10 2014 档案

2013 Asia Regional Changchun C
摘要：Little Tiger vs. Deep MonkeyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 960Accepted Submission... 阅读全文
posted @ 2014-10-21 22:04 haohaooo 阅读(203) 评论(0) 推荐(0)
hdu 4481 Time travel(高斯求期望)(转)
摘要：(转)http://blog.csdn.net/u013081425/article/details/39240021http://acm.hdu.edu.cn/showproblem.php?pid=4418读了一遍题后大体明白意思，但有些细节不太确定。就是当它处在i点处，它有1~m步可以走，但他... 阅读全文
posted @ 2014-10-20 22:40 haohaooo 阅读(218) 评论(0) 推荐(0)
hdu4405 Aeroplane chess
摘要：Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1597Accepted Submission(s): 1088Pro... 阅读全文
posted @ 2014-10-20 17:52 haohaooo 阅读(183) 评论(0) 推荐(0)
ZOJ Problem Set - 3329(概率DP)
摘要：One Person GameTime Limit: 1 Second Memory Limit: 32768 KB Special JudgeThere is a very simple and interesting one-person game. You have 3 dice, nam... 阅读全文
posted @ 2014-10-20 17:28 haohaooo 阅读(211) 评论(0) 推荐(0)
hdu 4946 2014 Multi-University Training Contest 8
摘要：Area of MushroomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2390Accepted Submission(s): 578Pro... 阅读全文
posted @ 2014-10-20 13:01 haohaooo 阅读(209) 评论(0) 推荐(0)
2012Chhengdu K - Yet Another Multiple Problem
摘要：K -Yet Another Multiple ProblemTime Limit:20000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4474Appoint description:Desc... 阅读全文
posted @ 2014-10-20 12:44 haohaooo 阅读(179) 评论(0) 推荐(0)
STL
摘要：STLqsortintcompare(constvoid*arg1,constvoid*arg2){ return(*(int*)arg1*(int*)arg2)?1:0;}这是一个和STL没有丝毫关系的传统风格的C++程序。因为程序的注释已经很详尽了，所以不需要我再做更多的解释。总的说来，这个程序... 阅读全文
posted @ 2014-10-19 19:58 haohaooo 阅读(139) 评论(0) 推荐(0)
codeforces 459E
摘要：codeforces 459EE. Pashmak and Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPashmak's home... 阅读全文
posted @ 2014-10-19 19:58 haohaooo 阅读(388) 评论(0) 推荐(0)
向量
摘要：向量a(x1，y1，z1)，b(x2，y2，z2)数量积(点积，内积)：a.b = x1x2+y1y2+z1z2 等于一个数值（标量）；向量积(叉积)： a×b =|e1 e2 e3||x1 y1 z1|（1）|x2 y2 z2|e1、e2、e3为OXYZ坐标系轴的三个单位向量。向量积用一... 阅读全文
posted @ 2014-10-19 19:57 haohaooo 阅读(200) 评论(0) 推荐(0)
Bestcoder#5 1002
摘要：Bestcoder#5 1002Poor MitsuiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 336 Accepted Submissi... 阅读全文
posted @ 2014-10-19 19:56 haohaooo 阅读(173) 评论(0) 推荐(0)
Bestcoder#5 1003
摘要：Bestcoder#5 1003Poor RukawTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24 Accepted Submission... 阅读全文
posted @ 2014-10-19 19:54 haohaooo 阅读(206) 评论(0) 推荐(0)
2012 Multi-University Training Contest 9 / hdu4389
摘要：2012 Multi-University Training Contest 9 / hdu4389打巨表，实为数位dp 还不太懂先这样放着。。对于打表，当然我们不能直接打，这里有技巧。我们可以这样：每隔100000我们统计一次，这样在10^9范围内，我们得到10000个数。然后就很好解决了。。。数... 阅读全文
posted @ 2014-10-19 19:52 haohaooo 阅读(388) 评论(0) 推荐(0)
和积式
摘要：和积式http://baike.baidu.com/view/8212164.htm 阅读全文
posted @ 2014-10-19 19:50 haohaooo 阅读(281) 评论(0) 推荐(0)
CF memsql Start[c]UP 2.0 A
摘要：CF memsql Start[c]UP 2.0 AA. Golden Systemtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPiegirl... 阅读全文
posted @ 2014-10-19 19:49 haohaooo 阅读(225) 评论(0) 推荐(0)
CF memsql Start[c]UP 2.0 B
摘要：CF memsql Start[c]UP 2.0 BB. Distributed Jointime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPieg... 阅读全文
posted @ 2014-10-19 19:47 haohaooo 阅读(223) 评论(0) 推荐(0)
Codeforces #261 D
摘要：Codeforces #261 DD. Pashmak and Parmida's problemtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outpu... 阅读全文
posted @ 2014-10-19 19:46 haohaooo 阅读(231) 评论(0) 推荐(0)
2014 Multi-University Training Contest 9#1009
摘要：Just a JokeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 288 Accepted Submission(s): 111Prob... 阅读全文
posted @ 2014-10-19 19:44 haohaooo 阅读(178) 评论(0) 推荐(0)
ACM 计算几何中的精度问题（转）
摘要：http://www.cnblogs.com/acsmile/archive/2011/05/09/2040918.html计算几何头疼的地方一般在于代码量大和精度问题，代码量问题只要平时注意积累模板一般就不成问题了。精度问题则不好说，有时候一个精度问题就可能成为一道题的瓶颈，简直“画龙点睛”。这些... 阅读全文
posted @ 2014-10-19 19:43 haohaooo 阅读(648) 评论(0) 推荐(0)
2014 Multi-University Training Contest 9#11
摘要：2014 Multi-University Training Contest 9#11Killing MonstersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Sub... 阅读全文
posted @ 2014-10-19 19:41 haohaooo 阅读(155) 评论(0) 推荐(0)
2014 Multi-University Training Contest 9#6
摘要：2014 Multi-University Training Contest 9#6Fast Matrix CalculationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Tot... 阅读全文
posted @ 2014-10-19 19:40 haohaooo 阅读(154) 评论(0) 推荐(0)
Codeforces#262_1002
摘要：Codeforces#262_1002B. Little Dima and Equationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLit... 阅读全文
posted @ 2014-10-19 19:38 haohaooo 阅读(149) 评论(0) 推荐(0)
Codeforces Round #262 (Div. 2) 1003
摘要：Codeforces Round #262 (Div. 2) 1003C. Presenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLit... 阅读全文
posted @ 2014-10-19 19:36 haohaooo 阅读(235) 评论(0) 推荐(0)
Codeforces Round #262 (Div. 2) 1004
摘要：Codeforces Round #262 (Div. 2) 1004D. Little Victor and Settime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstand... 阅读全文
posted @ 2014-10-19 19:34 haohaooo 阅读(200) 评论(0) 推荐(0)
CF#138 div 1 A. Bracket Sequence
摘要：【#138 div 1A. Bracket Sequence】【原题】A. Bracket Sequencetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard ... 阅读全文
posted @ 2014-10-19 19:31 haohaooo 阅读(349) 评论(0) 推荐(0)
soj杂题
摘要：unique()函数是一个去重函数，STL中unique的函数 unique的功能是去除相邻的重复元素(只保留一个),还有一个容易忽视的特性是它并不真正把重复的元素删除。他是c++中的函数，所以头文件要加#include，具体用法如下： int num[100]; unique(num,mun+n)... 阅读全文
posted @ 2014-10-19 19:27 haohaooo 阅读(133) 评论(0) 推荐(0)
soj 2013年 Nanjing Slection
摘要：这样加边比STL快！不明白为什么要+mod 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #define INF 0x3f3f3f3f 8 #define M(a,b) memset(a,b,sizeof(a)... 阅读全文
posted @ 2014-10-19 19:25 haohaooo 阅读(108) 评论(0) 推荐(0)
Codeforces Round #270 1003
摘要：Codeforces Round #270 1003C. Design Tutorial: Make It Nondeterministictime limit per test2 secondsmemory limit per test256 megabytesinputstandard inpu... 阅读全文
posted @ 2014-10-19 19:22 haohaooo 阅读(167) 评论(0) 推荐(0)
Codeforces Round #270 1002
摘要：Codeforces Round #270 1002B. Design Tutorial: Learn from Lifetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputsta... 阅读全文
posted @ 2014-10-19 19:15 haohaooo 阅读(146) 评论(0) 推荐(0)
Codeforces Round #270 1001
摘要：Codeforces Round #270 1001A. Design Tutorial: Learn from Mathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputsta... 阅读全文
posted @ 2014-10-19 19:13 haohaooo 阅读(171) 评论(0) 推荐(0)
Codeforces #270 D. Design Tutorial: Inverse the Problem
摘要：http://codeforces.com/contest/472/problem/DD. Design Tutorial: Inverse the Problemtime limit per test2 secondsmemory limit per test256 megabytesinputs... 阅读全文
posted @ 2014-10-19 19:11 haohaooo 阅读(274) 评论(0) 推荐(0)
Shanghai Regional Online Contest 1004
摘要：Shanghai Regional Online Contest 1004In the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are g... 阅读全文
posted @ 2014-10-19 18:52 haohaooo 阅读(188) 评论(0) 推荐(0)
2012Chengdu B （快速组合数）
摘要：B -CandyTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4465Appoint description:DescriptionLazyChild is a la... 阅读全文
posted @ 2014-10-19 17:51 haohaooo 阅读(175) 评论(0) 推荐(0)
poj 3744 Scout YYF I(概率dp，矩阵优化)
摘要：Scout YYF ITime Limit:1000MSMemory Limit:65536KTotal Submissions:5020Accepted:1355DescriptionYYF is a couragous scout. Now he is on a dangerous missio... 阅读全文
posted @ 2014-10-14 22:47 haohaooo 阅读(155) 评论(0) 推荐(0)
2014牡丹江K Known Notation
摘要：Known NotationTime Limit: 2 Seconds Memory Limit: 65536 KBDo you know reverse Polish notation (RPN)? It is a known notation in the area of mathematic... 阅读全文
posted @ 2014-10-14 19:55 haohaooo 阅读(166) 评论(0) 推荐(0)
2014牡丹江D Domination
摘要：DominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special JudgeEdward is the headmaster of Marjar University. He is enthusiastic about chess a... 阅读全文
posted @ 2014-10-14 19:46 haohaooo 阅读(200) 评论(0) 推荐(0)
2013长沙邀请赛A So Easy!(矩阵快速幂，共轭)
摘要：So Easy!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2286Accepted Submission(s): 710Problem Des... 阅读全文
posted @ 2014-10-11 23:13 haohaooo 阅读(212) 评论(0) 推荐(0)
poj3070 (斐波那契，矩阵快速幂)
摘要：FibonacciTime Limit:1000MSMemory Limit:65536KTotal Submissions:9630Accepted:6839DescriptionIn the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1+... 阅读全文
posted @ 2014-10-11 20:28 haohaooo 阅读(182) 评论(0) 推荐(0)
2013nanjingJ
摘要：J -BallTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4811Appoint description:DescriptionJenny likes balls.... 阅读全文
posted @ 2014-10-10 23:00 haohaooo 阅读(193) 评论(0) 推荐(0)
2013nanjignB
摘要：B -Poor Warehouse KeeperTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4803Appoint description:DescriptionJ... 阅读全文
posted @ 2014-10-10 22:58 haohaooo 阅读(142) 评论(0) 推荐(0)
soj4271 Love Me, Love My Permutation (DFS)
摘要：4271: Love Me, Love My PermutationDescriptionGiven a permutation of n: a[0], a[1] ... a[n-1], ( its elements range from 0 to n-1, For example: n=4, on... 阅读全文
posted @ 2014-10-09 22:46 haohaooo 阅读(263) 评论(0) 推荐(0)
poj3335 半交平面，多边形内核
摘要：Rotating ScoreboardTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 5300Accepted: 2112DescriptionThis year, ACM/ICPC World finals will be held... 阅读全文
posted @ 2014-10-08 11:06 haohaooo 阅读(203) 评论(0) 推荐(0)
2013长沙 G Graph Reconstruction (Havel-Hakimi定理)
摘要：Graph ReconstructionTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeLet there be a simple graph with N vertices but we just know the degre... 阅读全文
posted @ 2014-10-06 14:34 haohaooo 阅读(339) 评论(0) 推荐(0)
2013区域赛长沙赛区现场赛 K - Pocket Cube
摘要：K -Pocket CubeTime Limit:10000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4801DescriptionPocket Cube is a 3-D combinati... 阅读全文
posted @ 2014-10-06 00:10 haohaooo 阅读(378) 评论(0) 推荐(0)
2013长沙赛区现场赛 J - Josephina and RPG
摘要：J -Josephina and RPGTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4800DescriptionA role-playing game (RPG ... 阅读全文
posted @ 2014-10-06 00:01 haohaooo 阅读(314) 评论(0) 推荐(0)
POJ 3254 Corn Fields(状态压缩DP）
摘要：Corn FieldsTime Limit:2000MSMemory Limit:65536KTotal Submissions:4739Accepted:2506DescriptionFarmer John has purchased a lush new rectangular pasture ... 阅读全文
posted @ 2014-10-05 01:31 haohaooo 阅读(177) 评论(0) 推荐(0)