-
Notifications
You must be signed in to change notification settings - Fork 0
/
Dev Skill _Mr. And Mrs. A.cpp
193 lines (144 loc) · 2.98 KB
/
Dev Skill _Mr. And Mrs. A.cpp
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
// Under construction
#include<bits/stdc++.h>
using namespace std;
#define high 1000005
#define sf scanf
#define pf printf
#define mxhigh 1000000000005
typedef long long LL;
typedef set<LL>sll;
typedef vector<LL>vll;
int prime[(high >> 6) + 1] , prm[(high>>1) + 9], plen=0 , vlen=0;
vll v;
#define setbit(n) (prime[n >> 6] |= (1 << ((n >> 1) & 31)))
#define checkbit(n) (prime[n >> 6] & (1 << ((n >> 1) & 31)))
void sieve()
{
int i,j;
for(i=3; i*i<high; i+=2)
{
if(!checkbit(i))
{
for(j=i*i; j<high; j+=(2 * i))
{
setbit(j);
}
}
}
prm[plen++] = 2;
for(i=3; i<high; i+=2)
{
if(!checkbit(i))
{
prm[plen++] = i;
}
}
//for(i=0; i<100; i++) cout << prm[i] << " "; //cerr << prm[i] << " ";
}
void init()
{
int i=0 , j;
LL pnum=0 , p=1;
sll st;
sll::iterator it;
for(i=0; i<plen; i++)
{
pnum = prm[i];
for(j=2; j<=40; j++)
{
//pnum = power(prm[i] , j);
p=1;
for(int k=1; k<=j; k++)
{
p*=pnum;
if(p > mxhigh) break;
}
if(p < mxhigh)
{
st.insert(p);
}
}
}
//cerr << st.size();
for(it=st.begin() ; it!=st.end() ; ++it)
{
v.push_back(*it);
}
//for(i=0; i<100; i++) cout << v[i] << " ";
//cout << v.size();
//cout << v[v.size()-1];
vlen = v.size();
}
int khojlwr(int lo, int hi, LL itm)
{
int mid;
while(lo <= hi)
{
mid = (lo + hi) / 2;
if(v[mid] == itm) hi = mid - 1;
else if(v[mid] > itm) hi = mid - 1;
else if(v[mid] < itm) lo = mid + 1;
}
return lo;
}
int khojupr(int lo, int hi, LL itm)
{
int mid ;
while(lo <= hi)
{
mid = (lo + hi) / 2;
if(v[mid] == itm) lo = mid + 1;
else if(v[mid] > itm) hi = mid - 1;
else if(v[mid] < itm) lo = mid + 1;
}
return lo;
}
int khoj(int lo, int hi, LL itm)
{
int mid;
while(lo <= hi)
{
mid = (lo + hi) / 2;
if(v[mid] == itm) return mid;
else if(v[mid] > itm) hi = mid - 1;
else if(v[mid] < itm) lo = mid + 1;
}
return lo;
}
int main()
{
sieve();
init();
int t, tc=0 , lwr=0 , upr=0;
LL L , R;
sf("%d" , &t);
while(t--)
{
sf("%lld %lld" , &L , &R);
if(L > 3)
{
upr = khoj(0 , vlen-1, L);
}
else
{
upr = 0;
}
if(upr > 0)
{
if(v[upr] != L)
{
upr--;
}
if(v[upr] < L) upr++;
}
//cout << upr << " " << v[upr] << "\n";
lwr = khoj(0 , vlen-1, R);
if(v[lwr] != R)
{
lwr--;
}
//cout << lwr << " " << v[lwr] << "\n";
pf("Case %d: %lld\n" , ++tc , lwr - upr + 1);
}
return 0;
}