Cod sursa(job #2874670)
Utilizator | Data | 19 martie 2022 21:20:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
using namespace std;
int n,a,b;
int gdc(int a, int b){
while(a!=b)
if(a>b)
a-=b;
else
b-=a;
return a;
}
int main(){
fin >> n;
for(int i=1; i<=n; ++i)
{
fin >> a >> b;
gdc(a,b);
fout << a << '\n';
}
}