Cod sursa(job #2247088)
Utilizator | Data | 27 septembrie 2018 21:16:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
if (a==0)
return b;
return euclid(b % a, a);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t,a,i,b;
f>>t;
for(i=1;i<=t;i++)
{
f>>a>>b;
g<<euclid(a,b)<<'/n';
}
return 0;
}