# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85422 | farukkastamonuda | Nice sequence (IZhO18_sequence) | C++14 | 12 ms | 1856 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define lo long long
#define inf 1000000000
#define md 1000000007
#define pb push_back
#define li 400105
using namespace std;
int tt,t,n,m,B[li],A[li],ans;
bool vis[li];
int gcd(int a,int b){
return (b==0?a:gcd(b,a%b));
}
void dfs(int node){
if(vis[node] || node<0 || node>ans) return ;
vis[node]=true;
dfs(node-n);
dfs(node+m);
A[node]=t++;
}
void solve(){
scanf("%d %d",&n,&m);
ans=n+m-1-gcd(n,m);
t=0;
fill(vis,vis+ans+1,false);
for(int i=0;i<=ans;i++){
dfs(i);
}
printf("%d\n",ans);
for(int i=0;i<ans;i++){
printf("%d ",A[i]-A[i+1]);
}
printf("\n");
}
int main(){
scanf("%d",&tt);
for(int i=1;i<=tt;i++) solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |