字符串函数
淡定的小鱼
这个作者很懒,什么都没留下…
展开
-
HDU 2091 空心三角形
/*中文题意:中文翻译:题目大意:求一个空心三角形解题思路:观察三角形的结构,用两个for循环控制行和列,进而控制填上字母难点详解:注意要有getchar();吸收下一个输入的字符,还有就是注意题上我标记的红字,是题眼。关键点:对格式的控制,了解是第一类的填数解题人:lingnichong解题时间:2014/8/1 20:10解题感受:最后输出结果好像有点小原创 2014-08-01 20:06:14 · 650 阅读 · 0 评论 -
HDU 2163 Palindromes
PalindromesTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2949 Accepted Submission(s): 1723Problem DescriptionWrite a progra原创 2014-07-28 21:15:23 · 514 阅读 · 0 评论 -
HDU 1228 A + B【字符串的处理】
//对字符串的处理很好A + BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12172 Accepted Submission(s): 7118Problem Description原创 2014-10-22 14:08:40 · 619 阅读 · 0 评论 -
HDU 1234 开门人和关门人
开门人和关门人Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10622 Accepted Submission(s): 5419Problem Description每天第一个到机房的人要把门打开,最原创 2014-07-27 23:58:09 · 545 阅读 · 0 评论 -
HDU 2203 亲和串
/*题目大意:解题思路:难点详解:关键点:解题人:解题时间:解题体会:*/原创 2014-08-20 21:19:00 · 460 阅读 · 0 评论 -
HDU 1860 统计字符
/*中文题目中文翻译-大意题目大意:解题思路:难点详解:关键点:解题人:解题时间:解题体会:*/统计字符Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7344原创 2014-08-18 21:06:03 · 477 阅读 · 0 评论 -
HDU 2029 Palindromes _easy version
Palindromes _easy versionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21228 Accepted Submission(s): 13242Problem Description原创 2014-07-29 16:22:28 · 460 阅读 · 0 评论 -
HDU 1062 Text Reverse
Text ReverseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16342 Accepted Submission(s): 6205Problem DescriptionIgnatius lik原创 2014-07-29 00:12:01 · 543 阅读 · 0 评论 -
HDU 1039 Easier Done Than Said?
Easier Done Than Said?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7554 Accepted Submission(s): 3737Problem DescriptionPas原创 2014-07-28 19:28:47 · 371 阅读 · 0 评论 -
HDU 2203 亲和串【字符串函数的使用】
http://acm.hdu.edu.cn/showproblem.php?pid=2203#include#include#define MAXN 100000char a[MAXN],b[MAXN],c[MAXN];int main(){ while(~scanf("%s",a)) { scanf("%s",b); strcpy(c,a); s原创 2015-03-23 21:09:10 · 421 阅读 · 0 评论