Cod sursa(job #3258347)
| Utilizator | Data | 22 noiembrie 2024 10:32:30 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 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, m[100001][2];
fin >> T;
for (int i = 1; i <= T; i++){
for (int k = 1; k <= 2; k++){
fin >> m[i][k];
}
fout << cmmdc(m[i][1], m[i][2]) << '\n';
}
}
