제출 #210450

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210450		tleontest1	Prosjecni (COCI16_prosjecni)	C++14	36 / 120	6 ms	504 KiB

prosjecni

#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("-3\n");return 0;}
	//~ int tut=n*n;
	for(int i=1;i<n;i++){
		int tut=(i+n-1);
		int at=(1<<(tut));
		cev=0;
		for(int j=2;j<=n;j++){
			cev+=at;
			a[i][j]=at++;
		}
		a[i][1]=n*(1<<tut)-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;
}

컴파일 시 표준 에러 (stderr) 메시지

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: 36 / 120