Cod sursa(job #659799)
Utilizator | Data | 10 ianuarie 2012 23:58:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
long int cmmdc(long int a, long int b) {
if (a<b) {
a+=b;
b=a-b;
a=a-b;
}
while (a && b) {
a=a%b;
if (!a)
return b;
b=b%a;
}
return a;
}
int main() {
long int x,y;
int n,i;
ifstream f("cmmdc.in",ifstream::in);
ofstream g("cmmdc.out",ifstream::out);
for (i=0;i<n;i++) {
f>>x>>y;
g<<cmmdc(x,y);
}
return 0;
}