Pagini recente » Cod sursa (job #1172199) | Cod sursa (job #2432157) | Cod sursa (job #2309566) | Cod sursa (job #969390) | Cod sursa (job #1757668)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int prim(int a, int b)
{
int c;
while(b)
{
c = a % b;
a = b;
b = c;
}
if(a == 1)
return 1;
return 0;
}
int fractii(int n)
{
int i, j, nr = 0;
for(i = 1; i < n + 1; i++)
for(j = 1; j < n + 1; j++)
if(prim(i, j))
nr++;
return nr;
}
int main()
{
int n;
f >> n;
g << fractii(n);
return 0;
}