Cod sursa(job #1987278)
Utilizator | Data | 30 mai 2017 08:46:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,x,y,i;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>x>>y;
while(x!=y)
{
if (x>y) x=x-y;
else y=y-x;
}
if (y!=1) g<<y<<"\n";
else g<<1<<"\n";
}
return 0;
}