mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
49 lines
1.1 KiB
C++
49 lines
1.1 KiB
C++
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <algorithm>
|
|
using namespace std;
|
|
int bit[15];
|
|
int dp[15][15][3];
|
|
int dfs(int pos,int mod,int have,int lim)
|
|
{
|
|
int num,i,ans,mod_x,have_x;
|
|
if(pos<=0)
|
|
return mod == 0 && have == 2;
|
|
if(!lim && dp[pos][mod][have] != -1)
|
|
return dp[pos][mod][have];
|
|
num = lim?bit[pos]:9;
|
|
ans = 0;
|
|
for(i = 0; i<=num; i++)
|
|
{
|
|
mod_x = (mod*10+i)%13;
|
|
have_x = have;
|
|
if(have == 0 && i == 1)
|
|
have_x = 1;
|
|
if(have == 1 && i != 1)
|
|
have_x = 0;
|
|
if(have == 1 && i == 3)
|
|
have_x = 2;
|
|
ans+=dfs(pos-1,mod_x,have_x,lim&&i==num);
|
|
}
|
|
if(!lim)
|
|
dp[pos][mod][have] = ans;
|
|
return ans;
|
|
}
|
|
int main()
|
|
{
|
|
int n,len;
|
|
while(~scanf("%d",&n))
|
|
{
|
|
memset(bit,0,sizeof(bit));
|
|
memset(dp,-1,sizeof(dp));
|
|
len = 0;
|
|
while(n)
|
|
{
|
|
bit[++len] = n%10;
|
|
n/=10;
|
|
}
|
|
printf("%d\n",dfs(len,0,0,1));
|
|
}
|
|
return 0;
|
|
}
|