Cod sursa(job #1462406)
Utilizator | Data | 17 iulie 2015 23:44:53 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
using namespace std;
long long euler(int x)
{
int j,k,m,t=0;
for(k=1;k<x;k++)
for(j=k;m=j%x;j=j+k)
if(m==1)
t++;
return t;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
long long N,s=0;
in>>N;
for(int i=2;i<=N;i++)
{
s=s+euler(i);
}
out<<2*s+1;
}