2013年3月7日
fzu2089
摘要： Problem 2089 数字游戏Accept: 230Submit: 660 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem Description现在，给你2个整形数字A和B。你的任务就是计算出A+B的结果C后，统计C中数字5出现的次数。Input输入数据第一行包含一个整数T，表示测试数据的组数。对于每组测试数据：输入两个整数a,b(-2*10^9<a,b<2*10^9)。两个数字之间用空格隔开。Output对于每组测试数据，输出一行，包含一个整数，表示数字5出现的次数。Sample Input2 4 5 33 22Sam 阅读全文
posted @ 2013-03-07 17:17 哥的笑百度不到 阅读(149) 评论(0) 推荐(0) 编辑
fzu 2088
摘要： Problem 2088 最长队名Accept: 192Submit: 473 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionJack所在的班级决定组团报名参加FZU校赛。为了体现班级的团结和睦，班长决定用班级所有人的名字连起来组成一个史上最长最醒目的队名。因为听说在分数相同的情况下，队名字典序小的会排在更前面，班长还希望连成的史上最长队名拥有最小的字典序。Input输入数据第一行包含一个整数T，表示测试数据的组数。对于每组测试数据：第一行为一个整数n(0#includeusing namespace std;c. 阅读全文
posted @ 2013-03-07 16:53 哥的笑百度不到 阅读(227) 评论(0) 推荐(0) 编辑
2013年3月4日
HDU1019
摘要： Least Common MultipleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20759Accepted Submission(s): 7738 Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the 阅读全文
posted @ 2013-03-04 19:46 哥的笑百度不到 阅读(357) 评论(0) 推荐(0) 编辑
2013年3月2日
hdu1008
摘要： ElevatorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 29443Accepted Submission(s): 15921 Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which fl 阅读全文
posted @ 2013-03-02 23:36 哥的笑百度不到 阅读(154) 评论(0) 推荐(0) 编辑
hdu1004
摘要： Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 50088Accepted Submission(s): 17947 Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite tim 阅读全文
posted @ 2013-03-02 23:11 哥的笑百度不到 阅读(151) 评论(0) 推荐(0) 编辑
hdu1005
摘要： Number SequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 72091Accepted Submission(s): 16791 Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are 阅读全文
posted @ 2013-03-02 21:27 哥的笑百度不到 阅读(155) 评论(0) 推荐(0) 编辑
hdu1003
摘要： Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 95590Accepted Submission(s): 22086 Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the m 阅读全文
posted @ 2013-03-02 21:23 哥的笑百度不到 阅读(151) 评论(0) 推荐(0) 编辑
hdu1002
摘要： A + B Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 141857Accepted Submission(s): 26917 Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line 阅读全文
posted @ 2013-03-02 20:01 哥的笑百度不到 阅读(229) 评论(1) 推荐(0) 编辑
hdu1001
摘要： Sum ProblemTime Limit: 1000/500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 194488Accepted Submission(s): 46632 Problem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n. 阅读全文
posted @ 2013-03-02 19:45 哥的笑百度不到 阅读(198) 评论(0) 推荐(0) 编辑
hdu1000
摘要： A + B ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 271014Accepted Submission(s): 80188 Problem DescriptionCalculateA + B.InputEach line will contain two integersAandB. Process to end of file.OutputFor each case, outputA + Bin one line.Sa 阅读全文
posted @ 2013-03-02 19:30 哥的笑百度不到 阅读(208) 评论(0) 推荐(0) 编辑