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