Cod sursa(job #1486934)
Utilizator | Data | 15 septembrie 2015 18:57:54 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long p[1000009],n,i,j;
long long t=0;
int main()
{
f>>n;
for(i=1;i<=n;i++)
p[i]=i-1;
for(i=2;i<=n;i++)
{
j=2*i;
while(j<=n)
{
p[j]=p[j]-p[i];
j=j+i;
}
}
for(i=1;i<=n;i++)
t=t+p[i];
g<<2*t+1<<'/n';
g.close();return 0;
}