Cod sursa(job #1061247)
Utilizator | Data | 19 decembrie 2013 15:04:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if (b==0)
return a;
else
return gcd(b,a%b);
}
int main(){
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int t,a,b;
in >>t;
for (int i=0;i<t;i++)
{
in>>a>>b;
out<<gcd(a,b)<<"\n";
}
return 0;
}