Codeforces ---- Boring Apartments（水题）

题目来源：点击进入原题

Desciptions:

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.

Input:

You have to answer tt independent test cases.

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.

题意：

有一个人特别无聊，他将给公寓房间号全部相同的住户打电话，知道有人接听才停止，现给出接听了电话的住户编号，按下数字的顺序依次是：1−>11−>111−>1111−>2−>22…，问这个无聊的人总共按了几次数字。

Example

input
4
22
9999
1
777

output
13
90
1
66

AC代码：

#include<stdio.h>
#include<iostream>
using namespace std;
void solve()
{
	int n;
	scanf("%d",&n);
	while(n--){
		int m=0,cnt=0;
		scanf("%d",&m);
		int mark=m%10;//得到最后一位 
		while(m>0){
			m=m/10;
			cnt++;
		}
		int times=(mark-1)*10;
		for(int i=1;i<=cnt;i++){
			times+=i;
		}
		printf("%d\n",times);
		
	}
	return ;
}
int main()
{
	solve();
	return 0;
}