Cod sursa(job #662653)
Utilizator | Data | 16 ianuarie 2012 21:22:44 | |
---|---|---|---|
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");
void euclid (int x, int y)
{
int z;
while (y!=0)
{
z=x%y;
x=y;
y=z;
}
g<<x;
}
int x,y,n,i;
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>x>>y;
euclid(x,y);
g<<'\n';
}
return 0;
}