Cod sursa(job #2639545)
| Utilizator | Data | 2 august 2020 18:08:55 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | 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 cmmdc(int a,int b)
{
if(b)
return cmmdc(b,a%b);
else
{
return a;
}
}
int main()
{
int nr;
f>>nr;
int x,y;
while (nr--)
{
f>>x>>y;
g<<cmmdc(x,y)<<'\n';
}
return 0;
}
