随笔分类 -  ACM(HOJ)题目解题报告

上一页 1 ··· 21 22 23 24 25 26 27 下一页

ACM HDU 1235 统计同成绩学生人数(超级简单水题)
摘要:统计同成绩学生人数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7066Accepted Submission(s): 4118Problem Description读入N名学生的成绩,将获得某一给定分数的学生人数输出。Input测试输入包含若干测试用例,每个测试用例的格式为第1行:N第2行:N名学生的成绩,相邻两数字用一个空格间隔。第3行:给定分数当读到N=0时输入结束。其中N不超过1000,成绩分数为(包含)0到100之间的一个整数。Ou 阅读全文

posted @ 2011-08-02 18:27 kuangbin 阅读(698) 评论(0) 推荐(1) 编辑

ACM HDU 1234 开门人和关门人(简单水题)
摘要:开门人和关门人Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5372Accepted Submission(s): 2773Problem Description每天第一个到机房的人要把门打开,最后一个离开的人要把门关好。现有一堆杂乱的机房签 到、签离记录,请根据记录找出当天开门和关门的人。 Input测试输入的第一行给出记录的总天数N ( > 0 )。下面列出了N天的记录。 每天的记录在第一行给出记录的条目数M ( > 0 ), 阅读全文

posted @ 2011-08-02 18:20 kuangbin 阅读(809) 评论(0) 推荐(0) 编辑

ACM HDU 1219 AC me(简单题,但是花了很长时间才AC)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1219简单题。收获:gets()的使用。AC MeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5280Accepted Submission(s): 2388Problem DescriptionIgnatius is doing his homework now. The teacher gives him some articles and 阅读全文

posted @ 2011-08-02 17:04 kuangbin 阅读(1911) 评论(0) 推荐(0) 编辑

ACM HDU 1205 吃糖果(简单题,注意数据范围)
摘要:吃糖果Time Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 6890Accepted Submission(s): 1997Problem DescriptionHOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。Input第一行有一个整数T, 阅读全文

posted @ 2011-08-02 16:37 kuangbin 阅读(854) 评论(5) 推荐(1) 编辑

ACM HDU 1202 The calculation of GPA(简单题)
摘要:The calculation of GPATime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9186Accepted Submission(s): 2110Problem Description每学期的期末,大家都会忙于计算自己的平均成绩,这个成绩对于评奖学金是直接有关的。国外大学都是计算GPA(grade point average) 又称GPR(grade point ratio),即成绩点数与学分的加权平均值来代表一个学生的成绩的。那么如 阅读全文

posted @ 2011-08-01 23:21 kuangbin 阅读(1081) 评论(0) 推荐(0) 编辑

ACM HDU 1201 18岁生日(简单水题)
摘要:18岁生日Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7131Accepted Submission(s): 2209Problem DescriptionGardon的18岁生日就要到了,他当然很开心,可是他突然想到一个问题,是不是每个人从出生开始,到达18岁生日时所经过的天数都是一样的呢?似乎并不全都是这样,所以他想请你帮忙计算一下他和他的几个朋友从出生到达18岁生日所经过的总天数,让他好来比较一下。Input一个数T,后面T行每行有一 阅读全文

posted @ 2011-08-01 22:57 kuangbin 阅读(1298) 评论(0) 推荐(1) 编辑

ACM HDU 1197 Specialized Four-Digit Numbers(简单进制转换)
摘要:Specialized Four-Digit NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1431Accepted Submission(s): 1017Problem DescriptionFind and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals 阅读全文

posted @ 2011-08-01 22:19 kuangbin 阅读(2360) 评论(0) 推荐(0) 编辑

ACM HDU 1196 Lowest Bit(简单水题)
摘要:Lowest BitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3399Accepted Submission(s): 2426Problem DescriptionGiven an positive integer A (1 <= A <= 100), output the lowest bit of A.For example, given A = 26, we can write A in binary form as 1 阅读全文

posted @ 2011-08-01 20:56 kuangbin 阅读(1054) 评论(0) 推荐(0) 编辑

