Pagini recente » Cod sursa (job #2605782) | Cod sursa (job #905662) | Cod sursa (job #2595793) | Cod sursa (job #3221316) | Cod sursa (job #607909)
Cod sursa(job #607909)
#include<fstream>
using namespace std;
long c[1000002],i,j,n,v[1000000],u,k=1;
long long rez;
void ciur(int n)
{
for(int i=2;i<=n/2;i++)
if(!c[i])
{
for(j=2;j<=n/i;j++)
c[i*j]=1;
}
for(i=2;i<=n;i++) if(!c[i]) v[++u]=i;
}
int main()
{
ifstream f("fractii.in");ofstream g("fractii.out");
f>>n;
ciur(n);
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
if(i%j && j%i)
{
for(k=1; v[k] && v[k]<=j && (j%v[k] || i%v[k]); k++);
if(v[k]==0 || v[k]>=j) rez++;
}
g<<rez+n+n-1<<" ";
f.close();g.close();
return 0;}