# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085481 | 8pete8 | Nice sequence (IZhO18_sequence) | C11 | 7 ms | 1372 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<stdio.h>
#include <stdlib.h>
#define int long long
int compare(const void* a, const void* b){
return (*(int*)a - *(int*)b);
}
const int mx=1e9;
void solve(){
int n,m;scanf("%lld %lld",&n,&m);
int mul=1;
if(n>m){
n^=m,m^=n,n^=m;
mul=-1;
}
int k=m+(m%n)-1;
int ans[k],val;
if(n==1)val=0;
else val=(mx-1)/(n-1);
printf("%lld\n",k);
for(int i=0;i<k;i++){
if((i%n)==(n-1))ans[i]=-mx;
else ans[i]=val;
}
for(int i=0;i<k;i++)printf("%lld ",mul*ans[i]);
printf("\n");
}
int32_t main(){
int t;scanf("%lld",&t);
while(t--)solve();
}
/*
+++-
3
3 1
2 3
1 1
*/
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... |