제출 #559969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
559969		Yazan_Alattar	MalnaRISC (COI21_malnarisc)	C++14	0 / 100	1 ms	340 KiB

malnarisc

#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;

int n;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;

    int to = n / 2;
//    if(n == 8) to = 7;
//    else if(n == 13) to = 10;
//    else if(n == 16) to = 10;
//    else if(n == 32) to = 15;
//    else if(n == 53) to = 21;
//    else if(n == 64) to = 21;
//    else if(n == 73) to = 28;
//    else if(n == 82) to = 28;
//    else if(n == 91) to = 29;
//    else if(n == 100) to = 50;

    cout << to << endl;
    for(int i = 1; i <= to ; ++i){
        for(int j = i % 2 + 1; j < n; j += 2) cout << "CMPSWP R" << j << " R" << j + 1 << " ";
        cout << endl;
    }
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10