Code Submission Evaluation System Login

Datatähti 2018 alku

Start:2017-10-02 00:00:00
End:2017-10-16 00:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2018 alku - Results
History
2017-10-06 21:15:2137
2017-10-06 21:08:0737
2017-10-06 20:59:2537
2017-10-06 20:45:4537
2017-10-06 19:51:080
2017-10-06 19:39:200
Task:Kyselyt
Sender:luxask
Submission time:2017-10-06 21:15:21
Language:C++
Status:READY
Score:37

Feedback

groupverdictscore
#1ACCEPTED12
#2ACCEPTED25
#3WRONG ANSWER0

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.05 / 1.002details
#3WRONG ANSWER0.05 / 1.003details

Code

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

using namespace std;

uint64_t mod(uint64_t x, uint64_t y) {
	return x - y * (x / y);
}

vector<uint64_t> getIndexes() {
	uint64_t count, num;
    vector<uint64_t> indexes;
    cin >> count;

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

uint64_t f(uint64_t x) {
	return 9 * x * pow(10, x-1);
}

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

uint64_t getMiddleNumber(uint64_t index, uint64_t numCount, uint64_t subNumber) {
	uint64_t j = floor(floor(index / numCount) / pow(10, numCount - subNumber));
	return mod(j, 10);
}

uint64_t getLastNumber(uint64_t index, uint64_t numCount) {
	return mod(((index / numCount) - 1), 10);
}

uint64_t getNumberFromIndex(uint64_t index) {
	if (index <= 9)
		return index;

	uint64_t numCount = 1;
	while (index > f(numCount)) {
		index -= f(numCount);
		numCount++;
	}
	switch (uint64_t subNumber = mod(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(uint64_t 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(pow(10, 9));
	real();
    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1000
582
214
723
273
480
280
237
204
134
210
565
640
784
508
846
532
465
952
205
...
view   save

correct output
0
1
7
7
6
1
5
4
7
6
2
2
2
2
8
2
1
3
1
8
...
view   save

user output
0
1
7
7
6
1
5
4
7
6
2
2
2
2
8
2
1
3
1
8
...
view   save

Test 2

Group: 2

Verdict: ACCEPTED

input
1000
615664
916441
627600
279508
126605
944125
25887
440405
352957
206746
951305
821686
716797
333476
430123
167570
619834
411383
459670
...
view   save

correct output
1
2
3
2
2
8
7
9
8
3
7
1
9
8
4
3
1
9
9
6
...
view   save

user output
1
2
3
2
2
8
7
9
8
3
7
1
9
8
4
3
1
9
9
6
...
view   save

Test 3

Group: 3

Verdict: WRONG ANSWER

input
1000
672274832941907421
260504693279721732
646999966092970935
100853063389774434
469646937576313460
292789544562527987
202678876957048242
921044261294332160
293497307441838185
889420403130803486
887773296767104352
272588988734184089
900854413164191389
306838570888252671
321818592757748092
632312861733842235
590425060048634753
921705179835679834
711775852688052272
...
view   save

correct output
7
2
2
0
9
7
7
2
0
4
0
3
0
5
9
9
3
1
2
7
...
view   save

user output
7
2
2
0
9
7
7
2
0
4
0
3
0
5
9
9
3
1
2
7
...
view   save