随笔档案「2014年4月」 - ERKE

Nim or not Nim? hdu3032 SG值打表找规律

摘要：Nim or not Nim?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 858Accepted Submission(s): 412Probl... 阅读全文

posted @ 2014-04-30 21:25 ERKE 阅读(398) 评论(0) 推荐(0)

Maximum 贪心

摘要：MaximumTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionLetx1,x2,...,xmbe real numbers satisfying the following cond... 阅读全文

posted @ 2014-04-30 12:19 ERKE 阅读(155) 评论(0) 推荐(0)

The Super Powers

摘要：The Super PowersTime Limit:1000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionAThe Super PowersWe all know the... 阅读全文

posted @ 2014-04-29 22:27 ERKE 阅读(343) 评论(0) 推荐(0)

LCM Cardinality 暴力

摘要：LCM CardinalityTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionProblem FLCM CardinalityInput:Standard InputOutput:S... 阅读全文

posted @ 2014-04-29 18:54 ERKE 阅读(315) 评论(0) 推荐(1)

Longge's problem poj2480 欧拉函数，gcd

摘要：Longge's problemTime Limit:1000MSMemory Limit:65536KTotal Submissions:6918Accepted:2234DescriptionLongge is good at mathematics and he likes to think ... 阅读全文

posted @ 2014-04-27 09:42 ERKE 阅读(285) 评论(0) 推荐(0)

GCD hdu2588

摘要：GCDTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 897Accepted Submission(s): 400Problem Descripti... 阅读全文

posted @ 2014-04-27 08:46 ERKE 阅读(194) 评论(0) 推荐(0)

Perfect Pth Powers poj1730

摘要：Perfect Pth PowersTime Limit:1000MSMemory Limit:10000KTotal Submissions:16383Accepted:3712DescriptionWe say that x is a perfect square if, for some in... 阅读全文

posted @ 2014-04-25 21:00 ERKE 阅读(167) 评论(0) 推荐(0)

6656 Watching the Kangaroo

摘要：6656 Watching the KangarooDay by day number of Kangaroos is decreasing just liketiger, whale or lions. So I decided to make them a sanctuarywhere they... 阅读全文

posted @ 2014-04-25 09:28 ERKE 阅读(234) 评论(0) 推荐(0)

搜索

摘要：Count the PolygonsTime Limit:2000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionECount the PolygonsInput:Stand... 阅读全文

posted @ 2014-04-24 21:14 ERKE 阅读(155) 评论(0) 推荐(0)

Even Parity uva11464 模拟

摘要：Even ParityTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionDEven ParityInput:Standard InputOutpu... 阅读全文

posted @ 2014-04-23 20:17 ERKE 阅读(216) 评论(0) 推荐(0)

GCD hdu1695容斥原理

摘要：GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5106Accepted Submission(s): 1833Problem Descrip... 阅读全文

posted @ 2014-04-23 07:19 ERKE 阅读(228) 评论(0) 推荐(0)

Rectangles hdu2461容斥定理

摘要：RectanglesTime Limit: 5000/4000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1259Accepted Submission(s): 661Problem D... 阅读全文

posted @ 2014-04-22 20:26 ERKE 阅读(255) 评论(0) 推荐(0)

GCD XOR uvalive6657

摘要：GCD XORGiven an integer N, nd how many pairs (A; B) are there such that: gcd(A; B) = A xor B where1 B A N.Here gcd(A; B) means the greatest com... 阅读全文

posted @ 2014-04-20 23:13 ERKE 阅读(411) 评论(0) 推荐(0)

Paint the Grid Again ZOJ - 3780 拓扑

摘要：Paint the Grid AgainTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionLeo has a grid withN×Ncells.... 阅读全文

posted @ 2014-04-20 13:13 ERKE 阅读(254) 评论(0) 推荐(0)

Paint the Grid Reloaded ZOJ - 3781 图论变形

摘要：Paint the Grid ReloadedTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionLeo has a grid withNrows ... 阅读全文

posted @ 2014-04-20 10:27 ERKE 阅读(476) 评论(0) 推荐(0)

End up with More Teams UVA - 11088

摘要：End up with More TeamsTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionIIUPC2006Problem E: End up... 阅读全文

posted @ 2014-04-19 14:54 ERKE 阅读(226) 评论(0) 推荐(0)

Just Finish it up UVA - 11093

摘要：Just Finish it upTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionIIUPC2006Problem J: Just Finish... 阅读全文

