Cod sursa(job #642649)
Utilizator | Data | 1 decembrie 2011 20:42:39 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int main()
{
int v[1000005];
long long contor,i,j,n;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
contor=0;
for(i=2;i<=n;i++)
v[i]=i-1;
for(i=2;i<=n;i++)
{
contor=contor+v[i];
for(j=i+i;j<=n;j=j+i)
v[j]=v[j]-v[i];
}
g<<contor;
f.close();
g.close();
return 0;
}