Cod sursa(job #1350446)
Utilizator | Data | 20 februarie 2015 20:02:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int a,b,i,n;
int gcd(int a, int b)
{
if (b==0) return a;
return gcd(b, a % b);
}
int main()
{
in>>n;
for(i=1;i<=n;i++){
in>>a>>b;
out<<gcd(a,b)<<endl;
}
return 0;
}