Submission #559936

#TimeUsernameProblemLanguageResultExecution timeMemory
559936Yazan_AlattarMalnaRISC (COI21_malnarisc)C++14
10.19 / 100
1 ms468 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define F first #define S second #define pb push_back #define endl "\n" #define all(x) x.begin(), x.end() const int M = 100007; const ll inf = 2e9; const ll mod = 1e9 + 7; const double pi = acos(-1); const double eps = 1e-6; const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0}; const int block = 320; vector < pair <int,int> > ans; bool cmp(int a, int b){ ans.pb({a, b}); return a < b; } int n, a[M]; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for(int i = 1; i <= n; ++i) a[i] = n - i + 1; // sort(a + 1, a + n + 1, cmp); for(int i = 1; i <= n; ++i) for(int j = i + 1; j <= n; ++j) ans.pb({i, j}); cout << ans.size() << endl; for(auto i : ans) cout << "CMPSWP R" << i.F << " R" << i.S << endl; return 0; }
#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...