Cod sursa(job #2502785)
| Utilizator | Data | 1 decembrie 2019 16:31:12 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream o("euclid2.out");
int gcd(int a, int b){
if(!b) return a;
if(!a) return b;
if(a<b) return gcd(a, b-a);
return gcd(a-b, b);
}
int main(){
int a, b;
f>>a;
while(f>>a){
f>>b;
o<<gcd(b, a)<<'\n';
}
}
