Ice cream

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <cassert>
 
  
  
using namespace std;
  
  
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
  
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
  
/** Read */
  
static const int buf_size = 4096;
  
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len)
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    if (pos == len)
        return -1;
    return buf[pos++];
}
  
inline int readChar() {
    int c = getChar();
    while (c <= 32)
        c = getChar();
    return c;
}
  
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
  
/** Write */
  
static int write_pos = 0;
static char write_buf[buf_size];
  
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
  
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
  
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
  
inline void writeWord( const char *s ) {
    while (*s)
        writeChar(*s++);
}
  
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
  
 
#define left left228
#define right right228  
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
 
 
int n;
int a[1002][1002];
int cnt[1002];
int uk = 0;
 
 
void get(int i, int j, int lst) {
    if (i == n - 2 && j == n) {
        set<int> s;
        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < n; j++) {
                sum += a[i][j];
            }
            s.insert(sum);
        }
        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < n; j++) {
                sum += a[j][i];
            }
            s.insert(sum);
        }
        if (sz(s) == 2 * n) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    writeInt(a[i][j], ' ');
                }
                writeChar('\n');
            }
            exit(0);
        }
        return;
    }
    if (i < 0 || j >= n) {
        if (i < 0) {
            if (j != n) {
                get(j, 0, lst);
            } else {
                get(n - 1, 1, lst);
            }
        } else {
            get(n - 1, i + 2, lst);
        }
        return;
    }
    for (int ii = lst; ii <= n; ii++) {
        if (cnt[ii] < n) {
            cnt[ii]++;
            a[i][j] = ii;
            get(i - 1, j + 1, ii);
            cnt[ii]--;
        }
    }
}
 
 
int main() {
    cin >> n;
    if (n <= 100) {
        get(0, 0, 1);
        cout << "QAQ" << endl;
    } else {
        int i = 0;
        int j = 0;
        int lst = 1;
        while (true) {
            if (i == n - 2 && j == n) {
                for (int i = 0; i < n; i++) {
                    for (int j = 0; j < n; j++) {
                        writeInt(a[i][j], ' ');
                    }
                    writeChar('\n');
                }
                return 0;
            }
            if (i < 0 || j >= n) {
                if (i < 0) {
                    if (j != n) {
                        i = j;
                        j = 0;
                    } else {
                        i = n - 1;
                        j = 1;
                    }
                } else {
                    j = i + 2;
                    i = n - 1;
                }
                continue;
            }
            for (int ii = lst; ii <= n; ii++) {
                if (cnt[ii] < n) {
                    cnt[ii]++;
                    a[i][j] = ii;
                    lst = ii;
                    i--, j++;
                    break;
                }
            }
        }
    }
    return 0;
}
 

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER