Cod sursa(job #894941)
Utilizator | Data | 27 februarie 2013 02:04:04 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
using namespace std;
#include<fstream>
ifstream eu("fractii.in");
ofstream tu("fractii.out");
long long a[1000001],x=0;
int main()
{
int i,n,j;
eu>>n;
for(i=2;i<=n;i++)
{
a[i]=i;
}
for(i=2;i<=n;i++)
{
if(a[i]==i)
{
for(j=i;j<=n;j+=i)
a[j]=a[j]/i*(i-1);
}
}
for(i=2;i<=n;i++)
x=x+a[i];
tu<<2*x+1;
return 0;
}