Cod sursa(job #790416)
| Utilizator |  George Tutoveanu gxgik |
Data | 21 septembrie 2012 10:48:24 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include "stdio.h"
int N,A,B;
int gcd(int a,int b){
if (!b) return a;
else return gcd(b,a%b);
}
void main(){
freopen("euclid2.in","r",cin);
freopen("euclid2.out","w",cout);
cin>>N;
for (int i=0;i<N;i++){
cin>>A>>B;
cout<<gcd(&A,&B);
}
}