Cod sursa(job #1046509)
Utilizator | Data | 2 decembrie 2013 23:35:04 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int v[1000002],n,i,j;
long long maxfrac=0;
f>>n;
for(i=2; i<=n; i++)
v[i]=i-1;
for(i=2; i<=n; i++)
{
maxfrac+=v[i];
for(j=i+i; j<=n; j=j+i)
v[j]-=v[i];
}
maxfrac=maxfrac*2+1;
g<<maxfrac;
return 0;
}