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