# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
371155 | daniel920712 | Red-blue table (IZhO19_stones) | C++14 | 56 ms | 1924 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 all[1005][1005];
int main()
{
int T,N,M,ans=0,i,j;
scanf("%d",&T);
while(T--)
{
ans=0;
scanf("%d %d",&N,&M);
if(N<=M)
{
ans=M;
for(i=0;i<=N/2;i++) for(j=0;j<M;j++) all[i][j]=0;
for(i=N/2+1;i<N;i++)
{
ans++;
for(j=0;j<M;j++) all[i][j]=1;
}
}
else
{
ans=N;
for(i=0;i<=M/2;i++) for(j=0;j<N;j++) all[j][i]=1;
for(i=M/2+1;i<M;i++)
{
ans++;
for(j=0;j<N;j++) all[j][i]=0;
}
}
printf("%d\n",ans);
for(i=0;i<N;i++)
{
for(j=0;j<M;j++)
{
if(all[i][j]==0) printf("-");
else printf("+");
}
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... |