Cod sursa(job #2044489)
Utilizator | Data | 21 octombrie 2017 10:38:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, x, y;;
int main()
{
f>>n;
for(int i=0; i<n; i++)
{
f>>x>>y;
if(y>x)
{
int a=x;
x=y;
y=a;
}
while(y!=0)
{
int a=x%y;
x=y;
y=a;
}
g<<x<<'\n';
}
return 0;
}