Pagini recente » Cod sursa (job #3235083) | Cod sursa (job #1591727) | Cod sursa (job #2225236) | Cod sursa (job #1230183) | Cod sursa (job #2030687)
#include <fstream>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int m,n,i,j,x,y,i2,j2;
int a[502][502];
int nop;
int main(){
fin >> m >> n;
for (i = 1; i <= m; ++i)
for (j = 1; j <= n; ++j)
if (a[i][j] == 0){
++x;
y= 1;
while (i+(y<< 1)-1<= m && j +(y<< 1)-1<=n)
y<<= 1;
for (i2 = i; i2 <= i + y - 1; ++i2)
for (j2 = j; j2 <= j + y - 1; ++j2)
a[i2][j2] = x;
}
fout << n;
for (int i = 1; i <= m; ++i){
fout <<endl;
for (j = 1; j <= n; ++j)
fout << a[i][j] << ' ';
}
return 0;
}