SGU 102 虽然代码比较多，不过还是挺高效的~

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
const int maxn = 10011;

int gcd(int a, int b)
{
    if (!a || !b)
    {
        return max(a, b);
    }
    int t;
    while (t = a % b)
    {
        a = b;
        b = t;
    }
    return b;
};

bool notp[maxn];
vector<int>v;
vector<int>p;
bool a[maxn];
int n;

bool isp(int x)
{
    int tx = sqrt(x);
    for(int i=0;i<p.size();i++)
    {
        if(x%p[i]==0)
        {
            return false;
        }
        else if(p[i] > tx)
        {
            return true;
        }
    }
    return true;
}

bool yes(int x)
{
    if(a[x] == true)
    {
        return false;
    }
    for(int i=0;i<v.size();i++)
    {
        if(v[i] <= x)
        {
            if( x%v[i] == 0)
            {
                return false;
            }
        }
        else
        {
            return true;
        }
    }
    return true;
}

int main()
{
    p.clear();
    MM(notp,false);
    notp[1]=true;
    notp[2]=false;
    p.pb(2);
    for(int i=3;i<maxn;i++)
    {
        if(isp(i))
        {
            notp[i] = false;
            p.push_back(i);
        }
        else
        {
            notp[i] = true;
        }
    }
    int temp;
    while(SS(n)!=EOF)
    {
        if(n==1)
        {
            printf("1\n");
            continue;
        }
        if(!notp[n])
        {
            printf("%d\n",n-1);
            continue;
        }
        else
        {
            v.clear();
            MM(a,false);
            temp = n;
            for(int i=0;i<p.size();i++)
            {
                if(p[i] <= temp)
                {
                    if(temp % p[i] == 0)
                    {
                        v.push_back(p[i]);
                        a[p[i]]=true;
                        temp/=p[i];
                    }
                }
                else
                {
                    break;
                }
            }
    /*        for(int i=0;i<v.size();i++)
            {
                cout<<v[i]<<" ";
            }
            cout<<endl;       */
            int ans = 0;
            for(int i=1;i<=n-1;i++)
            {
                if(yes(i))
                {
                    ans++;
                }
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}