Cod sursa(job #2211916)
Utilizator | Data | 12 iunie 2018 14:48:30 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
int v[1000005];
void phi()
{
for(int i=1; i<=n; i++)
v[i]=i;
for(int i=2; i<=n; i++)
if(v[i]==i)
for(int j=i; j<=n; j=j+1)
{v[j]=v[j]/i; v[j]=v[j]*i-1;}
}
int main()
{ int s=0;
f>>n;
phi();
for(int i=1; i<=n; i++)
s=s+v[i];
g<<2*s-1;
return 0;
}