|
Water problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1063 Accepted Submission(s): 444
Problem Description
If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3+3+5+4+4=19 letters used in total.If all the numbers from 1 to n (up to one thousand) inclusive were written out in words, how many letters would be used?
Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of "and" when writing out numbers is in compliance with British usage.
Input
There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases.
For each test case: There is one positive integer not greater one thousand.
Output
For each case, print the number of letters would be used.
Sample Input
Sample Output
Author
BUPT
Source
|
————————————————————————————————————
求1~n所有数字用英语写出来的字母数量
思路:打表
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>
using namespace std;
#define LL long long
const int INF = 0x3f3f3f3f;
int a[1005];
int sum[1005];
int main()
{
a[0]=0;
a[1]=3;
a[2]=3;
a[3]=5;
a[4]=4;
a[5]=4;
a[6]=3;
a[7]=5;
a[8]=5;
a[9]=4;
a[10]=3;
a[11]=6;
a[12]=6;
a[13]=8;
a[14]=8;
a[15]=7;
a[16]=7;
a[17]=9;
a[18]=8;
a[19]=8;
a[20]=6;
a[30]=6;
a[40]=5;
a[50]=5;
a[60]=5;
a[70]=7;
a[80]=6;
a[90]=6;
a[1001]=7;//bai
a[1002]=8;//qian
a[1003]=3;//and;
for(int i=21; i<100; i++)
{
if(i%10==0)
continue;
else a[i]=a[i/10*10]+a[i%10];
}
for(int i=100; i<1000; i++)
{
if(i%100==0)
a[i]=a[i/100]+a[1001];
else
a[i]=a[i/100]+a[1001]+a[1003]+a[i%100];
}
a[1000]=a[1]+a[1002];
sum[0]=0;
for(int i=1; i<=1000; i++)
sum[i]=sum[i-1]+a[i];
int T,n;
for(scanf("%d",&T); T--;)
{
scanf("%d",&n);
printf("%d\n",sum[n]);
}
return 0;
}