码代码的猿猿

摘要： ---恢复内容开始--- Corporative NetworkTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionA very big corporation is developing its corporative network. In the beginning each of the N enterprises of the corporation, numerated from 1 to N, organized... 阅读全文

摘要： Ping pongTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionN(3N20000)ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill rank. To improve their skill rank, they ofte... 阅读全文

摘要： Dakar RallyTime Limit:2 Seconds Memory Limit:65536 KBDescriptionTheDakar Rallyis an annual Dakar Series rally raid type of off-road race, organized by the Amaury Sport Organization. The off-road endurance race consists of a series of routes. In different routes, the competitors cross dunes, mud, cam 阅读全文

摘要： 偏方记录背包里的物品。。。。。每个背包的价值+0.01Happy Programming ContestTime Limit:2 Seconds Memory Limit:65536 KBIn Zhejiang University Programming Contest, a team is called "couple team" if it consists of only two students loving each other. In the contest, the team will get a lovely balloon with unique col 阅读全文

摘要： 泊松分布。。。。Alien's OrganTime Limit:2 Seconds Memory Limit:65536 KBThere's an alien whose name is Marjar. It is an universal solder came from planet Highrich a long time ago.Marjar is a strange alien. It needs to generate new organs(body parts) to fight. The generated organs will provide power t 阅读全文

摘要： X-PlosivesTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionX-PlosivesA secret service developed a new kind of explosive that attain its volatile property only when a specific association of products occurs. Each product is a mix of two differe 阅读全文

摘要： Problem EEasy Problem from Rujia Liu?Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasionally sets easy problem (for example, 'the Coco-Col 阅读全文

摘要： UVA - 11997K Smallest SumsTime Limit:1000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionProblem KK Smallest SumsYou're given k arrays, each array has k integers. There are kkways to pick exactly one element in each array and calculate the sum of the in 阅读全文

摘要： 名字是法雷数列其实是欧拉phi函数 Farey SequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:11246Accepted:4363DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 2 #include 3 #include 4 5 using namespace std; 6 7 typedef unsigned l... 阅读全文

摘要： 期望DP +数学推导DiceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 337Accepted Submission(s): 223Special JudgeProblem DescriptionYou have a dice with m faces, each face contains a distinct number. We assume when we tossing the dice, each face will occur 阅读全文