Pagini recente » Cod sursa (job #1989198) | Cod sursa (job #3267872) | Cod sursa (job #2529290) | Cod sursa (job #1129907) | Cod sursa (job #2905409)
#include <fstream>
using namespace std;
ifstream cin("piese.in");
ofstream cout("piese.out");
int n,m,a[505][505],k,p,l,nr;
int main() {
cin>>n>>m;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (a[i][j]==0){
nr++;
l=1;
while(2*l+i-1<=n && 2*l+j-1<=m)
l=l*2;
for (k=0;k<l;k++)
for (p=0;p<l;p++)
a[i+k][j+p]=nr;
}
cout<<nr<<"\n";
for (int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<a[i][j]<<" ";
}
cout<<"\n";
}
}