设为首页 加入收藏

TOP

ZOJ 3465 The Hive 暴力模拟(二)
2012-11-01 15:46:36 来源: 作者: 【 】 浏览:1020
Tags:ZOJ  3465  The  Hive  暴力 模拟

 

    }

    void print(){

    printf("         _");printf("\n");

    printf("       _/%c\\_",bx(5,11));printf("\n");

    printf("     _/%c\\_/%c\\_",bx(4,10),bx(6,10));printf("\n");

    printf("   _/%c\\_/%c\\_/%c\\_",bx(3,9),bx(5,10),bx(7,9));printf("\n");

    printf(" _/%c\\_/%c\\_/%c\\_/%c\\_",bx(2,8),bx(4,9),bx(6,9),bx(8,8));printf("\n");

    printf("/%c\\_/%c\\_/%c\\_/%c\\_/%c\\",bx(1,7),bx(3,8),bx(5,9),bx(7,8),bx(9,7));printf("\n");

    printf("\\_/%c\\_/%c\\_/%c\\_/%c\\_/",bx(2,7),bx(4,8),bx(6,8),bx(8,7));printf("\n");

    printf("/%c\\_/%c\\_/%c\\_/%c\\_/%c\\",bx(1,6),bx(3,7),bx(5,8),bx(7,7),bx(9,6));printf("\n");

    printf("\\_/%c\\_/%c\\_/%c\\_/%c\\_/",bx(2,6),bx(4,7),bx(6,7),bx(8,6));printf("\n");

    printf("/%c\\_/%c\\_/%c\\_/%c\\_/%c\\",bx(1,5),bx(3,6),bx(5,7),bx(7,6),bx(9,5));printf("\n");

    printf("\\_/%c\\_/%c\\_/%c\\_/%c\\_/",bx(2,5),bx(4,6),bx(6,6),bx(8,5));printf("\n");

    printf("/%c\\_/%c\\_/%c\\_/%c\\_/%c\\",bx(1,4),bx(3,5),bx(5,6),bx(7,5),bx(9,4));printf("\n");

    printf("\\_/%c\\_/%c\\_/%c\\_/%c\\_/",bx(2,4),bx(4,5),bx(6,5),bx(8,4));printf("\n");

    printf("/%c\\_/%c\\_/%c\\_/%c\\_/%c\\",bx(1,3),bx(3,4),bx(5,5),bx(7,4),bx(9,3));printf("\n");

    printf("\\_/%c\\_/%c\\_/%c\\_/%c\\_/",bx(2,3),bx(4,4),bx(6,4),bx(8,3));printf("\n");

    printf("/%c\\_/%c\\_/%c\\_/%c\\_/%c\\",bx(1,2),bx(3,3),bx(5,4),bx(7,3),bx(9,2));printf("\n");

    printf("\\_/%c\\_/%c\\_/%c\\_/%c\\_/",bx(2,2),bx(4,3),bx(6,3),bx(8,2));printf("\n");

    printf("/%c\\_/%c\\_/%c\\_/%c\\_/%c\\",bx(1,1),bx(3,2),bx(5,3),bx(7,2),bx(9,1));printf("\n");

    printf("\\_/%c\\_/%c\\_/%c\\_/%c\\_/",bx(2,1),bx(4,2),bx(6,2),bx(8,1));printf("\n");

    printf("  \\_/%c\\_/%c\\_/%c\\_/",bx(3,1),bx(5,2),bx(7,1));printf("\n");

    printf("    \\_/%c\\_/%c\\_/",bx(4,1),bx(6,1));printf("\n");

    printf("      \\_/%c\\_/",bx(5,1));printf("\n");

    printf("        \\_/");printf("\n");

    }

    int main(){

    int i,ans;

    while(gets(s)!=NULL){

    sscanf(s,"%d",&n);

    init();

    ans = 0;

    for(i = 1; i <= n; ++i){

    gets(s);

    int index = s[0]-'A'+1;

    if(!S[index].empty() && S[index].size()<arr[index]  && S[index].top() == s ){

    S[index].pop();

    ans++;

    }

    else if(S[index].size() <  arr[index]){

    S[index].push(s );

    }

    }

    printf("The number of candy is %d.\n",ans);

    print();

    }

    return 0;

    }

      

首页 上一页 1 2 3 下一页 尾页 2/3/3
】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇ZOJ 3464 Rugby F.. 下一篇php 路由解析规则

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: