C - 不要62

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <cmath>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)
 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
 #define Close fclose(stdin),fclose(stdout)
 const int maxn = 1e5 + ;
 using namespace std;
 const int MOD = 1e9+;
 typedef long long ll;
 int a[maxn];
 int dp[maxn][];

 int dfs(int pos, int pre, int sta, bool limit){
     if(pos == -) return ;
     if(!limit && dp[pos][sta] != -) return dp[pos][sta];
     int up = limit? a[pos]:;
     int tmp = ;
     for(int i = ;i <= up;i++){
         if(pre ==  && i == )
             continue;
         if(i == )
             continue;
         tmp += dfs(pos-, i, i == , limit && i == a[pos]);
     }
     if(!limit) dp[pos][sta] = tmp;
     return tmp;
 }

 //从 1到x 的满足的数量
 int solve(int x){
     int pos = ;
     while(x){
         a[pos++] = x%;
         x /= ;
     }
     return dfs(pos-, -, , true);
 }

 int main(){
     Faster;
     int l, r;
     while(cin >> l >> r){
         if(l ==  && r == )
             break;
         memset(dp, -, sizeof dp);
         int ans = solve(r) - solve(l-);
         cout << ans << endl;
     }
      return ;
  }

dalao博客：https://blog.csdn.net/wust_zzwh/article/details/52100392