Cod sursa(job #705592)
Utilizator | Data | 4 martie 2012 17:28:02 | |
---|---|---|---|
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 euclid(int a,int b){
int r;
while (b>0){
r=a%b;
a=b;
b=r;
}
return a;
}
int main() {
int a,b,n;
in>>n;
for (int i=1;i<=n;i++){
in>>a>>b;
out<<euclid(a,b)<<"\n";
}
return 0;
}