Cod sursa(job #1288574)
Utilizator | Data | 8 decembrie 2014 21:55:32 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<iostream>
using namespace std;
long v[100000];
int phi(int n)
{int k=2;
int p=n;
int d;
while(n>1)
{d=0;
while(n%k==0)
{
n=n/k;d++;
}
if(d>0)
p=(p*(k-1))/k;
k++;
}
return p;
}
int main()
{int s=1,n,i;
cout<<"n=";cin>>n;
for(i=1;i<=n-1;i++)
s=s+2*phi(i+1);
cout<<s;
return 0;
}