Cod sursa(job #3254770)
Utilizator | Data | 8 noiembrie 2024 19:40:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
int euclidGCD(int a,int b)
{
while(b!=0)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T;
fin>>T;
for(int i=0;i<T;++i)
{
int a,b;
fin>>a>>b;
fout<<euclidGCD(a,b)<<"\n";
}
in.close();
out.close();
return 0;
}