# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210443 | tleontest1 | Prosjecni (COCI16_prosjecni) | C++14 | 6 ms | 552 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.
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 505;
const lo mod = 1000000007;
int n,m,b[li],a[105][105],k,flag,t;
int cev;
string s;
vector<int> v;
main(void){
scanf("%lld",&n);
if(n==2){printf("-1\n");return 0;}
int tut=n*n;
for(int i=1;i<=n;i++){
int at=tut*i;
cev=0;
for(int j=2;j<=n;j++){
cev+=at;
a[i][j]=at++;
}
a[i][1]=tut*i*4-cev;
}
FOR{
for(int j=1;j<=n;j++){
printf("%lld ",a[i][j]);
}
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |