Cod sursa(job #1151619)
Utilizator | Data | 24 martie 2014 11:30:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid.in");
ofstream out("euclid.out");
int euclid(int a,int b){
if(!b) return a;
return euclid(b,a%b);
}
int main(){int n;
in>>n;int mini,a,b;
for(int i=1;i<=n;i++){
in>>a>>b;
out<<euclid(a,b)<<" ";
}
return 0;}