YES
注意事项:
开始提交了3次,都是wa,发现有一种测试用例我无法通过,也是上个代码错误的地方,测试用例如下:
样例输入:1122335566778899(不连续)12345
样例输出:yes
AC代码:
- #include <stdio.h> #include <stdlib.h>
- #include <string.h>
- int main() {
- char a[101]; char b[101];
- char ch, key; int i, lena, lenb, flag;
- int count[11];
- while(scanf("%s",a) != EOF)
- { //接收回车符
- ch = getchar(); //接收出牌
- scanf("%s",b); ch = getchar();
- //长度 lena = strlen(a);
- lenb = strlen(b); //初始化
- memset(count,0,sizeof(count)); //遍历手牌
- for(i = 0; i < lena; i ++) {
- count[a[i] - '0'] ++; }
- //检测对方出牌 switch(lenb)
- { case 1:
- case 2: case 3:
- case 4: flag = 0;
- for(key = b[0] - '0' + 1; key <= 9; key ++) {
- if(count[key] >= lenb) {
- flag = 1; break;
- } }
- break; case 5:
- flag = 0; for(key = b[0] - '0' + 1; key < 9; key ++)
- { if(count[key] > 0 && count[key + 1] > 0 && count[key + 2] > 0 && count[key + 3] > 0 && count[key + 4] > 0)
- { flag = 1;










