08.09.2025 16:53

Author: AkhrorKhasanov

266B Queue at the School.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+int main()
+{
+    string s;
+    int n, t;
+    cin >> n >> t;
+    cin >> s;
+    while (t)
+    {
+        string temp = s;
+        for (int i = 0; i < s.size() - 1; i++)
+        {
+            if (s[i] == 'B' && s[i + 1] == 'G')
+            {
+                temp[i] = 'G';
+                temp[i + 1] = 'B';
+            }
+        }
+        s = temp;
+        t--;
+    }
+    cout << s << endl;
+
+    return 0;
+}

344A Magnets.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int n;
+    string s;
+    cin >> n;
+    string arr[n];
+    for (int i = 0; i < n; i++)
+    {
+        cin >> s;
+        arr[i] = s;
+    }
+    if (n == 1)
+    {
+        cout << 1 << endl;
+    }
+    else
+    {
+        int c = 1;
+        for (int i = 0; i < n - 1; i++)
+        {
+            if (arr[i] != arr[i + 1])
+            {
+                c++;
+            }
+        }
+        cout << c << endl;
+    }
+    return 0;
+}

467A George and Accommodation.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int n, p, q, c = 0;
+    cin >> n;
+    while (n--)
+    {
+        cin >> p >> q;
+        if (q - p >= 2)
+        {
+            c++;
+        }
+    }
+    cout << c << endl;
+    return 0;
+}

486A Calculating Function.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    long long int n;
+    cin >> n;
+    if (n % 2 == 0)
+    {
+        cout << n / 2 << endl;
+    }
+    else
+    {
+        cout << n / 2 - n << endl;
+    }
+    return 0;
+}