Cod sursa(job #1831388)
| Utilizator | Data | 17 decembrie 2016 22:51:18 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
//http://www.infoarena.ro/problema/euclid2
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b)
{
if(b!=0) return cmmdc(b, a%b);
else return a;
return a;
}
int main()
{
int a,i;
fin >> a;
int x[a], y[a];
for(i = 1; i <= a; i++)
{
fin >> x[i] >> y[i];
fout << cmmdc(x[i], y[i]) << "\n";
}
return 0;
}
