Kyselyt

#include <iostream>
#include <vector>
#include <cmath>
 
using namespace std;
 
int nthDigit(int x, int pos)
{
	int digits = 0;
	int tmpnum = x;
	while(tmpnum > 0) { digits++; tmpnum /= 10; }
 
	return (x / (int)pow(10, digits - pos)) % 10;
}
 
 
int main()
{
	vector<int> places;
 
	int count;
	cin >> count;
	
	places.resize(count);
 
	for(int i = 0; i < count; i++)
		cin >> places[i];
 
	for(int i = 0; i < count; i++)
	{
		int num = 1;
		int exp = 0;
		places[i]--;
 
		while(1)
		{
			if(places[i] - 9 * pow(10, exp) * (exp + 1) > 0)
			{
				places[i] -= 9 * pow(10, exp) * (exp + 1);
				num *= 10;
				exp++;
			}
			else
				break;
		}
//		cout << "pla: " << places[i] << endl;
//		cout << "num: " << num << endl;
//		cout << "dig: " << exp + 1 << endl;
//		cout << "div: " << places[i] / (exp + 1) << endl;
//		cout << "mod: " << places[i] % (exp + 1) << endl;
	
		num += places[i] / (exp + 1);
//		cout << "num: " << num << endl;
		//places[i] % (exp + 1);
	
		/*while(1)
		{
			int sub = 0;
			int tmpnum = num;
			while(tmpnum > 0) { sub++; tmpnum /= 10; }
			if(places[i] - sub > 0)
			{
				places[i] -= sub;
				num++;
			}
			else
				break;
		}*/
 
		cout << nthDigit(num, places[i] % (exp + 1) + 1) << endl;
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: RUNTIME ERROR