oj.uz

Submission #210451

# Submission time Handle Problem Language Result Execution time Memory
210451 2020-03-17T11:39:06 Z tleontest1 Prosjecni (COCI16_prosjecni) C++14
120 / 120
 6 ms 508 KB 
#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]=n*tut*i-cev;
	}
	for(int i=1;i<=n;i++){
		cev=0;
		for(int j=1;j<n;j++){
			cev+=a[j][i];
		}
		a[n][i]=a[n-1][i]*n-cev;
	}
	FOR{
		for(int j=1;j<=n;j++){
			printf("%lld ",a[i][j]);
		}
		printf("\n");
	}
	return 0;
}

Compilation message

prosjecni.cpp:34:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
prosjecni.cpp: In function 'int main()':
prosjecni.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 6 ms 508 KB Output is correct
10 Correct 6 ms 504 KB Output is correct