posted @ 2014-04-19 14:11 ERKE 阅读(426) 评论(0) 推荐(1)

How many Knight Placing? UVA - 11091

摘要：How many Knight Placing?Time Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionIIUPC2006Problem H: How ... 阅读全文

posted @ 2014-04-19 09:18 ERKE 阅读(305) 评论(0) 推荐(0)

Free Goodies UVA - 12260 贪心

摘要：Free GoodiesTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionBFree GoodiesPetra and Jan have just... 阅读全文

posted @ 2014-04-17 15:52 ERKE 阅读(334) 评论(0) 推荐(0)

Training little cats poj3735

摘要：Training little catsTime Limit:2000MSMemory Limit:65536KTotal Submissions:9299Accepted:2230DescriptionFacer's pet cat just gave birth to a brood of li... 阅读全文

posted @ 2014-04-14 23:07 ERKE 阅读(339) 评论(0) 推荐(0)

The Nerd Factor SPOJ - MYQ5

摘要：The Nerd FactorTime Limit:1000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionProf.Venky handles Advanced Topic... 阅读全文

posted @ 2014-04-13 21:27 ERKE 阅读(297) 评论(0) 推荐(0)

Max Sum of Max-K-sub-sequence hdu3415

摘要：Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5569Accepted Submission(s): 2003Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the rig 阅读全文

posted @ 2014-04-13 10:53 ERKE 阅读(187) 评论(0) 推荐(0)

Beautiful Dream hdu3418 （直接做或二分）

摘要：Beautiful DreamTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 629Accepted Submission(s): 224Problem DescriptionWhen we were a child, we all had a beautiful dream, time flies, where is your colorful dream living in now?Get it? If not, it doesn’t ma 阅读全文

posted @ 2014-04-13 00:49 ERKE 阅读(273) 评论(0) 推荐(0)

Another Easy Problem fzu1753

摘要：Another Easy ProblemTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64u[Submit] [Go Back] [Status]Descriptionxtt最近学习了高斯消元法解方程组,现在他的问题来了，如果是以下的方程，那么应该如何解呢?C(n1,m1)==0 (mod M)C(n2,m2)==0 (mod M)C(n3,m3)==0 (mod M)................C(nk,mk)==0 (mod M)xtt希望你告诉他满足条件的最大的M其中C(i,j)表示组合数,例如C 阅读全文

posted @ 2014-04-08 22:22 ERKE 阅读(124) 评论(0) 推荐(0)

Divisors poj2992

摘要：DivisorsTime Limit:1000MSMemory Limit:65536KTotal Submissions:9940Accepted:2924DescriptionYour task in this problem is to determine the number of divisors ofCnk. Just for fun -- or do you need any special reason for such a useful computation?InputThe input consists of several instances. Each instanc 阅读全文

posted @ 2014-04-08 21:41 ERKE 阅读(158) 评论(0) 推荐(0)

Happy 2006 poj2773

摘要：Happy 2006Time Limit:3000MSMemory Limit:65536KTotal Submissions:9049Accepted:3031DescriptionTwo positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9...are all relatively prime to 2006.Now your job is easy: for the given i 阅读全文

posted @ 2014-04-08 20:29 ERKE 阅读(156) 评论(0) 推荐(0)

Racing Car Computer dp

摘要：Racing Car ComputerInput:Standard InputOutput:Standard OutputThe racing cars of today are equipped with so many sophisticated equipment. Introduction of a new visual transducer which is interfaced with the on-board computer can tell you on the fly how many cars are ahead of you while how many are tr 阅读全文

posted @ 2014-04-05 09:57 ERKE 阅读(259) 评论(0) 推荐(0)

Race to 1 概率dp

摘要：Race to 1Time Limit:10000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionBRace to 1Input:Standard InputOutput:Standard OutputDilu have learned a new thing about integers, which is - any positive integer greater than 1 can be divided by at least one prime nu 阅读全文

posted @ 2014-04-05 00:26 ERKE 阅读(179) 评论(0) 推荐(0)

不要62 hdu2089

摘要：不要62Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16975Accepted Submission(s): 5566Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如：62315 73418 8 阅读全文

posted @ 2014-04-02 13:04 ERKE 阅读(260) 评论(0) 推荐(0)

Kia's Calculation hdu4726

摘要：Kia's CalculationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1367Accepted Submission(s): 327Problem DescriptionDoctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a number w 阅读全文

posted @ 2014-04-01 13:17 ERKE 阅读(174) 评论(0) 推荐(0)