제출 #1170207

#제출 시각아이디문제언어결과실행 시간메모리
1170207mnbvcxz123Nice sequence (IZhO18_sequence)C++20
100 / 100
237 ms41764 KiB
#include<bits/stdc++.h> using namespace std; using ll=long long; int gcd(int a, int b){ if(!b)return a; return gcd(b,a%b); } int n,m,k,tr; int v[500005]; void dfs(int x){ if(x+n<=k and !v[x+n])dfs(x+n); if(x>=m and !v[x-m])dfs(x-m); v[x]=++tr; } void solve(){ memset(v,0,sizeof v); tr=0; cin>>n>>m; k=n+m-gcd(n,m)-1; for(int i=0;i<=k;++i) if(!v[i])dfs(i); cout<<k<<'\n'; if(k<=0)return; for(int i=1;i<=k;++i) cout<<v[i]-v[i-1]<<' '; cout<<'\n'; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t; cin>>t; while(t--) solve(); }
#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...