A. Boring Apartments

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a building consisting of 10 00010 000 apartments numbered from 11 to 10 00010 000, inclusive.

Call an apartment boring, if its number consists of the same digit. Examples of boring apartments are 11,2,777,999911,2,777,9999 and so on.

Our character is a troublemaker, and he calls the intercoms of all boring apartments, till someone answers the call, in the following order:

  • First he calls all apartments consisting of digit 11, in increasing order (1,11,111,11111,11,111,1111).
  • Next he calls all apartments consisting of digit 22, in increasing order (2,22,222,22222,22,222,2222)
  • And so on.

The resident of the boring apartment xx answers the call, and our character stops calling anyone further.

Our character wants to know how many digits he pressed in total and your task is to help him to count the total number of keypresses.

For example, if the resident of boring apartment 2222 answered, then our character called apartments with numbers 1,11,111,1111,2,221,11,111,1111,2,22 and the total number of digits he pressed is 1+2+3+4+1+2=131+2+3+4+1+2=13.

You have to answer tt independent test cases.

Input

The first line of the input contains one integer tt (1≤t≤361≤t≤36) — the number of test cases.

The only line of the test case contains one integer xx (1≤x≤99991≤x≤9999) — the apartment number of the resident who answered the call. It is guaranteed that xx consists of the same digit.

Output

For each test case, print the answer: how many digits our character pressed in total.

Example

input

Copy

4
22
9999
1
777

output

Copy

13
90
1
66

 

解题说明:此题是一道模拟题,按照题目意思,求出前面有多少个数字即可。

#include <stdio.h>
#include<string.h>
#include<ctype.h>

int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int x, num = 0, c = 0;
		scanf("%d", &x);
		num = x % 10;
		while (x != 0)
		{
			c++;
			x /= 10;
		}
		c = (c*(c + 1)) / 2;
		printf("%d\n", c + ((num - 1) * 10));
	}
	return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值