eolymp
bolt
Try our new interface for solving problems
Problems

Square Free Numbers

Square Free Numbers

The integer is called square-free if it is not divisible by a perfect square, except \textbf{1}. You have to count them! \InputFile First line contains the number of test cases \textbf{t}. Each of the following \textbf{t} lines contains one positive integer \textbf{n} (\textbf{n} ≤ \textbf{10^14}). \OutputFile Print \textbf{t} lines, each line contains the number of positive square-free integers not larger than \textbf{n}.
Time limit 3 seconds
Memory limit 128 MiB
Input example #1
3
1
1000
100000000000000
Output example #1
1
608
60792710185947