ACM
文章平均质量分 69
xiaofei2010
艰苦的奋斗
展开
-
1425: sort hash表排序
给你n个整数,请按从大到小的顺序输出其中前m大的数。每组测试数据有两行,第一行有两个数n,m(0输入: 5 3 3 -35 92 213 -644 输出: 213 92 3 //******以下为输入元素无重复情况时源码******#include using namespace std;int hash[1000001];int main(原创 2012-03-01 22:50:55 · 878 阅读 · 0 评论 -
3079:Vowel Counting
Problem DescriptionThe "Vowel-Counting-Word"(VCW), complies with the following conditions.Each vowel in the word must be uppercase. Each consonant (the letters except the vowels) must be lower原创 2012-09-01 22:42:15 · 1078 阅读 · 0 评论 -
2399:GPA
Problem DescriptionEach course grade is one of the following five letters: A, B, C, D, and F. (Note that there is no grade E.) The grade A indicates superior achievement , whereas F stands for fai原创 2012-07-23 21:21:05 · 1077 阅读 · 0 评论 -
2317:Nasty Hacks
Problem DescriptionYou are the CEO of Nasty Hacks Inc., a company that creates small pieces of malicious software which teenagers may useto fool their friends. The company has just finished thei原创 2012-07-22 15:17:43 · 730 阅读 · 0 评论 -
1061:Rightmost Digit(代码超级简洁)
Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line of the input is a single integer T which原创 2012-05-17 22:27:48 · 624 阅读 · 0 评论 -
1089-1096:A+B for Input-Output Practice
A+B for Input-Output Practice (I)Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I specially designed the problem for acm beginners. You must have found原创 2012-07-22 08:47:25 · 14188 阅读 · 1 评论 -
2095:find your present (2)
Problem DescriptionIn the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them wil原创 2012-07-22 15:42:07 · 2947 阅读 · 0 评论 -
1477:Box of Bricks
Problem DescriptionLittle Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I\'ve built a wall!”, he tells his older siste原创 2012-07-22 11:14:23 · 1275 阅读 · 0 评论 -
1003:Max Sum
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 max sum in this sequence is 6 + (-1) + 5原创 2012-07-22 08:31:56 · 1536 阅读 · 0 评论 -
ACM NOTE01
1. 输入不说明有多少个Input Block,以EOF为结束标志。参见:HDOJ_1089 #include int main() { inta,b; while(scanf("%d%d",&a, &b) != EOF) printf("%d\n",a+b); }2.各类输入一览:输入_第一类: 输入不说明有多少个Inpu原创 2012-02-29 16:28:37 · 769 阅读 · 0 评论 -
1021: Fibonacci Again
Problem Description:There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lines, each containing an integer n. (n原创 2012-03-02 14:10:15 · 805 阅读 · 1 评论 -
2035: 人见人爱A^B
求A^B的最后三位数表示的整数。说明:A^B的含义是“A的B次方”Input输入数据包含多个测试实例,每个实例占一行,由两个正整数A和B组成(1Output对于每个测试实例,请输出A^B的最后三位表示的整数,每个输出占一行。Sample Input2 312 66789 100000 0Sample Output89841原创 2012-05-17 22:51:51 · 607 阅读 · 0 评论 -
1108: 最小公倍数
Problem Description给定两个正整数,计算这两个数的最小公倍数。 Input输入包含多组测试数据,每组只有一行,包括两个不大于1000的正整数. Output对于每个测试用例,给出这两个数的最小公倍数,每个实例输出一行。 Sample Input10 14 Sample Output70#include using na原创 2012-05-17 18:35:03 · 838 阅读 · 0 评论 -
2106:decimal system
Problem DescriptionAs we know , we always use the decimal system in our common life, even using the computer. If we want to calculate the value that 3 plus 9, we just import 3 and 9.after calculat原创 2012-09-01 23:53:48 · 799 阅读 · 0 评论