Cod sursa(job #1657795)
Utilizator | Data | 20 martie 2016 20:08:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long euclid(long long a, long long b){
if (!b) return a;
return euclid(b,a%b);
}
int main()
{ long n;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
cin>>n;
for (long i=0; i<n; i++){
long long a,b;
cin>>a>>b;
cout<<euclid(a,b)<<endl;
}
return 0;
}