Cod sursa(job #3207222)
Utilizator | Data | 25 februarie 2024 15:19:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <stdio.h>
int Euclid(int a, int b)
{
int rest = a % b;
if (!rest)
return b;
else
return Euclid(b, rest);
}
int main()
{
int a, b;
printf("Introduceti 2 numere:\n");
scanf("%d %d",&a,&b);
printf( "Cel mai mare divizor comun este: %d\n", Euclid(a,b) );
return 0;
}