CSES - Datatähti 2018 alku - Results
Submission details
Task:Kyselyt
Sender:luxask
Submission time:2017-10-06 20:59:25 +0300
Language:C++
Status:READY
Result:37
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED25
#30
Test results
testverdicttimegroup
#1ACCEPTED0.07 s1details
#2ACCEPTED0.05 s2details
#30.05 s3details

Code

#include <iostream>
#include <vector>
#include <math.h>
#include <string>

using namespace std;

vector<unsigned long long int> getIndexes() {
	unsigned long long int count, num;
    vector<unsigned long long int> indexes;
    cin >> count;

    for (unsigned long long int i = 0; i < count; ++i)
    {
    	cin >> num;
    	indexes.push_back(num);
    }
    return indexes;
}

unsigned long long int f(unsigned long long int x) {
	return 9 * x * pow(10, x-1);
}

unsigned long long int getFirstNumber(unsigned long long int index, unsigned long long int numCount) {
	return floor(index / (numCount * pow(10, numCount-1))) + 1;
}

unsigned long long int getMiddleNumber(unsigned long long int index, unsigned long long int numCount, unsigned long long int subNumber) {
	long int j = floor(floor(index / numCount) / pow(10, numCount - subNumber));
	return j % 10;
}

unsigned long long int getLastNumber(unsigned long long int index, unsigned long long int numCount) {
	return ((index / numCount) - 1) % 10;
}

unsigned long long int getNumberFromIndex(unsigned long long int index) {
	if (index <= 9)
		return index;

	unsigned long long int numCount = 1;
	while (index > f(numCount)) {
		index -= f(numCount);
		numCount++;
	}
	switch (unsigned long long 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;
	}
}

void test(unsigned long long int n) {
	string right, guess;
	for (unsigned i=1; i<n; i++)
    	guess += to_string(getNumberFromIndex(i));
    for (unsigned i=1; i<n; i++)
    	right += to_string(i);
    right = right.substr(0, n-1);
    if (right.compare(guess) == 0)
    	cout << "Right!";
   	else
   		cout << right << '\n' << guess << '\n';
}

void real() {
	auto indexes = getIndexes();
    for (unsigned i=0; i<indexes.size(); i++)
    	cout << getNumberFromIndex(indexes.at(i)) << '\n';
}

int main() {
	//test(1000000000000000000);
	real();
    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1000
582
214
723
273
...

correct output
0
1
7
7
6
...

user output
0
1
7
7
6
...
Truncated

Test 2

Group: 2

Verdict: ACCEPTED

input
1000
615664
916441
627600
279508
...

correct output
1
2
3
2
2
...

user output
1
2
3
2
2
...
Truncated

Test 3

Group: 3

Verdict:

input
1000
672274832941907421
260504693279721732
646999966092970935
100853063389774434
...

correct output
7
2
2
0
9
...

user output
7
2
2
0
9
...
Truncated