hdu 2303

The Embarrassed Cryptographer

Time Limit: 3000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 393    Accepted Submission(s): 116

Problem Description

The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic keys are created from the product of two primes, and are believed to be secure because there is no known method for factoring such a product effectively.
What Odd Even did not think of, was that both factors in a key should be large, not just their product. It is now possible that some of the users of the system have weak keys. In a desperate attempt not to be fired, Odd Even secretly goes through all the users keys, to check if they are strong enough. He uses his very poweful Atari, and is especially careful when checking his boss' key.

 

Input

The input consists of no more than 20 test cases. Each test case is a line with the integers 4 <= K <= 10 ¹⁰⁰ and 2 <= L <= 10 ⁶. K is the key itself, a product of two primes. L is the wanted minimum size of the factors in the key. The input set is terminated by a case where K = 0 and L = 0.

 

Output

For each number K, if one of its factors are strictly less than the required L, your program should output "BAD p", where p is the smallest factor in K. Otherwise, it should output "GOOD". Cases should be separated by a line-break.

 

Sample Input

  
  

   
   143 10
143 20
667 20
667 30
2573 30
2573 40
0 0
  
  

 

Sample Output

  
  

   
   GOOD
BAD 11
GOOD
BAD 23
GOOD
BAD 31
  
  

 

Source

NCPC2005

 

Recommend

zty

//建立素数表,这里N至少取1000004,因为比1000000大的素数是1000003,否则会WA。
import java.io.*;
import java.util.*;
import java.math.*;
public class Main{
    static final int  N = 1000005;
    public static int prime[] = new  int[N];
    public static boolean hash[] = new boolean[N];
    public static void Prime()
    {
        Arrays.fill(hash, (boolean)false);
        int n = (int)Math.sqrt(1.0 * N);
        for(int i = 2; i < n; i++)
            if(!hash[i])
            for(int j = 2 * i; j < N; j += i)
                hash[j] = true;
        int p = 0, i;
        for(i = 2; i < N; i++)
            if(!hash[i])
                prime[p++] = i;
    } 
    public static void main(String[] args)
    {
        Prime();
        Scanner cin = new Scanner(System.in);
        BigInteger k;
        boolean flag;
        while(cin.hasNext())
        {
            k = cin.nextBigInteger();
            int l;
            l = cin.nextInt();
            if(k.intValue() == 0 && l == 0)
                break;
            flag = true;
            for(int i = 0; prime[i] < l; i++)
            {
                BigInteger a = BigInteger.valueOf(prime[i]);
                if(k.remainder(a).intValue() == 0)
                {
                    System.out.print("BAD ");
                    System.out.println(prime[i]);
                    flag = false;
                    break;
                }
            }
            if(flag)
            {
                System.out.println("GOOD");
            }
        }
    }
}