-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAPS.cpp
63 lines (51 loc) · 840 Bytes
/
APS.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include<iostream>
#include<cmath>
#define MAX 1000000
using namespace std;
long long int list[MAX];
int seive[MAX];
int prime[MAX];
void seive_gen() {
int i,j,sq;
int k;
//sq=sqrt(MAX);
seive[0]=seive[1]=1;
for(int i=2;i<MAX;i+=2) seive[i]=1;
for(i=3;i<3163;i+=2) {
for(j=i*i,k=2*i;j<MAX;j+=k)
seive[j]=1;
}
j=-1;
for(int i=2;i<MAX;++i) {
if(seive[i]==0)
prime[++j]=i;
}
}
int small(int num) {
long long int j;
int flag=0;
for(j=2;j<2166;++j) {
if(num%prime[j]==0) {
flag=1;
return prime[j];
}
}
return num;
}
int main()
{
int t;
list[0]=list[1]=0;
long long int n,prime1;
seive_gen();
for(long long int i=2;i<MAX;++i) {
list[i]=list[i-1]+small(i);
}
cin>>t;
while(t--) {
cin>>n;
cout<<list[n]<<"\n\n";
}
//for(int i=0;i<MAX;++i) cout<<prime[i]<<" ";
return 0;
}