oj.uz

Submission #156432

# Submission time Handle Problem Language Result Execution time Memory
156432 2019-10-05T15:38:40 Z Moses Prosjecni (COCI16_prosjecni) C++14
24 / 120
 3 ms 376 KB 
// Created by AboAbdoMC
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) for(int i=a;i>=(n);--i)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long

using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;

const int OO = 1e9+7;
const int MOD = 1e9+7;
const int N = 1e5+7;



int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    if (n%2 == 1)
    {
    	int cnt = 1;
    	rep(i,n)
    	{
    		rep(j,n) {cout << cnt << ' ';cnt++;}
    		cout << '\n';
    	}
    	return 0;
    }
    //cout << -1 << '\n';
    return 0;
}

Subtask #1
24.0 / 120.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Unexpected end of file - int32 expected
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 376 KB Unexpected end of file - int32 expected
4 Correct 2 ms 252 KB Output is correct
5 Incorrect 2 ms 256 KB Unexpected end of file - int32 expected
6 Incorrect 2 ms 256 KB Unexpected end of file - int32 expected
7 Incorrect 2 ms 256 KB Unexpected end of file - int32 expected
8 Incorrect 2 ms 256 KB Unexpected end of file - int32 expected
9 Incorrect 3 ms 376 KB Unexpected end of file - int32 expected
10 Incorrect 2 ms 256 KB Unexpected end of file - int32 expected