Cod sursa(job #2059770)
Utilizator | Data | 7 noiembrie 2017 16:23:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
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 (b==0) {return a;}
return gcd(b,a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t;
int x;
int y;
f>>t;
while(t>0){
f>>x>>y;
g << gcd(x,y) << '\n';
t--;
}
}