Cod sursa(job #952100)
| Utilizator |  Justin Lim Kai Ze phobos |
Data | 22 mai 2013 18:17:41 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include<iostream>
#include<fstream>
using namespace std;
int gcd(int a,int b){
return (b==0?a:gcd(b,a%b));
}
int main(){
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T,a,b;
in>>T;
while(T--){
in>>a>>b;
out<<gcd(a,b)<<'\n';
}
return 0;
}