水数论HDU 2973
来源:互联网 发布:中央电视台网络春晚 编辑:程序博客网 时间:2024/04/29 20:01
YAPTCHA
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 599 Accepted Submission(s): 334
Problem Description
The math department has been having problems lately. Due to immense amount of unsolicited automated programs which were crawling across their pages, they decided to put Yet-Another-Public-Turing-Test-to-Tell-Computers-and-Humans-Apart on their webpages. In short, to get access to their scientific papers, one have to prove yourself eligible and worthy, i.e. solve a mathematic riddle.
However, the test turned out difficult for some math PhD students and even for some professors. Therefore, the math department wants to write a helper program which solves this task (it is not irrational, as they are going to make money on selling the program).
The task that is presented to anyone visiting the start page of the math department is as follows: given a natural n, compute
where [x] denotes the largest integer not greater than x.
However, the test turned out difficult for some math PhD students and even for some professors. Therefore, the math department wants to write a helper program which solves this task (it is not irrational, as they are going to make money on selling the program).
The task that is presented to anyone visiting the start page of the math department is as follows: given a natural n, compute
where [x] denotes the largest integer not greater than x.
Input
The first line contains the number of queries t (t <= 10^6). Each query consist of one natural number n (1 <= n <= 10^6).
Output
For each n given in the input output the value of Sn.
Sample Input
1312345678910100100010000
Sample Output
0112222334282071609题意就是叫你求上述那个公式在不同N下的结果。思路:很显然的将上述式子换下元另p=3k+7则有 Σ【(p-1)!+1/p-[(p-1)!/p]】 接下来用到一个威尔逊定理,如果p为素数则(p-1)!+1=0(modp),因此不难发现【*】里面要么为0,要么为1,为1的情况就是p为素数的情况,然后统计k=1-n中 有多少个3*k+1素数就好了->打一个大一点的素数表,用一个ans数组记录前缀和就行了= =一开始大小了WA了两发ORZZZ。。。然后还有不知道为什么开始素数表都 打错了= = 手生了么= =|||。。。#include<cstdio>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>using namespace std;const int maxn=1000110;bool is_prime[3*maxn];int ans[maxn];int cnt;void dabiao(){ memset(is_prime,0,sizeof(is_prime)); is_prime[0]=is_prime[1]=1; int n=(maxn-10)*3; int m=maxn-10; for(int i=2;i<=n;i++) { if(is_prime[i]!=0) { continue; } for(int j=2*i;j<=n;j+=i) { is_prime[j]=1; } } ans[0]=0; for(int i=1;i<=m;i++) { if(is_prime[3*i+7]==0) { ans[i]=ans[i-1]+1; } else { ans[i]=ans[i-1]; } }}int main(){ dabiao(); int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); printf("%d\n",ans[n]); } return 0;}
0 0
- 水数论HDU 2973
- HDU 2973 YAPTCHA (数论)
- HDU 1004 数论水题
- HDU ——2973(数论)
- Hdu 2973 YAPTCHA (数论 威尔逊定理)
- ACM 数论 HDU 2973 YAPTCHA 威尔逊定理
- HDU 1576 A/B 数论水题
- HDU 1397 POJ 2262 数论水题.
- HDU 2204 (数论)
- 数论 MillerRabin hdu 3792
- HDU 3123 数论
- 【数论】HDU-4196-Remoteland
- HDU 3988 数论
- HDU 1787 数论
- hdu 1395 数论
- HDU 2104数论 欧几里得
- HDU 1060 数论
- HDU 2161 Primes 数论
- web service 学习笔记
- Errors running builder 'Android Pre Compiler' on project 'CriminalIntent'. java.lang.NullPointerExce
- locate命令的使用
- 小白学c++之模板类
- [LA 6745 Traitor] 树上覆盖DP
- 水数论HDU 2973
- hdu 3999The order of a Tree
- ovirt-智能卡设备
- 学习C++:实践者的方法(Beta1)
- vim user-manual第二章小节
- poj 1151Atlantis线段树+扫面线
- Android开发——通过使用getResource.getIdentifier() 获取layout中组件id
- hdu 5030 Rabbit's String sa+rmq+二分
- 制约程序性能的几大常见因素