Cod sursa(job #2931337)
Utilizator | Data | 30 octombrie 2022 21:24:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b) {
int aux;
while (b) {
aux = a%b;
a = b;
b = aux;
}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, no1, no2;
f >> n;
for (int i = 1; i <= n; ++i) {
f >> no1 >> no2;
g<<gcd(no1, no2)<<"\n";
}
return 0;
}