# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1126734 | koukirocks | Red-blue table (IZhO19_stones) | C++20 | 19 ms | 1348 KiB |
#include<bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0);cin.tie(0)
using namespace std;
template<typename T>
using vvector = vector<vector<T>>;
void solve() {
int n,m;
cin>>n>>m;
if (min(n,m)==1) {
if (n==1) {
cout<<m<<"\n";
for (int j=1;j<=m;j++) cout<<"-";
cout<<"\n";
} else {
cout<<n<<"\n";
for (int i=1;i<=n;i++) cout<<"+\n";
}
} else if (min(n,m)==2) {
if (n==2) {
cout<<m<<"\n";
for (int i=1;i<=n;i++) {
for (int j=1;j<=m;j++) cout<<"-";
cout<<"\n";
}
} else {
cout<<n<<"\n";
for (int i=1;i<=n;i++) {
for (int j=1;j<=m;j++) cout<<"+";
# | 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... |