제출 #167456

#제출 시각아이디문제언어결과실행 시간메모리
167456PedroBigManProsjecni (COCI16_prosjecni)C++14
24 / 120
3 ms504 KiB
#include <iostream> #include <vector> #include <cmath> #include <algorithm> #include <string> using namespace std; typedef long long int ll; typedef unsigned long long int ull; typedef long double ld; #define REP(i,a,b) for(ll i=a; i<b; i++) #define pb push_back #define mp make_pair #define pl pair<ll,ll> #define ff first #define ss second #define INF ((ll) pow(2,63) -1) #define si signed ll insig; #define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);} void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;} int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll N; cin>>N; vector<vector<ll> > a; vector<ll> xx; REP(i,0,N) {xx.pb(0);} REP(i,0,N) {a.pb(xx);} if(N%2==1) { REP(i,0,N) { REP(j,0,N) { cout<<N*i +j+1<<" "; } cout<<endl; } } else if(N==2) { cout<<-1<<endl; } else { REP(i,0,N) { REP(j,0,N) { if(i==N-1 && j==N-1) { cout<<3*N*N/2+N/2<<" "; } else if(i==N-1) { cout<<N*i+j+1+N*N/2<<" "; } else if(j==N-1) { cout<<N*i+j+1+N/2<<" "; } else { cout<<N*i+j+1<<" "; } } cout<<endl; } } return 0; }

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

prosjecni.cpp: In function 'void Out(std::vector<long long int>)':
prosjecni.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
prosjecni.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
prosjecni.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...