Pagini recente » Cod sursa (job #2358652) | Cod sursa (job #90321) | Cod sursa (job #2602130) | Cod sursa (job #2760910) | Cod sursa (job #3153051)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n, m, r[502][502], i, j, l, k;
int main() {
fin >> n >> m;
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
if(!r[i][j]) {
l = 256;
while(i + l - 1 > n || j + l - 1 > m) l /= 2;
k++;
for(int ii = i; ii < i + l; ii++) {
for(int jj = j; jj < j + l; jj++) r[ii][jj] = k;
}
}
}
}
fout << k << "\n";
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) fout << r[i][j] << " ";
fout << "\n";
}
return 0;
}