Cod sursa(job #1698100)
Utilizator | Data | 3 mai 2016 18:09:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a,int b)
{
if(!b) return a;
else return gcd(b,a%b);
}
int main()
{
int n,x,y;
f>>n;
for (; n;n-- )
{f>>x>>y;
g<<gcd(x,y);}
return 0;
}