Cod sursa(job #1759253)
| Utilizator | Data | 18 septembrie 2016 18:34:10 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool nincs_kozos_oszto(int szam_1, int szam_2)
{
while(szam_1!=szam_2)
{
if(szam_1>szam_2) szam_1 -= szam_2;
else szam_2 -= szam_1;
}
if(szam_1 < 2) {return true;}
return false;
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
long long int n;
f>>n;
long long int p = 0;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(nincs_kozos_oszto(i, j)) p++;
}
}
g<<p;
return 0;
}
