Cod sursa(job #2081760)
| Utilizator | Data | 5 decembrie 2017 09:18:30 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int euclid(int a, int b)
{
int aux;
while(b!=0)
{
aux=b;
b=a%b;
a=aux;
}
return a;
}
int main()
{
int n,a,b;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>a>>b;
fout<<euclid(a,b)<<endl;
}
return 0;
}
