int main() { //assert(freopen("input.txt", "r", stdin)); //assert(freopen("output.txt", "w", stdout)); //std::ios::sync_with_stdio(0); //std::cin.tie(0); for (int i = 2; i * i < 32000; ++i) if (!sieve[i]) for (int j = i * i; j < 32000; j += i) sieve[j] = 1; for (int i = 2; i < 32000; ++i) if (!sieve[i]) pr[++pn] = i; long long n; scanf("%lld", &n); for (int p = 2; p <= 60; ++p) { int k = pow(n, 1.0 / p); if (bpow(k, p) == n && ok(k)) { printf("%d %d", k, p); return 0; } if (bpow(k + 1, p) == n && ok(k + 1)) { printf("%d %d", k + 1, p); return 0; } } puts("0"); }
double bpow(double x, int n) { double y,z; if(n == 0) return 1.0; y = bpow(x, n / 2); z = y * y; if(n & 1) { if(n > 0) z *= x; else z /= x; } return z; }
int main() { int num, iii; scanf(" %d", &num); for (iii = 0; iii < num; iii++) { ubig K, C, S; scanf(" %llu %llu %llu", &K, &C, &S); if (S < K) { printf("Case #%d: IMPOSSIBLE\n", iii + 1); continue; } ubig e = bpow(K, C - 1); printf("Case #%d: ", iii + 1); int i; for (i = 0; i < K; i++) { printf("%llu ", i * e + 1); } printf("\n"); } return 0; }