Cod sursa(job #1893551)
Utilizator | Data | 25 februarie 2017 19:26:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#define NMAX 100003
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T,a,b,i;
int euclid(int a,int b);
int main()
{
fin>>T;
for(i=1;i<=T;i++)
{
fin>>a>>b;
fout<<euclid(a,b)<<'\n';
}
}
int euclid(int a,int b)
{
if(b==0) return a;
return euclid(b,a%b);
}