CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:caro
Submission time:2019-10-05 17:44:16 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#50.01 s1, 2, 3details
#6ACCEPTED0.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
#12ACCEPTED0.01 s1, 2, 3details
#13ACCEPTED0.18 s2, 3details
#140.22 s2, 3details
#150.21 s2, 3details
#160.21 s2, 3details
#170.22 s2, 3details
#180.21 s2, 3details
#190.01 s2, 3details
#20ACCEPTED0.01 s2, 3details
#21ACCEPTED0.21 s3details
#220.31 s3details
#230.32 s3details
#240.31 s3details
#250.30 s3details
#260.25 s3details
#270.01 s3details
#28ACCEPTED0.01 s3details

Code

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

ull NumberOfValidB(ull n){
	if(n == 0) return 1;
	if(n < 10) return 2;
	ull count = 0;
	ull power = 1e18;
	for(int i = 17; i >= 0; i--) {
		ull digit = n / power;
		if(digit == 1) {
			count += (2 << i) + 1;
		}
		else if (digit != 0) {
			ull add = 2 << i;
			count += add * 2;
		}
		n -= digit * power;
		power /= 10;
	}
	if(n != 0) count += 1;
	return count;
}

ull NumberOfValidA(ull n){
	if(n == 0) return 0;
	if(n == 1) return 1;
	if(n <= 10) return 2;
	ull count = 0;
	ull power = 1e18;
	for(int i = 17; i >= 0; i--) {
		ull digit = n / power;
		if(digit == 1) {
			count += (2 << i);
		}
		else if(digit != 0) {
			count += (2 << i) * 2;
		}
		n -= digit * power;
		power /= 10;
	}
	if(n == 1) count += 1;
	if(n > 1) count += 2;
	return count;
}


int main(){
	ull count;
	cin >> count;

	for(ull i = 0; i < count; i++) {
		ull a;
		ull b;
		cin >> a;
		cin >> b;
		ull zeroCountA = NumberOfValidA(a);
		ull zeroCountB = NumberOfValidB(b);
		cout << zeroCountB - zeroCountA << '\n';
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
4
0 10
1 5
3 4
11 11

correct output
3
1
0
1

user output
3
1
0
1

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
0 0

correct output
1

user output
1

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
1000 1000

correct output
1

user output
1

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
1
2
2
1
1
...

user output
1
2
2
1
1
...

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
1
2
3
4
5
...

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
9
9
9
9
9
...

user output
9
9
9
9
9
...

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
6
2
6
8
...

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
1
18446744073709551615
18446744073709551611
7
18446744073709551615
...

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
3
7
3
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
1
1
0
0
0
...

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
9
13
8
13
12
...

Test 12

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
0 1000

correct output
9

user output
9

Test 13

Group: 2, 3

Verdict: ACCEPTED

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

correct output
33
33
33
33
33
...

user output
33
33
33
33
33
...

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
7
6
18446744073709551612
16
18446744073709551601
...

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
14
11
3
4
10
...

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
27
3
5
2
4
...

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
1
1
0
0
0
...

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
33
61
32
61
60
...

Test 19

Group: 2, 3

Verdict:

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
18446744073709551615
18446744073709551587
1

Test 20

Group: 2, 3

Verdict: ACCEPTED

input
1
0 100000

correct output
33

user output
33

Test 21

Group: 3

Verdict: ACCEPTED

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

correct output
262145
262145
262145
262145
262145
...

user output
262145
262145
262145
262145
262145
...

Test 22

Group: 3

Verdict:

input
100000
179926689319432205 25677963778...

correct output
0
0
0
0
0
...

user output
131172
139412
18446744073709527983
147838
24323
...

Test 23

Group: 3

Verdict:

input
100000
100110100011010101 11100011010...

correct output
74822
54944
140968
252594
23521
...

user output
74830
54955
140979
252602
23533
...

Test 24

Group: 3

Verdict:

input
100000
100110100011010102 11100011010...

correct output
74822
252594
94086
10836
11352
...

user output
74830
252602
94093
10844
11358
...

Test 25

Group: 3

Verdict:

input
100000
256779637786129463 25677963778...

correct output
0
0
0
0
0
...

user output
0
1
2
3
18446744073709551615
...

Test 26

Group: 3

Verdict:

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

correct output
262145
262144
262144
262144
262143
...

user output
262145
524285
262144
524285
524284
...

Test 27

Group: 3

Verdict:

input
3
999999999999999999 99999999999...

correct output
0
1
1

user output
18446744073709551615
18446744073709289475
1

Test 28

Group: 3

Verdict: ACCEPTED

input
1
0 1000000000000000000

correct output
262145

user output
262145