blob: c3f11cfa78a0e6b6c84edbc6591320656761d145 (
plain) (
blame)
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
#include <iostream>
#include <algorithm>
#include "Interval.h"
bool isPrime(int n)
{
double temp = sqrt(n);
for (int i = 2; i <= temp; i++)
{
if (n % i == 0)
return false;
}
return true;
}
bool isPalindorme(int n)
{
int reversed = 0;
while (n != 0)
{
int lastDigit = n % 10;
(reversed *= 10) += lastDigit;
n /= 10;
}
return n == reversed;
}
bool containsOnlyDistinctNumbers(int n)
{
bool digits[10];
for (int i = 0; i < 10; i++)
digits[i] = false;
while (n != 0)
{
int lastDigit = n % 10;
if (digits[lastDigit])
return false;
digits[n % 10] = true;
n /= 10;
}
return true;
}
size_t Interval::countNumbersInIntervalCondition(bool(*pred)(int)) const
{
size_t count = 0;
for (int i = a; i <= b; i++)
{
if (pred(i))
count++;
}
return count;
}
Interval::Interval() : Interval(0, 0) {}
Interval::Interval(int a, int b)
{
if (a > b)
a = b = 0;
this->a = a;
this->b = b;
}
int Interval::getA() const
{
return a;
}
int Interval::getB() const
{
return b;
}
void Interval::setA(int a)
{
if (a > b)
return;
this->a = a;
}
void Interval::setB(int b)
{
if (b < a)
return;
this->b = b;
}
size_t Interval::getLength() const
{
return b - a + 1;
}
bool Interval::isMemberOfInterval(int x) const
{
return (a <= x && x <= b);
}
size_t Interval::calcPrimeNumbersInTheInterval() const
{
return countNumbersInIntervalCondition(isPrime);
}
size_t Interval::calcPalindromicNumbersInTheInterval() const
{
return countNumbersInIntervalCondition(isPalindorme);
}
size_t Interval::calcDiffrentDigitNumbersInTheInverval() const
{
return countNumbersInIntervalCondition(containsOnlyDistinctNumbers);
}
bool Interval::areStartAndEndPowersOfTwo() const
{
return (a == 0 || (a & a - 1) == 0) && (b == 0 || (b & b - 1) == 0);
}
Interval Interval::intersect(const Interval& other) const
{
if (b < other.getA() || a > other.getB())
return Interval(0, 0);
int newA = std::max(a, other.getA());
int newB = std::min(b, other.getB());
return Interval(newA, newB);
}
bool Interval::isSuperInterval(const Interval& other) const
{
return a <= other.getA() && b >= other.getB();
}
|
