Cod sursa(job #2533447)
Utilizator | Data | 29 ianuarie 2020 00:21:43 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int prim(int a,int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
if(a==1)
return 1;
return 0;
}
int main()
{
int q,p,n,k=0;
f>>n;
for(p=1; p<=n; p++)
for(q=1; q<=n; q++)
if(prim(p,q)==1)
k++;
g<<k;
f.close();
g.close();
}