Cod sursa(job #1910013)
Utilizator | Data | 7 martie 2017 15:08:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int T,a,b;
int gcd(int a, int b)
{
if(!b)
return a;
return gcd(b, a % b);
}
int main(void)
{
ifstream fin ("euclid2.in");
ofstream fout("euclid2.out");
fin>>T;
for(int i=1;i<=T;i++)
{
fin>>a>>b;
fout<<gcd(a,b)<<'\n';
}
return 0;
}