数论/组合
文章平均质量分 71
superset
这个作者很懒,什么都没留下…
展开
-
hdoj1017--A Mathematical Curiosity
Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases!The first line of a multiple input is an inte原创 2014-02-11 11:43:11 · 563 阅读 · 0 评论 -
hdoj1021--Fibonacci Again
Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lines, each containing an integer n.原创 2014-02-24 11:49:43 · 460 阅读 · 0 评论 -
hdoj1019--Least Common Multiple
Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 1原创 2014-02-24 10:25:43 · 449 阅读 · 0 评论 -
hdoj1018--Big Number
Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are原创 2014-02-11 00:03:40 · 476 阅读 · 0 评论