Cod sursa(job #1417907)
| Utilizator | Data | 11 aprilie 2015 13:27:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a, int b)
{
if(b==0) return a;
else return euclid(b, a%b);
}
int main()
{
int i, n, a, b;
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
int div=euclid(a,b);
g<<div<<'\n';
}
return 0;
}
