Pagini recente » Cod sursa (job #630029) | Cod sursa (job #2301755) | Cod sursa (job #3249317) | Cod sursa (job #3272273) | Cod sursa (job #1680012)
#include <fstream>
using namespace std;
int v[24], a[503][503], i, j, ij, ii, jj, n, m, nr;
int main()
{
ifstream fin("piese.in");
ofstream fout("piese.out");
v[0]=1;
for(i=1;i<=23;i++)
v[i]=v[i-1]*2;
nr=1;
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
if(a[i][j]==0){
while(i+v[ij]-1<=n && j+v[ij]-1<=m)
ij++;
ij--;
for(ii=i;ii<=v[ij]+i-1;ii++)
for(jj=j;jj<=v[ij]+j-1;jj++)
a[ii][jj]=nr;
nr++;
}
}
for(i=1;i<=n;i++){
for(j=1;j<=m;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}