hihoCoder太阁最新面经算法竞赛14 register

Ended

Participants:84

Verdict:Wrong Answer
Score:0 / 100
Submitted:2016-11-10 12:24:24

Lang:Java

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
import java.util.Scanner;
public class Main {
    public static void main(String args[]){
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt()-1;
        boolean isPrime[] = new boolean[t+1];
        int primeList[] = new int[t+1];
        for(int i=0;i<=t;i++){
            isPrime[i= true;
        }
        int count=0;
        for(int j=1;j<=t;j++){
            if(isPrime[j]){
                if(Miller_Rabin(j)){
                    count++;
                    primeList[count= j;
                    for(int k=1;k<=count;k++){
                        if(j*primeList[k]>t){
                            break;
                        }
                        isPrime[j*primeList[k]] = false;
                        if(j%primeList[k]==0){
                            break;
                        }
                    }
                }
            }
        }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX