Pagini recente » Cod sursa (job #2114616) | Cod sursa (job #2515500) | Cod sursa (job #1946777) | Cod sursa (job #52703) | Cod sursa (job #2912947)
#include <bits/stdc++.h>
using namespace std;
ifstream in("piese.in");
ofstream out("piese.out");
int n, m, a[505][505], k, p, l, nr;
int main() {
in >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i][j] == 0) {
nr++;
l = 1;
while (2 * l + i - 1 <= n && 2 * l + j - 1 <= m)
l = l * 2;
for (k = 0; k < l; k++)
for (p = 0; p < l; p++)
a[i + k][j + p] = nr;
}
}
}
out << nr << "\n";
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
out << a[i][j] << " ";
}
out << "\n";
}
}