//652K 0MS G++
#include <stdio.h>
#include <string.h>
int caseNum;
long long numberAcc[31300];
void init() {
int curIncStep = 1;
long long sum = 0;
long long length = 0;
long long carry = 10;
for (int i = 1; i < 31300; i++) {
if (i == carry) {
curIncStep++;
carry *= 10;
}
if (i == 1) {
numberAcc[i] = 1;
length = 1;
sum = 1;
} else {
length += curIncStep;
numberAcc[i] = sum + length;
sum += length;
}
// printf("%d %lld\n",i, numberAcc[i]);
}
}
int getLength(int num) {
int length = 0;
while(num) {
num /= 10;
length++;
}
return length;
}
// long long binarySearchFirstLarger(int num) {
// int begin = 0;
// int end = 31299;
// int mid = (begin + end)>>1;
// while(1) {
// // printf("PPP\n");
// if (numberAcc[mid] >= num && ((mid == 0)|| numberAcc[mid-1] < num)) {
// return numberAcc[mid-1];
// } else if (numberAcc[mid-1] >= num) {
// end = mid - 1;
// } else if (numberAcc[mid] < num) {
// begin = mid + 1;
// }
// mid = (begin + end)>>1;
// }
// return -1;
// }
char getChar(int num) {
int numOfNumberBefore = 0;
int curNumber = 1;
int prevNumber = 0;
int stepAdd = 1;
int index = 1;
while(numberAcc[index] < num) {
index++;
}
num -= numberAcc[index-1];
curNumber = 1;
numOfNumberBefore = 0;
stepAdd = 1;
int carryWeight = 10;
while(1) {
if (numOfNumberBefore > num-1) {
break;
} else {
if (curNumber == carryWeight) {
stepAdd++;
carryWeight *= 10;
}
curNumber++;
numOfNumberBefore += stepAdd;
}
}
curNumber--; // !!!!!!!!!!!!!!!!
numOfNumberBefore = numOfNumberBefore - stepAdd;
// printf("%d %d\n", num, numOfNumberBefore);
num -= numOfNumberBefore;
// num -= 1;
int numLength = getLength(curNumber);
// printf("FINAL %d %d %d\n", curNumber, num, numLength);
int tmp = 1;
for (int i = 1; i <= numLength - num; i++) {
tmp *= 10;
}
int res = (curNumber/tmp)%10;
// printf("R %d\n", res);
printf("%d\n", res);
}
int main() {
init();
scanf("%d", &caseNum);
for (int i = 0; i < caseNum; i++) {
int num;
scanf("%d", &num);
getChar(num);
// printf("%c\n", getChar(num));
}
}
又是一道对数组位置等细节的要求高的题,
思想其实很简单,就是单纯的模拟(不过这个是有现成公式的,但对数学要求高,就没用,还是用了模拟的路子)。
一开始没有numberAcc数组(该数组代表, 对于某个数X,序列的长度: 比如:2 -> 112,就是3 , 3->112123 就是6,注意要是long long类型的 )先预处理出来,每次都现处理,直接TLE了。
后来预处理了以后,就0ms AC....
后面的细节对我这种人来说太痛苦了,完全是试错,发现这种数学位置和序数基数转换的操作,很不擅长,以后要专门理一下,自己做几条准则.