# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334062 | boykut | Red-blue table (IZhO19_stones) | C++14 | 1 ms | 364 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>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n, m, flag = 0;
cin >> n >> m;
int a[n][m];
if(n==1){
cout<<m<<'\n';
for(int i=0;i<m;i++)
cout<<'-';
cout<<'\n';
continue;
}
if(m==1){
cout<<n<<'\n';
for(int i=0;i<n;i++)
cout<<'+'<<'\n';
continue;
}
if(n==2){
cout<<m<<'\n';
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
cout<<'-';
cout<<'\n';
}
continue;
}
if(m==2){
cout<<n<<'\n';
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
cout<<'+';
cout<<'\n';
}
continue;
}
if(n==3){
cout<<m+1<<'\n';
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
if(i%2==0)cout<<'-';
else cout<<'+';
cout<<'\n';
}
continue;
}
if(m==3){
cout<<n+1<<'\n';
for(int i=0;i<n;i++)
cout<<"+-+\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... |