Cod sursa(job #3308408)
| Utilizator | Data | 24 august 2025 15:16:58 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t, a, b;
int cmmdc(int a, int b){
if (a > b)swap(a,b);
int r;
while (b){
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
f >> t;
for (int i = 1; i <= t; i++){
f >> a >> b;
g << cmmdc(a,b) << '\n';
}
return 0;
}
