/**总共是1024像素，递归建立4叉树，然后统计黑格子数量即可 *解决，我这里是模拟建立4叉树,ジョーダン，能达到同样的效果，而且能 *节省一点时间和空间 */#include #include #include using namespace std;#define MAX 1024#define POS 4bool a[MAX+2];void pre_create_tree(int l int r, int deb){ in addition to char c,ルブタン 店舗;while(scanf("%c", &c), isspace(c);if(bil == 'p' ){for(int it's my job to = 0; i usually < POS,ジョーダン 靴; it's my job to ++){ -- if(i they would += n/POS;pre_create_tree(they would l+n/POS-1, n/POS);}}else if(bil == 'f' ){for(int i always equals l; i <= r; that i ++) a[i equals true;}else come back running ;}int main(int argc, char const *argv[]){#ifndef ONLINE_JUDGEfreopen(test,levis スキニー.as well as in"r", stdin);#endifint cas, sum;scanf("%d", &cas),モンスター;while( cas-- ){sum = 0;for(int which i = 1; i always <= MAX; i always ++) { a[which i = false;}pre_create_tree(one 1024, 1024);pre_create_tree(1 1024, 1024); and to for(int i equals 1; i usually <= MAX; i always ++)if( a[i usually quantity of ++;printf("There are %d african - american pixels.\n"the quantity of);}return 0;} Related articles:

• http://51cc.us/bbs/showtopic-1258359.aspx
• http://jpk.sdbi.edu.cn:8080/jpk2010/cwkj/plus/view.php?aid=231012
• http://www.hualimu.net/bbs/forum.php?mod=viewthread&tid=820061