Cod sursa(job #1600907)
Utilizator | Data | 15 februarie 2016 15:20:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
int n,x,y;
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
while((x!=0)&&(y!=0))
{
if(x>y)
x=x%y;
else
y=y%x;
}
if(x!=0)
g<<x;
else
g<<y;
g<<'\n';
}
return 0;
}