CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:Swarm
Submission time:2019-10-09 20:45:06 +0300
Language:C++17
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.01 s1, 2, 3details
#30.01 s1, 2, 3details
#40.01 s1, 2, 3details
#50.01 s1, 2, 3details
#60.01 s1, 2, 3details
#70.01 s1, 2, 3details
#80.01 s1, 2, 3details
#90.01 s1, 2, 3details
#100.01 s1, 2, 3details
#110.01 s1, 2, 3details
#120.01 s1, 2, 3details
#130.18 s2, 3details
#140.20 s2, 3details
#150.19 s2, 3details
#160.19 s2, 3details
#170.20 s2, 3details
#180.18 s2, 3details
#190.01 s2, 3details
#200.01 s2, 3details
#210.27 s3details
#220.36 s3details
#230.35 s3details
#240.35 s3details
#250.36 s3details
#260.27 s3details
#270.01 s3details
#280.01 s3details

Compiler report

input/code.cpp:27:3: warning: integer constant is so large that it is unsigned
   10'000'000'000'000'000'000
   ^~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:73:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a%powsOf10[i] == a)
       ~~~~~~~~~~~~~~^~~~
input/code.cpp:82:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (b % powsOf10[i] == b)
        ~~~~~~~~~~~~~~~~^~~~
input/code.cpp:109:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (a < temp - powsOf10[j])
         ~~^~~~~~~~~~~~~~~~~~~~
input/code.cpp:133:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (b < temp - powsOf10[j])
         ~~^~~~~~~~~~~~~~~~~~~~

Code

#include<iostream>
#include<bitset>

