【UESTC】【windy数】

本文主要是介绍【UESTC】【windy数】，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

1 10

9

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;typedef long long ll;
ll dp[70][10];
ll bits[70];
int cur;
ll dfs(ll pos,int pre,bool flag,bool zeros)
{if(pos <= 0){return 1;}if(!flag && ~dp[pos][pre]) return dp[pos][pre];ll end = flag?bits[pos] : 9;ll ret = 0;for(int i=0;i<=end;i++){if(abs(pre - i) >= 2)  {int tmp  =  i;if(zeros && tmp == 0) tmp = 100;ret += dfs(pos-1,tmp,flag && i == end,zeros && i == 0);}}return flag ? ret : dp[pos][pre] = ret;
}ll solve(ll x)
{cur = 0;ll tt = x;while(tt > 0){bits[++cur] = tt % 10;tt /= 10;}return dfs(cur,100,true,true);}
int main()
{ll a,b;while(scanf("%lld%lld",&a,&b) != EOF){memset(dp,-1,sizeof(dp));printf("%lld\n",solve(b)-1-(solve(a-1) -1));}return 0;
}

这篇关于【UESTC】【windy数】的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！