![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
┠──>数论
hhfgeg
这个作者很懒,什么都没留下…
展开
-
POJ 2635 The Embarrassed Cryptographer
The Embarrassed Cryptographer Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 11984 Accepted: 3196 Description The young and very promising cryptographer Odd Even has implemente原创 2014-07-21 09:48:34 · 1388 阅读 · 0 评论 -
POJ 1845 Sumdiv
Sumdiv Description Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901). Input The only line原创 2014-07-21 16:10:28 · 1018 阅读 · 0 评论 -
POJ 2739 Sum of Consecutive Prime Numbers
Sum of Consecutive Prime Numbers Description Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive原创 2014-07-21 17:00:55 · 990 阅读 · 1 评论 -
HDU 4869 Turn the pokers
Turn the pokers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 188 Accepted Submission(s): 48 Problem Description原创 2014-07-22 21:27:15 · 1113 阅读 · 0 评论 -
数学公式
(1) 整数的唯一分解定理: 任意正整数都有且只有一种方式写出其素因子的乘积表达式。 A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn) 其中pi均为素数 (2) 约数和公式: 对于已经分解的整数A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn) 有A的所有因子之和为原创 2014-07-21 16:04:31 · 1342 阅读 · 3 评论