叶孤心的专栏

MZL's BorderTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 835    Accepted Submission(s): 268Problem DescriptionAs is known to

ClockHands The medieval interest in mechanical contrivances is well illustrated by the development of the mechanical clock, the oldest of which is driven by weights and controlled by a v

Problem HThe Land of JusticeInput: standard inputOutput: standard outputTime Limit: 4 secondsIn the Land of Justice the selling price of everything is fixed all over the country. Nobody

Steps One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the pr

Searching for Nessy The Loch Ness Monsteris a mysterious and unidentified animal said to inhabit Loch Ness,  a large deep freshwater loch near the city of Inverness in northern Scotlan

The Snail A snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foot at night while sleeping. The sna

Uniform Generator Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formwhere ``  " is the modulus ope

The Other Two TreesInput: standard inputOutput: standard outputTime Limit: 2 seconds You have a quadrilateral shaped land whose opposite fences are of equal length. You have four neighbors w

Inscribed Circles and Isosceles Triangles Given two real numbersBthe width of the base of an isosceles triangle in inchesHthe altitude of the same isosceles triangle in inches

Tree's a CrowdTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit StatusDescription Tree's a Crowd Dr William Larch, noted

Where is the Marble?Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit StatusDescription  Where is the Marble? Raju and Me

Master-Mind HintsTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit StatusDescriptionMasterMind is a game for two players. One of them, Designer, selects

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

Problem G. Birthday Cake BackgroundLucy and Lily are twins. Today is their birthday. Mother buys a birthday cake for them.Now we put the cake onto a Descartes coordinate. Its cen

A. Amr and Musictime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr is a young coder who likes music a lot.

D - Train Problem ITime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAs the new term comes, the Ignatius Train Station is very bus

Max SumTime Limit: 2000ms   Memory limit: 32768K  有疑问？点这里^_^题目描述Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example,

图练习-BFS-从起点到目标点的最短步数Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述在古老的魔兽传说中，有两个军团，一个叫天灾，一个叫近卫。在他们所在的地域，有n个隘口，编号为1..n，某些隘口之间是有通道连接的。其中近卫军团在1号隘口，天灾军团在n号隘口。某一天，天灾军团的领袖巫

Number SequenceTime Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mo

A     Ace of AcesTime Limit: 2 Seconds      Memory Limit: 65536 KBThere is a mysterious organization called Time-Space Administrative Bureau (TSAB) in the deep universe that we humans have not

水题Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述给定一个正整数 n，求一个最小的正整数 x，使得可以找到一个正整数y，且满足 y*y = n + x*x。输入输入包含多组测试数据。每组数据只有一行为 1 个整数 n(0 输出对于每组测

Fun HouseTime Limit: 1000MS Memory limit: 65536K题目描述American Carnival Makers Inc. (ACM) has a long history of designing rides and attractions. One of their more popular attract

图结构练习——BFS——从起始点到目标点的最短步数Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述 在古老的魔兽传说中，有两个军团，一个叫天灾，一个叫近卫。在他们所在的地域，有n个隘口，编号为1..n，某些隘口之间是有通道连接的。其中近卫军团在1号隘口，天灾军团在n号隘口。某一天，天灾

Reverse RotTime Limit: 1000MS Memory limit: 65536K题目描述A very simplistic scheme, which was used at one time to encode information, is to rotate the characters within an alphabet

(More) MultiplicationTime Limit: 1000MS Memory limit: 65536K题目描述Educators are always coming up with new ways to teach math to students. In 2011, an educational software company

C. Ilya and Stickstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the evening, after the contest Ilya w

Train SwappingTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit StatusDescription Train Swapping At an old railway statio

Problem BList of ConquestsInput: standard inputOutput: standard outputTime Limit: 2 secondsIn Act I, Leporello is telling Donna Elvira about his master's long list of conquests:``This is t

TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7679 Accepted: 3734DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles? 

B - 背包Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescription话说现在猪肉价格这么贵，著名的ACBoy 0068 也开始了养猪生活。说来也奇怪，他养的猪一出生第二天开始就能每天中午生一只小猪，而且生下来的竟然都

Alice and Bob   Time Limit : 1000 MS Memory Limit : 65536 KB Problem DescriptionThe famous "Alice and Bob" are playing a game again. So now comes the new

Welcome to XTCPC   Time Limit : 1000 MS Memory Limit : 65536 KB Problem DescriptionWelcome to XTCPC! XTCPC start today, you are going to choose a slogan t

加密术Time Limit: 1000MS Memory limit: 65536K题目描述加密技术是一种常用的安全保密手段，利用加密技术可以把重要的数据变成经过加密变成乱码传送，到达目的地后再利用解密手段还原。现在我们发明了一种新的加密技术，即通过在一个字符串的任意位置插入若干个随机生成的字符（‘a’~’z’或’A’~’Z’）对该字符串加密。我们想

小胖吃肉Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述众所周知，小胖非常喜欢吃肉。有一天，小胖发现了很多块肉。由于每一块肉的大小都不一样，并且每一块肉带给小胖的愉悦程度都不一样。但是因为小胖太胖了，所以小胖的妈妈规定小胖最多可以吃x体积的肉。小胖现在来求助于你，想让你找到一个最优的吃

Easy的题Time Limit: 1000MS Memory limit: 65536K题目描述YZL说她的线代很好，但是我们大家都不服啊，这坚决不能忍啊。。连我这上学期把所有能挂的科目都挂了的学渣渣都表示不服。。。于是我们一起出了个看似是矩阵或者行列式的题目给她，让她来做。她一看惊呼“so easy！”，然后。。。就没然后了。。只是从她嘴里知道她现在

题目描述给N个数，判断这N个数中存在多少组勾股数（勾股数：存在三个数满足a*a + b*b = c*c）。输入第一行输入一个数T(1每组数据输入一个N(1接下来N个数ai(1输出每组数据输出一行，表示有多少组勾股数。示例输入344 3 5 34 6 7 8 1056 7 8 9 5示例输出21

All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 27328 Accepted: 11175DescriptionYou have devised a new encryption technique which encodes a me

懒虫小鑫Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述小鑫是个大懒虫，但是这一天妈妈要小鑫去山上搬些矿石去城里卖以补贴家用。小鑫十分的不开心。不开心归不开心，小鑫还是要做这件事情的。我们把这个事情简化一下。有n块矿石，设第i块矿石由两个数字wi和pi表示。分别表示这块石头的重量和

Happy NumberAccepted : 121 Submit : 307Time Limit : 1000 MS Memory Limit : 65536 KB Problem DescriptionRecently, Mr. Xie learn the concept of happy number

B - SaleTime Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 34BDescriptionOnce Bob got to a sale of old TV sets. There we