Cod sursa(job #2770589)
| Utilizator | Data | 21 august 2021 22:49:03 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#define FIN "euclid.in"
#define FOUT "euclid.out"
using namespace std;
int euclid(int a, int b) {
int r = a % b;
while( r ) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main(int argc, char const *argv[]) {
int a, b, T;
ifstream fin(FIN);
ofstream fout(FOUT);
for(fin>>T; T; T--) {
fin>>a>>b;
fout<<euclid(a,b)<<"\n";
}
return 0;
}
