Pagini recente » Cod sursa (job #1965785) | Borderou de evaluare (job #2029718) | Borderou de evaluare (job #1965718) | Borderou de evaluare (job #1336005) | Cod sursa (job #1872423)
#include <fstream>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int m,n,piese,ii,jj,a[510][510],lat;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(a[i][j]==0){
piese++;
lat=1;
while(i+2*lat-1<=n && j+2*lat-1<=m)
lat=lat*2;
for(ii=0;ii<lat;ii++)
for(jj=0;jj<lat;jj++)
a[ii+i][jj+j]=piese;
}
fout<<piese<<"\n";
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
}