제출 #420496

#제출 시각아이디문제언어결과실행 시간메모리
420496maximath_1MalnaRISC (COI21_malnarisc)C++11
76.41 / 100
2 ms332 KiB
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <set>
#include <string>
#include <vector>
#include <random>
#include <deque>
using namespace std;

mt19937 rng(420691273);
#define ll long long
const int MX = 1e5 + 5;

int main(){
	cin.tie(0) -> sync_with_stdio(0);

	int n; cin >> n;
	cout << n << endl;
	for(int i = 0; i < n; i ++){
		for(int j = i % 2; j + 1 < n; j += 2)
			cout << "CMPSWP R" << j + 1 << " R" << j + 2 << " ";
		cout << 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...