Pagini recente » Cod sursa (job #1490093) | Cod sursa (job #1427608) | Cod sursa (job #2828096) | Cod sursa (job #2635593) | Cod sursa (job #2603749)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long n,p,q,i,j,k;
int main()
{
f>>n;
k=n*2-1;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
{
q=0;
if(i==j) {j++;}
else if(i>j)
for(p=2;p<=i/2;p++)
{
if(i%p==0&&j%p==0) {q++; break;}
}
else if(i<j)
for(p=2;p<=j/2;p++)
{
if(i%p==0&&j%p==0) {q++; break;}
}
if(q==0) k++;
}
k--;
g<<k;
}