CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:Swarm
Submission time:2019-10-09 23:01:35 +0300
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.01 s1, 2, 3details
#3ACCEPTED0.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
#13--2, 3details
#14--2, 3details
#15--2, 3details
#16--2, 3details
#17--2, 3details
#180.81 s2, 3details
#190.01 s2, 3details
#200.01 s2, 3details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#27--3details
#28--3details

Compiler report

input/code.cpp:26: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:77:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a%powsOf10[i] == a)
       ~~~~~~~~~~~~~~^~~~
input/code.cpp:86:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (b % powsOf10[i] == b)
        ~~~~~~~~~~~~~~~~^~~~
input/code.cpp:99:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i <= ones[omA] - powsOf10[omA]; i++)
                    ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:107:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (a < (powsOf10[omA] + temp))
         ~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:118:22: warning: comparison between signed and unsigned integer expressions [...

Code

#include<iostream>
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 temp1;
long long temp;
int toA = 0;
int toB = 0;
int between;
int omA = 0;
int omB = 0;
bool aMidRange = false;
bool bMidRange = false;
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;
}
}
if (a == 0)
toA = 1;
else
{
toA = 2 << omA;
for (int i = 0; i <= ones[omA] - powsOf10[omA]; i++)
{
temp = 0;
for (int j = 0; j < omA; j++)
{
temp += powsOf10[j] * (i >> j & 1);
}
if (a < (powsOf10[omA] + temp))
toA--;
}
}
if (b == 0)
toB = 1;
else
{
toB = 2 << omB;
for (int i = 0; i <= ones[omB] - powsOf10[omB]; i++)
{
temp = 0;
for (int j = 0; j < omB; j++)
{
temp += powsOf10[j] * (i >> j & 1);
}
if (b < (powsOf10[omB] + temp))
toB--;
}
}
aMidRange = ((powsOf10[omA] <= a) && (a <= ones[omA]));
bMidRange = ((powsOf10[omB] <= b) && (b <= ones[omB]));
if (a == b)
{
if (aMidRange)
between = 1;
else
between = 0;
}
else if (toA == toB)
{
if (!aMidRange && !bMidRange)
between = 0;
else
between = toB - toA + 1;
}
else
between = toB - toA + 1;
std::cout << between << '\n';
}
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:

input
1
0 0

correct output
1

user output
0

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:

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

correct output
1
2
2
1
1
...

user output
0
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
0
2
3
4
-1
...

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
-82
-82
-82
-82
-82
...
Truncated

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
10
2
2
3
-83
...
Truncated

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
0
0
0
5
0
...
Truncated

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
5
7
5
1
7
...
Truncated

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

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
-82
8
-83
8
7
...
Truncated

Test 12

Group: 1, 2, 3

Verdict:

input
1
0 1000

correct output
9

user output
-82

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
(empty)

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
(empty)

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
(empty)

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
(empty)

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
(empty)

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
-10700
32
-10701
32
31
...
Truncated

Test 19

Group: 2, 3

Verdict:

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
0
-10731
1

Test 20

Group: 2, 3

Verdict:

input
1
0 100000

correct output
33

user output
-10700

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
(empty)

Test 28

Group: 3

Verdict:

input
1
0 1000000000000000000

correct output
262145

user output
(empty)