제출 #242547

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

prosjecni

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int n, i, j, sum, a[105][105];

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("D:/cpp/2/output.txt");
//    out("output.txt");

    cin >> n;
    if (n == 2) {cout << "-1";return 0;}

    int l = 1;

    for (i = 1; i < n; i++)
    {
        sum = 0;
        for (j = 1; j < n; j++, l++) sum += l, a[i][j] = l;

        while ((sum + l) % n) l++;
        a[i][n] = l++;
    }

    sum = 0;

    for (i = 1; i < n; i++) sum += a[i][1];
    if ((sum + l) % n) l += (n - (sum + l) % n);

    while (1)
    {
        sum = 0;
        set <int> se;
        for (j = 1; j < n; j++) se.insert(a[j][1]), sum += a[j][1];

        se.insert(l);

        sum += l;

        if (se.find(sum / n) == se.end()) l += n;
                                     else break;
    }

    sum = 0;
    for (j = 1; j < n; j++, l++) sum += l, a[n][j] = l;

    while ((sum + l) % n) l++;
    a[i][n] = l++;

    for (i = 1; i <= n; i++, cout << el)
      for (j = 1; j <= n; j++) cout << a[i][j] << " ";

}

//
//00000
//00110
//00111
//00011
//00000

• Subtask 1: 120 / 120