Pagini recente » Cod sursa (job #3191256) | Simulare olimpiada clasele 11-12 | Arhiva de probleme | Cod sursa (job #2800440) | Cod sursa (job #1660664)
#include <fstream>
using namespace std;
ifstream fi ("fractii.in");
ofstream fo ("fractii.out");
long long i,j,fr[1000006],nr_prime[1000006],b[1000006][20],n,s,p;
int main()
{
fi>>n;
for (i=2; i<=n; i++)
if (fr[i]==0)
{
for (j=i+i; j<=n; j=j+i)
{
fr[j]++;
nr_prime[j]++;
b[j][nr_prime[j]]=i;
}
}
for (i=1;i<=n;i++)
{
if (nr_prime[i]>0) p=i;
else p=i-1;
for (j=1;j<=nr_prime[i];j++)
p=p-p/b[i][j];
s+=p*2;
}
if (n==1) s=1;
else if (n==2) s=3;
else s++;
fo<<s;
return 0;
}
//3 - 7
//4 - 11
//5 - 19
//6 - 23
//7 - 35
//8 - 43
//9 - 55
//10 - 63