Cod sursa(job #1491113)
Utilizator | Data | 24 septembrie 2015 20:06:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,x,y;
int gcd(int x,int y)
{
if (y==0) return x;
return gcd(y,x%y) ;
}
int main()
{
f>>n;
for (int i=1; i<=n; ++i)
{
f>>x>>y;
g<<gcd(x,y)<<'\n';
}
f.close();
g.close();
return 0;
}