-- bird --

 Simple Addition ExpressionTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 569    Accepted Submission(s): 189Problem DescriptionA luxury yacht with 100 passengers on board is sailing on the sea in the

Football Score<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 942    Accepted Submission(s): 287<br /><br />Problem DescriptionFootball is one of the greatest games in the world. Lots of p

继续畅通工程<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 4083    Accepted Submission(s): 1577<br /><br />Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。现得到城镇道

Toxophily <br />Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 186    Accepted Submission(s): 106<br /><br />Problem DescriptionThe recreation center of WHU ACM Team has indoor billiards, Ping

Connect the Cities<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 1271    Accepted Submission(s): 423<br /><br />Problem DescriptionIn 2100, since the sea level rise, most of the cities di

Minimum Inversion Number<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 753    Accepted Submission(s): 402<br /><br />Problem DescriptionThe inversion number of a given number sequence a1,

A sequence of numbers<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 529    Accepted Submission(s): 162<br /><br />Problem DescriptionXinlv wrote some sequences on the paper a long time ag

 Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 549    Accepted Submission(s): 222Problem DescriptionA binary tree

Polynomial ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 219    Accepted Submission(s): 103Problem DescriptionWe have learned how

 Points on Cycle Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 513    Accepted Submission(s): 195Problem DescriptionThere is a cycle wit

<br /> Cube<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 436    Accepted Submission(s): 334<br /><br />Problem DescriptionCowl is good at solving math problems. One day a friend asked hi

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1724    Accepted Submission(s): 891Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. Th

1297. PalindromeTime Limit: 1.0 secondMemory Limit: 16 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimited» has infiltrated into “U.S. Robotics”. «U.S. Robots» security

http://ds.bianchengla.com/course/3/practise/problem?id=1387最长重复子串时间限制：1000 ms  |  内存限制：3000 KB 描述 <br />对于一个字符串S1，其中S2是他的一个子串（长度严格小于S1长度），如果S2在S1中出现次数超过1次，那么S2就是一个重复子串，现在的要求是给定S1，请求出他的最长重复子串；<br /> <br />如果有多个长度一样的最长子串，请输入字典序最小那个串；<br /> <br />比如bbbaaaccc<

SPOJ Problem Set (classical)705. New Distinct SubstringsProblem code: SUBST1<br /> <br />Given a string, we need to find the total number of its distinct substrings. Input<br />T- number of test cases. T<=20; Each test case consists of one string, whose le

CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2991 Accepted: 1407 Special Judge<br />DescriptionIn a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, a

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5545 Accepted: 1936<br />DescriptionA musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the piano. It

Orienteering<br />Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 203    Accepted Submission(s): 64<br /><br />Problem DescriptionThe Orienteering competition is coming soon！Now there are N play

Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 9500 Accepted: 3816Case Time Limit: 1000MS<br />DescriptionThe little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his mothe

694. Distinct SubstringsProblem code: DISUBSTR<br /> <br />Given a string, we need to find the total number of its distinct substrings.Input<br />T- number of test cases. T<=20;<br />Each test case consists of one string, whose length is <= 1000Output<br /

<br />Spring-outing Decision(2)<br />Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 164    Accepted Submission(s): 39<br /><br />Problem Description历经千辛万苦，ACgirl 终于定好了时间，在那一天，她们班全班的人都有时间去春游。<br

Train Problem ITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3548    Accepted Submission(s): 1299Problem DescriptionAs the new term come

PupuTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 344    Accepted Submission(s): 164Problem DescriptionThere is an island called PiLiPaL

DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all compu

一辆吉普车来到x公里宽的沙漠边沿A点，吉普车的耗油量为1升/公里，总装油量为500升。通常，吉普车必须用自身油箱中的油在沙漠中设置若干个临时储油点，才能穿越沙漠的。假设在沙漠边沿A点有充足的汽油可供使用，那么吉普车从A点穿过这片沙漠到达终点B，至少要耗多少升油。请编写一个程序，计算最少的耗油量（精确到小数点后3位）。（1）假设吉普车在沙漠中行进时不发生故障；（2）吉普车在沙漠边沿A点到终点B的直线

