Cod sursa(job #2483246)
Utilizator | Data | 29 octombrie 2019 16:21:47 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a,int b)
{int r;
r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
if(b==1)
return 1;
return 0;
}
int n,i,j,nr;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(euclid(i,j))nr++;
cout<<nr;
}