Cod sursa(job #1188311)
Utilizator | Arthur Springfield Maou | Data | 19 mai 2014 12:18:36 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <cmath>
using namespace std;
int cmmdc(int a, int b){
a=abs(a);
b=abs(b);
if (b>a)return cmmdc(b,a);
else{
int r=a%b;
while (r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
}
int main(){
int x,y,n;
fstream f("euclid2.in",ios::in);
fstream g("euclid2.out",ios::out);
f>>n;
while (n>0){
n--;
f>>x>>y;
g<<cmmdc(x,y)<<"\n";
}
f.close();
g.close();
}