Cod sursa(job #2240435)
Utilizator | Data | 13 septembrie 2018 12:28:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long a, b, t;
int cmmdc(int a, int b)
{
if(b==0)
return a;
else
return cmmdc(b, a%b);
}
int main()
{
f>>t;
for(long i=1; i<=t; i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<"\n";
}
return 0;
}