Cod sursa(job #2475903)
| Utilizator | Data | 17 octombrie 2019 19:13:20 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
long long cmmdc(long long x, long long y){
long long temp;
while( y != 0 ){
temp = x % y;
x = y;
y = temp;
}
return x;
}
int main(){
std :: ifstream fin("euclid2.in");
std :: ofstream fout("euclid2.out");
int n;
fin >> n;
for(int i = 0; i < n; i++){
long long x, y;
fin >> x >> y;
fout << cmmdc(x, y) << std :: endl;
}
fin.close();
fout.close();
return 0;
}