CRYPTON - The Embarrassed Cryptographer
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.
The input consists of no more than 20 test cases. Each test case is a line with the integers 4 ≤ K ≤ 10^100 and 2 ≤ L ≤ 10^6 . 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.
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.
Input: 143 10 143 20 667 20 667 30 2573 30 2573 40 0 0 Output: GOOD BAD 11 GOOD BAD 23 GOOD BAD 31
@<a href="http://www.spoj.com/users/bnslakki/">bnslakki</a> try itLast edit: 2016-12-02 06:27:31
@devil : think of using the string as parts and not as a whole
i am new to such problems...Can anyone tell me how to store very large like K in this case(4<k<10^100) in c++.
Forgot to look at "strictly less than".