# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378942 | daniel920712 | Nice sequence (IZhO18_sequence) | C++14 | 1 ms | 512 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main()
{
int T,N,M,i;
scanf("%d",&T);
while(T--)
{
scanf("%d %d",&N,&M);
if(max(N,M)%min(N,M)==0)
{
if(N>M)
{
printf("%d\n",N-1);
for(i=0;i<N-1;i++) printf("1 ");
printf("\n");
}
else
{
printf("%d\n",M-1);
for(i=0;i<M-1;i++) printf("-1 ");
printf("\n");
}
}
else if(N==2)
{
if(M%2==0) M--;
printf("%d\n",M);
for(i=0;i<M;i++)
{
if(i%2==0) printf("999 ");
else printf("-1000 ");
}
printf("\n");
}
else if(M==2)
{
if(N%2==0) N--;
printf("%d\n",N);
for(i=0;i<M;i++)
{
if(i%2==0) printf("-999 ");
else printf("1000 ");
}
printf("\n");
}
}
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... |