Cod sursa(job #1264956)
Utilizator | Data | 16 noiembrie 2014 15:16:03 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{int i,j,n,t[1000001];
long long k;
ifstream f("fractii.in");
ofstream g("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=j+i)
t[j]=t[j]-t[i];
k=k+t[i];
}
g<<k*2+1;
g.close();
}