int main()
{
	unsigned long long powsOf10[20]
	{
		1,
		10,
		100,
		1'000,
		10'000,
		100'000,
		1'000'000,
		10'000'000,
		100'000'000,
		1'000'000'000,
		10'000'000'000,
		100'000'000'000,
		1'000'000'000'000,
		10'000'000'000'000,
		100'000'000'000'000,
		1'000'000'000'000'000,
		10'000'000'000'000'000,
		100'000'000'000'000'000,
		1'000'000'000'000'000'000,
		10'000'000'000'000'000'000
	};

	unsigned long long ones[19]
	{
		1,
		11,
		111,
		1'111,
		11'111,
		111'111,
		1'111'111,
		11'111'111,
		111'111'111,
		1'111'111'111,
		11'111'111'111,
		111'111'111'111,
		1'111'111'111'111,
		11'111'111'111'111,
		111'111'111'111'111,
		1'111'111'111'111'111,
		11'111'111'111'111'111,
		111'111'111'111'111'111,
		1'111'111'111'111'111'111
	};

	int n;
	std::cin >> n;

	long long a;
	long long b;
	long long temp;

	int toA = 0;
	int toB = 0;

	int omA = 0;
	int omB = 0;

	for (int i = 0; i < n; i++)
	{
		std::cin >> a;
		std::cin >> b;

		for (int i = 0; i < 20; i++)
		{
			if(a%powsOf10[i] == a)
			{
				omA = i - 1;
				break;
			}
		}

		for (int i = 0; i < 20; i++)
		{
			if (b % powsOf10[i] == b)
			{
				omB = i - 1;
				break;
			}
		}

		toA = 2 << omA;
		toB = 2 << omB;

		//*******
		temp = ones[omA];

		if (a < temp)
			toA--;

		for (int i = 0; i < omA; i++)
		{
			temp = ones[omA];

			for (int j = 0; j < i; j++)
			{
				temp -= powsOf10[omA - j];
			}

			for (int j = 0; j < omA-i; j++)
			{
				if (a < temp - powsOf10[j])
					toA--;
			}

		}
		//*******

		//*******
		temp = ones[omB];

		if (b < temp)
			toB--;

		for (int i = 0; i < omB; i++)
		{
			temp = ones[omB];

			for (int j = 0; j < i; j++)
			{
				temp -= powsOf10[omB - j];
			}

			for (int j = 0; j < omB - i; j++)
			{
				if (b < temp - powsOf10[j])
					toB--;
			}

		}
		//*******

		std::cout << toA << ' ' << toB << '\n';
	}

	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
4
0 10
1 5
3 4
11 11

correct output
3
1
0
1

user output
-1 3
2 2
2 2
4 4

Test 2

Group: 1, 2, 3

Verdict:

input
1
0 0

correct output
1

user output
0 0

Test 3

Group: 1, 2, 3

Verdict:

input
1
1000 1000

correct output
1

user output
12 12

Test 4

Group: 1, 2, 3

Verdict:

input
16
0 0
0 1
0 2
1 1
...

correct output
1
2
2
1
1
...

user output
0 0
-1 2
-1 2
2 2
2 2
...

Test 5

Group: 1, 2, 3

Verdict:

input
9
0 0
0 1
0 10
0 11
...

correct output
1
2
3
4
5
...

user output
0 0
-1 2
-1 3
-1 4
-1 5
...

Test 6

Group: 1, 2, 3

Verdict:

input
1000
0 1000
0 1000
0 1000
0 1000
...

correct output
9
9
9
9
9
...

user output
-1 12
-1 12
-1 12
-1 12
-1 12
...

Test 7

Group: 1, 2, 3

Verdict:

input
1000
100 111
0 101
1 10
10 110
...

correct output
4
6
2
5
8
...

user output
5 8
-1 6
2 3
3 7
2 12
...

Test 8

Group: 1, 2, 3

Verdict:

input
1000
480 564
753 988
479 909
32 973
...

correct output
0
0
0
4
0
...

user output
8 8
8 8
8 8
4 8
8 8
...

Test 9

Group: 1, 2, 3

Verdict:

input
1000
98 111
8 111
98 111
111 113
...

correct output
4
6
4
1
7
...

user output
4 8
2 8
4 8
8 8
2 8
...

Test 10

Group: 1, 2, 3

Verdict:

input
1000
0 0
1 1
2 2
3 3
...

correct output
1
1
0
0
0
...

user output
0 0
2 2
2 2
2 2
2 2
...

Test 11

Group: 1, 2, 3

Verdict:

input
1000
0 1000
0 999
1 1000
0 998
...

correct output
9
8
8
8
7
...

user output
-1 12
-1 8
2 12
-1 8
2 8
...

Test 12

Group: 1, 2, 3

Verdict:

input
1
0 1000

correct output
9

user output
-1 12

Test 13

Group: 2, 3

Verdict:

input
100000
0 100000
0 100000
0 100000
0 100000
...

correct output
33
33
33
33
33
...

user output
-1 58
-1 58
-1 58
-1 58
-1 58
...

Test 14

Group: 2, 3

Verdict:

input
100000
86042 98295
30077 80920
45856 67174
3890 60412
...

correct output
0
0
0
16
0
...

user output
32 32
32 32
32 32
16 32
32 32
...

Test 15

Group: 2, 3

Verdict:

input
100000
11 10000
1111 11000
1011 1100
1110 1111
...

correct output
14
10
2
2
8
...

user output
4 27
16 28
13 13
15 16
27 30
...

Test 16

Group: 2, 3

Verdict:

input
100000
9 9999
1109 1110
112 1012
11098 11101
...

correct output
14
1
4
2
6
...

user output
2 16
14 15
8 13
29 30
13 27
...

Test 17

Group: 2, 3

Verdict:

input
100000
0 0
1 1
2 2
3 3
...

correct output
1
1
0
0
0
...

user output
0 0
2 2
2 2
2 2
2 2
...

Test 18

Group: 2, 3

Verdict:

input
100000
0 100000
0 99999
1 100000
0 99998
...

correct output
33
32
32
32
31
...

user output
-1 58
-1 32
2 58
-1 32
2 32
...

Test 19

Group: 2, 3

Verdict:

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
32 32
32 58
58 58

Test 20

Group: 2, 3

Verdict:

input
1
0 100000

correct output
33

user output
-1 58

Test 21

Group: 3

Verdict:

input
100000
0 1000000000000000000
0 1000000000000000000
0 1000000000000000000
0 1000000000000000000
...

correct output
262145
262145
262145
262145
262145
...

user output
-1 524269
-1 524269
-1 524269
-1 524269
-1 524269
...

Test 22

Group: 3

Verdict:

input
100000
179926689319432205 25677963778...

correct output
0
0
0
0
0
...

user output
262144 262144
262144 262144
262144 262144
262144 262144
262144 262144
...

Test 23

Group: 3

Verdict:

input
100000
100110100011010101 11100011010...

correct output
74822
54944
140968
252594
23521
...

user output
262126 262128
16370 65525
131055 262127
507 262129
262127 262128
...

Test 24

Group: 3

Verdict:

input
100000
100110100011010102 11100011010...

correct output
74822
252594
94086
10836
11352
...

user output
262126 262128
507 262129
65523 262126
262126 262127
262126 262126
...

Test 25

Group: 3

Verdict:

input
100000
256779637786129463 25677963778...

correct output
0
0
0
0
0
...

user output
262144 262144
262144 262144
262144 262144
262144 262144
262144 262144
...

Test 26

Group: 3

Verdict:

input
100000
0 1000000000000000000
0 999999999999999999
1 1000000000000000000
0 999999999999999998
...

correct output
262145
262144
262144
262144
262143
...

user output
-1 524269
-1 262144
2 524269
-1 262144
2 262144
...

Test 27

Group: 3

Verdict:

input
3
999999999999999999 99999999999...

correct output
0
1
1

user output
262144 262144
262144 524269
524269 524269

Test 28

Group: 3

Verdict:

input
1
0 1000000000000000000

correct output
262145

user output
-1 524269