CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:Swarm
Submission time:2019-10-12 13:37:03 +0300
Language:C++17
Status:READY
Result:36
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED24
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.01 s1, 2, 3details
#11ACCEPTED0.01 s1, 2, 3details
#12ACCEPTED0.01 s1, 2, 3details
#13ACCEPTED0.09 s2, 3details
#14ACCEPTED0.08 s2, 3details
#15ACCEPTED0.08 s2, 3details
#16ACCEPTED0.08 s2, 3details
#17ACCEPTED0.08 s2, 3details
#18ACCEPTED0.08 s2, 3details
#19ACCEPTED0.01 s2, 3details
#20ACCEPTED0.01 s2, 3details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#270.03 s3details
#280.01 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:99:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a%powsOf10[i] != a)
       ~~~~~~~~~~~~~~^~~~
input/code.cpp:107:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (b % powsOf10[i] != b)
        ~~~~~~~~~~~~~~~~^~~~
input/code.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);;
  ~~~~~^~~~~~~~~~
input/code.cpp:92:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a);
   ~~~~~^~~~~~~~~~~~
input/code.cpp:93:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &b);
   ~~~~~^~~~~~~~~~~~

Code

#include<iostream>

unsigned long long powsOf10[19]
{
	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
};

int powsOf2[19]
{
	0b1,
	0b10,
	0b100,
	0b1'000,
	0b10'000,
	0b100'000,
	0b1'000'000,
	0b10'000'000,
	0b100'000'000,
	0b1'000'000'000,
	0b10'000'000'000,
	0b100'000'000'000,
	0b1'000'000'000'000,
	0b10'000'000'000'000,
	0b100'000'000'000'000,
	0b1'000'000'000'000'000,
	0b10'000'000'000'000'000,
	0b100'000'000'000'000'000,
	0b1'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 main()
{
	int n;
	scanf("%d", &n);;

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

	int toA = 0;
	int toB = 0;
	int between;

	int omA = 0;
	int omB = 0;

	bool aValid = false;

	for (int i = 0; i < n; i++)
	{
		scanf("%lld", &a);
		scanf("%lld", &b);

		for (int i = 18; i >= 0; i--)
		{
			omA = i;

			if(a%powsOf10[i] != a)
				break;
		}

		for (int i = 18; i >= 0; i--)
		{
			omB = i;

			if (b % powsOf10[i] != b)
				break;
		}

		toA = powsOf2[omA + 1];
		for (int i = 0; i < powsOf2[omA]; i++)
		{
			temp = powsOf10[omA];
			for (int j = 0; j < omA; j++)
			{
				temp += powsOf10[j] * (i >> j & 1);
			}

			if (a < temp)
				toA--;
		}

		toB = powsOf2[omB + 1];;
		for (int i = 0; i < powsOf2[omB]; i++)
		{
			temp = powsOf10[omB];
			for (int j = 0; j < omB; j++)
			{
				temp += powsOf10[j] * (i >> j & 1);
			}

			if (b < temp)
				toB--;
		}

		aValid = true;
		while (a > 0)
		{
			int remainder = a % 10;
			if (remainder > 1)
			{
				aValid = false;
				break;
			}
			a /= 10;
		}

		between = toB - toA + aValid;

		printf("%d\n", between);
	}

	return 0;
}

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: ACCEPTED

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: ACCEPTED

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

correct output
4
6
2
5
8
...

user output
4
6
2
5
8
...

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
0
0
0
4
0
...

user output
0
0
0
4
0
...

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
4
6
4
1
7
...

user output
4
6
4
1
7
...

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

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: ACCEPTED

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

correct output
9
8
8
8
7
...

user output
9
8
8
8
7
...

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: ACCEPTED

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

correct output
0
0
0
16
0
...

user output
0
0
0
16
0
...

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

correct output
14
10
2
2
8
...

user output
14
10
2
2
8
...

Test 16

Group: 2, 3

Verdict: ACCEPTED

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

correct output
14
1
4
2
6
...

user output
14
1
4
2
6
...

Test 17

Group: 2, 3

Verdict: ACCEPTED

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: ACCEPTED

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

correct output
33
32
32
32
31
...

user output
33
32
32
32
31
...

Test 19

Group: 2, 3

Verdict: ACCEPTED

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
0
1
1

Test 20

Group: 2, 3

Verdict: ACCEPTED

input
1
0 100000

correct output
33

user output
33

Test 21

Group: 3

Verdict:

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

correct output
262145
262145
262145
262145
262145
...

user output
(empty)

Test 22

Group: 3

Verdict:

input
100000
179926689319432205 25677963778...

correct output
0
0
0
0
0
...

user output
(empty)

Test 23

Group: 3

Verdict:

input
100000
100110100011010101 11100011010...

correct output
74822
54944
140968
252594
23521
...

user output
(empty)

Test 24

Group: 3

Verdict:

input
100000
100110100011010102 11100011010...

correct output
74822
252594
94086
10836
11352
...

user output
(empty)

Test 25

Group: 3

Verdict:

input
100000
256779637786129463 25677963778...

correct output
0
0
0
0
0
...

user output
(empty)

Test 26

Group: 3

Verdict:

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

correct output
262145
262144
262144
262144
262143
...

user output
(empty)

Test 27

Group: 3

Verdict:

input
3
999999999999999999 99999999999...

correct output
0
1
1

user output
0
-524287
1

Test 28

Group: 3

Verdict:

input
1
0 1000000000000000000

correct output
262145

user output
-262143