随笔分类 -  ACM数论

HDU1395 ZOJ1489 2^x mod n = 1【暴力法+数论】
摘要:2^x mod n = 1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17824 Accepted... 阅读全文

posted @ 2017-09-05 21:29 海岛Blog 阅读(364) 评论(0) 推荐(0)

POJ1284 Primitive Roots【原根】
摘要:Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4361 Accepted: 2568DescriptionWe say that integer x, 0 #inclu... 阅读全文

posted @ 2017-07-27 22:07 海岛Blog 阅读(151) 评论(0) 推荐(0)

UVALive3399 UVA1210 POJ2739 Sum of Consecutive Prime Numbers【素数筛选+尺取法】
摘要:Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25286 Accepted: 13793DescriptionSome positiv... 阅读全文

posted @ 2017-06-25 15:56 海岛Blog 阅读(123) 评论(0) 推荐(0)

HDU1492 The number of divisors(约数) about Humble Numbers【约数】
摘要:The number of divisors(约数) about Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tota... 阅读全文

posted @ 2017-06-21 06:24 海岛Blog 阅读(184) 评论(0) 推荐(0)

UVALive6050 Primes【素数筛选+前缀和】
摘要:PrimesLet m and n be two integers, 2 ≤ m > Europe - Southeastern问题链接:UVALive6050 Primes。题意简述:参见上文。问题分析:用Eratosthenes筛选法筛选素数,然后计算素数数量的前... 阅读全文

posted @ 2017-06-15 08:57 海岛Blog 阅读(98) 评论(0) 推荐(0)

POJ3978 Primes【素数筛选+前缀和】
摘要:PrimesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4075 Accepted: 1579DescriptionA pretty straight forward task, calculat... 阅读全文

posted @ 2017-06-15 08:18 海岛Blog 阅读(178) 评论(0) 推荐(0)

HDU2161 Primes【筛选法+打表】
摘要:PrimesTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12512 Accepted Submis... 阅读全文

posted @ 2017-06-15 07:51 海岛Blog 阅读(142) 评论(0) 推荐(0)

ZOJ2723 Semi-Prime【素数筛选+试探法】
摘要:Semi-PrimeTime Limit: 2 Seconds Memory Limit: 65536 KBPrime Number Definition An integer greater than one is called a prime numbe... 阅读全文

posted @ 2017-06-15 00:18 海岛Blog 阅读(222) 评论(0) 推荐(0)

ZOJ1160 Biorhythms【中国剩余定理】
摘要:BiorhythmsTime Limit: 10 Seconds Memory Limit: 32768 KBSome people believe that there are three cycles in a person's life that st... 阅读全文

posted @ 2017-06-14 22:20 海岛Blog 阅读(259) 评论(0) 推荐(0)

HDU1163 Eddy's digital Roots(解法二)【快速模幂+九余数定理】
摘要:问题链接:HDU1163 Eddy's digital Roots。问题简述:参见上述链接。问题分析:计算n^n的数根,一要快,二要简单。使用快速模幂计算,加上数论中的九余数定理就完美了。程序说明:(略)参考链接:HDU1163 Eddy's digital Root... 阅读全文

posted @ 2017-06-08 14:14 海岛Blog 阅读(99) 评论(0) 推荐(0)

导航