Cod sursa(job #1169862)
Utilizator | Data | 12 aprilie 2014 11:01:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
long cmmdc(long a, long b){
if (b==0) return a;
else return cmmdc(b, a%b);
}
int main(){
int t,i;
long a,b;
in >> t;
for (i=1; i<=t; i++)
in >> a >> b,
out << cmmdc(a, b) << "\n";
return 0;
}