Cod sursa(job #1338631)
Utilizator | Data | 10 februarie 2015 10:26:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T,a,b;
int gcd(int a,int b){
if(b==0) return a;
return gcd(b,b%a);
}
int main(){
in>>T;
for(int i=1;i<=T;i++){
in>>a>>b;
out<<gcd(a,b);
}
return 0;
}