前50素数算法

import java.util.Scanner;

public class Hello {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
       int[] primes = new int[50];
       primes[0] = 2;
       int cnt = 1;
       MAIN_LOOP:
       for(int x = 3;cnt<50;x++)
       {
           for(int i = 0; i<cnt;i++){
               if(x%primes[i]==0){
                   continue MAIN_LOOP;
               }
           }
           primes[cnt++] = x;
       }
       for( int k : primes ){
           System.out.print(k+" ");
       }
            }
        }