UVA 409 - Excuses, Excuses!
来源:互联网 发布:淘宝一手货源一件代发 编辑:程序博客网 时间:2024/06/09 15:18
满满的都是泪啊.
一开始没思路,没想到多个key要怎么存..后来参考了一下别人的代码,知道可以用二维数组来存...也就在同时,我的悲剧开始了.
那个代码是可以AC的.
一般OJ不会出错的对吧...于是我就天真地以为代码是对的,但是按他的思路写的时候我发觉了好几处不对劲,更离谱的是他的输出是少了一句的,明显是WA的答案竟然可以AC.... 本着打破沙锅问到底的竟然,我就开始了漫长的调试之路....
到最后终于发现了问题:
int a,count[20];
和
int a;int count[20];
得出的是AC和WA..
泥马这两个不是完全一样的么...后来问了一下别人,得知有可能是写入出了点问题..然后阴差阳错就对了╮(╯▽╰)╭
TAT被坑死了.
这件事告诉我不要盲目迷信网上搜到的代码...而且OJ也有可能会出错的╮(╯▽╰)╭
总之要相信自己.
哎...幸好有这些体会,也没有白忙活了这么长时间...
#include <stdio.h>#include <string.h>#include <ctype.h>int count[200];int main(){ //freopen("input.txt","r",stdin); int i,j,n = 1,t = 0; int keynum, excnum,max,len; char key[20][30],excu[20][80],buf[80]; while (scanf("%d%d",&keynum, &excnum) == 2) { max = 0; memset(count,0,sizeof(count)); for (i = 0; i < keynum; i++) //输入关键词. scanf("%s", key[i]); getchar(); for (i = 0; i < excnum; i++) //i为当前的借口 { fgets(excu[i],80,stdin); len = strlen(excu[i]); //接下来转换为小写字母并判断 for (j = 0; j < len; j++) { if (isalpha(excu[i][j])) buf[t++] = tolower(excu[i][j]); else { buf[t] = '\0'; for (int l = 0; l < keynum; l++) if (!strcmp(buf,key[l])) count[i]++; memset(buf,0,sizeof(buf)); t = 0; } } if (count[i] > max) max = count[i]; } //输出 //printf("%d\n",max); printf("Excuse Set #%d\n",n++); for (i = 0; i < excnum; i++) if (count[i] == max) printf("%s",excu[i]); printf("\n"); } return 0;}
0 0
- UVa 409 Excuses, Excuses!
- uva 409 Excuses, Excuses!
- UVa 409 Excuses! Excuses!
- UVa 409 - Excuses, Excuses!
- uva-409 - Excuses, Excuses!
- UVa 409 - Excuses, Excuses!
- uva 409 Excuses, Excuses!
- UVA 409 Excuses, Excuses!
- UVa 409 - Excuses, Excuses!
- UVa 409 - Excuses, Excuses!
- UVA 409 Excuses, Excuses!
- uva 409 - Excuses, Excuses!
- UVa - 409 - Excuses, Excuses!
- UVA 409 Excuses, Excuses!
- uva 409 Excuses, Excuses!
- uva 409 Excuses, Excuses!
- uva - 409 - Excuses, Excuses!
- uva 409 - Excuses, Excuses!
- WebKit专栏
- c# 互斥锁(Mutex)使用详解
- golang动态解析xml
- 数据结构-van emde boas 树
- 大电容并小电容
- UVA 409 - Excuses, Excuses!
- CodeForces - Domino Effect
- EnumMap学习
- Dynamics CRM 2013 Claim Based Authentication & IFD Configuration Tips
- UIWebView指南
- 第二周作业
- nginx源码学习资源
- 操作格子(线段树)
- shell——变量、数学运算、数组