Cod sursa(job #767818)
Utilizator | Data | 14 iulie 2012 23:14:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
iostream f("euclid2.in");
ofstream g("euclid2.out");
void euclid(int x, int y)
{
while(x!=y)
if(x>y)x-=y;
else y-=x;
return x;
}
int main()
{
int n,x,y;
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
g<<euclid(x,y)<<endl;
}
g.close();
f.close();
return 0;
}