图书馆终于建成了，可以自习的教室也多了。所以，往常从不自习的Roam也开始上自习了。图书馆的自习室虽然很大而且座位众多，但找到满意座位也确实能算一门学问……由于Roam找座不是很有经验，而且他还有一些特殊的要求，所以Roam希望你来帮他选择座位。Roam 对于座位的要求有:旁边有另一个空座位，可以是左边，也可以是右边(放书包用的...)； 为了环境相对稳定，满足要求1的同时，R

A group of commandos were assigned a critical task. They are to destroy an enemy head quarter. The enemy head quarter consists of several buildings and the buildings are connected by roads. The comman

提高文件的压缩率一直是人们追求的目标。近几年有人提出了这样一种算法，它虽然只是单纯地对文件进行重排，本身并不压缩文件，但是对经这种算法调整后的文件进行压缩，在大多数情况下都能获得比原来更大的压缩率。该算法具体如下：对一个长度为n的字符串S，首先根据它构造n个字符串，其中第i个字符串由S向左循环移位i-1次得到（见示例）。然后把这n个字符串按照首字符从小到大排序。如果两个字符串的首字符相同，则它们的

http://acm.fzu.edu.cn/problem.php?pid=1685分析：我们知道，最长的路程当然要陪最好的加速器，这样才能最大幅度的加快速度。于是将2组数据排序后，在将2组数据一个一个相除，当加速器没有后在加上本身的就可以了代码如下： #include void paixu(double s[1001],int len){ int i,j,max; f

http://acm.fzu.edu.cn/problem.php?pid=1629It is said that 90% of frosh expect to be above average in their class. You are to provide a reality check. The first line of standard input contains an int

http://acm.fzu.edu.cn/problem.php?pid=1733In the process of transmission, data loss may occur, resulting in image distortion and so on. To simplify the problem, we consider an image whose pixel is a s

 http://acm.fzu.edu.cn/problem.php?pid=1705给定含有n个元素的多重集合S，每个元素在S中出现的次数称为该元素的重数。多重集S中重数最大的元素称为众数。例如，S={1，2，2，2，3，5}。多重集S的众数是2，其重数为3。现在给你一个已经排好序的集合S，让你求出其众数和重数。输入数据 （请使用标准输入输出，而不要读写文件）输入只有一行

题目大意：输入两个整数n,r。n是行数和列数，r是允许的距离。距离公式是max(|i-i|,|j-j|)。最后求每个点在允许的距离范围内的所有点的值的和。思路一：分析：先输入全部数。然后在一个点一个点的找。就是找出这个点的允许范围，在以这个范围为一个二维数组，求这个数组的全部数的和。结果：我发现提交会超时，循环语句太多了，应该换个思路。代码如下：（哪位朋友能帮我改进下）#i

Tom博士最近研发了一个自动机，该自动机能够同时处理n个队列。其中，队列的编号为1..n。给定m个操作，模拟该自动机的工作状态。 第一行有2个整数n,m（1≤n, m≤10,000），表示自动机能处理n个队列，接下来m行每行一条操作指令。 每条指令的格式如下： 指令指令说明INIT将自动机初始化，此时所有的队列清空。PUSH id val把整

Today the teacher give out a tedious homework to loy concerning the integer calculation practice. He is not contend with such boring homework, so instead, loy decides to write a program to help him fi

 Problem DescriptionThe new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern i

Problem DescriptionFollowing the account of Jules Verne, a scrambled message written by the middle age alchemist Arne Saknussemm, and deciphered by professor Lidenbrock, started the incredible trave

Problem DescriptionEverybody is fond of computers, but buying a new one is always a money challenge. Fortunately, there is always a convenient way to deal with. You can replace your computer and get

五子棋是起源于中国古代的传统黑白棋种之一。现代五子棋日文称之为"连珠"，音译为"Renju"，英文称之为"Gobang"或"FIR"(Five in a Row的缩写)，亦有"连五子"、"五子连"、"串珠"、"五目"、"五目碰"、"五格"等多种称谓。其规则简单，在15*15的棋盘上黑棋先行，其中一方有五枚棋子连成一线即可获胜（这里不考虑专业比赛中的禁手等规则）。不过在很多情况下，当一方出现“活

Problem DescriptionThe Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.N