Cod sursa(job #1109308)
Utilizator | Data | 16 februarie 2014 22:53:17 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ofstream ofis("fractii.out");
ifstream ifis("fractii.in");
int main()
{
long n,i,j,v[1000001];
long long nr;
ifis>>n;
for (i=2; i<=n; i++)
v[i]=i-1;
nr=0;
for (i=2; i<=n; i++)
{
for (j=2*i; j<=n; j+=i)
v[j]-=v[i];
nr+=v[i];
}
ofis<<2*nr+1;
return 0;
}