Cod sursa(job #1308009)
Utilizator | Data | 3 ianuarie 2015 12:29:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#define nmax
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int N, a, b;
void cmmdc(int x1, int x2){
int r;
do{
r = x1 % x2;
x1 = x2;
x2 = r;
}while(r);
g<<x2<<'\n';
}
int main()
{int i;
f>>N;
for(i = 1 ; i <= N ; ++i){
f>>a>>b;
cmmdc(a, b);
}
return 0;
}