问题 I have been given x and k , where x is the number of factors of a number A , and k is the number of prime factors of A . Given x and k , I have to find out whether such an A exists. For example: INPUT : 4 2 OUTPUT : 1 Since 6 is a number that has 4 factors 1, 2, 3, 6 out of which 2 are prime(2, 3). Also it is given that x and k can have any values between 1 and 10 9 . Here is my code for the this: long long int x, k; scanf("%lld%lld", &x, &k); int ans = 0; bool stop = false; for (long long