Cod sursa(job #1511692)
Utilizator | Data | 27 octombrie 2015 01:06:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
void gcd(int x, int y){
if(y > 0)
gcd(y, x%y);
if(y == 0) out << x << "\n";
}
void read(){
int T, x, y;
in >> T;
for(int i = 0; i < T; ++i){
in >> x >> y;
gcd(x, y);
}
}
int main(){
read();
return 0;
}