Cod sursa(job #1899604)
| Utilizator | Data | 2 martie 2017 20:31:49 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int teste,a,b;
inline int Cmmdc(int x,int y)
{
int r;
while(y)
{
r=x%y;
x=y;
y=r;
}
return x;
}
void Rezolvare()
{
int i,x;
fin>>teste;
for(i=1;i<=teste;i++)
{
fin>>a>>b;
x=Cmmdc(a,b);
fout<<x<<"\n";
}
}
int main()
{
Rezolvare();
fin.close();
fout.close();
return 0;
}
