QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#126708 | #6743. water235 | Bucketsmith# | WA | 1ms | 3588kb | C++17 | 335b | 2023-07-18 21:39:38 | 2023-07-18 21:39:42 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
cout << max(n, m) << "\n";
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= m; j ++)
cout << "01"[min(i, j) == min(n, m) || i == j] << " \n"[j == m];
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3420kb
input:
2 1
output:
2 1 1
result:
ok The answer is correct.
Test #2:
score: 0
Accepted
time: 1ms
memory: 3448kb
input:
3 3
output:
3 1 0 0 0 1 0 0 0 1
result:
ok The answer is correct.
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3588kb
input:
1 4
output:
4 1 1 1 1
result:
wrong answer The answer is wrong: expected = 3, found = 4