C++-1019-Number Sequence

题意：

　　求数字11212312341234512345612345671234567812345678912345678910123456789101112345678910111212345678910111213...的第i位是几？

数位dp打表+二分+暴力模拟

0msAC哦！暴力美学！

 #include <set>
 #include <map>
 #include <cmath>
 #include <queue>
 #include <vector>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 int a[],f[],b[],i_b;
 int digit(int x) {
     if(x>)return ;
     if(x>)return ;
     if(x>)return ;
     if(x>)return ;
     if(x>)return ;
     if(x>)return ;
     if(x>)return ;
     if(x>)return ;
     if(x>)return ;
     return ;
 }
 int main() {
     int i,j,k;
     for(i=; i<=; i++) {
         for(j=i; j>=; j--)
             if(f[j]) {a[i]+=f[j];break;}
             else a[i]+=digit(j);
         f[i]=a[i];
         a[i]+=a[i-];
     }//a[31267]=2147378477
     int T,I;
     for(scanf("%d",&T); T--;) {
         scanf("%d",&I);
         int l=,r=;
         while(r-l>) {
             int mid=(l+r)/;
             if(I>a[mid])l=mid;
             else if(I==a[mid])l=mid,r=mid;
             else r=mid;
         }
         int cnt=I-a[l],num,ans;
         if(!cnt) {cout<<l%<<endl;continue;}
         for(i=l+; cnt; i++)
             for(j=; j<=i && cnt; j++)
                 for(num=j,ans=,k=j; k && cnt; k/=,cnt--,ans++);
         for(i_b=,k=num; k ; b[++i_b]=k%,k/=);
         cout<<b[i_b-ans+]<<endl;
     }
     return ;
 }