UVA - 297 Quadtrees
2018-02-28 14:11
417 查看
和刘汝佳的基本一致,只是简化了读入#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int len=32;
int a[len][len],cnt;
void draw(int R,int C,int W)
{
char c;
cin>>c;
if(c=='p')
{
draw(R,C+W/2,W/2);
draw(R,C,W/2);
draw(R+W/2,C,W/2);
draw(R+W/2,C+W/2,W/2);
}
else if(c=='f')
{
for(int i=R; i<R+W; i++)
for(int j=C; j<C+W; j++)
{
if(!a[i][j])
{
a[i][j]=1;
cnt++;
}
}
}
}
void init()
{
memset(a,0,sizeof a);
cnt=0;
}
int main()
{
int T;
cin>>T;
while(T--)
{
init();
draw(0,0,32);
draw(0,0,32);
printf("There are %d black pixels.\n",cnt);
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int len=32;
int a[len][len],cnt;
void draw(int R,int C,int W)
{
char c;
cin>>c;
if(c=='p')
{
draw(R,C+W/2,W/2);
draw(R,C,W/2);
draw(R+W/2,C,W/2);
draw(R+W/2,C+W/2,W/2);
}
else if(c=='f')
{
for(int i=R; i<R+W; i++)
for(int j=C; j<C+W; j++)
{
if(!a[i][j])
{
a[i][j]=1;
cnt++;
}
}
}
}
void init()
{
memset(a,0,sizeof a);
cnt=0;
}
int main()
{
int T;
cin>>T;
while(T--)
{
init();
draw(0,0,32);
draw(0,0,32);
printf("There are %d black pixels.\n",cnt);
}
return 0;
}
相关文章推荐
- UVA 297 Quadtrees
- uva 297 - Quadtrees
- uva 297 - Quadtrees
- UVA - 297 Quadtrees
- UVa 297 - Quadtrees
- UVA 297 Quadtrees
- UVA297 - Quadtrees
- uva 297 Quadtrees
- UVA 297 - Quadtrees
- 【例题 6-11 UVA-297】Quadtrees
- Quadtrees UVA297
- uva 297 Quadtrees
- UVA - 297 Quadtrees
- UVA-297 Quadtrees
- uva 297 Quadtrees
- uva 297 - Quadtrees
- UVa 297 - Quadtrees
- Quadtrees UVA 297 四分树
- uva 297 Quadtrees
- UVA 297 - Quadtrees