Determined&Diligent的专栏

DescriptionA sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal leng

DescriptionYou have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we w

Problem DescriptionIn the German Lotto you have to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn't increase your chance of winning - is to select

Genealogical treeSpecial JudgeProblem DescriptionThe system of Martians' blood relations is confusing enough. Actually, Martians bud when they want and where they want. They gather t

http://poj.org/problem?id=3259DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that

DescriptionAn 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 falls off it. When two ant

http://poj.org/problem?id=2031DescriptionYou are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write

http://bailian.openjudge.cn/practice/2746/2746:约瑟夫问题查看提交统计提示提问总时间限制: 1000ms 内存限制: 65536kB描述约瑟夫问题：有ｎ只猴子，按顺时针方向围成一圈选大王（编号从１到ｎ），从第１号开始报数，一直数到ｍ，数到ｍ的猴子退出圈外，剩下的猴子再接着从1开始报数。就这样，

http://poj.org/problem?id=2244Eeny Meeny MooTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3336 Accepted: 2312DescriptionSurely you have made

http://poj.org/problem?id=2229DescriptionFarmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer

http://poj.org/problem?id=3187Backward Digit SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5684 Accepted: 3293DescriptionFJ and his

http://poj.org/problem?id=3061SubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10903 Accepted: 4513DescriptionA sequence of N positi

http://poj.org/problem?id=2229SumsetsTime Limit: 2000MS Memory Limit: 200000KTotal Submissions: 15492 Accepted: 6165DescriptionFarmer John commanded his

DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best s

Problem DescriptionGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1],

DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer len

DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponenti

http://poj.org/problem?id=1995DescriptionPeople are different. Some secretly read magazines full of interesting girls' pictures, others create an A-bomb in their cellar, others like usin

描述 Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on t

http://poj.org/problem?id=2506DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles? Here is a sample tiling of a 2x17 rectangle. InputInput is a seq

Problem DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determ

DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the sa

#include #include using namespace std;int main(){ int a[30005],i,j,n,m; while(scanf("%d%d",&n,&m)!=EOF) { priority_queue , less > p; //大的先 priority_queue , greater >q;//

DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It wa

DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing ea

DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this probl

http://poj.org/problem?id=1988DescriptionFarmer John and Betsy are playing a game with N (1 moves and counts. * In a move operation, Farmer John asks Bessie to move the stack containing

DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already con

http://poj.org/problem?id=2653Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 11638 Accepted: 4390DescriptionStan has n sticks o