Cod sursa(job #2059738)
Utilizator | Data | 7 noiembrie 2017 15:52:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a , int b)
{
if (a=b){ return a;}
{
if (a>b){ return gcd(a%b,b); }
{
return gcd(a,b%a);
}
}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t;
int a;
int b;
f>>t;
for ( int i=1; i<= t; i++)
{
f>>a>>b;
g << gcd(a,b) << endl;
}
}