Pagini recente » Cod sursa (job #2583755) | Cod sursa (job #2381672) | Cod sursa (job #2762384) | Cod sursa (job #1079184) | Cod sursa (job #1001948)
#include <fstream>
using namespace std;
int N, M, A[510][510], i, j, k, val, ii, jj;
int main() {
ifstream f("piese.in");
ofstream g("piese.out");
f>>N>>M;
val = 0;
for (i=1;i<=N;i++)
for (j=1;j<=M;j++)
if (A[i][j] == 0){
k = 1;
while (i+k-1 <= N && j+k-1 <= M)
k*=2;
k/=2;
val++;
for (ii=i;ii<=i+k-1;ii++)
for (jj=j;jj<=j+k-1;jj++)
A[ii][jj] = val;
}
g<<val<<"\n";
for (i=1;i<=N;i++) {
for (j=1;j<=M;j++) {
g<<A[i][j]<<" ";
}
g<<"\n";
}
return 0;
}