使用 pow（）函数可以过
- #include "iostream"
- #include "cmath"
- using namespace std;
- int main(){
- int N; cin >> N;
- int n=0;
- while(N--){
- cin >>n;
- int count=0;
- for(int i=1; i<=n; i++){
- float a = sqrt(i);
- float b = pow(i,1.0/3);
- if(a-int(a+0.000001)==0&&b-int(b+0.000001)==0){
- count++;
- }
- }
- cout<< count<<endl;
- }
- }
The road of your choice, you have to go on !
粤ICP备16082171号-1
登录后发布评论
暂无评论，来抢沙发