[Offer收割]编程练习赛12 register

Ended

Participants:1323

Verdict:Accepted
Score:100 / 100
Submitted:2017-04-02 12:04:52

Lang:G++

Edit
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
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<vector>
using namespace std;
int prime[1000006];
int Isprime[1000006];
int shai(int n)
{
    memset(Isprime,0,sizeof(Isprime));
    int cnt=0;
    Isprime[1]=1;
    for(int i=2;i<n;i++)
    if(Isprime[i]==0)
    {
        prime[++cnt]=i;
        for(int j=i*2;j<=n;j+=i)
        {
            Isprime[j]=1;
        }
    }
    return cnt;
}
int main()
{
    int cnt=shai(1000000);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=cnt;i++)
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX