Cod sursa(job #2328616)
Utilizator | Data | 25 ianuarie 2019 23:13:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long n;
int cmmdc(int a,int b)
{
if(!b) return a;
return cmmdc(b,a%b);
}
int main ()
{
fin>>n;
int i=1
while(i!=n)
{
int a,b;
fin>>a>>b;
fout<<cmmdc(a,b);
fout<<endl;
i++;
}
return 0;
}