Cod sursa(job #1962426)
Utilizator | Data | 11 aprilie 2017 19:08:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if (b==0) return a;
else gcd(b,a%b);
}
int main()
{
int a, b, i, div, nr;
ifstream f;
ofstream g;
f.open("euclid2.in");
g.open("euclid2.out");
f>>nr;
for(i=0;i<nr;i++)
{
f>>a;
f>>b;
div=gcd(a,b);
g<<div<<"\n";
}
f.close();
g.close();
return 0;
}