2015年02月_叶孤心丶

11月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 POJ 1308 Is It A Tree?（并查集）

Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23255 Accepted: 7977DescriptionA tree is a well-known data structure that is either empty (

2015-02-07 10:13:56 2083

原创 C. New Year Book Reading（CF）模拟

C. New Year Book Readingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNew Year is coming, and Jaehyun de

2015-02-06 20:18:10 1790

原创 B. New Year Permutation （CF）

B. New Year Permutationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputUser ainta has a permutation p1, p2

2015-02-06 20:16:14 1304

原创 A Good Bye 2014（CF）

A. New Year Transportationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNew Year is coming in Line World

2015-02-06 20:14:29 613

原创 A && B Codeforces Round #284 (Div. 2)

A. Watching a movietime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have decided to watch the best momen

2015-02-06 20:11:00 938

原创 B. Mr. Kitayuta's Colorful Graph（ Codeforces Round #286 (Div. 2)）

B. Mr. Kitayuta's Colorful Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Kitayuta has just bough

2015-02-06 20:06:46 783

原创 A. Mr. Kitayuta's Gift（暴力求加一个字符是否构成回文字符）

A. Mr. Kitayuta's Gifttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Kitayuta has kindly given you a s

2015-02-06 20:03:33 1138

原创 A B Codeforces Round #285 (Div. 2)

A. Contesttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMisha and Vasya participated in a Codeforces cont

2015-02-06 19:56:18 850

原创 HDU 2352 Verdis Quo（模拟）

H - Verdis Quo HDU 2352Time Limit: 1000 MS Memory Limit: 32768 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status]DescriptionThe Romans used letter

2015-02-06 19:53:36 695

原创 HDU 5099 Comparison of Android versions（坑水题）

C - Comparison of Android versions HDU 5099Time Limit: 1000 MS Memory Limit: 32768 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status]DescriptionAs

2015-02-06 19:46:51 953

原创 C. Fox And Names(Codeforces Round #290 (Div. 2))

C. Fox And Namestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is going to publish a paper on FO

2015-02-03 14:14:19 1029

原创 B. Fox And Two Dots( Codeforces Round #290 (Div. 2))

B. Fox And Two Dotstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is playing a mobile puzzle gam

2015-02-03 14:12:38 910

原创 A. Fox And Snake(Codeforces Round #290 (Div. 2))

A. Fox And Snaketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel starts to learn programming. The

2015-02-03 14:08:38 911

原创 UVA Add All（优先队列）

Problem FAdd AllInput: standard inputOutput: standard outputYup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++

2015-02-02 16:31:45 602

原创 UVA Ants（水题）

DescriptionProblem B: AntsAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly fal

2015-02-02 16:30:40 651

原创 UVA Minimal coverage （贪心）

Description Minimal coverage The ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of th

2015-02-02 16:12:52 832

原创 UVA Packets (模拟)

Description Packets A factory produces products packed in square packets of the same height h and of the sizes , , , , , . These products are always deliver

2015-02-02 16:07:29 1510

原创 UVA Shoemaker's Problem

Description Shoemaker's Problem Shoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ith job, i

2015-02-02 16:05:39 568

原创 UVA Problem E - Camel trading（栈和队列）

DescriptionProblem 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 or

2015-02-02 16:02:29 824

原创 UVA All in All（水题）

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

2015-02-02 16:00:32 640

原创 UVA 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

2015-02-02 15:55:49 674

原创 UVA Number Sequence（规律）

Problem BNumber SequenceInput: standard inputOutput: standard outputTime Limit: 1 secondA single positive integer iis given. Write a program to find the digit located in the position iin

2015-02-02 15:53:35 507

原创 UVA 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

2015-02-02 15:51:23 825

原创 UVA 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

2015-02-02 15:44:09 695

原创 UVA Lining Up （一条直线上最多的点数）

Description 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 a

2015-02-02 14:57:25 771

原创 UVA File Fragmentation（文件复原）

DescriptionQuestion 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

2015-02-02 14:41:41 1040