Cod sursa(job #255796)
Utilizator | Data | 10 februarie 2009 17:16:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
fstream f("euclid2.in",ios::in);
fstream g("euclid2.out",ios::out);
int cmmdc(int a, int b) {
int r;
do {
r=a%b;
a=b;
b=r;
} while (r!=0);
return a;
}
int main () {
int n,a,b;
f>>n;
for(int i=1;i<=n;i++) {
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
return 0;
}