poj 1284 Primitive Roots（未完）

 1 #include<iostream>
 2 using namespace std;
 3 int euler(int a){
 4     int i=2;
 5     int ans=a;
 6     if(a%2==0){
 7         //cout<<2<<endl;
 8         ans=ans/i*(i-1);
 9         while(a%2==0){
10               a/=2;
11         }
12     }
13     for(i=3;i<=a;i+=2){//优化 
14     if(a%i==0){
15         //cout<<i<<endl;
16         ans=ans/i*(i-1);
17         while(a%i==0){
18               a/=i;
19             }
20         }
21     }
22     return ans;
23 }
24 int main()//23, 28, and 33
25 {
26     int p;
27     while(cin>>p){
28         cout<<euler(p-1)<<endl;
29     }
30     return 0;
31 }