Cod sursa(job #1374447)
Utilizator | Data | 5 martie 2015 09:19:54 | |
---|---|---|---|
Problema | Piese | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <fstream>
using namespace std;
ifstream fin ("piese.in");
ofstream fout ("piese.out");
int l,L,i,j,p,k,q,e,A[509][509];
int main () {
fin>>l>>L;
for(i=1;i<=l;i++){
for(j=1;j<=L;j++){
if(A[i][j]==0){
p=1;
while(i+p-1<=l&&i+p-1<=L){
p=p*2;
}
p=p/2;
k++;
for(q=i;q<=i+p-1;q++){
for(e=j;e<=j+p-1;e++){
A[q][e]=k;
}
}
}
}
}
for(i=1;i<=l;i++){
for(j=1;j<=L;j++){
fout<<A[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}