- 博客(9)
- 收藏
- 关注
RSS订阅原创 CCF201503-2
问题描述 给定n个整数，请统计出每个整数出现的次数，按出现次数从多到少的顺序输出。输入格式 输入的第一行包含一个整数n，表示给定数字的个数。 第二行包含n个整数，相邻的整数之间用一个空格分隔，表示所给定的整数。输出格式 输出多行，每行包含两个整数，分别表示一个给定的整数和它出现的次数。按出现次数递减的顺序输出。如果两个整数出现的次数一样多，则先输出值较小的，
2015-09-10 10:47:43
442
原创 uva oj 10878
Your boss has just unearthed a roll of old computer tapes. The tapes have holes in them and might contain some sort of useful information. It falls to you to figure out what is written on them.Input
2014-05-13 21:54:09
542
原创 uva 537 Artificial Intelligence?
Artificial Intelligencehysics teachers in high school often think that problems given as text are more demanding than pure computations. After all, the pupils have to read and understand the problem
2014-05-02 22:15:52
453
原创 uva 10361
Problem IAutomatic Poetry Input: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MB“Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!”In Tom
2014-04-30 17:16:23
401
原创 poj 1088
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 72845 Accepted: 26892DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升
2014-04-28 12:04:53
511
原创 uva oj 401
#include#includeint panmir(char a,char b){ if(a=='A'&&b=='A') return 1; if( (a=='E'&&b=='3') || (a=='3'&&b=='E') ) return 1; if( (a=='H'&&b=='H') ) return 1; if( (a=='I'&&b==
2014-04-14 10:40:18
482
原创 uva 10055 - Hashmat the Brave Warrior
10055 - Hashmat the Brave WarriorTime limit: 3.000 seconds Problem AHashmat the brave warriorInput: standard inputOutput: standard outputHashmat
2014-04-07 20:31:14
452
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人