B-number
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 14 Accepted Submission(s) : 8
Problem Description
A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. Your task is to calculate how many wqb-numbers from 1 to n for a given integer n.
Input
Process till EOF. In each line, there is one positive integer n(1 <= n <= 1000000000).
Output
Print each answer in a single line.
Sample Input
13 100 200 1000
Sample Output
1 1 2 2
//题意:
有一种数,它包含“13”这个子串,并且能被13整除,给你一个n,问1-n里有几个这样的数。
//思路:
数位DP:开一个三维dp数组:
dp[i][j][k]:
i表示数位;
j表示这个数%13后的余数;
k表示3种状态:
k==0时:不含13且末尾不是1;
k==1时:不含13且末尾是1;
k==2时:已经包含13;
有一点,数位DP的dp数组中存放的都是一般情况,即各位0-9均可取的情况,且从高位往低位取。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int n;
int bit[20];
int dp[20][20][5];
//dp[i][j][k]
//i:数位
//j:余数
//k:3种操作状况,0:末尾不是1, 1:末尾是1, 2:含有13
//flag表示当前位的数是否已取到这一位的最大值
//比如:2346:当百位取2的时候,十位和个位可以取0-9的任意数,但百位取3的时候,十位就必须小于等于4了
//mod是余数,have表示k的3种状态
int dfs(int pos,int mod,int have,int flag)
{
if(pos<=0)
return mod==0&&have==2;
if(!flag&&dp[pos][mod][have]!=-1)
return dp[pos][mod][have];
int num=flag?bit[pos]:9;
int ans=0;
int mod2,have2;
for(int i=0;i<=num;i++)
{
mod2=(mod*10+i)%13;
have2=have;
if(have==0&&i==1)
have2=1;
if(have==1&&i!=1)
have2=0;
if(have==1&&i==3)
have2=2;
ans+=dfs(pos-1,mod2,have2,flag&&i==num);
}
if(!flag)
dp[pos][mod][have]=ans;
return ans;
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
memset(bit,0,sizeof(bit));
memset(dp,-1,sizeof(dp));
int len=0;
int x=n;
while(x)
{
bit[++len]=x%10;
x=x/10;
}
int ans=dfs(len,0,0,1);
printf("%d\n",ans);
}
return 0;
}