Kyselyt

#include <iostream>
#include <vector>
#include <math.h>
 
using namespace std;
 
vector<int> getIndexes() {
	int count, num;
    vector<int> indexes;
    cin >> count;
 
    for (int i = 0; i < count; ++i)
    {
    	cin >> num;
    	indexes.push_back(num);
    }
    return indexes;
}
 
int f(int x) {
	return 9 * x * pow(10, x-1);
}
 
int getFirstNumber(int index, int numCount) {
	return floor(index / (numCount * 10)) + 1;
}
 
int getMiddleNumber(int index, int numCount, int subNumber) {
	return floor(floor(index / numCount) / pow(10, numCount - subNumber));
}
 
int getLastNumber(int index, int numCount) {
	return (index / numCount) - 1;
}
 
int getNumberFromIndex(int index) {
	if (index <= 9)
		return index;
 
	int numCount = 1;
	while (index >= f(numCount)) {
		index -= f(numCount);
		numCount++;
	}
	switch (int subNumber = index % numCount){
		case 0:
			return getLastNumber(index, numCount);
			break;
		case 1:
			return getFirstNumber(index, numCount);
			break;
		default:
			return getMiddleNumber(index, numCount, subNumber);
			break;
	}
}
 
int main() {
    auto indexes = getIndexes();
    for (unsigned i=0; i<indexes.size(); i++)
    	cout << getNumberFromIndex(indexes.at(i)) << '\n';
    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED