| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 167699 | munhorgil | Red-blue table (IZhO19_stones) | C++14 | 93 ms | 1400 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()
{
int t , i , j , m , n , ans;
cin >> t;
while(t > 0)
{
cin >> n >> m;
ans = max(n , m) + (min(n , m) - 1) / 2;
cout << ans << endl;
if(n > m)
{
for(i = 0 ; i < n ; i++)
{
for(j = 0 ; j < m - ((m - 1) / 2) ; j++)
{
cout << '+';
}
for(j = 0 ; j < (m - 1) / 2 ; j++)
{
cout << '-';
}
cout << endl;
}
}
else
{
for(i = 0 ; i < n - ((n - 1) / 2) ; i++)
{
for(j = 0 ; j < m ; j++)
{
cout << '-';
}
cout << endl;
}
for(i = 0 ; i < (n - 1) / 2 ; i++)
{
for(j = 0 ; j < m ; j++)
{
cout << '+';
}
cout << endl;
}
}
t--;
}
}| # | 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... | ||||
