![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
素数
文章平均质量分 79
AnICoo1
这个作者很懒,什么都没留下…
展开
-
HDOJ 2710 Max Factor (筛素法求最大因子)
Max FactorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5557 Accepted Submission(s): 1799Problem DescriptionTo improve the原创 2016-01-17 21:59:13 · 845 阅读 · 0 评论 -
LightOJ 1220 - Mysterious Bacteria (质因子分解)
1220 - Mysterious BacteriaTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1220 DescriptionDr. Mob has just discovered原创 2016-01-13 18:14:19 · 1131 阅读 · 0 评论 -
HDOJ 5150 Sum Sum Sum (素数和 水)
Sum Sum SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 982 Accepted Submission(s): 578Problem DescriptionWe call a positive n原创 2016-02-12 23:04:47 · 268 阅读 · 0 评论 -
Codeforces Round #326 (Div. 2) B. Duff in Love (分解质因子)
B. Duff in Lovetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuff is in love with lovely numbers! A positive integ原创 2016-02-13 23:56:04 · 547 阅读 · 0 评论 -
LightOJ 1197 - Help Hanzo (模拟筛素法区间筛素)
1197 - Help Hanzo PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBAmakusa, the evil spiritual leader has captured the原创 2016-03-30 20:45:15 · 941 阅读 · 0 评论 -
LightOJ 1090 - Trailing Zeroes (II) (求式子结果0的个数)
1090 - Trailing Zeroes (II) PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBFind the number of trailing zeroes for th原创 2016-03-30 21:45:05 · 589 阅读 · 0 评论 -
LightOJ 1259 - Goldbach`s Conjecture (分解偶数为两个素数之和)
1259 - Goldbach`s Conjecture PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGoldbach's conjecture is one of the olde原创 2016-03-08 17:43:06 · 1358 阅读 · 0 评论 -
LightOJ 1278 - Sum of Consecutive Integers (求一个数能被分解为等差数列的方案数)
1278 - Sum of Consecutive Integers PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGiven an integer N, you have to fi原创 2016-03-09 21:13:11 · 662 阅读 · 0 评论 -
LightOJ 1245 - Harmonic Number (II) (求n/1+n/2+n/2+....+n/n)
1245 - Harmonic Number (II) PDF (English)StatisticsForumTime Limit: 3 second(s)Memory Limit: 32 MBI was trying to solve problem '1234 - Har原创 2016-03-09 21:50:48 · 622 阅读 · 0 评论 -
LightOJ 1138 - Trailing Zeroes (III) (求末尾0为x的最小N---二分)
1138 - Trailing Zeroes (III) PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou task is to find minimal natural numb原创 2016-04-03 16:41:25 · 361 阅读 · 0 评论 -
LightOJ 1054 - Efficient Pseudo Code (求n^m的因子和)
1054 - Efficient Pseudo Code PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBSometimes it's quite useful to write pse原创 2016-02-25 21:51:15 · 760 阅读 · 0 评论 -
LightOJ 1340 - Story of Tomisu Ghost (求n!在b进制下末尾0)
题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1340题意:给你一个n,一个t,n!在b进制下末尾0的个数要大于等于t,求最大的d思路:筛n之内的素数,然后依次看在素数p进制下0的个数,如果大于,快速幂优化ac代码:/*LightOJ 1340*/#include<stdio.h>#include<math.h>#incl原创 2016-05-16 17:39:14 · 681 阅读 · 0 评论 -
BZOJ 1607 Patting Heads 轻拍牛头 (素数筛应用)
题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1607思路:和素数筛一样的原理,记录每个数出现的次数,然后筛一遍就好了ac代码:#include<stdio.h>#include<math.h>#include<string.h>#include<stack>#include<set>#include<queue>#includ原创 2016-05-21 11:58:36 · 479 阅读 · 0 评论 -
hdu5726 GCD (线段树+区间gcd)
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1587 Accepted Submission(s): 515Problem DescriptionGive you a sequence of N(N原创 2016-07-21 09:30:06 · 2766 阅读 · 1 评论 -
POJ 2262 Goldbach's Conjecture(素数表分解质数)
Goldbach's ConjectureTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41314 Accepted: 15827DescriptionIn 1742, Christian Goldbach, a German amateur mathema原创 2015-10-18 17:53:01 · 422 阅读 · 0 评论 -
POJ 1595 Prime Cuts(素数切)
Prime CutsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10934 Accepted: 4156DescriptionA prime number is a counting number (1, 2, 3, ...) that is evenly原创 2015-10-20 22:53:29 · 654 阅读 · 0 评论 -
ZOJ 3911 Prime Query (线段树+单点更新+区间lazy更新+素数判断计数)
Prime QueryTime Limit: 1 Second Memory Limit: 196608 KBYou are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence.Here are原创 2016-01-26 12:31:15 · 374 阅读 · 0 评论 -
FZUOJ Problem 1607 Greedy division (求因子个数)
Problem 1607 Greedy division Accept: 478 Submit: 1715Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionOaiei has inherited a large sum of wealth recently; this t原创 2016-01-10 16:18:20 · 489 阅读 · 0 评论 -
NYOJ 476 谁是英雄 (唯一分解素数求因子个数)
谁是英雄时间限制:1000 ms | 内存限制:65535 KB难度:3描述 十个数学家(编号0-9)乘气球飞行在太平洋上空。当横越赤道时,他们决定庆祝一下这一壮举。于是他们开了一瓶香槟。不幸的是,软木塞在气球上打了一个洞,氢气泄漏,气球开始下降,眼看就要落入海中,所有人将要被鲨鱼吃掉。但是尚有一线生机--若其中一人牺牲自己跳下去的话,那他的原创 2016-01-28 12:45:19 · 565 阅读 · 0 评论 -
LightOJ 1014 - Ifter Party (**求因子)
1014 - Ifter Party PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBI have an Ifter party at the 5th day ofRamadan for原创 2016-02-05 22:40:09 · 747 阅读 · 0 评论 -
LightOJ 1035 - Intelligent Factorial Factorization (求因子)
1035 - Intelligent Factorial Factorization PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBGiven an integer N, you原创 2016-02-05 23:37:29 · 428 阅读 · 0 评论 -
LightOJ 1024 - Eid (高精度求n个数的LCM)
1024 - Eid PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBIn a strange planet there are n races. They arecompletely原创 2016-02-07 17:53:46 · 770 阅读 · 0 评论 -
LightOJ 1028 1028 - Trailing Zeroes (I) (求因子个数)
1028 - Trailing Zeroes (I) PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBWe know what a base of a number is and wha原创 2016-02-07 18:49:40 · 1050 阅读 · 0 评论 -
LightOJ 1109 - False Ordering (因子数打表排列)
1109 - False Ordering PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBWe define b is a Divisor of a number a if原创 2016-02-09 17:49:36 · 519 阅读 · 0 评论 -
POJ 1845 Sumdiv (大数据因子和)
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17287 Accepted: 4343DescriptionConsider two natural numbers A and B. Let S be the sum of all natural原创 2016-02-10 00:22:38 · 367 阅读 · 0 评论 -
ZOJ 1284 Perfection (因子和)
PerfectionTime Limit: 2 Seconds Memory Limit: 65536 KBFrom the article Number Theory in the 1994 Microsoft Encarta: "If a, b, c are integers such that a = bc, a is called a multiple of b原创 2016-01-11 18:32:17 · 332 阅读 · 0 评论 -
ZOJ 2095 Divisor Summation (求因子和)
Divisor SummationTime Limit: 5 Seconds Memory Limit: 32768 KBGive a natural number n (1 Definition: A proper divisor of a natural number is the divisor that is strictly less than the nu原创 2016-01-11 14:22:03 · 619 阅读 · 0 评论 -
POJ 2689 Prime Distance (大素数筛)
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14876 Accepted: 3946DescriptionThe branch of mathematics called number theory is about prope原创 2015-11-10 18:23:12 · 432 阅读 · 0 评论 -
POJ 2739 Sum of Consecutive Prime Numbers(素数打表+素数搜索)
Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21346 Accepted: 11695DescriptionSome positive integers can be represented原创 2015-10-20 21:41:57 · 1113 阅读 · 0 评论 -
Codeforces Round #338 (Div. 2) D. Multipliers (求因子积)
D. Multiplierstime limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputAyrat has number n, represented as it’s prime factorization pi of size原创 2016-08-12 12:14:21 · 663 阅读 · 0 评论