# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102293 | SirCeness | Prosjecni (COCI16_prosjecni) | C++14 | 5 ms | 384 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>
#define mod 1000000007
typedef long long ll;
using namespace std;
int n;
int mat[100][100];
int arr[100];
int main(){
//freopen("baskent.gir", "r", stdin);
cin >> n;
if (n == 1){
cout << "1" << endl;
return 0;
} else if (n == 2){
cout << "-1" << endl;
return 0;
}
for (int i = 0; i < n-1; i++){
arr[i] = i+1;
}
arr[n-1] = (n-1)*(n-1) - (n-2)*(n-1)/2;
//for (int i = 0; i < n; i++) cout << arr[i] << " "; cout << endl;
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
mat[i][j] = arr[i]*10000;
}
}
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
mat[i][j] += arr[j];
}
}
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
cout << mat[i][j] << " ";
}
cout << endl;
}
cout << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |