Problem G. Bomb

时间限制 1000 ms   内存限制 64 MB

The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence includes the sub-sequence "49", the power of the blast would add one point.
Now the counter-terrorist knows the number N. They want to know the final points of the power. Can you help them?
 

输入数据

The first line of input consists of an integer T (1 <= T <= 10000), indicating the number of test cases. For each test case, there will be an integer N (1 <= N <= 2^63-1) as the description.

The input terminates by end of file marker.
 

输出数据

For each test case, output an integer indicating the final points of the power.
 

样例输入

复制
3
1
50
500

样例输出

复制
0
1
15

提交

请先 登录

© 2025 FAQs Contact About