2013年03月_ACM2272902662

原创 HDU 4417 Super Mario

Super MarioTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1130 Accepted Submission(s): 574Problem DescriptionMario is world-famous plu

2013-03-31 19:31:44 1068

原创 HDU 4414 Finding crosses

Finding crossesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 611 Accepted Submission(s): 353Problem DescriptionThe Nazca Lines are a

2013-03-28 00:18:21 1268

原创 HDU 4415 Assassin’s Creed

Assassin’s CreedTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 976 Accepted Submission(s): 276Problem DescriptionEzio Auditore is a gr

2013-03-26 21:03:27 992

原创 SDUT 2570 奇怪的数之一

奇怪的数之一Time Limit: 1000MS Memory limit: 65536K 题目描述给定N个正整数，求最小的不能由这些数的和组成的数。输入多组数据，<=50每组数据第一行一个数N，1第二行N个数字Pi,0输出每组数据输出一行，一个数即答案。示例输入41 2 3 4 示例输出11 这道题目

2013-03-25 18:36:19 973

原创 SDUT 2568 小白学Fibonacci之一

http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2568题目描述一天，Z懂得了Fibonacci数列，发现数列有以下规律：F[1]=F[2]=1; F[N]=F[N-1]+F[N-2];于是Z觉得很神奇，想知道任意两个Fibonacci数有没有大于1的公约数。但是光在有限的

2013-03-25 13:30:44 1177

原创 POJ 3159 Candies

CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 19693 Accepted: 5196DescriptionDuring the kindergarten days, flymouse was the monitor of his cla

2013-03-23 10:39:10 1086

原创 SDUT 2408 Pick apples

题目描述Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A girl carrying a big bag comes into the yard. She is so surprised because she

2013-03-20 21:51:17 1075

原创 POJ 2983 Is the Information Reliable?

Is the Information Reliable?Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 9433 Accepted: 2944DescriptionThe galaxy war between the Empire Draco and t

2013-03-20 20:47:44 893

原创 POJ 1201 Intervals

IntervalsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18456 Accepted: 6919DescriptionYou are given n closed, integer intervals [ai, bi] and n integers

2013-03-19 09:33:14 805

原创 UVa 12596 - Recursive Texting

Problem ERecursive TextingAll of you have typed in mobile phones. In this problem, you will have to do a similar thing.You are given a word. You will have to process it. There are two phases i

2013-03-12 00:39:25 1334

原创 codeforces 281B Nearest Fraction

B. Nearest Fractiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given three positive integers x, y, n. Yo

2013-03-11 02:37:23 1444

原创 sdut 1961 Image Compression

http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1961 这是此次比赛中的一个题目，由于赛前，英文的题目并没有做，也没仔细看，就加上了，没想到那么简单，本想着这道题目这么多图应该不会有人做出来，可是没想到，实际做了一下，会是这么简单，完全就是一个递归的简单应用。这次比赛出的有些简单了。

2013-03-10 13:30:20 875

原创 Problem E - Camel trading

Problem E - Camel tradingTime Limit: 1 secondBackgroundAroud 800 A.D., El Mamum, Calif of Baghdad was presented the formula 1+2*3*4+5, which had its origin in the financial accounts of a c

2013-03-07 20:30:58 1104

原创 UVa 10340 - All in All

Problem EAll in AllInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MBYou have devised a new encryption technique whichencodes a message by inserting betwe

2013-03-06 21:27:23 999

原创 UVa 10706 - Number Sequence

Problem BNumber SequenceInput: standard inputOutput: standard outputTime Limit: 1 secondA single positiveinteger iis given. Write a program to find the digitlocated in the positioniin

2013-03-06 21:13:06 927

原创 Codeforces 279B Books

B. Bookstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Valera has got some free time, he goes to the library t

2013-03-05 20:12:03 1719

原创 SDUT 1498 Edge Case

题目描述 In graph theory, a matching or independent edge set in a graph G = (V, E) is a set of edges M ⊆ E such that no two edges in the matching M share a common vertex. Recently you saw in the news th

2013-03-04 21:54:29 847

原创 UVa 10487 - Closest Sums

Problem DClosest SumsInput: standard inputOutput: standard outputTime Limit: 3 seconds Given is a set of integers and then a sequence of queries. A query gives you a number and asks to fin

2013-03-04 20:39:48 816

原创 UVa 10057 - A mid-summer night's dream.

Problem CA mid-summer night’s dreamInput: standard inputOutput: standard output This is year 2200AD. Science has progressed a lot in two hundred years. Two hundred years is mentioned here

2013-03-01 20:39:58 753

原创 POJ 10341 - Solve It

Problem FSolve ItInput: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBSolve the equation: p*e-x + q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0

2013-03-01 17:31:33 781

原创 UVa 270 - Lining Up

Lining Up ``How am I ever going to solve this problem?" said the pilot.Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dangero

2013-03-01 16:03:23 703

原创 UVa 10132 - File Fragmentation

Question 2: File FragmentationThe ProblemYour friend, a biochemistry major, tripped while carrying a tray of computer files through the lab. All of the files fell to the ground and broke. Your fri

2013-03-01 13:28:48 832

ACM2272902662的专栏