Cod sursa(job #1005523)
Utilizator | Data | 5 octombrie 2013 10:53:02 | |
---|---|---|---|
Problema | Fractii | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
using namespace std;
long long s;
int main()
{
int i,j,n,v[100000];
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
f.close();
for(i=2;i<=n;i++)
v[i]=i-1;
for(i=2;i<=n;i++)
{ s=s+v[i];
for(j=i+i;j<=n;j=j+i)
v[j]=v[j]-v[i];
}
g<<2*s+1;
g.close();
return 0;
}