Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

用到一个定理

Posted by 13408100238 at 2014-08-01 19:07:39 on Problem 1284
/*
	Name: Primetive Roots  pku 1284
	Copyright: Shangli Cloud
	Author: Shangli Cloud
	Date: 01/08/14 15:49
	Description: 如果P是素数  则P有Phi(p-1)个原根 
*/
#include"iostream"
#include"cstdio"
#include"cstring"
#include"algorithm"
using namespace std;
const int ms=65540;
int phi[ms];
int main()
{
	int i,j,p;
	for(i=1;i<ms;i++)
		phi[i]=i;
	for(i=2;i<ms;i+=2)
		phi[i]/=2;
	for(i=3;i<ms;i+=2)
		if(phi[i]==i)
			for(j=i;j<ms;j+=i)
				phi[j]=phi[j]/i*(i-1);
	while(cin>>p)
		cout<<phi[p-1]<<endl;
	return 0;
} 

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator