Cod sursa(job #1193060)
Utilizator | Data | 30 mai 2014 19:38:08 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
int i,j,n,t[1000002];
long long k;
int main()
{
f.open("fractii.in");
g.open("fractii.out");
f>>n;
for(i=2;i<=n;i++)
t[i]=i-1;
k=0;
for(i=2;i<=n;i++)
{
for(j=i+i;j<=n;j+=i)t[j]-=t[i];
k+=t[i];
}
g<<k*2+1;
g.close();
}