/*
DATE: 2020-03-12 15:38:28
NAME:
PROBLEM: COCI16_PROSJECNI
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5;
int a[MAXN + 7];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
printf("%d ", (i - 1) * n + (j - 1) + 1);
}
printf("\n");
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Average condition doesn't hold. |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Incorrect |
5 ms |
256 KB |
Average condition doesn't hold. |
4 |
Correct |
5 ms |
504 KB |
Output is correct |
5 |
Incorrect |
5 ms |
256 KB |
Average condition doesn't hold. |
6 |
Incorrect |
5 ms |
376 KB |
Average condition doesn't hold. |
7 |
Incorrect |
5 ms |
376 KB |
Average condition doesn't hold. |
8 |
Incorrect |
5 ms |
376 KB |
Average condition doesn't hold. |
9 |
Incorrect |
6 ms |
376 KB |
Average condition doesn't hold. |
10 |
Incorrect |
6 ms |
376 KB |
Average condition doesn't hold. |