编程介的小学生
2017-12-10 18:17Bomb
Problem Description
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?
Input
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.
Output
For each test case, output an integer indicating the final points of the power.
Sample Input
3
1
50
500
Sample Output
0
1
15
- 点赞
- 回答
- 收藏
- 复制链接分享
2条回答
为你推荐
- 这么久没人能帮我吗? Bmob服务器。在查询数据时只能异步查询,onSuccess出现脏数据 ,请问怎么解决?
- 异步
- 服务器
- bmob
- android
- 数据
- 4个回答
- Fighting the Landlords
- 游戏
- string
- play
- x
- basic
- 1个回答
- Bombing plan
- ui
- as
- numbers
- x
- lines
- 1个回答
- Bomber Man wants to bomb an Array.
- as
- each
- it
- x
- 1个回答
- Bombs
- it
- 1个回答