Cod sursa(job #2725461)
| Utilizator | Data | 18 martie 2021 22:49:10 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#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");
ofstream out("fractii.out");
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;
}
}
out<<nr;
return 0;
}