Cod sursa(job #2378570)
Utilizator | Data | 12 martie 2019 13:51:16 | |
---|---|---|---|
Problema | Fractii | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int prime[100001];
long long sum;
int main()
{
int n, p, i;
f>>n;
for(i=1;i<=n;i++)
prime[i]=i-1;
for(p=2;p<=n;p++)
{
sum+=prime[p];
for(i=p*2;i<=n;i+=p)
prime[i]=prime[i]-prime[p];
}
sum=sum*2+1;
g<<sum;
return 0;
}