Cod sursa(job #1247175)
| Utilizator | Data | 22 octombrie 2014 11:51:17 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int e[10000000];
int verif(int n)
{
for(int j=1; j<=n; j++)
e[j]=j;
for(int i=2; i<=n; i++)
if(e[i]==i)
for(int j=i; j<=n; j+=i)
e[j]=e[j]/i*(i-1);
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
f>>n;
verif(n);
int long long nr=1;
for(int i=2; i<=n; i++)
nr+=2*e[i];
g<<nr;
return 0;
}
