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 endl "\n"
using namespace std;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int t,n,m;
char a1,a2,h;
string s[1005];
void resh()
{
int br=0;
for(int i=1; i<=(n-1)/2; i++)
{
for(int j=1; j<=m/2+1; j++)
{
s[i][j]=a1;
}
for(int j=m/2+2; j<=m; j++)
{
s[i][j]=a2;
}
br++;
}
for(int i=(n-1)/2+1; i<=n; i++)
{
for(int j=1; j<=(m-1)/2; j++)
{
s[i][j]=a2;
}
for(int j=(m-1)/2+1; j<=m; j++)
{
s[i][j]=a1;
}
br++;
}
cout<<br<<endl;
if(h)
{
for(int i=1; i<=m; i++)
{
for(int j=1; j<=n; j++)
{
cout<<s[j][i]<<" ";
}
cout<<endl;
}
return;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
cout<<s[i][j]<<" ";
}
cout<<endl;
}
}
void read()
{
cin>>t;
for(int z=1; z<=t; z++)
{
cin>>n>>m;
if(n<m)
{
swap(n,m);
a1='-';
a2='+';
h=1;
}
else
{
a1='+';
a2='-';
}
resh();
}
}
int main()
{
speed();
read();
return 0;
}
# | 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... |