Pagini recente » Cod sursa (job #285893) | Cod sursa (job #893604) | Cod sursa (job #1917246) | Cod sursa (job #2368032) | Cod sursa (job #810114)
Cod sursa(job #810114)
#include<fstream>
using namespace std;
long int n, s, v[100];
long int euler(int n)
{
s=0;
for(int i=1; i<=n; i++)
v[i]=i;
for(int i=2; i<=n; i++)
if(v[i]=i)
for(int j=1; j<=n; j=j+i)
{
v[i]=v[i]/i;
v[j]=v[j]*(i-1);
}
for(int i=1; i<=n; i++)
s=s+v[i];
return s;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>n;
if(n==0)
out<<" nu.";
else
out<<euler(n)*2-1;
}