Cod sursa(job #2707043)
| Utilizator | Data | 16 februarie 2021 13:30:20 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int gcd(int a, int b) {
if (a%b==0)
return b;
else
if((a%b) <= (a/b) || (a%b)%(a/b)==0)
return (a%b);
return (a%b)/(a/b);
return 0;
}
int main() {
int T;
in >> T;
for(int i =1;i<=T;i++)
{
int a,b;
in >> a >> b;
out << gcd(max(a,b),min(a,b)) << endl;
}
return 0;
}
