Cod sursa(job #3312289)
| Utilizator | Data | 27 septembrie 2025 12:50:23 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, a, b, ct;
ll cmmdc(ll a, ll b){
while(b){
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin >> a >> b;
for(int i = 1; i <= n; i++){
fin >> a >> b;
fout << cmmdc(a, b) << endl;
}
return 0;
}
