https://vjudge.net/problem/UVA-11210

//被水题虐了一上午...

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 using namespace std;
 const char* mahjong[]={"GZH","1T","2T","3T","4T","5T","6T","7T","8T","9T",
     "1S","2S","3S","4S","5S","6S","7S","8S","9S",
     "1W","2W","3W","4W","5W","6W","7W","8W","9W",
     "DONG","NAN","XI","BEI","ZHONG","FA","BAI"};
 ],startMahjong[];//last mahjong
 ];
 int ID(char* s){
     ;i<=;i++)
         ) return i;
     ;
 }
 bool dfs(int l){
     ) return true;
     ;i<=;i++){
         ){
             c[i]-=;
             )) return true;
             c[i]+=;
         }
     }
     ;i<=;i++)
         <=&&i%&&c[i]>=&&c[i+]>=&&c[i+]>=){
             --c[i];--c[i+];--c[i+];
             )) return true;
             ++c[i];++c[i+];++c[i+];
         }
     return false;
 }
 bool Judge(){
     ;i<=;i++){
         ){
             c[i]-=;
             )) return true;
             c[i]+=;
         }
     }
     return false;
 }
 int main()
 {
     ;
     ){
         ]==;
         printf("Case %d:",++caseCount);
         startMahjong[]=ID(input);
         ;i<=;i++){
             scanf("%s",input);startMahjong[i]=ID(input);
         }
         ;
         ;i<=;i++){
             memset(c,,sizeof(c));
             ;j<=;j++) c[startMahjong[j]]++;
             ) continue;
             c[i]++;
             if(Judge()){
                 ok=;
                 printf(" %s",mahjong[i]);
             }
             c[i]--;
         }
         if(!ok) printf(" Not ready");
         printf("\n");
     }
 }

最新文章

  1. PHP图片上传类
  2. ssh 使用密钥与登录进行远程cp
  3. js字符串和正则表达式中的match、replace、exec等函数详解
  4. Dephi 和 Pascal 的关系
  5. 用sql 语句给字段添加描述
  6. EditText的几个小点
  7. thinkphp我掉下的一些坑
  8. SQL基础查询实战
  9. 获取radio的值
  10. 设置spring-boot的logging
  11. linux大文件读取
  12. Nginx 用最快方式让缓存失效
  13. linux基础 用户(组)管理
  14. flask 使用Flask-Migrate迁移数据库(创建迁移环境、生成迁移脚本、更新数据库)
  15. [No0000F5]C# 类(Class)
  16. 黄金连分数|2013年蓝桥杯B组题解析第四题-fishers
  17. cogs 330. [NOI2003] 文本编辑器
  18. mongodb聚合管道用法
  19. 【原创】移动端获取用户公网ip,获取用户ip
  20. Luogu 2000 拯救世界

热门文章

  1. 106. Construct Binary Tree from Inorder and Postorder Traversal
  2. 返回顶部(解决IE6固定定位)
  3. cf 61 E. Enemy is weak 离散化+树状数组
  4. c# 贪吃蛇源码
  5. ARM7+PROTEUS调试(转)
  6. JConsole connection failed
  7. JAVA数据类型自动转换,与强制转换
  8. KVC , KVO , KVB
  9. 读取缓存模拟----FIFO
  10. POJ 3422 Kaka&#39;s Matrix Travels 【最小费用最大流】