Pagini recente » Cod sursa (job #1658423) | Cod sursa (job #125191) | Cod sursa (job #3232164) | Cod sursa (job #3187668) | Cod sursa (job #2974412)
#include <iostream>
using namespace std;
int a[501][501];
int main() {
freopen("piese.in", "r", stdin);
freopen("piese.out", "w", stdout);
int n, m, cnt = 0;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (a[i][j] != 0) {
continue;
}
++cnt;
int lim = min(n - i, m - j);
int p = 1;
while ((p << 1) <= lim) {
p <<= 1;
}
for (int x = 0; x < p; ++x) {
for (int y = 0; y < p; ++y) {
a[i + x][j + y] = cnt;
}
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cout << a[i][j] << " ";
}
cout << "\n";
}
return 0;
}