![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
sicily
文章平均质量分 78
KellyHo_yeah
这个作者很懒,什么都没留下…
展开
-
2013. Pay Back
2013. Pay BackDescription "Never a borrower nor a lender be." O how Bessie wishes she had taken that advice! She has borrowed from or lent money to each of N (1 ≤ N ≤ 100,000) friends, c原创 2013-08-18 12:06:29 · 1320 阅读 · 0 评论 -
1381. a*b 大数相乘
1381. a*bDescriptionGive two positive integers a and b, please help us calculate a*b.InputThe first line of the input is a positive integer T. T is the number of test cases followed.Ea转载 2013-09-05 19:49:58 · 1124 阅读 · 0 评论 -
1134. 积木分发
1134. 积木分发ConstraintsTime Limit: 10 secs, Memory Limit: 32 MBDescription歌手The Pancakes到幼儿园跟小朋友玩耍,她到达的时候小朋友们已经争着积木玩了。小朋友都想要更多的积木砌一个自己喜欢的图形,砌完就可以和The Pancakes合照。同时,The Pancakes手上还有一些积木,她可以把手上的原创 2013-09-06 17:27:54 · 879 阅读 · 0 评论 -
1021. Couples
1021. CouplesDescriptionN couples are standing in a circle, numbered consecutively clockwise from 1 to 2N. Husband and wife do not always stand together. We remove the couples who stand to原创 2013-09-06 12:21:04 · 846 阅读 · 0 评论 -
4629. A+B Again
4629. A+B AgainTime Limit: 1sec Memory Limit:256MBDescription输入两个分数a/b和c/d,计算a/b+c/d.Input第一行是一个整数T (T接下来的T行,每行是一组数据,包括4个正整数a, b, c, d (1Output原创 2013-09-06 13:50:27 · 1170 阅读 · 0 评论 -
1179. Extrusion
1179. ExtrusionDescription The Acme Extrusion Company specializes in the production of steel bars with custom-designed cross-sections. The manufacturing process involves cutting a hole in a原创 2013-09-06 13:58:03 · 749 阅读 · 0 评论 -
1482. 奖学金
1482. 奖学金ConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescription某小学最近得到了一笔赞助,打算拿出其中一部分为学习成绩优秀的前5名学生发奖学金。期末,每个学生都有3门课的成绩:语文、数学、英语。先按总分从高到低排序,如果两个同学总分相同,再按语文成绩从高到低排序,如果两个同学原创 2013-09-08 11:09:27 · 706 阅读 · 0 评论 -
1001. Common Subsequence
1001. Common SubsequenceDescription A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = 1, x2, ..., xm>, another sequenc原创 2013-09-08 15:50:31 · 696 阅读 · 0 评论 -
A Funny Game
1087. A Funny GameDescription Alice and Bob decide to play a funny game. At the beginning of the game they pick n(1 6) coins in a circle, as Figure 1 shows. A move consists in removing one or tw转载 2013-09-02 12:11:25 · 632 阅读 · 0 评论 -
1146. 采药
1146. 采药Description辰辰是个天资聪颖的孩子,他的梦想是成为世界上最伟大的医师。为此,他想拜附近最有威望的医师为师。医师为了判断他的资质,给他出了一个难题。医师把他带到一个到处都是草药的山洞里对他说:“孩子,这个山洞里有一些不同的草药,采每一株都需要一些时间,每一株也有它自身的价值。我会给你一段时间,在这段时间里,你可以采到一些草原创 2013-09-10 13:20:51 · 952 阅读 · 0 评论 -
1486. 统计数字
1486. 统计数字Description某次科研调查时得到了n个自然数,每个数均不超过1500000000(1.5*10^9)。已知不相同的数不超过10000个,现在需要统计这些自然数各自出现的次数,并按照自然数从小到大的顺序输出统计结果。Input 包含多个测试数据,每个包含n+1行: 第1行是整数n,表示自然数的个数。 第2~原创 2013-09-10 17:17:49 · 1134 阅读 · 0 评论 -
重建二叉树(1)
重建二叉树:已知前序遍历和中序遍历,求其后序遍历。Description对于二叉树T,可以递归定义它的先序遍历、中序遍历和后序遍历如下: PreOrder(T)=T的根节点+PreOrder(T的左子树)+PreOrder(T的右子树) InOrder(T)=InOrder(T的左子树)+T的根节点+InOrder(T的右子树) PostOrder(T)=PostOrder(T原创 2013-09-05 11:30:25 · 679 阅读 · 0 评论 -
奖金
1424. 奖金Description 由于无敌的凡凡在2005年世界英俊帅气男总决选中胜出,Yali Company总经理Mr.Z心情好,决定给每位员工发奖金。公司决定以每个人本年在公司的贡献为标准来计算他们得到奖金的多少。 于是Mr.Z下令召开m方会谈。每位参加会谈的代表提出了自己的意见:“我认为员工a的奖金应该比b高!”Mr.Z决定要找出一种奖金方案,满足原创 2013-08-26 13:07:53 · 2533 阅读 · 0 评论 -
Crypto Columns
1036. Crypto ColumnsDescriptionThe columnar encryption scheme scrambles the letters in a message (or plaintext) using a keyword as illustrated in the following example: Suppose BATBOY is the原创 2013-08-26 13:17:37 · 867 阅读 · 0 评论 -
Forest
Forest题目链接:http://soj.me/show_problem.php?pid=1001&cid=970DescriptionIn the field of computer science, forest is important and deeply researched , it is a model for many data structures .原创 2013-05-31 18:05:41 · 845 阅读 · 0 评论 -
Handshaking
Handshaking题目链接:http://soj.me/show_problem.php?pid=1000&cid=1035DescriptionN (N is even) persons stand around a round table. They make handshakes. Every person shakes the hand with one a原创 2013-05-30 23:44:49 · 5947 阅读 · 0 评论 -
Let Me Count The Ways
Let Me Count The Ways题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=293After making a purchase at a large department store, Mel's change wa原创 2013-06-03 19:44:26 · 669 阅读 · 0 评论 -
Partitioning by Palindromes
Partitioning by PalindromesWe say a sequence of characters is a palindrome if it is the same written forwards and backwards. For example, 'racecar' is a palindrome, but 'fastcar' is not.A partitio原创 2013-06-03 19:56:53 · 910 阅读 · 0 评论 -
Sum of divisors
Sum of divisorsDescriptionmmm is learning division, she's so proud of herself that she can figure out the sum of all the divisors of numbers no larger than 100 within one day!But her tea原创 2013-06-19 22:32:08 · 925 阅读 · 0 评论 -
Physical Examination
Physical ExaminationTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescriptionWANGPENG is a freshman. He is requested to have a physical examination when e原创 2013-06-20 01:01:33 · 929 阅读 · 0 评论 -
1010. Zipper
1010. ZipperConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in t原创 2013-08-20 18:13:25 · 678 阅读 · 0 评论 -
1047. Super Snooker
1047. Super SnookerConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionOn one of my many interplanetary travels I landed on a beautiful little planet called Crucible. It was inh原创 2013-08-20 19:10:50 · 757 阅读 · 0 评论 -
回文素数Prime Palindromes
4190. Prime PalindromesDescriptionThe number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a progr原创 2013-08-21 19:01:21 · 921 阅读 · 0 评论 -
Permutation
Permutation题目链接:http://soj.me/show_problem.php?pid=1002&cid=1035DescriptionPermutation plays a very important role in Combinatorics. For example, 1 2 3 4 5 and 1 3 5 4 2 are both 5原创 2013-06-03 19:04:53 · 1015 阅读 · 0 评论 -
1046. Plane Spotting
1046. Plane SpottingDescriptionCraig is fond of planes. Making photographs of planes forms a major part of his daily life. Since he tries to stimulate his social life, and since it’s q原创 2013-08-25 19:51:15 · 989 阅读 · 0 评论 -
1935. 二叉树重建(2)
1935. 二叉树重建Description对于二叉树T,可以递归定义它的先序遍历、中序遍历和后序遍历如下: PreOrder(T)=T的根节点+PreOrder(T的左子树)+PreOrder(T的右子树) InOrder(T)=InOrder(T的左子树)+T的根节点+InOrder(T的右子树) PostOrder(T)=PostOrder(T的左子树)+PostOrde原创 2013-09-05 16:57:41 · 1167 阅读 · 0 评论