Cod sursa(job #837994)
| Utilizator | Data | 18 decembrie 2012 21:42:00 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long s,n,numere[1000005];
int main()
{
ifstream ka("fractii.in");
ofstream ki("fractii.out");
ka>>n;
for(int i=1;i<=n;i++)
{numere[i]=i;}
for(int i=2;i<=n;i++)
{if(numere[i]==i)
{numere[i]=i-1;
for(int g=2*i;g<=n;g+=i)
numere[g]=numere[g]*(i-1)/i;}
}
for(int i=1;i<=n;i++)
{
s+=numere[i]; }
ki<<2*s-1;
}
