模拟
简单题
//模拟
#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 105;
int arr[maxn];
int main() {
int t,n,cnt;
cin >> t;
while (t--) {
cin >> n;
cnt = 0;
memset(arr, 0, sizeof(arr));//锁着
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j += i) {
arr[j] = arr[j]^1;//取反
}
}
for (int i = 1; i <= n; i++) {
if (arr[i])
cnt++;
}
cout << cnt << endl;
}
return 0;
}