HDU3792---Twin Prime Conjecture(树状数组)
来源:互联网 发布:python if false 编辑:程序博客网 时间:2024/05/18 03:40
Twin Prime Conjecture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2950 Accepted Submission(s): 1016
Problem Description
If we define dn as: dn = pn+1-pn, where pi is the i-th prime. It is easy to see that d1 = 1 and dn=even for n>1. Twin Prime Conjecture states that "There are infinite consecutive primes differing by 2".
Now given any positive integer N (< 10^5), you are supposed to count the number of twin primes which are no greater than N.
Now given any positive integer N (< 10^5), you are supposed to count the number of twin primes which are no greater than N.
Input
Your program must read test cases from standard input.
The input file consists of several test cases. Each case occupies a line which contains one integer N. The input is finished by a negative N.
The input file consists of several test cases. Each case occupies a line which contains one integer N. The input is finished by a negative N.
Output
For each test case, your program must output to standard output. Print in one line the number of twin primes which are no greater than N.
Sample Input
1520-2
Sample Output
014
题目大意:
题目的意思是,给定一个数字n。求小于n的孪生素数有多少对。孪生素数的概念就是说,相邻的两个素数之间差值为2。例如:5和7,17和19,这些都是。
解题思路:
先用筛法打了一个素数表,在素数表的基础上打出来一个直接保存结果的数组c[](树状数组直接处理的数组)。这样就可以直接用树状数组来解决了。基础的BIT应用。
如果不懂树状数组的话,可以去看这篇博客:搞懂树状数组
源代码:
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<stack>#include<queue>#include<vector>#include<deque>#include<map>#include<set>#include<algorithm>#include<string>#include<iomanip>#include<cstdlib>#include<cmath>#include<sstream>#include<ctime>using namespace std;typedef long long ll;#define MAXN 100005int c[MAXN];//c[]从下标为1的地方开始int lowbit(int x){ return x&(-x);}void add(int x, int num)//x代表位置,num代表增量{ while(x<=MAXN) { c[x]+=num; x+=lowbit(x); }}int sum(int x)//代表求解1~x的和(x是下标){ int res = 0; while(x>0) { res+=c[x]; x-=lowbit(x); } return res;}int primer[MAXN];int number[MAXN];void init(){ memset(number,0,sizeof(number)); int i,j; int cnt=0; for(i=2;i<=100000;i++) { if(number[i]==0) { cnt++; primer[cnt]=i; for(j=i*2;j<=100000;j+=i) { number[j]=1; } } }//素数表OK for(i=2;i<=cnt;i++) { if(primer[i]-primer[i-1]==2) { add(primer[i],1);//发现一对增加一个 } }}int main(){ int n; init(); while(scanf("%d",&n)!=EOF&&n>0) { printf("%d\n",sum(n)); }return 0;}
1 0
- HDU3792---Twin Prime Conjecture(树状数组)
- hdu3792 Twin Prime Conjecture(树状数组+线性筛)
- hdu3792(Twin Prime Conjecture) and hdu1541(Stars)树状数组
- HDU 3792 Twin Prime Conjecture(素数筛法 + 树状数组)
- Twin Prime Conjecture + 数论
- hdoj3792 Twin Prime Conjecture
- hdu 3792 Twin Prime Conjecture
- hdu 3792 Twin Prime Conjecture
- HDU 3792Twin Prime Conjecture
- HDU 3792——Twin Prime Conjecture(数论)
- HDOJ 题目 3792 Twin Prime Conjecture(数学)
- zju2011保研:Twin Prime Conjecture
- 素数 hdu 3792 Twin Prime Conjecture
- 杭电 3792 Twin Prime Conjecture
- hdu 3792 Twin Prime Conjecture 浙大复试上机题 水题
- hdu 3792 Twin Prime Conjecture n之内的孪生素数个数
- Twin Prime Conjecture(浙大计算机研究生保研复试上机考试-2011年)
- hdu 3792 Twin Prime Conjecture n之内的孪生素数个数
- 百度地图在设置中心时,背景变白
- python 科学计算库 - Numpy,Scipy,Pandas
- C# Java间进行RSA加密解密交互 .
- 洛谷 P1108 低价购买
- “J.U.C”:ReentrantLock之三unlock方法分析(r)
- HDU3792---Twin Prime Conjecture(树状数组)
- app/android:showAsAction的区别
- 基础(1)
- KMP算法的实现
- Leetcode 5 Longest Palindromic Substring
- rolling invalidation对子游标产生的影响
- linux安装 和 启动的过程
- HDU-4300 Clairewd’s message + 4333(扩展KMP)
- AlertDialog实现提示框初体验+自定义对话框