Pagini recente » Cod sursa (job #476262) | Cod sursa (job #2934213) | Cod sursa (job #2672493) | Cod sursa (job #2246320) | Cod sursa (job #2725459)
#include <iostream>
#include <fstream>
using namespace std;
int div_comun(int N, int M)
{
int div = 2;
bool ok = false;
while ((div <= N || div <= M) && ok == false)
{
if(N % div == 0 && M % div == 0)
{
ok = true;
}
++div;
}
return ok;
}
int main()
{
ifstream in("fractii.in");
int N;
in>>N;
int nr = 0;
for (unsigned int i = 1; i <= N; i++)
{
for (unsigned int j = 1; j <= N; j++)
{
if(!div_comun(i,j))
++nr;
}
}
cout<<nr;
return 0;
}