Pagini recente » Cod sursa (job #750116) | Cod sursa (job #2540580) | Cod sursa (job #2696110) | Cod sursa (job #3288096) | Cod sursa (job #1135024)
#include <iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int prim (int n)
{
int i=2;
while(i<sqrt(n))
{
if(n%i==0)return 0;
i++;
}
return 1;
}
int main()
{
int n,i,j,k,ok;
in>>n;
in.close();
k=(2*n)-1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(prim(j)==1)
if((i%j!=0)&&(j%i!=0))
{
//cout<<i<<"/"<<j<<"\n";
k++;
}
}
out<<k;
return 0;
}