Submission #1869763

---

Source Code Expand

//while (clock()<=69*CLOCKS_PER_SEC)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define shandom_ruffle random_shuffle

const int nax=2007;

const int k=37;
const int n=k*k+k+1;

int tab[nax][nax];
int mag[nax];

int l;

int main()
{
	for (int i=0; i<k; i++)
	{
		for (int j=0; j<k; j++)
		{
			l++;
			tab[i][j]=l;
		}
	}
	for (int i=0; i<=k; i++)
	{
		l++;
		mag[i]=l;
	}
	//debug() << n << " " << l << " " << k;
	
	printf("%d %d\n", n, k+1);
	for (int i=0; i<k; i++)
	{
		for (int j=0; j<k; j++)
		{
			int v=i;
			for (int l=0; l<k; l++)
			{
				printf("%d ", tab[l][v]);
				v=(v+j)%k;
			}
			printf("%d\n", mag[j]);
		}
	}
	for (int i=0; i<k; i++)
	{
		for (int l=0; l<k; l++)
			printf("%d ", tab[i][l]);
		printf("%d\n", mag[k]);
	}
	for (int i=0; i<=k; i++)
		printf("%d ", mag[i]);
	printf("\n");
	return 0;
}

Submission Info

Judge Result