# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493291 | nickmet2004 | Red-blue table (IZhO19_stones) | C++11 | 43 ms | 1328 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;
const int N = 1005;
int n ,m;
void solve(){
cin >> n >> m;
char a[n+5][m+5];
if(n >= m){
int x = m/2;
if(m%2==0)--x;
cout << n + x<<endl;
for(int i = 0; i < n; ++i){
for(int j = 0; j< x; ++j)a[i][j] = '-';
}
for(int i = 0; i <n; ++i){
for(int j =x; j < m; ++j)a[i][j] = '+';
}
}else{
int x = n/2;
if(n % 2==0)--x;
cout << m + x << endl;
for(int i = 0; i < x; ++i){
for(int j =0; j < m; ++j) a[i][j] = '+';
}
for(int i= x; i < n; ++i){
for(int j = 0;j <m; ++j)a[i][j] = '-';
}
}
for(int i = 0; i <n; ++i){
for(int j = 0; j < m; ++j)cout << a[i][j];cout<<endl;
}
}
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int t;
cin >> t;
while(t--)solve();
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... |