oj.uz

답안 #166639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166639 2019-12-03T10:43:53 Z egekabas Prosjecni (COCI16_prosjecni) C++14
120 / 120
 3 ms 376 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll n;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    if(n == 2){
        cout << "-1\n";
        return 0;
    }
    if(n%2){
        for(ll i = 1; i <= n*n; ++i){
            cout << i << " ";
            if(i%n == 0)
                cout << "\n";
        }
    }
    else{
        ll beg = 1;
        ll colcnt = 0;
        for(ll i = 1; i < n; ++i){
            colcnt += beg;
            ll cnt = 0;
            for(ll j = beg; j < beg+n-1; ++j){
                cout << j << " ";
                cnt += j;
            }
            ll end = n*(beg+n-1-1)-cnt;
            cout << end << "\n";
            if(i != n-1)
                beg = end+1;
        }
        beg = n*beg-colcnt;
        ll cnt = 0;
        for(ll j = beg; j < beg+n-1; ++j){
            cout << j << " ";
            cnt += j;
        }
        ll end = n*(beg+n-1-1)-cnt;
        cout << end << "\n";
    }
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct