摘要：
Secrete Master Plan Secrete Master Plan Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status Master Mind Kong 阅读全文
posted @ 2016-04-23 19:55
Ritchie丶
阅读(260)
评论(0)
推荐(0)
摘要：
小兔的棋盘 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8819 Accepted Submission(s): 4595 Problem D 阅读全文
posted @ 2016-04-23 19:43
Ritchie丶
阅读(145)
评论(0)
推荐(0)
摘要：
折线分割平面 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24505 Accepted Submission(s): 16644 Proble 阅读全文
posted @ 2016-04-23 19:41
Ritchie丶
阅读(462)
评论(0)
推荐(0)
摘要：
小数化分数2 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4278 Accepted Submission(s): 1725 Problem 阅读全文
posted @ 2016-04-23 19:28
Ritchie丶
阅读(197)
评论(0)
推荐(0)
摘要：
ACboy needs your help Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5963 Accepted Submission(s) 阅读全文
posted @ 2016-04-23 19:27
Ritchie丶
阅读(250)
评论(0)
推荐(0)
摘要：
http://www.cnblogs.com/Yu2012/archive/2011/10/09/2199156.html 阅读全文
posted @ 2016-04-23 19:26
Ritchie丶
阅读(203)
评论(0)
推荐(0)
摘要：
Children’s Queue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13333 Accepted Submission(s): 43 阅读全文
posted @ 2016-04-23 19:25
Ritchie丶
阅读(460)
评论(0)
推荐(0)
摘要：
找新朋友 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10401 Accepted Submission(s): 5493 Problem D 阅读全文
posted @ 2016-04-23 19:23
Ritchie丶
阅读(470)
评论(0)
推荐(0)
摘要：
题目链接 题意：给定m个H和n个D(1<=n,m<=20)，问这些字母构成的序列中，对于任意位置，从左开始数H的累积个数总是不比D的累计数少的排列有多少种。 题解：二维DP，画一个正方形，从左上角到右下角画一条线，右上方区域就是我们所要求的。另外注意这个题的输入顺序是先输入m再输入n。 虽然知道深搜 阅读全文
posted @ 2016-04-23 19:22
Ritchie丶
阅读(400)
评论(0)
推荐(0)
摘要：
Hat's Fibonacci Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10568 Accepted Submission(s): 350 阅读全文
posted @ 2016-04-23 19:20
Ritchie丶
阅读(436)
评论(0)
推荐(0)
摘要：
How Many Trees? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3397 Accepted Submission(s): 1964 阅读全文
posted @ 2016-04-23 19:19
Ritchie丶
阅读(207)
评论(0)
推荐(0)
摘要：
FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62898 Accepted Submission(s): 212 阅读全文
posted @ 2016-04-23 19:17
Ritchie丶
阅读(488)
评论(0)
推荐(0)
摘要：
Number Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 147161 Accepted Submission(s): 35 阅读全文
posted @ 2016-04-23 19:15
Ritchie丶
阅读(192)
评论(0)
推荐(0)
摘要：
Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 102132 Accepted Submission(s 阅读全文
posted @ 2016-04-23 19:14
Ritchie丶
阅读(187)
评论(0)
推荐(0)
摘要：
Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 206582 Accepted Submission(s): 48294 Prob 阅读全文
posted @ 2016-04-23 19:13
Ritchie丶
阅读(233)
评论(0)
推荐(0)
摘要：
The area Problem Description Ignatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and 阅读全文
posted @ 2016-04-23 19:09
Ritchie丶
阅读(285)
评论(0)
推荐(0)
摘要：
Prison Transfer Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The prison of your city has n priso 阅读全文
posted @ 2016-04-23 18:55
Ritchie丶
阅读(205)
评论(0)
推荐(0)
摘要：
Police Recruits Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The police department of your city 阅读全文
posted @ 2016-04-23 18:51
Ritchie丶
阅读(336)
评论(0)
推荐(0)
摘要：
Sereja and Mirroring Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Let's assume that we are given 阅读全文
posted @ 2016-04-23 18:46
Ritchie丶
阅读(237)
评论(0)
推荐(0)
摘要：
Sereja and Mugs Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Sereja showed an interesting game t 阅读全文
posted @ 2016-04-23 18:44
Ritchie丶
阅读(270)
评论(0)
推荐(0)
摘要：
Magic Formulas Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description People in the Tomskaya region like m 阅读全文
posted @ 2016-04-23 18:40
Ritchie丶
阅读(322)
评论(0)
推荐(0)
摘要：
Megacity Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The administration of the Tomsk Region fir 阅读全文
posted @ 2016-04-23 18:37
Ritchie丶
阅读(256)
评论(0)
推荐(0)
摘要：
Squats Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Pasha has many hamsters and he makes them wo 阅读全文
posted @ 2016-04-23 18:36
Ritchie丶
阅读(338)
评论(0)
推荐(0)
摘要：
描述：关于辗转相除法的具体实现在这里就不具体说明了，本文要记录的是辗转相除法应用于求最大公约数的算法证明过程。 假设： 求m和n的最大公约数。a,b分别是m除以n的商和余数，即m=na+b。gcd(m,n)表示m和n的最大公约数。 求证：gcd(m,n)=gcd(n,b) 证明： 设c=gcd(m, 阅读全文
posted @ 2016-04-23 18:11
Ritchie丶
阅读(514)
评论(0)
推荐(0)
摘要：
Start Up Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Recently, a start up by two students of a 阅读全文
posted @ 2016-04-23 18:09
Ritchie丶
阅读(267)
评论(0)
推荐(0)
摘要：
Square Table Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description While resting on the ship after the "R 阅读全文
posted @ 2016-04-23 18:05
Ritchie丶
阅读(283)
评论(0)
推荐(0)
摘要：
Crash Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description During the "Russian Code Cup" programming com 阅读全文
posted @ 2016-04-23 18:03
Ritchie丶
阅读(252)
评论(0)
推荐(0)
摘要：
Elimination Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The finalists of the "Russian Code Cup" 阅读全文
posted @ 2016-04-23 18:02
Ritchie丶
阅读(320)
评论(0)
推荐(0)
摘要：
Guess a number! Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description A TV show called "Guess a number!" 阅读全文
posted @ 2016-04-23 18:01
Ritchie丶
阅读(313)
评论(0)
推荐(0)
摘要：
Triangle Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description There is a right triangle with legs of len 阅读全文
posted @ 2016-04-23 17:59
Ritchie丶
阅读(220)
评论(0)
推荐(0)
摘要：
Unusual Product Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Little Chris is a huge fan of linea 阅读全文
posted @ 2016-04-23 17:57
Ritchie丶
阅读(205)
评论(0)
推荐(0)
摘要：
Gravity Flip Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Little Chris is bored during his physi 阅读全文
posted @ 2016-04-23 17:04
Ritchie丶
阅读(246)
评论(0)
推荐(0)
摘要：
Marathon Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Valera takes part in the Berland Marathon. 阅读全文
posted @ 2016-04-23 17:03
Ritchie丶
阅读(261)
评论(0)
推荐(0)
摘要：
Valera and X Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Valera is a little boy. Yesterday he g 阅读全文
posted @ 2016-04-23 16:59
Ritchie丶
阅读(200)
评论(0)
推荐(0)
摘要：
Inna and Alarm Clock Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Inna loves sleeping very much, 阅读全文
posted @ 2016-04-23 16:55
Ritchie丶
阅读(308)
评论(0)
推荐(0)
摘要：
Fox and Cross Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Fox Ciel has a board with n rows and 阅读全文
posted @ 2016-04-23 16:50
Ritchie丶
阅读(241)
评论(0)
推荐(0)
摘要：
Fox and Number Game Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Fox Ciel is playing a game with 阅读全文
posted @ 2016-04-23 16:47
Ritchie丶
阅读(306)
评论(0)
推荐(0)
摘要：
Football Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description One day, at the "Russian Code Cup" event i 阅读全文
posted @ 2016-04-23 16:43
Ritchie丶
阅读(235)
评论(0)
推荐(0)
摘要：
//求一个集合的子集 #include using namespace std; int main() { int n=4; int a[4]={15,20,25,30}; for(int i=0;i<(1<<n);i++) { printf("%d: ",i); for(int j=0;j<n;j++) {... 阅读全文
posted @ 2016-04-23 16:05
Ritchie丶
阅读(215)
评论(0)
推荐(0)
摘要：
贪心法所不能解决的01背包问题即不可分割的问题01背包问题是 考虑整体最优解 贪心策略适用的前提是：局部最优策略能导致产生全局最优解。 例题分析编辑例题1、[0-1背包问题]有一个背包，背包容量是M=150。有7个物品，物品不可以分割成任意大小。要求尽可能让装入背包中的物品总价值最大，但不能超过总容 阅读全文
posted @ 2016-04-23 15:26
Ritchie丶
阅读(3992)
评论(0)
推荐(1)
浙公网安备 33010602011771号