Cod sursa(job #2482248)
Utilizator | Data | 27 octombrie 2019 22:29:56 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int n,i,j,a=0;
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(euclid(i,j)==1)
a++;
fout<<a;
return 0;
}