#include bits/stdc++.husing namespace std;long long pow(long long n,long long count,long long root,long long x){ count 0; for (int i0;in;i++) { root(int) sqrt(x); if (root*rootx) count++; } return count; }int main() { int n; cin n; int count 0; for (int i 0; i n; i++){ int x; cin x; int root (int) sqrt(x); if (root * root x) { count++; } } cout count endl; return 0; }
Đọc tiếp
#include <bits/stdc++.h>
using namespace std;
long long pow(long long n,long long count,long long root,long long x)
{
count =0;
for (int i=0;i<n;i++)
{
root=(int) sqrt(x);
if (root*root==x)
count++;
}
return count;
}
int main()
{
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
int root = (int) sqrt(x);
if (root * root == x) {
count++;
}
}
cout << count << endl;
return 0;
}
theo công thức