void sqrt arg bool true false default push pop #include try catch top typedef public operator
virtual list break template copy begin() end() string vector map std:: printf cout<< cin>>
for (int i = 0; i < n; ++i) { } while true do for int int int long long long double double vector
sort begin end main struct bool algorithm #include #define cmath iomanip cstdlib setlocale
class double { } < > << >> , ( ) #include iostream using namespace std :; void main = - +
LC_ALL endl #include bits stdc++.h using namespace std; int main() ios_base::sync_with_stdio(0)
cin cout cin.tie(0) cout.tie(0) double #define ll long long long long #define ld long double
long double unsigned float char string vector pair set map multiset unordered_map void return 0;
#pragma typedef ++i i++ for if while do next_permutation sort(a.begin(), a.end())
a.begin() a.end() __gcd(x, y); struct fixed setprecision(15) endl freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout); #define F first first #define S second second
#define pb push_back push_back iterator min(a, b); max(a, b); swap(a, b); queue
priority_queue push pop() erase clear() insert find count min_element max_element deque
stack front() back() cout double long long long double string vector pair void typedef
while if a.first a.second push_back queue push find map set struct char while for case
switch if int char bool if() while() for() return strcmp const char* extern #ifdef #endif