ICPC-数论:素数
文章平均质量分 77
数论中有关素数的题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
UVA10236 The Fibonacci Primes【欧拉筛法】
The Fibonacci number sequence is 1, 1, 2, 3, 5, 8, 13 and so on. You can see that except the first two numbers the others are summation of their previous two numbers. A Fibonacci Prime is a Fibonacci number which is relatively prime to all the smaller Fibo原创 2022-04-30 00:36:42 · 857 阅读 · 0 评论 -
HDU6069 Counting Divisors【欧拉筛法】
Counting DivisorsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 6208 Accepted Submission(s): 2147Problem DescriptionIn mathematics, the function d(n) denotes the number of divisors of posit原创 2021-08-09 20:41:35 · 196 阅读 · 0 评论 -
HDU5901 Count primes【素数】
Count primesTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3365 Accepted Submission(s): 1706Problem DescriptionEasy question! Calculate how many primes between [1…n]!InputEach line contain原创 2021-08-09 01:33:33 · 235 阅读 · 0 评论 -
UVA10871 Primed Subsequence【欧拉筛法】
Given a sequence of positive integers of length n, we define a primed subsequence as a consecutive subsequence of length at least two that sums to a prime number greater than or equal to two. For example, given the sequence:3 5 6 3原创 2021-08-02 23:06:04 · 469 阅读 · 0 评论 -
UVA516 POJ1365 LA5533 ZOJ1261 Prime Land【欧拉筛法】
Everybody in the Prime Land is using a prime base number system. In this system, each positive integer x is represented as follows: Let {pi}i=0∞\{pi\}_{i=0}^{∞}{pi}i=0∞ denote the increasing sequence of all prime numbers. We know that x > 1 can be repr原创 2021-04-10 23:51:36 · 215 阅读 · 0 评论 -
UVA12043 Divisors【欧拉筛法】
Let us define the functions d(n) and σ(n) asd(n)=numberofdivisorsofnd(n) = number of divisors of nd(n)=numberofdivisorsofnσ(n)=summationofdivisorsofnσ(n) = summation of divisors of nσ(n)=summationofdivisorsofn Here divisors of n i原创 2021-04-10 10:52:46 · 197 阅读 · 0 评论 -
UVA10738 Riemann vs Mertens【欧拉筛法】
One of the biggest, most mathematicians would call it THE biggest, unsolved problems in mathematics is the proof of the Riemann Hypothesis: “All non-trivial zeros of the zeta function have real part onehalf”. Now your task is simple: For any natural number原创 2021-04-09 22:26:12 · 234 阅读 · 0 评论 -
UVA12039 Goldbach‘s Cardinality【欧拉筛法】
Goldbach’s cardinality (GC) of an even number means the number of ways the even number can be expressed as summation of 2 different primes. For example 30 = 7 + 23 = 11 + 19 = 13 + 17. So Goldbach’s cardinality of 30 is 3. In other words we can write that原创 2021-03-15 00:27:26 · 161 阅读 · 0 评论 -
UVA12396 LA5828 HDU4196 Remoteland【欧拉筛法】
RemotelandTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 1512 Accepted Submission(s): 642Problem DescriptionIn the Republic of Remoteland, the people celebrate their independence day every原创 2021-03-14 20:02:27 · 180 阅读 · 0 评论 -
UVA11802 All Your Bases Belong to Us【欧拉筛法】
It is very easy to find number of trailing zero in n! for a particular base b. In this problem you have to do the reverse. You have to find for how many bases b, n! has k trailing zeros in base b.InputInput starts with a positive number T ≤ 10000, denoti原创 2021-03-14 19:24:50 · 209 阅读 · 0 评论 -
HDU5750 Dertouzos【欧拉筛法】
DertouzosTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4306 Accepted Submission(s): 1249Problem DescriptionA positive proper divisor is a positive divisor of a number n, excluding n itself.原创 2021-03-09 19:03:02 · 253 阅读 · 0 评论 -
UVA11440 Help Tomisu【筛选法】
After wasting a significant time of his life in problem-setting, Mr. Tomisu is now searching for glory: A glory that will make him famous like Goldbach and rich like Bill Gates ????. And he has chosen the field of Number Theory as his prime interest. His c原创 2021-02-21 16:57:43 · 209 阅读 · 0 评论 -
UVA10650 Determinate Prime【欧拉筛法】
If three or more consecutive primes are uni-distance they are called Determinate Primes. Your task is to print all the Determinate Prime sets between two integers (inclusive).InputThe input is consist of several test cases. Each test case consists of two原创 2021-02-05 23:57:00 · 259 阅读 · 0 评论 -
HDU1405 The Last Practice【筛选法】
The Last PracticeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13107 Accepted Submission(s): 3064Problem DescriptionTomorrow is contest...原创 2020-05-03 19:42:23 · 352 阅读 · 0 评论 -
UVA10490 Mr. Azad and his Son!!!!!【筛选法】
There are a lot of Abul Kalam Azad in Bangladesh. But, why is he so special? Not that he is my dad is the only reason. He can wonderfully do some calculation. If anyone gives him any positive integer ...原创 2020-04-22 22:59:36 · 244 阅读 · 0 评论 -
UVA10539 Almost Prime Numbers【筛选法+打表+二分查找】
Almost prime numbers are the non-prime numbers which are divisible by only a single prime number. In this problem your job is to write a program which finds out the number of almost prime numbers with...原创 2020-04-22 21:12:28 · 453 阅读 · 0 评论 -
UVA1213 LA3619 POJ3132 ZOJ2822 Sum of Different Primes【筛选法+0-1背包】
A positive integer may be expressed as a sum of different prime numbers (primes), in one way or another. Given two positive integers n and k, you should count the number of ways to express n as a sum ...原创 2020-04-21 21:18:15 · 336 阅读 · 0 评论 -
UVA11876 N + NOD (N)【欧拉筛法+前缀和】
Consider an integer sequence N where,N0 = 1Ni = Ni−1 + NOD(Ni−1) for i > 0 Here, NOD(x) = number of divisors of x. So the first few terms of this ...原创 2020-04-18 17:56:59 · 435 阅读 · 0 评论 -
UVA10742 The New Rule in Euphomia【欧拉筛法+二分搜索】
The ancient country of Euphomia had some strange rules regarding payment of prices and values of coins. When King Albert ruled this country the following payment rules were in place:a) The name of th...原创 2020-04-18 00:21:57 · 385 阅读 · 0 评论 -
UVA897 Anagrammatic Primes【筛选法+离线程序+代码生成+条件编译】
A number greater than one is prime if it has no divisors other than itself and 1 (note that 1 is not prime). For example, 23 is prime and 35 is not prime because 35 = 7 × 5. When the digits of a numbe...原创 2020-03-01 09:24:25 · 479 阅读 · 0 评论 -
UVA914 Jumping Champion【筛选法】
Professor Ma.L. (Math Lover) loves everything related to prime numbers. Remember that a prime is a positive numberbigger than one and only divisible by 1 and itself. He is now working on a property o...原创 2020-02-29 18:23:10 · 1590 阅读 · 0 评论 -
UVA10852 Less Prime【筛选法】
Let n be an integer, 100 ≤ n ≤ 10000, find the prime number x, x ≤ n, so that n − p ∗ x is maximum, where p is an integer such that p ∗ x ≤ n < (p + 1) ∗ x.InputThe first line of the input contai...原创 2020-02-28 10:23:10 · 334 阅读 · 0 评论 -
UVA10394 Twin Primes【孪生素数】
Twin primes are pairs of primes of the form (p, p + 2). The term “twin prime” was coined by Paul Stckel (1892-1919). The first few twin primes are (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43...原创 2020-02-27 20:40:38 · 533 阅读 · 0 评论 -
UVA10311 Goldbach and Euler【筛选法+歌德巴赫猜想】
That every number which is resolvable into two prime numbers can be resolved into as many prime numbers as you like, can be illustrated and confirmed by an observation which you have formerly communic...原创 2020-02-27 20:18:47 · 397 阅读 · 0 评论 -
HDU3826 Squarefree number【Eratosthenes筛选法+欧拉筛+唯一分解定理】
Squarefree numberTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4271 Accepted Submission(s): 1149Problem DescriptionIn mathematics, a s...原创 2020-02-26 19:08:08 · 430 阅读 · 0 评论 -
UVA12542 LA6149 Prime Substring【筛选法+贪心】
Given a string of digits, your task is to find the largest prime number which presents in that string. Our prime numbers are values between 2 to 100,000 only.InputEach line contains a string of digi...原创 2020-02-21 14:40:07 · 288 阅读 · 0 评论 -
UVA10924 Prime Words【筛选法】
A prime number is a number that has only two divisors: itself and the number one. Examples of prime numbers are: 1, 2, 3, 5, 17, 101 and 10007. In this problem you should read ...原创 2020-02-21 11:15:45 · 411 阅读 · 0 评论 -
UVA10235 Simply Emirp【筛选法】
An integer greater than 1 is called a prime number if its only positive divisors (factors) are 1 and itself. Prime numbers have been studied over the years by a lot of mathematicians. Applications of ...原创 2020-02-21 10:38:57 · 540 阅读 · 0 评论 -
POJ3292 UVA11105 Semi-prime H-numbers【筛法打表】
问题链接:POJ3292 UVA11105 Semi-prime H-numbers。问题简述:参见上述链接。问题分析:H-number:4n+1的数,n>=0,例如1,5,9,13,17,21,......。H-prime:H-number数并且其因子只有1和它本身。H-semi-prime:两个H-prime的乘积。H-composite:其他H-number数。...原创 2017-05-20 06:16:09 · 814 阅读 · 0 评论 -
UVALive6050 Primes【素数筛选+前缀和】
PrimesLet m and n be two integers, 2 ≤ m < n ≤ 10000000. Consider the following set:P rime(m, n) = {p|p prime and m ≤ p ≤ n}.Compute the cardinal of the set P rime(m, n).InputThe input consist...原创 2017-06-15 08:56:34 · 1038 阅读 · 0 评论 -
UVALive3399 UVA1210 POJ2739 Sum of Consecutive Prime Numbers【素数筛选+尺取法】
Sum of Consecutive Prime NumbersTime Limit:1000MS Memory Limit:65536K Total Submissions:25286 Accepted:13793 DescriptionSome positive integers can be represented by a...原创 2017-06-25 15:55:38 · 1101 阅读 · 0 评论 -
UVA10200 Prime Time【素数判定】
Euler is a well-known matematician, and, among many other things, he discovered that the formula n2 + n + 41 produces a prime for 0 ≤ n < 40. For n = 40, the formula produces 1681, which is 41 ∗ ...原创 2017-10-07 17:33:49 · 1371 阅读 · 0 评论 -
POJ2689 ZOJ1842 UVA10140 Prime Distance【筛选法】
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25099 Accepted: 6567DescriptionThe branch of mathematics called number theory is about properties of numbers. One of the a...原创 2019-02-12 23:24:07 · 347 阅读 · 0 评论 -
UVA10789 Prime Frequency【筛选法】
Given a string containing only alpha-numerals (0-9, A-Z and a-z) you have to count the frequency (thenumber of times the character is present) of all the characters and report only those characters w...原创 2019-02-12 17:50:11 · 420 阅读 · 0 评论 -
UVA10780 Again Prime? No Time.【筛选法】
The problem statement is very easy. Given a number n you have to determine the largest power of m, not necessarily prime, that divides n!.InputThe input file consists of several test cases. The firs...原创 2019-02-12 17:03:11 · 228 阅读 · 0 评论 -
UVALive2116 The Mobius Function【筛选法+莫比乌斯函数】
The Mobius function M(n) is defined on positive integers as follows:M(n) = 1 if n is 1.M(n) = 0 if any prime factor of n is contained in n more than once.M(n) = (−1)^p if n is the product of p diff...原创 2019-02-12 08:00:31 · 323 阅读 · 0 评论 -
HDU2098 分拆素数和【筛选法】
分拆素数和Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 42630Accepted Submission(s): 18630Problem Description把一个偶数拆成两个不同素数的和...原创 2016-04-29 09:19:17 · 4647 阅读 · 2 评论 -
HDU1262 寻找素数对【素数】
寻找素数对Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14663Accepted Submission(s): 7357Problem Description哥德巴赫猜想大家都知道一点吧.我...原创 2016-05-08 02:52:44 · 5967 阅读 · 8 评论 -
ZOJ2723 Semi-Prime【素数筛选+试探法】
Semi-PrimeTime Limit:2 Seconds Memory Limit:65536 KBPrime Number DefinitionAn integer greater than one is called a prime number if its only positive divisors (factors) are one and i...原创 2017-06-15 00:17:51 · 1464 阅读 · 0 评论 -
HDU2161 Primes【筛选法+打表】
PrimesTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12512Accepted Submission(s): 5178Problem DescriptionWrite a program...原创 2017-06-15 07:50:59 · 808 阅读 · 0 评论