Cod sursa(job #1527234)
| Utilizator | Data | 17 noiembrie 2015 22:20:10 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
using namespace std;
int gcd(int a, int b)
{
if (a > b)
return gcd (b, a);
else if (a == 0)
return b;
else return gcd(b%a, a);
}
int main()
{long long a, b, n;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> n;
for(int i = 1; i <= n; i++)
{f >> a >> b;
g << gcd(a, b) << endl;}
f.close();
g.close();
return 0;}
