Cod sursa(job #696548)
| Utilizator | Data | 28 februarie 2012 18:56:45 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream>
using namespace std;
long long n,i,j,k,v[1000001]={0};
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
k=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)
for(j=i;j<=n;j+=i)
{
if(v[j])
{
v[j]=v[j]/i;
v[j]=v[j]*(i-1);
}
else
{
v[j]=j/i;
v[j]=v[j]*(i-1);
}
}
k+=v[i];
}
g<<(k*2)-1;
}
