Cod sursa(job #1516531)
Utilizator | Data | 3 noiembrie 2015 09:40:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
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 divizor(int a,int b)
{
if(!b)return a;
else return divizor(b,a%b);
}
int main()
{int n,x,y;
f>>n;
while(n>=1)
{f>>x>>y;
g<<divizor(x,y)<<endl;
n--;}
}