Pagini recente » Cod sursa (job #1258732) | Cod sursa (job #3218525) | Cod sursa (job #2190790) | Cod sursa (job #1125823) | Cod sursa (job #2305783)
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
typedef long long ll;
typedef pair< int , int > PII;
int n, m, a[1005][1005], last = 0, cnt = 1;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ifstream cin("tablete.in");
ofstream cout("tablete.out");
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < m; j++) {
if (last) a[i][j] = last, last = 0;
else a[i][j] = cnt++;
}
if (cnt & 1) {
last = cnt++;
}
a[i][m] = cnt++;
}
for (int i = 1; i <= n; i++)
for (int j = m + 1; j <= n; j++)
if (last) a[i][j] = last, last = 0;
else a[i][j] = cnt++;
for (int i = 1; i <= n; i++, cout << "\n")
for (int j = 1; j <= n; j++, cout << " ")
cout << a[i][j];
return 0;
}