Cod sursa(job #1104449)
| Utilizator |  Sami Reka SamiReka |
Data | 10 februarie 2014 20:03:18 |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,i,j,v[1000000];
long long c;
int main()
{f>>n;
for(i=2;i<=n;i++)
v[i]=i-1;
for(i=2;i<=n;i++)
for(j=2*i;j<=n;j=j+i)
v[j]=v[j]-v[i];
for(i=2;i<=n;i++)
c=c+v[i];
c=c*2+1;
g<<c;
//f.close();
//g.close();
return 0;
}
