ACM,再见！

http://poj.org/problem?id=3278DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a numbe

http://codeforces.com/problemset/problem/19/COnce Bob saw a string. It contained so many different letters, that the letters were marked by numbers, but at the same time each letter

http://codeforces.com/problemset/problem/29/CDescriptionOne day Bob got a letter in an envelope. Bob knows that when Berland's post officers send a letter directly from city «A» to city «B

http://acm.hdu.edu.cn/showproblem.php?pid=4821Problem DescriptionGiven a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if  (i) It is of l

http://codeforces.com/problemset/problem/527/CC. Glass Carvingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outp

http://acm.hdu.edu.cn/showproblem.php?pid=4268Problem DescriptionAlice and Bob's game never ends. Today, they introduce a new game. In this game, both of them have N different rectangular ca

http://acm.hdu.edu.cn/showproblem.php?pid=4400Problem DescriptionTerrorists put some mines in a crowded square recently. The police evacuate all people in time before any mine explodes. Now

http://acm.hdu.edu.cn/showproblem.php?pid=4277Problem DescriptionLike everyone, cows enjoy variety. Their current fancy is new shapes for pastures. The old rectangular shapes are out of

http://acm.hdu.edu.cn/showproblem.php?pid=5288Problem DescriptionOO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy ai mod aj=0,now OO want to k

http://codeforces.com/problemset/problem/19/DDescriptionPete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows:

http://acm.hdu.edu.cn/showproblem.php?pid=4339Problem DescriptionYou are given two strings s1[0..l1], s2[0..l2] and Q - number of queries.Your task is to answer next queries:  1) 1 a i c

http://acm.hdu.edu.cn/showproblem.php?pid=3973Problem DescriptionYou are given some words {Wi}. Then our stupid AC will give you a very long string S. AC is stupid and always wants to know w

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3148Problem KK Smallest SumsYou're given k arrays, each array has k integers. There are kk 

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3142

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1136

http://codeforces.com/problemset/problem/244/BB. Undoubtedly Lucky Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputs

http://poj.org/problem?id=2431DescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run ov

http://acm.hdu.edu.cn/showproblem.php?pid=1004Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is

http://acm.hdu.edu.cn/showproblem.php?pid=2648Problem DescriptionEvery girl likes shopping,so does dandelion.Now she finds the shop is increasing the price every day because the Spring Festi

http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=10611&courseid=0Problem description  　　最近，一位老木匠遇到了一件非常棘手的问题。他需要将一根非常长的木棒切成N段。每段的长度分别为L1,L2,…,LN（ 1≤L1,L2,…,LN≤1000，且均为整数）个长度

该函数在头文件zho

http://codeforces.com/problemset/problem/12/CC. Fruitstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

http://vjudge.net/contest/view.action?cid=51408#problem/CDescriptionYou live in the universe X where all the physical laws and constants are different from ours. For example all of the

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3146

题目大意：有n个人，每个

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5635The bored Bob is playing a number game. In the beginning, there are n numbers. For each turn, Bob will take out two numbers from the