Cod sursa(job #1812449)
Utilizator | Data | 22 noiembrie 2016 09:26:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
int r;
while(b!=0)
{
r = a%b;
a = b;
b = r;
}
return a;
}
int main()
{
int a, b, n, i;
ifstream fin ("euclid.in");
ofstream fout ("euclid.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a>>b;
fout<<cmmdc(a,b)<<"\n";
}
return 0;
}