2013年11月4日
UVA-11991 Easy Problem from Rujia Liu?
摘要： 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 阅读全文
posted @ 2013-11-04 19:17 码代码的猿猿 阅读(263) 评论(0) 推荐(1) 编辑
UVA-11997 K Smallest Sums
摘要： 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 阅读全文
posted @ 2013-11-04 19:12 码代码的猿猿 阅读(187) 评论(0) 推荐(1) 编辑
POJ 2478 Farey Sequence
摘要： 名字是法雷数列其实是欧拉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... 阅读全文
posted @ 2013-11-04 14:54 码代码的猿猿 阅读(187) 评论(0) 推荐(0) 编辑