Pagini recente » Cod sursa (job #1128418) | Cod sursa (job #1790627) | Cod sursa (job #2211035) | Cod sursa (job #3129036) | Cod sursa (job #2254869)
#include <iostream>
#include <fstream>
using namespace std;
int prim(int numarator, int numitor)
{
int x;
while (numitor)
{
x = numarator % numitor;
numarator = numitor;
numitor = x;
}
if (numarator == 1)
return 1;
return 0;
}
int main()
{
int fractii = 0, n=4;
ifstream citire ("fractii.in");
citire >> n;
citire.close();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (prim(i, j))
fractii++;
ofstream afisare ("fractii.out");
afisare << fractii << '\n';
afisare.close();
return 0;
}