제출 #226194

#제출 시각아이디문제언어결과실행 시간메모리
226194osaaateiasavtnlProsjecni (COCI16_prosjecni)C++14
120 / 120
5 ms512 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcount #define ll long long #define mp make_pair #define f first #define s second #define Time (double)clock()/CLOCKS_PER_SEC const int N = 107; int a[N][N]; signed main() { #ifdef HOME freopen("input.txt", "r", stdin); #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif int n; cin >> n; if (n == 2) { cout << "-1" << endl; exit(0); } int sh = n * (n - 1) / 2; for (int i = 0; i < n; ++i) { int sum = 0, r = 0; for (int j = 0; j < n - 1; ++j) { a[i][j] = i * sh + j; sum += a[i][j]; r = a[i][j]; } a[i][n - 1] = r * n - sum; } for (int j = 0; j < n; ++j) { int sum = 0, r = 0; for (int i = 0; i < n - 1; ++i) { sum += a[i][j]; r = a[i][j]; } a[n - 1][j] = r * n - sum; } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cout << a[i][j] << ' '; } cout << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...