ACM HDU 1194 Beat the Spread!(简单的水题)
摘要:Beat the Spread!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1723Accepted Submission(s): 899Problem DescriptionSuperbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions, the local 阅读全文

posted @ 2011-08-01 20:48 kuangbin 阅读(1529) 评论(0) 推荐(0) 编辑

ACM POJ 2109 Power of Cryptography
摘要:http://poj.org/problem?id=2109Power of CryptographyTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 10904Accepted: 5626DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted 阅读全文

posted @ 2011-08-01 20:10 kuangbin 阅读(335) 评论(0) 推荐(0) 编辑

ACM HDU 1070 Milk
摘要:MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5689Accepted Submission(s): 1291Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermar 阅读全文

posted @ 2011-08-01 19:19 kuangbin 阅读(773) 评论(0) 推荐(0) 编辑

ACM HDU 1106 排序 (简单题)
摘要:排序Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15676Accepted Submission(s): 4032Problem Description输入一行数字,如果我们把这行数字中的‘5’都看成空格,那么就得到一行用空格分割的若干非负整数(可能有些整数以‘0’开头,这些头部的‘0’应该被忽略掉,除非这个整数就是由若干个‘0’组成的,这时这个整数就是0)。你的任务是:对这些分割得到的整数,依从小到大的顺序排序输出。Input输入包含多组 阅读全文

posted @ 2011-08-01 19:16 kuangbin 阅读(2713) 评论(2) 推荐(0) 编辑

ACM HDU 1108 最小公倍数(完全的水题)
摘要:最小公倍数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14564Accepted Submission(s): 7651Problem Description给定两个正整数,计算这两个数的最小公倍数。Input输入包含多组测试数据,每组只有一行,包括两个不大于1000的正整数.Output对于每个测试用例,给出这两个数的最小公倍数,每个实例输出一行。Sample Input10 14Sample Output70SourcePOJ Reco 阅读全文

posted @ 2011-08-01 19:14 kuangbin 阅读(1564) 评论(0) 推荐(0) 编辑

ACM HDU 1157 Who's in the Middle (完全的水题,排序找中值的)
摘要:Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3360Accepted Submission(s): 1646Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of 阅读全文

posted @ 2011-08-01 19:04 kuangbin 阅读(2461) 评论(0) 推荐(0) 编辑

ACM HDU 1163 Eddy's digital Roots(数根,找规律)
摘要:Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1609Accepted Submission(s): 947Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit 阅读全文

posted @ 2011-08-01 19:01 kuangbin 阅读(452) 评论(0) 推荐(0) 编辑

ACM HDU 1164 Eddy's research I(素数分解,水题)
摘要:Eddy's research ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2443Accepted Submission(s): 1492Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divi 阅读全文

posted @ 2011-08-01 18:55 kuangbin 阅读(430) 评论(0) 推荐(0) 编辑

ACM HDU 1170 Balloon Comes! (完全的水题,加减乘除)
摘要:Balloon Comes!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10546Accepted Submission(s): 3623Problem DescriptionThe contest starts now! How excited it is to see balloons floating around. You, one of the best programmers in HDU, can get a very bea 阅读全文

posted @ 2011-08-01 18:49 kuangbin 阅读(3577) 评论(0) 推荐(0) 编辑

ACM HDU 1098Ignatius's puzzle
摘要:Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2716Accepted Submission(s): 1788Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that 阅读全文

posted @ 2011-08-01 10:49 kuangbin 阅读(647) 评论(0) 推荐(0) 编辑

A hard puzzle ACM HDU1097
摘要:A hard puzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13437Accepted Submission(s): 4677Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,s 阅读全文

posted @ 2011-08-01 10:23 kuangbin 阅读(1599) 评论(4) 推荐(0) 编辑

Humble Numbers HDU 1058 ACM
摘要:Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6085Accepted Submission(s): 2639Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 阅读全文

posted @ 2011-07-31 21:43 kuangbin 阅读(3221) 评论(1) 推荐(2) 编辑

上一页 1 ··· 21 22 23 24 25 26 27 下一页

导航

JAVASCRIPT: