Cod sursa(job #3362227)
| Utilizator | Data | 4 august 2026 15:11:27 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b){
if (b == 0)
return a;
return cmmdc (b, a % b);
}
int main(){
int T;
fin >> T;
for(int i = 1; i <= T; i++){
int x, y;
fin >> x >> y;
fout << cmmdc(x, y) <<'\n';
}
return 0;
}