04 2016 档案
摘要:2.1 2.6 -2.1 -2.6floor : 不大于自变量的最大整数 2 2 -3 -3ceil :不小于自变量的最大整数 3 3 -2 -2round:四舍五入到最邻近的整数 2 3 -2 -3需包含头文件<math.h> round可以自己写 double round(double r){
阅读全文
摘要:D - Joyful Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status D - Joyful Submit Status Description Sakura has a very m
阅读全文
摘要:G - Football Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status G - Football Submit Status Description Consider a sing
阅读全文
摘要:今天加群遇到了这个问题,百度有在线分解质因数的计算器,附上网址。http://www.atool.org/quality_factor.php? 但是,一个ACMer要会利用百度,而不是依赖百度,这种简单的代码,自己也可以轻松搞定。
阅读全文
摘要:F - Scout YYF I Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status F - Scout YYF I Submit Status Description YYF is a
阅读全文
摘要:E - The Arrow Time Limit:1000MS Memory Limit:64000KB 64bit IO Format:%lld & %llu Submit Status E - The Arrow Submit Status Description The history sho
阅读全文
摘要:Trouble Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5681 Accepted Submission(s): 1570 Proble
阅读全文
摘要:A - Arcane Numbers 1 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4320 A - Arcane Numbers 1 Submit
阅读全文
摘要:A - Hero Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4310 A - Hero Submit Status Practice HDU 4310
阅读全文
摘要:R(N) Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2761 Accepted Submission(s): 1420 Problem De
阅读全文
摘要:YY's new problem Time Limit: 12000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5422 Accepted Submission(s): 15
阅读全文
摘要:sSN LMDscandata 1 1 B98C27 0 0 85C0 85C3 F55D73C5 F55DCC81 0 0 7 0 0 1388 168 0 1 DIST1 3F800000 00000000 DBBA0 1388 B5 136C 1373 136B 1389 1398 1356
阅读全文
摘要:Secrete Master Plan Secrete Master Plan Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status Master Mind Kong
阅读全文
摘要:小兔的棋盘 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8819 Accepted Submission(s): 4595 Problem D
阅读全文
摘要:折线分割平面 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24505 Accepted Submission(s): 16644 Proble
阅读全文
摘要:小数化分数2 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4278 Accepted Submission(s): 1725 Problem
阅读全文
摘要: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)
阅读全文
摘要:http://www.cnblogs.com/Yu2012/archive/2011/10/09/2199156.html
阅读全文
摘要: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
阅读全文
摘要:找新朋友 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10401 Accepted Submission(s): 5493 Problem D
阅读全文
摘要:题目链接 题意:给定m个H和n个D(1<=n,m<=20),问这些字母构成的序列中,对于任意位置,从左开始数H的累积个数总是不比D的累计数少的排列有多少种。 题解:二维DP,画一个正方形,从左上角到右下角画一条线,右上方区域就是我们所要求的。另外注意这个题的输入顺序是先输入m再输入n。 虽然知道深搜
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文
摘要:FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62898 Accepted Submission(s): 212
阅读全文
摘要:Number Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 147161 Accepted Submission(s): 35
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文
摘要:Prison Transfer Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The prison of your city has n priso
阅读全文
摘要:Police Recruits Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The police department of your city
阅读全文
摘要:Sereja and Mirroring Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Let's assume that we are given
阅读全文
摘要:Sereja and Mugs Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Sereja showed an interesting game t
阅读全文
摘要:Magic Formulas Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description People in the Tomskaya region like m
阅读全文
摘要:Megacity Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The administration of the Tomsk Region fir
阅读全文
摘要:Squats Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Pasha has many hamsters and he makes them wo
阅读全文
摘要:描述:关于辗转相除法的具体实现在这里就不具体说明了,本文要记录的是辗转相除法应用于求最大公约数的算法证明过程。 假设: 求m和n的最大公约数。a,b分别是m除以n的商和余数,即m=na+b。gcd(m,n)表示m和n的最大公约数。 求证:gcd(m,n)=gcd(n,b) 证明: 设c=gcd(m,
阅读全文
摘要: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
阅读全文
摘要:Square Table Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description While resting on the ship after the "R
阅读全文
摘要:Crash Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description During the "Russian Code Cup" programming com
阅读全文
摘要:Elimination Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description The finalists of the "Russian Code Cup"
阅读全文
摘要:Guess a number! Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description A TV show called "Guess a number!"
阅读全文
摘要:Triangle Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description There is a right triangle with legs of len
阅读全文
摘要:Unusual Product Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Little Chris is a huge fan of linea
阅读全文
摘要:Gravity Flip Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Little Chris is bored during his physi
阅读全文
摘要:Marathon Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Valera takes part in the Berland Marathon.
阅读全文
摘要: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
阅读全文
摘要:Inna and Alarm Clock Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Inna loves sleeping very much,
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文
摘要:Football Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description One day, at the "Russian Code Cup" event i
阅读全文
摘要://求一个集合的子集 #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++) {...
阅读全文
摘要:贪心法所不能解决的01背包问题即不可分割的问题01背包问题是 考虑整体最优解 贪心策略适用的前提是:局部最优策略能导致产生全局最优解。 例题分析编辑例题1、[0-1背包问题]有一个背包,背包容量是M=150。有7个物品,物品不可以分割成任意大小。要求尽可能让装入背包中的物品总价值最大,但不能超过总容
阅读全文
摘要:表哥的面包 表哥的面包 Problem:1142 Time Limit:1000ms Memory Limit:65535K Description 可爱的表哥遇到了一个问题,有一个长为N(1≤N≤10^18)的长条状面包,问最多可以切成几段,使得每段面包的长度互不相等且均不能围成三角形。 Inpu
阅读全文
摘要:特殊的质数 特殊的质数 Problem:1151 Time Limit:1000ms Memory Limit:65535K Description 如果一个数是质数,而且他在质数表中的编号也是质数,称为特殊的质数。比如质数表中第7个质数是17,因为7和17都是质数,所以我们称17是特殊的质数;比如
阅读全文
摘要:又见a+b 又见a+b Problem:1146 Time Limit:1000ms Memory Limit:65535K Description 给定两个非负整数A,B,求他们的和。 Input 多组输入,每组输入两个非负整数A和B(0<=A,B<10^3000),可能会有前缀0,但保证总长度不
阅读全文
摘要:C - Crazy Calendar Time Limit:4000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1393 C - Crazy Calendar Submit St
阅读全文
摘要:这题没名字 这题没名字 Problem:I Time Limit:2000ms Memory Limit:65535K Problem:I Time Limit:2000ms Memory Limit:65535K Problem:I Problem:I Time Limit:2000ms Time
阅读全文
摘要:Function1 Function1 Problem:F Time Limit:1000ms Memory Limit:65535K Problem:F Time Limit:1000ms Memory Limit:65535K Problem:F Problem:F Time Limit:100
阅读全文
摘要:HK HK Problem:B Time Limit:2000ms Memory Limit:65535K Problem:B Time Limit:2000ms Memory Limit:65535K Problem:B Problem:B Time Limit:2000ms Time Limit
阅读全文
摘要:D - Partitioning Game Time Limit:4000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status D - Partitioning Game Submit Status Description
阅读全文
摘要:G - Game of Hyper Knights Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status G - Game of Hyper Knights Submit Status Des
阅读全文
摘要:F - Again Stone Game Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status F - Again Stone Game Submit Status Description A
阅读全文
摘要:A - Matrix Game Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status A - Matrix Game Submit Status Description Given an m
阅读全文
摘要:LightOJ1253 :Misere Nim LightOJ1253 :Misere Nim 时间限制:1000MS 内存限制:32768KByte 64位IO格式:%lld & %llu 描述 Alice and Bob are playing game of Misère Nim. Misèr
阅读全文
摘要:尼姆博奕(Nimm Game):有三堆各若干个物品,两个人轮流从某一堆取任意多的物品,规定每次至少取一个,多者不限,最后取光者得胜。 这种情况最有意思,它与二进制有密切关系,我们用(a,b,c)表示某种局势,首先(0,0,0)显然是奇异局势,无论谁面对奇异局势,都必然失败。第二种奇异局势是(0,n,
阅读全文
摘要:假设有两个物品 第一个物品 w=2 v=1 第二个物品 w=2 v=2在将背包由二维转化为一维进行优化的时候如果正常逆序进行dpdp[1][4]=1; dp[1][2]=1; dp[2][4]=max(dp[1][4],dp[1][4-2]+2)=3; dp[2][2]=2;这是正确做法但是如果正序
阅读全文
摘要:G - Coprime Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 5072 G - Coprime Submit Status Practice H
阅读全文
摘要:E - The Boss on Mars Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4059 E - The Boss on Mars Submit
阅读全文
摘要:B - Sky Code Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 3904 B - Sky Code Submit Status Practice
阅读全文
摘要:Trouble Time Limit: 5000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description Hassan is in trouble. His mathematics teache
阅读全文
摘要:The Sports Association of Bangladesh is in great problem with their latest lottery `Jodi laiga Jai'. Thereare so many participants this time that they
阅读全文
摘要:H - Visible Trees Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 2841 H - Visible Trees Submit Status
阅读全文
摘要:In most professional sporting events, cheerleaders play a major role in entertaining the spectators. Theirroles are substantial during breaks and prio
阅读全文
摘要:F - GCD Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1695 F - GCD Submit Status Practice HDU 1695 D
阅读全文

浙公网安备 33010602011771号