ACMSTEP 2.1.6 招新朋友 //数论 互质

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

#define  N 32769

int a
;

int main()
{
int n, cases, i ,j ;

cin>>cases;

while (cases--)
{
cin>>n;

memset(a, 0, sizeof(a));
for (i=2; i<=n; i++)
{
if (a[i] == 0 && n % i == 0)
{
for (j = i; j<=n; j+=i)
a[j] = 1;
}
}
int countn = 0;
for (i = 1; i<n ; i++)
{
if (a[i] == 0) countn++;
}
cout << countn <<endl;
}
return 0;
}