poj Number Sequence

主要先大概确定数的范围，才26368左右，可以先枚举到i总共有多少个数字，然后确定最后一个数。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
 long long  a[100001];
 long long d[100001];
int f(int n){
int k = 0;
while(n){
k++;
n/=10;
}
return k;
}
int main()
{
d[0] = 0;
for(int i = 1;i<=31268;i++)d[i] = d[i-1]+f(i);
a[0] = 0;
for(int i = 1;i<=31268;i++){
a[i] = a[i-1]+d[i];
///if(a[i]>2147483647)printf("%lld ",a[i]);
}
int t;
scanf("%d",&t);
int c[8];
while(t--){
int n;
scanf("%d",&n);
int i;
for( i = 1;i<=31268;i++){
if(a[i]>=n)break;
}
int rest = n-a[i-1];
int k = 1;
while(d[k]<rest)k++;
int ret = rest-d[k-1];
int l = 0;
while(k){
c[l++] = k%10;
k/=10;
}
printf("%d\n",c[l-ret]);
}
getchar();getchar();getchar();getchar();
return 0;
}