Cod sursa(job #2202361)
Utilizator | Data | 8 mai 2018 16:26:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("euclid2.in") ;
ofstream fout("euclid2.out") ;
int cmmdc(long long a, long long b)
{
if(b==0) return a ;
else cmmdc(b,a%b) ;
}
int main()
{
long long n,i,x,y ;
fin>>n ;
for(i=1;i<=n;i++)
{
fin>>x>>y ;
fout<<cmmdc(x,y) ;
fout<<endl ;
}
return 0;
}