QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#630746 | #9415. Matrix | ucup-team004 | WA | 0ms | 3584kb | C++23 | 625b | 2024-10-11 20:15:26 | 2024-10-11 20:15:27 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int a;
if (i < 2 && j < 2) {
a = i * 2 + j + 1;
} else if (i >= j) {
a = 2 * i + 2;
} else {
a = 2 * j + 1;
}
std::cout << a << " \n"[j == n - 1];
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3584kb
input:
2
output:
1 2 3 4
result:
wrong answer Line [name=yesno] equals to "1 2", doesn't correspond to pattern "Yes|No" (test case 1)