标签:Cubes 762 Codeforces number int likes test integer Polycarp
Polycarp likes squares and cubes of positive integers. Here is the beginning of the sequence of numbers he likes: 1, 4, 8, 9, ....
For a given number n, count the number of integers from 1 to n that Polycarp likes. In other words, find the number of such x that 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).
Input
The first line contains an integer t (1≤t≤20) — the number of test cases.
Then tt lines contain the test cases, one per line. Each of the lines contains one integer nn (1≤n≤109).
Output
For each test case, print the answer you are looking for — the number of integers from 1 to nn that Polycarp likes.
Example
input
Copy
6 10 1 25 1000000000 999999999 500000000
output
Copy
4 1 6 32591 32590 23125
题意:从1到n之间有几个平方数和立方数
思路:将所有的平方数和立方数都压入set,然后遍历一遍即可
#include<bits/stdc++.h>
using namespace std;
#define ll long long
set<ll> se;
int main(){
ios::sync_with_stdio(false);
for(ll i = 1; i * i <= 1000000000; i++){
se.insert(i * i);
}
for(ll i = 1; i * i * i <= 1000000000; i++){
se.insert(i * i * i);
}
int t;
cin >> t;
int n;
while(t--){
cin >> n;
int ans = 0;
for(auto i : se){
if(n >= i){
ans++;
}else{
break;
}
}
cout << ans << endl;
}
return 0;
}
标签:Cubes,762,Codeforces,number,int,likes,test,integer,Polycarp 来源: https://blog.csdn.net/m0_55682843/article/details/122269711
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。