Cod sursa(job #1982897)
| Utilizator | Data | 20 mai 2017 15:38:03 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 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 t;
int a, b;
f>>t;
while(t--)
{
f>>a>>b;
g<<euclid(a, b)<<"\n";
}
return 0;
}
