摘要： Problem Description Let A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a given number 阅读全文

摘要： Problem Description Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let 阅读全文

摘要： Problem Description You are given N baskets of gold coins. The baskets are numbered from 1 to N. In all except one of the baskets, each gold coin weig 阅读全文

摘要： Problem Description You have a sequence {a1,a2,...,an} and you can delete a contiguous subsequence of length m. So what is the minimum number of inver 阅读全文

摘要： Description zstu的萌新们准备去自助旅行，他们租了一辆吉普车，然后选择了n个城市作为游览地点。然后他们惊喜的发现他们选择的城市刚好绕城一个环。 也就是说如果给所有城市按照0,1,2,……,n-1编号，0号城市和n-1号城市是相邻的，并且只能从i号城市去(i+1)%n号城市。 已知每个城 阅读全文

摘要： Description KI十分喜欢美丽而优雅的斐波那契数列,最近他新认识了一种斐波那契字符串,定义如下 f (0) = b, f (1) = a, f (2) = f (1) + f (0) = ab, f (3) = f (2) + f (1) = aba, f (4) = f (3) + f 阅读全文

摘要： Description 农夫有一个长满草的（x0, y0）为圆心，r为半径的圆形牛栏，他要将一头牛栓在坐标（x1, y1）栏桩上，但只让牛吃到一半草，问栓牛鼻的绳子应为多长？ 农夫有一个长满草的（x0, y0）为圆心，r为半径的圆形牛栏，他要将一头牛栓在坐标（x1, y1）栏桩上，但只让牛吃到一半草 阅读全文

摘要： Problem Description Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met 阅读全文

摘要： Problem Description Peter has a sequence a1,a2,...,an and he define a function on the sequence -- F(a1,a2,...,an)=(f1,f2,...,fn), where fi is the leng 阅读全文

摘要： Problem Description P is a permutation of the integers from 1 to N(index starting from 1).Here is the code of Bubble Sort in C++. for(int i=1;i<=N;++i 阅读全文