B-number

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1833 Accepted Submission(s): 1000

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

Sample Output

Author wqb0039
Source 2010 Asia Regional Chengdu Site ―― Online Contest

题意：给定一个数n，求1-n内含有13且能被13整除的数。

数位dp，比前面的多了一个限制条件是能被13整除，因此在dp时需要加一个mod，假如mod==0，说明能被13整除。

代码：

/* ***********************************************
Author :xianxingwuguan
Created Time :2014-2-7 12:33:32
File Name :1.cpp
************************************************ */
#pragma comment(linker, "/STACK:102400000,102400000")
#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #include 
      
        #include 
       
         #include 
        
          #include 
         
           #include 
          
            #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
                using namespace std; #define INF 0x3f3f3f3f #define eps 1e-8 #define pi acos(-1.0) typedef long long ll; int dp[15][15][3],num[20]; int dfs(int pos,int mod,int st,bool flag){ if(pos==0)return st==2&&mod==0; if(flag&&dp[pos][mod][st]!=-1)return dp[pos][mod][st]; int u=flag 9:num[pos]; int ans=0; for(int d=0;d<=u;d++){ int tmod=(mod*10+d)%13; if(st==2||(st==1&&d==3))ans+=dfs(pos-1,tmod,2,flag||d
                
                 >n)cout<

hdu 3652 数位dp

B-number