Cod sursa(job #2119992)
Utilizator | Data | 1 februarie 2018 20:18:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream fin("main.in");
ofstream fout("main.out");
int a,b;
int cmmdc(int a,int b){return (b) ? cmmdc(b,a%b):a;}
int main()
{
int i,n;
fin >> n;
for(i=0;i<n;i++)
{
fin >> a>> b;
fout <<cmmdc(a,b)<<'\n';
}
}