- Bomb
-
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
500Sample Output
0
1
15
public static void main(String[] args) {
int n;
Scanner in = new Scanner(System.in);
n=in.nextInt();
long m,sum;
for (int i = 0; i < n; i++) {
m = in.nextLong();
sum = cal(m);
System.out.println(sum);
}
}
public static long cal(long m) {
long sum = 0;
for (int i = 49; i < m; i++) {
if (String.valueOf(i).contains("49")) {
sum++;
}
}
return sum;
}
