Cod sursa(job #2144901)
Utilizator | Data | 26 februarie 2018 23:32:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t,a,b;
int cmmdc(int x, int y){
if(y==0) return x;
return cmmdc(y,x%y);
}
int main(){
f>>t;
for(int i=t;i>=1;i--){
f>>a>>b;
g<<cmmdc(a,b)<<"\n";
}
return 0;
}