Cod sursa(job #1324554)
Utilizator | Data | 22 ianuarie 2015 15:45:57 | |
---|---|---|---|
Problema | Fractii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
#define NMAX 1000000
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
long long n,x,i,v[NMAX],p=1,j;
int main()
{
in>>n;
for(i=1;i<=n;i++)v[i]=i-1;
for(i=2;i<=n;i++)
for(j=2*i;j<=n;j=j+i) v[j]=v[j]-v[i];
for(i=1;i<=n;i++) p=p+v[i]*2;
out<<p;
in.close();
out.close();
return 0;
}