Cod sursa(job #1951758)
Utilizator | Data | 3 aprilie 2017 19:41:47 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long t, a, b;
int cmmdc(int a, int b)
{
if(b==0)return a;
else return cmmdc(b,a%b);
}
int main()
{ f>>t;
for(int i=1; i<=t; i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
return 0;
}