Preparando MOJI
You're given Q queries of the form (L, R).
For each query you have to find the number of such x that L ≤ x ≤ R and there exist integer numbers a > 0, p > 1 such that x = ap.
The first line contains the number of queries Q (1 ≤ Q ≤ 105).
The next Q lines contains two integers L, R each (1 ≤ L ≤ R ≤ 1018).
Output Q lines — the answers to the queries.
6
1 4
9 9
5 7
12 29
137 591
1 1000000
2
1
0
3
17
1111
In query one the suitable numbers are 1 and 4.
Informação
Provedor Codeforces
Código CF955C
Tags
Submetido 0
BOUA! 0
Taxa de BOUA's 0%
Datas 09/05/2023 09:32:56
Relacionados