#include <iostream> using namespace std; int a, b; bool is_prime(int x) { for (int i = 2; i <= x / i; i ++ ) if (x % i == 0...

#include <iostream> #include <stack> #include <unordered_map> using namespace std; int n; string op; stack<char>...

#include <iostream> using namespace std; const int N = 1e5 + 10; int n, m, a, b, k; int p[N]; bool insert(int a, int b, int c) ...