Submission #102293

#TimeUsernameProblemLanguageResultExecution timeMemory
102293SirCenessProsjecni (COCI16_prosjecni)C++14
120 / 120
5 ms384 KiB
#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 timeMemoryGrader output
Fetching results...