407347: GYM102769 G Good Number
Memory Limit:512 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
G. Good Numbertime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard output
Alex loves numbers.
Alex thinks that a positive integer $$$x$$$ is good if and only if $$$\lfloor \sqrt[k]{x} \rfloor$$$ divides $$$x$$$.
Can you tell him the number of good positive integers which do not exceed $$$n$$$ ?
InputThe first line of the input gives the number of test cases, $$$T\ (1 \le T \le 10)$$$. $$$T$$$ test cases follow.
For each test case, the only line contains two integers $$$n$$$ and $$$k\ (1 \le n,k \le 10^9)$$$.
OutputFor each test cases, output one line containing "Case #x: y", where $$$\texttt{x}$$$ is the test case number (starting from $$$1$$$), and $$$\texttt{y}$$$ is the answer.
ExampleInput2 233 1 233 2Output
Case #1: 233 Case #2: 43