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-14 14:17:18100
2017-10-14 13:16:3237
2017-10-14 12:51:1837
2017-10-14 12:46:3837
2017-10-14 12:40:1537
2017-10-14 10:46:3737
2017-10-14 10:43:340
2017-10-13 22:50:5837
2017-10-13 19:13:430
Task:Kyselyt
Sender:Ilmari2000
Submission time:2017-10-14 14:17:18
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED12
#2ACCEPTED25
#3ACCEPTED63

Test results

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

Code

#include <iostream>
#include <vector>
#include <cmath>
#include <cstdint>

using namespace std;

uint64_t lpow(uint64_t base, uint64_t exp)
{
	uint64_t ret = 1;
	for(uint64_t i = 0; i < exp; i++)
		ret *= base;
	return ret;
}

uint64_t nthDigit(uint64_t x, uint64_t pos)
{
	uint64_t digits = 0;
	uint64_t tmpnum = x;
	while(tmpnum > 0) { digits++; tmpnum /= 10; }

	return (x / (uint64_t)lpow(10, digits - pos)) % 10;
}


int main()
{
	vector<uint64_t> places;

	uint64_t count;
	cin >> count;
	
	places.resize(count);

	for(uint64_t i = 0; i < count; i++)
		cin >> places[i];

	for(uint64_t i = 0; i < count; i++)
	{
		uint64_t num = 1;
		uint64_t exp = 0;
		places[i]--;

		while(1)
		{
			if(places[i] - 9 * lpow(10, exp) * (exp + 1) < places[i])
			{
				places[i] -= 9 * lpow(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)
		{
			uint64_t sub = 0;
			uint64_t 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 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: ACCEPTED

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