did some flashcards and a contest on the ccc grader for pratice

Author: Github11200

Contests/CCC Contests/flipper.cpp

@@ -0,0 +1,43 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+/******************************************
+  Link:
+  Points:
+******************************************/
+
+void flipper()
+{
+  string input;
+  cin >> input;
+
+  vector<vector<int>> grid = {{1, 2}, {3, 4}};
+
+  for (int i = 0; i < input.size(); ++i)
+  {
+    if (input[i] == 'H')
+    {
+      swap(grid[0][0], grid[1][0]);
+      swap(grid[0][1], grid[1][1]);
+    }
+    else
+    {
+      swap(grid[0][0], grid[0][1]);
+      swap(grid[1][0], grid[1][1]);
+    }
+  }
+
+  for (int i = 0; i < 2; ++i)
+  {
+    for (int j = 0; j < 2; ++j)
+      printf("%d ", grid[i][j]);
+    printf("\n");
+  }
+}
+
+int main()
+{
+  flipper();
+  return 0;
+}

Contests/CCC Contests/prettyAveragePrimes.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+/******************************************
+  Link:
+  Points:
+******************************************/
+
+bool isPrime(int x)
+{
+  for (int i = 2; i * i <= x; ++i)
+    if (x % i == 0)
+      return false;
+  return true;
+}
+
+void prettyAveragePrimes()
+{
+  int T, N;
+  scanf("%d", &T);
+
+  vector<int> primes;
+  for (int i = 0; i < T; ++i)
+  {
+    scanf("%d", &N);
+    N *= 2;
+    for (int j = 2; j <= N / 2; ++j)
+    {
+      bool leftPrime = isPrime(j);
+      bool rightPrime = isPrime(N - j);
+
+      if (leftPrime && rightPrime)
+      {
+        printf("%d %d\n", j, N - j);
+        break;
+      }
+    }
+  }
+}
+
+int main()
+{
+  prettyAveragePrimes();
+  return 0;
+}