Cod sursa(job #1539057)
Utilizator | Data | 30 noiembrie 2015 10:05:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int x,int y)
{
if (y==0) return x;
return euclid(y,x%y);
}
int main ()
{
int i,n,x,y;
f>>n;
for (i=1;i<=n;i++)
{ f>>x>>y;
g<<euclid(x,y)<<endl;
}
return 0;
}