2015年01月_AndreaQ

原创 poj 1306 combinations

Combinations Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8745 Accepted: 4064 Description Computing the exact number of ways that N things can be taken M

2015-01-30 15:52:06 748

原创数塔问题

数塔 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 24591 Accepted Submission(s): 14793 Problem Description 在讲述DP算法的时候，一个经典的例子就是数塔问

2015-01-28 17:10:36 969

原创求最小公倍数跟最大公约数问题

求最大公约数（辗转相除法）设a=qb+r,其中，a,b,q,r都是整数，则 gcd(a,b)=gcd(b,r) int gcd(int a, int b) { int x,y,r; x = max(a,b); y = min(a,b); r = x%y; while(r) { x = y;

2015-01-16 14:55:10 634

原创埃拉托斯特尼(Eratosthene)筛法

下面是代码： /* 功能：将1-n的素数输出使用了埃拉托斯特尼(Eratosthene)筛法 */ #include #include using namespace std; int prime[10000000];//存放需要筛选数 int sieve (int *prime,int n,int k)//n是1-n这个范围，k是当前把prime[k]作为筛

2015-01-16 11:22:51 2521

转载 ACM中国国家集训队论文集目录(1999-2009)

国家集训队1999论文集陈宏：《数据结构的选择与算法效率——从IOI98试题PICTURE谈起》来煜坤：《把握本质，灵活运用——动态规划的深入探讨》齐鑫：《搜索方法中的剪枝优化》邵铮：《数学模型的建立、比较和应用》石润婷：《隐蔽化、多维化、开放化——论当今信息学竞赛中数学建模的灵活性》杨帆：《准确性、全面性、美观性——测试数据设计中的三要素》周咏基：《论随机化算法的

2015-01-13 10:31:24 886

原创 codeforces Vasya and Basketball

Description Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 point

2015-01-11 19:55:33 786

原创 codeforces Vanya and Lanterns

Vanya and Lanterns Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the

2015-01-09 21:53:30 763

原创分治练习之Ultra-QuickSort

Ultra-QuickSort Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence eleme

2015-01-09 21:13:26 829 1

wan1314mum的专栏