Boring Apartment的解法

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 x� 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.

你必须回答t�独立测试用例。

Input

输入的第一行包含一个整数t� (1≤T≤361≤�≤36） — 测试用例的数量。

测试用例的唯一一行包含一个整数x� (1≤x≤99991≤�≤9999） — 接听电话的居民的公寓号码。保证x�由相同的数字组成。

Output

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

#include<stdio.h>

int main()

{

int a,b,c,d,s;

scanf("%d",&a);

while(a--)

{

s=0;

scanf("%d",&b);

d=b%10;

for(c=0;b>0;c++)

b=b/10;

if(c==1)

s+=1;

else if(c==2)

s+=3;

else if(c==3)

s+=6;

else if(c==4)

s+=10;

printf("%d\n",s+(d-1)*10);

}

return 0;

}