Cod sursa(job #464772)
Utilizator | Data | 21 iunie 2010 17:59:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdlib>
#include <fstream>
using namespace std;
ifstream in("euclid.in");
ofstream out("euclid.out");
int gcd(int a,int b){
int c;
while(a%b!=0) {
c=b;
b=a%b;
a=c;
}
return b;
}
int main(){
int a,b,t,k;
in>>t;
for(k=1;k<=t;k++){
in>>a>>b;
if(a==0) out<<b<<"\n";
else if(b==0) out<<a<<"\n";
else out<<gcd(a,b)<<"\n";
}
}