제출 #485537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
485537		SirCovidThe19th	Nice sequence (IZhO18_sequence)	C++17	0 / 100	1 ms	296 KiB

sequence

#include <bits/stdc++.h>
using namespace std;

int n, m, sz, pre[500005], vis[500005];

void dfs(int cur){
    if (vis[cur]) return;
    vis[cur] = 1;
    if (cur + m <= sz) pre[cur + m] = pre[cur] + 1, dfs(cur + m);
    if (cur - n >= 0) pre[cur - n] = pre[cur] + 1, dfs(cur - n); 
}

int main(){
    int tc; cin >> tc;
    while (tc--){
        cin >> n >> m; sz = n + m - __gcd(n, m) - 1;
        fill(vis, vis + sz + 1, 0);
        pre[sz - n + 1] = 0; dfs(sz - n + 1);

        cout<<sz<<endl;
        for (int i = 1; i <= sz; i++) cout<<pre[i] - pre[i - 1]<<" ";
        cout<<endl;
    }
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24