Cod sursa(job #1843264)
Utilizator | Data | 8 ianuarie 2017 15:17:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a, int b)
{
if(a == 0)return b;
if(b == 0)return a;
if(a > b)return euclid(a%b,b);
return euclid(b%a,a);
}
int main()
{
int n, i, a, b;
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<euclid(a, b)<<'\n';
}
return 0;
}