Pagini recente » Cod sursa (job #1946668) | Cod sursa (job #924775) | Cod sursa (job #2957090) | Cod sursa (job #2190366) | Cod sursa (job #2603399)
#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) q++;
if(i>j)
for(p=2;p<=i/2;p++)
{
if(i%p==0&&j%p==0) q++;
}
if(i<j)
for(p=2;p<=j/2;p++)
{
if(i%p==0&&j%p==0) q++;
}
if(q==0) k++;
}
g<<k;
return 0;
}