【POJ 1284】Primitive Roots

1.题目链接。求一个奇素数原根的数量。结论题，如果一个数存在原根，那么数量是phi(phi(n))个。奇素数一定是存在原根的。

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 75536;
int vis[N], prime[N];
int tot = 0;
int phi[N];
#pragma warning(disable:4996)
void getphi()
{
	int i, j;
	phi[1] = 1;
	for (i = 2; i <= N; i++)  
	{
		if (!vis[i])
		{
			prime[++tot] = i; 
			phi[i] = i - 1; 
		}
		for (j = 1; j <= tot; j++)
		{
			if (i*prime[j] > N)  break;
			vis[i*prime[j]] = 1; 
			if (i%prime[j] == 0)
			{
				phi[i*prime[j]] = phi[i] * prime[j]; break;
			}
			else  phi[i*prime[j]] = phi[i] * (prime[j] - 1);
		}
	}
}
int main()
{

	int n;
	getphi();
	while (~scanf("%d", &n))
	{
		printf("%d\n", phi[phi[n]]);
	}
	return 0;
}