2019 Anhui University programming competition

Euler function to achieve Edition

#include<bits/stdc++.h>
using namespace std;
const int  maxn=1050;
int ans[maxn];
bool isprime(int x)
{
    if(x==1)    return false;
    if(x==2)    return true;
    for(int i=2;i*i<=x;i++)
        if(x%i==0)    return false;
    return true;
}
int main()
{
    int cnt=0;
    for(int i=1;i<maxn;i++)
    {
        if(isprime(i))
           cnt++;
        ans[i]=cnt;
    }
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("%d\n",ans[n]);
    }
    return 0;
}