UVa 11064-Number Theory

求1 <= m <= n ， gcd（m，n）！=1，gcd（m，n）！=m。简单的说就是，用n减去，n以为的因子数和n以内与其互质的数的和，因为这样减了两次1，所以还要在结果+1

/*************************************************************************
    > File Name: 11064.cpp
    > Author: Toy
    > Mail: ycsgldy@163.com
    > Created Time: 2013年06月07日 星期五 16时00分58秒
 ************************************************************************/

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>

using namespace std;
const int INF = 0x7fffffff;
typedef pair<int,int> II;
typedef vector<int> IV;
typedef vector<II> IIV;
typedef vector<bool> BV;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned int u32;
#define For(t,v,c) for(t::const_iterator v=c.begin(); v!=c.end(); ++v)
#define IsComp(n) (_c[n>>6]&(1<<((n>>1)&31)))
#define SetComp(n) _c[n>>6]|=(1<<((n>>1)&31))
const int MAXP = 46341; //sqrt(2^31)
const int SQRP = 216; //sqrt(MAX)
int _c[(MAXP>>6)+1];
IV primes, opt, vec;
int Case, n, m;

void prime_sieve (){
    for ( int i = 3; i <= SQRP; i += 2 )
        if ( !IsComp ( i ) ) for ( int j = i * i; j <= MAXP; j += i + i ) SetComp ( j );
    primes.push_back( 2 );
    for ( int i = 3; i <= MAXP; i += 2 )
        if ( !IsComp ( i ) ) primes.push_back( i );
}

int count_divisors ( int n ) {
	int ret = 1;
	int sn = sqrt ( n );
	For ( IV, it, primes ) {
		int prime = *it;
		if ( prime > sn ) break; if ( n % prime ) continue;
		int e = 0; for ( ; n%prime == 0; e++, n/= prime );
		ret *= e+1;
		sn = sqrt(n);
	}
	if ( n > 1 ) ret *= 2;
	return ret;
}

int euler_phi ( int n ) {
	int ans = n;
	int sn = sqrt ( n );
	For ( IV, it, primes ) {
		int prime = *it;
		if ( prime > sn ) break; if ( n % prime ) continue;
		for ( ; n%prime == 0; n/= prime );
		ans /= prime;
		ans *= (prime-1);
		sn = sqrt(n);
	}
	if ( n > 1 ) ans /= n, ans *= (n-1);
	return ans;
}

int main ( ) {
    prime_sieve();
    while ( scanf ( "%d", &Case ) == 1 ) {
        printf ( "%d\n", Case - euler_phi( Case ) - count_divisors( Case ) + 1 );
    }
    return 0;
}