Cod sursa(job #2035413)
Utilizator | Data | 9 octombrie 2017 12:24:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
int cmmdc(int,int);
int main()
{
int n,a,b,i;
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
in>>n;
for(i = 0; i < n;i++)
{
in>>a>>b;
out<<cmmdc(a,b)<<"\n";
}
}
int cmmdc(int a, int b)
{
int t;
while (b != 0)
{
b = a % b;
t = b;
a = t;
}
return a;
}