Cod sursa(job #1885672)
Utilizator | Data | 20 februarie 2017 10:56:00 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
int i,n,j,v[1000001];
unsigned long long t;
int main()
{
f>>n;
for(i=2;i<=n;i++) v[i]=i-1;
for(i=2;i<=n;i++)
{
t=t+v[i];
for(j=i+i;j<=n;j=j+i)
v[j]=v[j]-v[i];
}
t=t*2;
g<<t+1;
return 0;
}