摘要: Problem DTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 103 Accepted Submission(s) : 38Font: Times New Roman | Verdana | Georgia Font Size: ← →Problem Description有一个长度为n(nint main(){int a,b,j,n,m,l,i,s,k; while(scanf("%d%d",&n,&m 阅读全文
posted @ 2013-08-05 10:43 夏子藤 阅读(126) 评论(0) 推荐(0) 编辑
摘要: I Love This GameTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4693 Accepted Submission(s): 1613Problem DescriptionDo you like playing basketball ? If you are , you may know the NBA Skills Challenge . It is the content of the basketball skills . 阅读全文
posted @ 2013-08-02 20:09 夏子藤 阅读(247) 评论(0) 推荐(0) 编辑
摘要: 自制QQ在线交谈--> 阅读全文
posted @ 2013-08-02 15:23 夏子藤 阅读(263) 评论(0) 推荐(1) 编辑
摘要: CalendarTime Limit: 1000MS Memory Limit: 30000K Total Submissions: 9817 Accepted: 3684 DescriptionA calendar is a system for measuring time, from hours and minutes, to months and days, and finally to years and centuries. The terms of hour, day, month, year and century are all units of time measureme 阅读全文
posted @ 2013-07-31 16:30 夏子藤 阅读(198) 评论(0) 推荐(0) 编辑
摘要: 开门人和关门人Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8901 Accepted Submission(s): 4623Problem Description每天第一个到机房的人要把门打开,最后一个离开的人要把门关好。现有一堆杂乱的机房签 到、签离记录,请根据记录找出当天开门和关门的人。 Input测试输入的第一行给出记录的总天数N ( > 0 )。下面列出了N天的记录。 每天的记录在第一行给出记录的条目数M ( > 0 阅读全文
posted @ 2013-07-31 09:04 夏子藤 阅读(526) 评论(2) 推荐(0) 编辑
摘要: 大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6303 Accepted Submission(s): 2178Problem Description话说,经过了漫长的一个多月,小明已经成长了许多,所以他改了一个名字叫“大明”。这时他已经不是那个只会做100以内加法的那个“小明”了,现在他甚至会任意长度的正小数的加法。现在,给你两个正的小数A和B,你的任务是代表大明计算出A+B的值。Input本题目包含多组测试数据,请处理到文件结 阅读全文
posted @ 2013-07-30 15:31 夏子藤 阅读(143) 评论(0) 推荐(0) 编辑
摘要: 放大的X Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 211 Accepted Submission(s) : 35Font: Times New Roman | Verdana | Georgia Font Size: ← →Problem Description请你编程画一个放大的’X’。如3*3的’X’应如下所示:X X XX X5*5的’X’如下所示:X X X X X X XX XInput输入数据第一行是一个整数T,表示有T组测 阅读全文
posted @ 2013-07-29 20:11 夏子藤 阅读(307) 评论(0) 推荐(0) 编辑
摘要: 字符串替换Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8492 Accepted: 4009 Description编写一个C程序实现将字符串中的所有"you"替换成"we"Input输入包含多行数据 每行数据是一个字符串,长度不超过1000 数据以EOF结束Output对于输入的每一行,输出替换后的字符串Sample Inputyou are what you doSample Outputwe are what we doSource#include#includeint ma 阅读全文
posted @ 2013-07-29 15:55 夏子藤 阅读(223) 评论(0) 推荐(0) 编辑
摘要: Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57692 Accepted Submission(s): 21088Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite tim 阅读全文
posted @ 2013-07-29 11:45 夏子藤 阅读(137) 评论(0) 推荐(0) 编辑
摘要: 第二小整数 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 74 Accepted Submission(s) : 39Font: Times New Roman | Verdana | Georgia Font Size: ← →Problem Description求n个整数中倒数第二小的数。每一个整数都独立看成一个数,比如,有三个数分别是1,1,3,那么,第二小的数就是1。Input输入包含多组测试数据。输入的第一行是一个整数C,表示有C 阅读全文
posted @ 2013-07-27 18:54 夏子藤 阅读(176) 评论(0) 推荐(0) 编辑