Cod sursa(job #1216697)
Utilizator | Data | 5 august 2014 14:01:41 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.25 kb |
#include <ifstream>
using namespace std;
unsigned long long sol;
int n,i,v[1000001],j;
int main()
{
fin>>n;
for (i=1;i<=n;i++) v[i]=i-1;
for (i=2;i<=n;i++)
for (j=i+i;j<=n;j+=i)
v[j]-=v[i];
for (i=2;i<=n;i++) sol+=v[i];
sol*=2;sol++;
fout<<sol
}