传统题 1000ms 128MiB

Squares and Cubes

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

题面翻译

nn 以内有多少个完全平方数或完全立方数。

题目描述

Polycarp likes squares and cubes of positive integers. Here is the beginning of the sequence of numbers he likes: 1 1 , 4 4 , 8 8 , 9 9 , ....

For a given number n n , count the number of integers from 1 1 to n n that Polycarp likes. In other words, find the number of such x x that x x is a square of a positive integer number or a cube of a positive integer number (or both a square and a cube simultaneously).

输入格式

The first line contains an integer t t ( 1t20 1 \le t \le 20 ) — the number of test cases.

Then t t lines contain the test cases, one per line. Each of the lines contains one integer n n ( 1n109 1 \le n \le 10^9 ).

输出格式

For each test case, print the answer you are looking for — the number of integers from 1 1 to n n that Polycarp likes.

6
10
1
25
1000000000
999999999
500000000
4
1
6
32591
32590
23125

日常训练赛

未参加
状态
已结束
规则
ACM/ICPC
题目
11
开始于
2022-4-28 17:15
结束于
2022-4-28 20:00
持续时间
2.8 小时
主持人
参赛人数
1