A - Happy Birthday, Polycarp!

Codeforces Round #606 (Div. 2, based on Technocup 2020 Elimination Round 4)

A. Happy Birthday, Polycarp!

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Hooray! Polycarp turned nn years old! The Technocup Team sincerely congratulates Polycarp!

Polycarp celebrated all of his nn birthdays: from the 11-th to the nn-th. At the moment, he is wondering: how many times he turned beautiful number of years?

According to Polycarp, a positive integer is beautiful if it consists of only one digit repeated one or more times. For example, the following numbers are beautiful: 11, 7777, 777777, 4444 and 999999999999. The following numbers are not beautiful: 1212, 1111011110, 69696969 and 987654321987654321.

Of course, Polycarpus uses the decimal numeral system (i.e. radix is 10).

Help Polycarpus to find the number of numbers from 11 to nn (inclusive) that are beautiful.

Input

The first line contains an integer tt (1≤t≤1041≤t≤104) — the number of test cases in the input. Then tt test cases follow.

Each test case consists of one line, which contains a positive integer nn (1≤n≤1091≤n≤109) — how many years Polycarp has turned.

Output

Print tt integers — the answers to the given test cases in the order they are written in the test. Each answer is an integer: the number of beautiful years between 11 and nn, inclusive.

Example

6
18
1
9
100500
33
1000000000

　output

10
1
9
45
12
81

　　题目地址：https://codeforces.com/contest/1277/problem/A

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main(void)
{
	int t,n;
	int z[10]={0,1,2,3,4,5,6,7,8,9};
	int b[15];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		int ans=0;
		for(int i=1;i<=9;i++){
			long long int x=i;
			while(x<=n)//枚举iii…i<=n
			{
				ans++;
				x=10*x+i;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}