Cod sursa(job #1227486)
Utilizator | Data | 10 septembrie 2014 18:38:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#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, nrPairs;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> nrPairs;
while (nrPairs){
f >> a >> b;
g << gcd(a, b)<<"\n";
nrPairs--;
}
return 0;
}