hdu3555——Bomb(数位DP)
来源:互联网 发布:ae mac 中文 编辑:程序博客网 时间:2024/04/28 03:59
Bomb
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 3212 Accepted Submission(s): 1142
Problem Description
The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence includes the sub-sequence "49", the power of the blast would add one point.
Now the counter-terrorist knows the number N. They want to know the final points of the power. Can you help them?
Input
The first line of input consists of an integer T (1 <= T <= 10000), indicating the number of test cases. For each test case, there will be an integer N (1 <= N <= 2^63-1) as the description.
The input terminates by end of file marker.
Output
For each test case, output an integer indicating the final points of the power.
Sample Input
3
1
50
500
Sample Output
0
1
15
Hint
From 1 to 500, the numbers that include the sub-sequence "49" are "49","149","249","349","449","490","491","492","493","494","495","496","497","498","499",
so the answer is 15.
Author
fatboy_cw@WHU
Source
2010 ACM-ICPC Multi-University Training Contest(12)——Host by WHU
Recommend
zhouzeyong
解析:
和hdu2089一样,就不多说了。。。
很基础的数位DP
代码:
#include<cstdio>#include<algorithm>using namespace std;//dp[i][0]没有出现49//dp[i][1]没有出现49且最高位为9//dp[i][2]出现了49long long dp[21][3];void init(){ memset(dp,0,sizeof(dp)); dp[0][0]=1; for(int i=1;i<20;i++) { dp[i][0]=(long long)dp[i-1][0]*10-dp[i-1][1]; dp[i][1]=dp[i-1][0]; dp[i][2]=dp[i-1][1]+(long long)dp[i-1][2]*10; }}void read(){ freopen("hdu3555.in","r",stdin); freopen("hdu3555.out","w",stdout); int test; scanf("%d",&test); while(test--) { long long x; scanf("%I64d",&x); x++; long long y=x; int l=0; int wei[30]; bool flag=0; while(y) { wei[++l]=(y%10); y/=10; } long long ret=0; wei[l+1]=0; for(int i=l;i>=1;i--) { ret+=(long long)dp[i-1][2]*wei[i]; if(flag)ret+=dp[i-1][0]*wei[i]; if(!flag&&wei[i]>4)ret+=dp[i-1][1]; if(wei[i+1]==4&&wei[i]==9)flag=true; } printf("%I64d\n",ret); }}int main(){ init(); read(); return 0;}
- hdu3555——Bomb(数位DP)
- HDU3555——Bomb(数位DP)
- HDU3555——Bomb(数位DP)
- hdu3555——Bomb(数位dp)
- hdu3555——Bomb(数位dp)
- HDU3555 Bomb —— 数位DP
- HDU3555——Bomb(数位dp入门)
- HDU3555 Bomb(数位dp)
- HDU3555 Bomb(数位dp)
- HDU3555 Bomb (数位dp)
- hdu3555 Bomb(数位dp)
- HDU3555 Bomb(数位DP)
- hdu3555 Bomb(数位dp)
- 【数位DP】 hdu3555 Bomb
- 【hdu3555】【数位DP】Bomb
- 【数位DP】Bomb HDU3555
- hdu3555 Bomb 数位DP
- HDU3555:Bomb(数位DP)
- SmartThreadPool 线程池
- BoneCP学习笔记——配置参数
- opencv基础 图像反转问题解决
- 利用客户端远程连接Linux服务器端的mysql
- 专题1,2 数据结构(学习笔记)
- hdu3555——Bomb(数位DP)
- HDOJ 2955 Robberies (0/1背包)
- uboot makefile分析
- 解决httpclient传中文乱码问题
- modelsim的 # (vish-4014) No objects found matching '/*'
- IOS开发(1)之UIAlertView
- Android 使用HttpClient和第三方MiME文件上传类库,实现文件上传带进度条
- 关于java的++和--操作符,你真的搞明白了吗?
- jvm-栈与堆区别