Cod sursa(job #1227719)
Utilizator | Data | 11 septembrie 2014 14:58:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <iostream>
using namespace std;
int y, x, n;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a, int b)
{
if(!b) return a;
return gcd(b, a % b);
}
int main()
{
int t;
f>>t;
while(t>0)
{
f>>x>>y;
g<<gcd(x ,y)<<'\n';
t--;
}
return (0);
}