随笔分类 - HDU ACM Steps 7.2

7.2.5 Description has only two Sentences

摘要：Problem Description an = X*an-1 + Y and Y mod (X-1) = 0.Your task is to calculate the smallest positive integer k that ak mod a0 = 0. Input Each line will contain only three integers X, Y, a0 ( 1 < X < 231, 0 <= Y < 263, 0 < a0 < 231). Output For each case, output th... 阅读全文

posted @ 2013-07-14 11:37 cssystem 阅读(171) 评论(0) 推荐(0)

7.2.1 The Euler function

摘要：The Euler functionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 134 Accepted Submission(s): 76 Problem Description The Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbe... 阅读全文

posted @ 2013-07-14 00:43 cssystem 阅读(153) 评论(0) 推荐(0)