Cod sursa(job #1195306)
Utilizator | Data | 6 iunie 2014 20:44:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b){
if (!b) return a;
else return gcd(b, a%b);
}
int main()
{
int a,b,n,i;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in >> n;
for (i=0;i<n;i++){
in >> a >> b;
out << gcd(a,b) << "\n";
}
return 0;
}