Pagini recente » Cod sursa (job #2283306) | Cod sursa (job #1570382) | Cod sursa (job #2099435) | Cod sursa (job #1697372) | Cod sursa (job #2901825)
#include <fstream>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <ctype.h>
using namespace std;
//ifstream f("in.in");
//ofstream g("out.out");
ifstream f("piese.in");
ofstream g("piese.out");
int val=0,n,m;
int a[505][505];
int main(){
f>>n>>m;
int i=1;
while(i<=n){
cout<<",";
int initialp=1;
while(initialp<=min(n-i+1,m)){
initialp*=2;
}
initialp/=2;
int j=1,p=initialp;
while(j<=m){
cout<<".";
while(not(p<=m-j+1)){
p/=2;
}
//g<<p<<" ";
for(int l=i;l<=i+initialp-1;l+=p){
cout<<"1";
val++;
for(int ii=l;ii<=l+p-1;ii++){
cout<<"2";
for(int jj=j;jj<=j+p-1;jj++){
cout<<"3";
a[ii][jj]=val;
}
}
}
j=j+p;
}
i+=initialp;
}
g<<val<<'\n';
for(int ii=1;ii<=n;ii++){
for(int jj=1;jj<=m;jj++){
g<<a[ii][jj]<<" ";
}
g<<'\n';
}
f.close();
g.close();
return 0;
}