Kyselyt

#include <iostream>
#include <cmath>
 
typedef unsigned long long int huge;
// max value ~ 1.8e19
 
using namespace std;
 
huge startpos(int n)
{
	if (n==1) return 10;
	return startpos(n-1)+(huge)n*(huge)(9*pow(10,n-1));
}
 
int getstage(huge n)
{
	int c=1;
	while (1)
	{
		if ((n>=startpos(c))&&(n<startpos(c+1))) return c;
		c++;
	}
}
 
int unelegant(huge n)
{
	if (n<10) return (int)n;
	int N=-1;
	huge stage=getstage(n)+1;
	huge s=startpos(stage-1);
	for (huge i=0;i<stage;++i)
		if ((n-s)%stage==i) 
			N=( (n-s-i)/(stage*(huge)pow(10,stage-1-i))+(huge)(i==0) )%10;
	return N;
}
 
int main(int argc, char** argv)
{
	int maara; cin>>maara;
	huge values[maara];
	for (int i=0;i<maara;++i) cin>>values[i];
	for (int i=0;i<maara;++i) cout<<unelegant(values[i])<<endl;
	//huge n; cin>>n; cout<<unelegant(n)<<endl;
 
 
	// when n>=startpos(5) output turns into gibberish
	// 16 999999989999999999999999000000 1 000000000000000010000000000000
	/*
	for (int i=2;i<18;++i)
	{
		cout<<startpos(i)<<" ";
		for (int j=-30;j<31;++j)
			cout<<unelegant(startpos(i)+(huge)j);
		cout<<endl;
	}*/
 
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED