Problem H. Hotel in Ves Lagos

Problem H. Hotel in Ves Lagos

Input le: hotel.in

Output le: hotel.out

Time limit: 1 second

Memory limit: 256 megabytes

A new hotel is being built in the city of Ves Lagos. The hotel will have an innite number of rooms (it is out of fashion to build hotels with nite numbers of rooms). The new hotel also tries to cater for superstitious guests. The most common superstition in Ves Lagos is that the number 13 brings bad luck. Accordingly, only numbers whose decimal forms do not contain the substring \13" will be used to label the rooms in the new hotel. For example, the hotel will have rooms numbered 1, 3, 14, 31, 123, but will not have the rooms 13, 132, 913, 1308, 1313. Let's consider the list of all room numbers, ordered increasingly. Find the N-th number in this list (members of the list are indexed from 1). Input The input le contains several test cases. The rst line of the le contains T (1 ≤ T ≤ 100), the number of test cases. Each of the following T lines describes one test case and contains the integer N (1 ≤ N ≤ 1018). Output The output le should contain exactly T lines, with the i-th line containing exactly one integer, the answer for the i-th test case from the input le.

Example hotel.in hotel.out

3

20

150

1

21

162

1

//题意，原来 1-n 标号的房间，现在，不想出现数字中有13 数字，问，原来的第 n 个们应标号为多少？

题解：由于数据特别大，所以要数位DP，套好模板后，还需要二分搜索标号为多少，注意的是，要尽量小，不然有一些重叠的

 #include <iostream>
 #include <stdio.h>
 #include <string.h>
 #include <algorithm>
 #include <stdlib.h>
 #include <map>
 #include <queue>
 #include <set>
 #include <vector>
 using namespace std;
 #define LL unsigned long long
 #define MX 100005

 LL n;
 LL dp[][];

 void Init()
 {
     dp[][]=;
     for (int i=;i<=;i++)
     {
         dp[i][]=dp[i-][]*+dp[i-][];
         dp[i][]=dp[i-][];
         dp[i][]=dp[i-][]*-dp[i-][];
     }
 }

 LL slove(LL x)
 {
     LL a[],len=;
     while (x)
     {
         a[++len]=x%;
         x/=;
     }
     a[len+]=;

     LL ans =;
     int flag=;
     for (int i=len;i>;i--)
     {
         ans+=dp[i-][]*a[i];
         if (flag)
             ans+=dp[i-][]*a[i];
         if (!flag&&((a[i]==&&a[i-]>)||(a[i]>)))
             ans+=dp[i-][];
         if (a[i]==&&a[i+]==)
             flag=;
     }
     return ans;
 }

 int main()
 {
     freopen("hotel.in","r",stdin);
     freopen("hotel.out","w",stdout);
     Init();
     int t;
     cin>>t;
     while (t--)
     {
          cin>>n;
          LL l=,r=1e19;
          LL ans;
          while (l<=r)
          {
              LL mid = (l+r)>>;
              LL tp = mid-slove(mid+);
              if (tp>=n)
              {
                  ans = mid;
                  r=mid-;
              }
              else if (tp<n)
                  l=mid+;
          }
          cout<<ans<<endl;
     }
     return ;
 }