Cod sursa(job #731098)
Utilizator | Data | 7 aprilie 2012 14:47:56 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int n,p,q,t,a[50000];
int main ()
{
ifstream fin("fractii.in");
fin>>n;
fin.close();
for(p=1;p<=n;p++)
a[p]=p;
for(p=2;p<=n;p++)
if(a[p]==p)
for(q=p;q<=n;q=q+p)
{
a[q]=a[q]/p;
a[q]=a[q]*(p-1);
}
for(p=1;p<=n;p++)
t=t+a[p];
ofstream fout("fractii.out");
fout<<(t*2)-1;
return 0;
}