心向往之！！

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 2140    Accepted Submission(s): 925Special JudgeProblem DescriptionChiaki has 3n points p...

Problem DescriptionLittle Q likes solving math problems very much. Unluckily, however, he does not have good spatial ability. Everytime he meets a 3D geometry problem, he will struggle to draw a pic...

 Problem DescriptionLittle Q and Little T are playing a game on a tree. There are n vertices on the tree, labeled by 1,2,...,n, connected by n−1 bidirectional edges. The i-th vertex has the value of...

Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 71737   Accepted: 23963 DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as p...

 Problem DescriptionEdward is a worker for Aluminum Cyclic Machinery. His work is operating mechanical arms to cut out designed models. Here is a brief introduction of his work.Assume the operating...

题目链接：http://poj.org/problem?id=3279FliptileTime Limit: 2000MS   Memory Limit: 65536K Total Submissions: 16162   Accepted: 5903 DescriptionFarmer John knows that an intellectual...

Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with som...

 Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more dif...

Time ZoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5204    Accepted Submission(s): 878Problem DescriptionChiaki often participates ...

Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S<101）毫升　(正好装满一瓶) ，它们三个之间可以相互倒可乐 (都是...

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3336    Accepted Submission(s): 523Problem DescriptionChiaki has an array of n positive int...

Problem DescriptionGiven an integer n, Chiaki would like to find three positive integers x, y and z such that: n=x+y+z, x∣n, y∣n, z∣n and xyz is maximum.InputThere are multiple test cases. The f...

 思路很简单， 求逆序数然后乘上x， y里面较大的那个，但是一开始只会暴力求法。。。队友写了并归然后赛后也学了并归算法，嗯感觉有一点二分的意思，据dalao说还有树状数组的方法，看了看博客还是不大懂。。。跟二进制有关就容易晕。。。要继续加油啊。Problem DescriptionLong long ago, there was an integer sequence a.Tonyfan...

 在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 , k <= ...

 Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home is at the c...

DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit...