Cod sursa(job #2219132)
Utilizator | Data | 7 iulie 2018 13:36:30 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int prime(int x, int y)
{
while (x!=y)
if (x>y) x=x-y;
else y=y-x;
return x;
}
int main()
{
int p, q, n, s=0;
f>>n;
for (p=1; p<=n; p++)
for (q=1; q<=n; q++)
if (prime(p,q) == 1) s++;
g<<s;
return 0;
}