Submission #520603

#TimeUsernameProblemLanguageResultExecution timeMemory
520603N1NT3NDOMalnaRISC (COI21_malnarisc)C++14
10.19 / 100
2 ms460 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back #define sz(x) (int)x.size() #define fi first #define sd second #define all(vec) vec.begin(), vec.end() using namespace std; //typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int n; cin >> n; vector< pair<int, int> > ans; for(int i = 1; i < n; i++) for(int j = i + 1; j <= n; j++) ans.pb({i, j}); cout << sz(ans) << '\n'; for(auto u : ans) cout << "CMPSWP " << "R" << u.fi << ' ' << "R" << u.sd << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...