Cod sursa(job #2439429)
| Utilizator | Data | 15 iulie 2019 22:35:03 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n,a,b;
int cmmdc(int a, int b){
if(!b) return a;
else return cmmdc(b,a%b);
}
int main()
{
fin>>n;
for( int i=1; i<=n; i++){
fin>>a>>b;
fout<<cmmdc(a,b)<<'\n';
}
return 0;
}
