Cod sursa(job #812090)
Utilizator | Data | 13 noiembrie 2012 14:22:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out("euclid2.out");
int main()
{ int r, a, b, aux, n, i;
in>>n;
for(i=1;i<=n;i++){
in>>a; in>>b;
if(b>a){
aux=a;
a=b;
b=aux;}
while(b!=0){
r=a%b;
a=b;
b=r;}
out<<a<<"\n";
}
return 0;
}