随笔分类 -  UVA

K - Building designing 其实是贪心
摘要：K -Building designingTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionBuilding designingAn architect wants to design a very high building. The building will consist of some floors, and each floor has a certain size. The size of a floor must be greater than the s 阅读全文

posted @ 2013-11-21 21:06 keep trying 阅读(288) 评论(0) 推荐(0)

Alternate Task UVA11728 暴力枚举
摘要：FAlternate TaskInput:Standard InputOutput:Standard OutputLittle Hasan loves to play number games with his friends. One day they were playing a game where one of them will speak out a positive number and the others have to tell the sum of its factors. The first one to say it correctly wins. After a w 阅读全文

posted @ 2013-10-31 20:24 keep trying 阅读(240) 评论(0) 推荐(0)

GCD Extreme (II) 欧拉函数的应用
摘要：Problem JGCD Extreme (II)Input:Standard InputOutput:Standard OutputGiven the value of N, you will have to find the value of G. The definition of G is given below:HereGCD(i,j) means the greatest common divisor of integeriand integer j.For those who have trouble understanding summation notation, the m 阅读全文

posted @ 2013-10-31 20:09 keep trying 阅读(227) 评论(0) 推荐(0)

10026 - Shoemaker's Problem 贪心
摘要：Shoemaker's ProblemShoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ithjob, it is known the integer Ti(1#include#include#include#include#include#include#include#include#include#include#include//ios_base::sync_with_stdio(fal 阅读全文

posted @ 2013-10-21 22:57 keep trying 阅读(258) 评论(0) 推荐(0)

导航