hdu 4722 Good Numbers 数位dp(2013 ACM/ICPC Asia Regional Online —— Warmup2 1007)
来源:互联网 发布:windows防火墙关闭不了 编辑:程序博客网 时间:2024/06/06 06:07
#include <cstdio>#include <cstring>#include <cmath>#include <iostream>#include <algorithm>using namespace std;#define LL __int64LL c[20][11];LL find(int a[],int n)//求0~a的符合条件的数{ int i,j,k; memset(c,0,sizeof(c)); int x=0; for(i=1;i<=n;i++)//从最高位开始,按位dp { for(j=0;j<10;j++) for(k=0;k<10;k++) c[i][(j+k)%10]+=c[i-1][j]; for(j=0;j<a[i];j++) c[i][(x+j)%10]++; x=(x+a[i])%10; } if(x==0)c[n][0]++; return c[n][0];}int main(){ int T,tt=0; scanf("%d",&T); while(T--) { int s[20],n,i,j,num=0; LL ans=0; char a[20],b[20]; scanf("%s%s",a,b); n=strlen(b); for(i=0;i<n;i++) s[i+1]=b[i]-'0'; ans+=find(s,n); n=strlen(a); for(i=0;i<n;i++) { s[i+1]=a[i]-'0'; num+=s[i+1]; } ans-=find(s,n); if(num%10==0)ans++; printf("Case #%d: %I64d\n",++tt,ans); } return 0;}
- hdu 4722 Good Numbers 数位dp(2013 ACM/ICPC Asia Regional Online —— Warmup2 1007)
- hdu 4722 Good Numbers 2013 ACM/ICPC Asia Regional Online —— Warmup2
- 2013 ACM/ICPC Asia Regional Online —— Warmup2
- 2013 ACM/ICPC Asia Regional Online — Warmup2 个人总结
- hdu 4726 Kia's Calculation 数论(2013 ACM/ICPC Asia Regional Online —— Warmup2 1011)
- hdu 4717 The Moving Points 三分法(2013 ACM/ICPC Asia Regional Online —— Warmup2 1002)
- hdu 2013 ACM/ICPC Asia Regional Online —— Warmup2解题报告
- hdu 4734 F(x) 数位dp (2013 ACM/ICPC Asia Regional Chengdu Online 1007)
- hdu 4727 The Number Off of FFF 简单题( 2013 ACM/ICPC Asia Regional Online —— Warmup2 1012)
- hdu 4720 Naive and Silly Muggles 外接圆(计算几何) 2013 ACM/ICPC Asia Regional Online —— Warmup2 1005
- 2013 ACM/ICPC Asia Regional Online —— Warmup2 两个水题
- hdu5045||2014 ACM/ICPC Asia Regional Shanghai Online【数位dp】
- HDU 5898 odd-even number (数位DP) 2016 ACM/ICPC Asia Regional Shenyang Online
- HDU 5898&&2016 ACM/ICPC Asia Regional Shenyang Online/ odd-even number [数位DP]【动态规划】
- HDU 5898 odd-even number (数位DP) 2016 ACM/ICPC Asia Regional Shenyang Online
- HDU 5492 Find a path DP —— 2015 ACM-ICPC Asia Regional Hefei Online
- HDU 5492 Find a path(DP)——2015 ACM/ICPC Asia Regional Hefei Online
- HDU 5492 Find a path DP —— 2015 ACM-ICPC Asia Regional Hefei Online
- Jquery Post提交JSON主从关系对象数组到服务器
- 快速排序
- nginx简介(1)
- AS3预加载SWF实例
- Java编程中“为了性能”需做的26件事
- hdu 4722 Good Numbers 数位dp(2013 ACM/ICPC Asia Regional Online —— Warmup2 1007)
- Maven
- 快逸V5实现报表按比例显示
- opencv直方图之查表法,均衡化
- 12款强大的Chrome插件
- cin和getline连用读取非期望结果
- 一个萝卜一个坑:短网址开发运维经验总结分享
- python windows错误
- YII 框架 第六天(1) YII和分页