UESTC 250 windy数

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007

int dp[20][10];

int A,B;

void init()
{
Clean(dp,0);
rep(i,0,9) dp[1][i] = 1;
rep(i,2,10)
rep(j,0,9)
rep(k,0,9)
if ( abs( j - k ) > 1 ) dp[i][j]+=dp[i-1][k];
}

int cal(int x)
{
int ans = 1;
int bit[12];
bit[0] = 0;
int l = 0;

while( x )
{
bit[++l] = x % 10;
x/=10;
}
//长度小于l的数
rep(i,1,l-1)
{
rep(j,1,9) ans+=dp[i][j];
}
//长度等于l且最高位不到上限
rep(i,1,bit[l]-1) ans+=dp[l][i];
//长度等于l最高位到上限
Rrep(i,l-1,1)
{
rep(j,0,bit[i] - 1)
if ( abs( bit[i+1] - j ) > 1 ) ans+=dp[i][j];
if ( abs( bit[i+1] - bit[i] ) <= 1 ) break;
}
return ans;
}

int main()
{
init();
scanf("%d %d",&A,&B);
printf("%d\n"  , cal(B+1) - cal(A) );
return 0;
}

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007

int dp[20][11];  //dp[i][j]处理到第i位时，上一位的值为j
int digit[20];
int A,B;

int dfs(int pos , int x ,  bool flag)
{
if ( pos == 0 ) return 1;
if ( !flag && dp[pos][x]!=-1 ) return dp[pos][x];
int ed = flag?digit[pos]:9;
int ans = 0;
rep(i,0,ed)
{
if ( x < 10 && abs(i-x)<2 ) continue; //x为10表示前面所有位取的都是0，也就是前导零
ans+=dfs( pos-1 , (x==10 && i == 0)?10:i , flag && i == ed );
}
if ( !flag ) dp[pos][x] = ans;

return ans;
}

int cal(int x)
{
int len = 0;
while(x)
{
digit[++len] = x % 10;
x /= 10;
}
return dfs(len,10,1);
}
int main()
{
Clean(dp,-1);
scanf("%d %d",&A,&B);
printf("%d\n"  , cal(B) - cal(A-1) );
return 0;
}