Cod sursa(job #2024264)
Utilizator | Data | 20 septembrie 2017 11:15:49 | |
---|---|---|---|
Problema | Fractii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
unsigned long long n,i,j,op,v[10000001];
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
v[i]=i-1;
}
for(i=2; i<=n; i++)
{
for(j=2*i; j<=n; j+=i)
{
v[j]-=v[i];
}
}
for(i=1; i<=n; i++)
{
op+=v[i];
}
g<<2*op+1;
return 0;
}