Cod sursa(job #660139)
Utilizator | Data | 11 ianuarie 2012 19:40:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
long int cmmdc(long int a, long int b) {
long int c;
while (b) {
c=a%b;
a=b;
b=c;
}
return a;
}
int main() {
long int x,y;
int n,i;
ifstream f("euclid2.in",ifstream::in);
ofstream g("euclid2.out",ifstream::out);
f>>n;
for (i=0;i<n;i++) {
f>>x>>y;
g<<cmmdc(x,y)<<'\n';
}
return 0;
}