Cod sursa(job #1377112)
Utilizator | Data | 5 martie 2015 20:11:37 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long n,i,a[1000001],j;
long long s;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
a[i]=i-1;
for(i=1; i<=n; i++)
{
for(j=2*i; j<=n; j=j+i)
a[j]=a[j]-a[i];
s=s+a[i];
}
fout<<2*s+1;
return 0;
}