Cod sursa(job #1496188)
Utilizator | Nicolae Radu RaduXD1 | Data | 4 octombrie 2015 15:56:42 |
---|---|---|---|
Problema | Piese | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.77 kb |
#include<iostream>
#include<fstream>
#include<math.h>
#include<algorithm>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n,i,ii,j,jj,a[502][502],m,p,nr;
int main(){
fin>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if(a[i][j]==0)
{
p=1;
while(p+i-1<=m&&p+j-1<=n)
p=p*2;
nr++;
p=p/2;
for(ii=i;ii<i+p;ii++)
for(jj=j;jj<p+j;jj++)
a[ii][jj]=nr;
}
}
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}