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