不要过于沉溺过去，也不要过于畅想未来，把握现在！

08 2014 档案

2012 Asia JinHua Regional Contest
摘要：A HDU　4442Physical ExaminationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5518Accepted Submiss... 阅读全文
posted @ 2014-08-31 11:25 coding_yuan 阅读(186) 评论(0) 推荐(0)
2013 ACM-ICPC南京赛区全国邀请赛
摘要：题目链接：http://acm.hdu.edu.cn/search.php?field=problem&key=2013 ACM-ICPC南京赛区全国邀请赛——题目重现&source=1&searchmode=sourceA(HDU4586)Play the DiceTime Limit: 2000... 阅读全文
posted @ 2014-08-31 10:31 coding_yuan 阅读(260) 评论(0) 推荐(0)
2012ACM 杭州邀请赛个别题目题解
摘要：B（HDU 4454）Stealing a CakeTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1795 Accepted Submissio... 阅读全文
posted @ 2014-08-31 10:15 coding_yuan 阅读(203) 评论(0) 推荐(0)
LCA和RMQ题目汇总
摘要：1.HDU 3183A Magic LampTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1624 Accepted Submiss... 阅读全文
posted @ 2014-08-31 09:45 coding_yuan 阅读(214) 评论(0) 推荐(0)
CodeForces 439D
摘要：D. Devu and his Brothertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDevu and his brother love ... 阅读全文
posted @ 2014-08-22 00:14 coding_yuan 阅读(219) 评论(0) 推荐(0)
POJ 2769 Reduced ID Numbers
摘要：思路： 枚举Reduced ID NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8847 Accepted: 3552DescriptionT. Chur teaches various groups of stud... 阅读全文
posted @ 2014-08-21 14:44 coding_yuan 阅读(143) 评论(0) 推荐(0)
LightOj 1179 Josephus Problem
摘要：1179 - Josephus ProblemPDF (English) Statistics ForumTime Limit: 2 second(s) Memory Limit: 32 MBThe historian Flavius Josephus relates how, in the Rom... 阅读全文
posted @ 2014-08-21 13:33 coding_yuan 阅读(263) 评论(0) 推荐(0)
LightOj 1148 Basic Math
摘要：1148 - Mad CountingPDF (English) Statistics ForumTime Limit: 0.5 second(s) Memory Limit: 32 MBMob was hijacked by the mayor of the Town "TruthTown". M... 阅读全文
posted @ 2014-08-21 10:24 coding_yuan 阅读(170) 评论(0) 推荐(0)
LightOj 1078 Basic Math
摘要：思路： 设输入的两个数分别为n和a,每一次所得到的数为update： 开始update=a,依次update分别为update*10+a,这样数据会超出范围，则update每次为update=(update*10+a)%n即可， 如果update=0,跳出循环； 只需证明：(update*10+a)... 阅读全文
posted @ 2014-08-21 00:35 coding_yuan 阅读(234) 评论(0) 推荐(0)
LightOj 1020 博弈
摘要：思路介绍： 1. 如果首先由Alice取，定义ans[i],如果ans[i]=1表示Alice会取胜,反之Bob取胜。枚举前100项，ans[1]=0，ans[2]=1,ans[i]=!(ans[i-1]&&ans[i-2]); 可以发现规律：当i为2，3，5，6，8，9....时Alice取胜，所... 阅读全文
posted @ 2014-08-20 23:41 coding_yuan 阅读(170) 评论(0) 推荐(0)
POJ 2653 线段交
摘要：思路： 运用队列存储没有被覆盖的木棍，没加入一个棍子，就要判断一下是否队列中的棍子被覆盖，如果被覆盖，就从队列中删除； 线段交判断方法：跨立实验Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9698 ... 阅读全文
posted @ 2014-08-20 13:56 coding_yuan 阅读(174) 评论(0) 推荐(0)
POJ 1269 直线位置关系的判断
摘要：题目意思：给定四个点，前两个点确定一条直线，后两个点确定一条直线，判断两条直线的位置关系；思路： 两条直线的位置关系分为三种情况： 1.重合：判断方法：(（p1-q1)^(p2-q1))==0&&(（p1-q2)^(p2-q2))==0 2.平行：判断方法：（p1-p2）.x*(q1-q2).y... 阅读全文
posted @ 2014-08-19 23:39 coding_yuan 阅读(227) 评论(0) 推荐(0)
POJ 3304 计算几何
摘要：SegmentsTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 9564 Accepted: 2943 DescriptionGiven n segments in the two dimensional space, write... 阅读全文
posted @ 2014-08-19 16:53 coding_yuan 阅读(126) 评论(0) 推荐(0)
POJ 2398 计算几何+二分+排序
摘要：Toy StorageTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 3953 Accepted: 2334 DescriptionMom and dad have a problem: their child, Reza, ne... 阅读全文
posted @ 2014-08-19 00:49 coding_yuan 阅读(155) 评论(0) 推荐(0)
POJ 2318 计算几何+二分
摘要：TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10425 Accepted: 5002DescriptionCalculate the number of toys that land in each bin of a p... 阅读全文
posted @ 2014-08-18 17:09 coding_yuan 阅读(180) 评论(0) 推荐(0)
LightOJ 1216 圆锥体积
摘要：1001 - Opposite TaskPDF (English) Statistics ForumTime Limit: 0.5 second(s) Memory Limit: 32 MBThis problem gives you a flavor the concept of special ... 阅读全文
posted @ 2014-08-07 20:52 coding_yuan 阅读(216) 评论(0) 推荐(0)
Light Oj 1214 大数整除
摘要：Large DivisionTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1214DescriptionGiven two integers, a and b... 阅读全文
posted @ 2014-08-07 16:14 coding_yuan 阅读(263) 评论(0) 推荐(0)
Light Oj 1211 计算多个立方体重叠部分体积
摘要：Intersection of CubesTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1211DescriptionYou are given n cubes... 阅读全文
posted @ 2014-08-07 15:34 coding_yuan 阅读(676) 评论(0) 推荐(0)
Light Oj 1116
摘要：Ekka DokkaTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionEkka and his friend Dokka decided to buy a cake. Th... 阅读全文
posted @ 2014-08-07 01:12 coding_yuan 阅读(198) 评论(0) 推荐(0)
阶乘位数转化
摘要：Digits of FactorialTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionFactorial of an integer is defined by the ... 阅读全文
posted @ 2014-08-05 21:56 coding_yuan 阅读(273) 评论(0) 推荐(0)
Light Oj 1008
摘要：Fibsieve`s Fantabulous BirthdayTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionFibsieve had a fantabulous (yes... 阅读全文
posted @ 2014-08-05 19:20 coding_yuan 阅读(227) 评论(0) 推荐(0)
HDU 1082
摘要：Matrix Chain MultiplicationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1066 Accepted Submissi... 阅读全文
posted @ 2014-08-05 00:19 coding_yuan 阅读(140) 评论(0) 推荐(0)
POJ 1363
摘要：RailsTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 24709 Accepted: 9698 DescriptionThere is a famous railway station in PopPush City. Cou... 阅读全文
posted @ 2014-08-04 19:04 coding_yuan 阅读(165) 评论(0) 推荐(0)
UVA 10935 约瑟夫环
摘要：Throwing cards away ITime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionGiven is an ordered deck of n cards numbered... 阅读全文
posted @ 2014-08-04 17:16 coding_yuan 阅读(179) 评论(0) 推荐(0)

不要过于沉溺过去，也不要过于畅想未来，把握现在！