제출 #754066

#제출 시각아이디문제언어결과실행 시간메모리
754066vjudge1Nice sequence (IZhO18_sequence)C++11
43 / 100
2081 ms8936 KiB
#include<bits/stdc++.h> using namespace std; #define PB push_back const int MAXN = 1e6 + 7; const int logo = 20; const int inf = 1e9 + 7; typedef vector<int> vi; int pf[MAXN]; int tim = 1, n, m, sol; void dfs(int u){ if(u - n >= 0) dfs(u - n); if(u + m <= sol) dfs(u + m); pf[u] = tim++; } void solve(){ tim = 1; cin >> n >> m; sol = n + m - 1 - __gcd(n, m); for(int i=0; i<=sol; i++) pf[i] = 0; for(int i=0; i<=sol; i++) if(!pf[i]) dfs(i); cout << sol << "\n"; for(int i=0; i<sol; i++) cout << pf[i] - pf[i + 1] << " "; cout << "\n"; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; cin >> t; while(t--) solve(); 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...