┠──>数论
hhfgeg
这个作者很懒,什么都没留下…
展开
-
POJ 2635 The Embarrassed Cryptographer
The Embarrassed CryptographerTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 11984Accepted: 3196DescriptionThe young and very promising cryptographer Odd Even has implemente原创 2014-07-21 09:48:34 · 1402 阅读 · 0 评论 -
POJ 1845 Sumdiv
SumdivDescriptionConsider 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).InputThe only line原创 2014-07-21 16:10:28 · 1040 阅读 · 0 评论 -
POJ 2739 Sum of Consecutive Prime Numbers
Sum of Consecutive Prime NumbersDescriptionSome 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 · 1003 阅读 · 1 评论 -
HDU 4869 Turn the pokers
Turn the pokersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 188 Accepted Submission(s): 48Problem Description原创 2014-07-22 21:27:15 · 1128 阅读 · 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 · 1394 阅读 · 3 评论