Cod sursa(job #1515928)
Utilizator | Data | 2 noiembrie 2015 14:33:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a, int b){
if(b==0){
return a;
}else{
return gcd(b, a%b);
}
}
int main() {
int n;
f>>n;
for(int i=0;i<n;i++){
int a, b;
f>>a;
f>>b;
g<<gcd(a,b)<<"\n";
}
return 0;
}