Cod sursa(job #1914152)
Utilizator | Data | 8 martie 2017 15:47:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int n,a,b,i;
int cmmdc(int x, int y)
{
int aux;
while(x!=0)
{
aux=y%x;
y=x;
x=aux;
}
return y;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}