Cod sursa(job #2328565)
Utilizator | Data | 25 ianuarie 2019 22:12:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int n, a, b;
int gcd(int a, int b)
{
if(b==0) return a;
return gcd(b,a%b);
}
int main()
{
fin>>n;
while(n--)
{
fin>>a>>b;
fout<<gcd(a, b)<<'\n';
}
return 0;
}