forked from derekhh/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstrange-numbers.cpp
More file actions
58 lines (54 loc) · 1.02 KB
/
strange-numbers.cpp
File metadata and controls
58 lines (54 loc) · 1.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
//strange-numbers.cpp
//Strange numbers
//Weekly Challenges - Week 11
//Author: derekhh
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
set<unsigned long long> s;
unsigned long long q[500];
int head, tail;
int lenDigit(unsigned long long num)
{
int digits = 0;
do
{
num /= 10;
digits++;
} while (num != 0);
return digits;
}
int main()
{
const long long upperBound = 1000000000000000000LL;
head = tail = 0;
for (int i = 0; i <= 9; i++)
{
q[tail++] = i;
s.insert(i);
}
while (head < tail)
{
unsigned long long num = q[head++];
int len = lenDigit(num);
for (int i = len; i <= len + 2; i++)
{
unsigned long long candidate = num * i;
if (s.find(candidate) == s.end() && lenDigit(candidate) == i && candidate <= upperBound)
{
q[tail++] = candidate;
s.insert(candidate);
}
}
}
int t;
cin >> t;
while (t--)
{
unsigned long long l, r;
cin >> l >> r;
cout << count_if(q, q + tail, [l, r](unsigned long long i) {return i >= l && i <= r; }) << endl;
}
return 0;
}