Cod sursa(job #1976697)
Utilizator | Data | 4 mai 2017 00:07:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
if(!b)return a;
return cmmdc(b,a%b);
}
int main(int t, int a, int b)
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in>>t;
while (t>=1)
{
in>>a>>b;
out<<cmmdc(a,b);
t--;
}
return 0;
}