HDU 5867.Water problem【打表】【8月20】
来源:互联网 发布:全球工业软件市场规模 编辑:程序博客网 时间:2024/06/08 06:17
Water problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 233 Accepted Submission(s): 158
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.
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.
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
3123
Sample Output
3611
思路:打表,O(1)查询
#include<iostream>#include<cstdio>using namespace std;int ty[10]={0,0,6,6,5,5,5,7,6,6};int fnum[10]={3,3,3,5,4,4,3,5,5,4};int en[10]={3,6,6,8,8,7,7,9,8,8};int num[1005]={0}, sum[1005]={0};int main(){ num[0] = 0; for(int i = 1;i < 1005; ++i) { int n = i; if(n >= 1000) { num[i] += (fnum[n/1000]+8); n %= 1000; } if(n >= 100) { if(num[i]) num[i] += 3; num[i] += (fnum[n/100]+7); n %= 100; } bool flag = false; if(n >= 10) { flag = true; if(num[i]) num[i] += 3; if(n < 20) { num[i] += en[n%10]; sum[i] = sum[i-1]+num[i]; continue; } else { num[i] += ty[n/10]; n %= 10; } } if(n) { if(num[i] && !flag) num[i] += 3; num[i] += fnum[n]; } sum[i] = sum[i-1]+num[i]; } int T; scanf("%d", &T); while(T--) { int N; scanf("%d", &N); cout << sum[N] << endl; } return 0;}
0 0
- HDU 5867.Water problem【打表】【8月20】
- HDU 1016.Prime Ring Problem【DFS(递归)】【素数打表】【8月17】
- hdu 5867 Water problem
- HDU 5867 Water problem
- HDU 5867 Water problem
- HDU 5867 Water problem
- Water problem HDU
- Water problem HDU
- Water problem HDU
- Water problem HDU
- HDU 5867 Water problem 【】
- hdu 5867 Water problem
- HDU 4548.美素数【打表】【预处理】【8月11】
- HDU 5104 Primes Problem(打表)
- hdu 5443 The Water Problem
- hdu 5443 The Water Problem
- hdu 5443 water problem (RMQ)
- HDU 5443 The Water Problem
- linux tcp wrappers(对inted端口监视程序生成的服务提供增强的安全性)
- 二维数组做函数参数
- kaldi安装及运行测试例子
- qt platform plugin 'windows'
- 基于标准设计,遵从规范
- HDU 5867.Water problem【打表】【8月20】
- 微擎之关键字回复图文消息进入模块首页
- JavaWeb---session活化与钝化
- poj 1039 Pipe
- 基于Eclipse Maven的Spring4/Spring-MVC/Hibernate4整合之九:Hibernate Session Helper类,用于Entity属性与表字段的操作...
- hadoop安装及其注意事项
- 单片机控制ws2812b
- C++拷贝构造函数详解
- java 延迟阻塞队列详解