Preparing NOJ

Qian Dao Problem

1000ms 65536K

Description:

BLB hates numbers containing factors 2, 3, 5, and 7. How many BLB numbers do you like in the interval $$$[1,n]$$$?

In short, this question will give you a $$$n$$$, please find out how many numbers in $$$[1,n]$$$ do not contain factors 2, 3, 5, 7.

This question is very simple. If you can't solve this problem, you will be transferred to Africa by the boss.

Input:

The first line is an integer T($$$1 \leq T \leq 10^5$$$) representing the number of groups of data.

In the next T lines, an integer $$$n(1 \leq n \leq 10^{18})$$$ per line represents a query.

Output:

For each query, output an answer.

Sample Input:

1
10

Sample Output:

1

Info

NOJ

Provider NOJ

Code NOJ2386

Tags

Submitted 57

Passed 25

AC Rate 43.86%

Date 08/15/2019 01:18:45

Related

Nothing Yet