Cod sursa(job #2693862)
Utilizator | Data | 7 ianuarie 2021 12:30:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int N,a,b,i,k;
int GCDivisor(int a, int b)
{
while(b)k=b,b=a%b,a=k;
return a;
}
int main()
{
fi >> N;
for(i=1; i<=N; i++) fi >> a >> b, fo << GCDivisor(a,b) << '\n';
}