Cod sursa(job #1644174)
Utilizator | Data | 9 martie 2016 21:51:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n;
int euclid(int a, int b){
if(!b) return a;
return euclid(b,a%b);
}
int main()
{
in>>n;int a,b;
for (int i=n;i>0;i--){
in>>a>>b;
out<<euclid(a,b)<<'\n';
}
return 0;
}