Cod sursa(job #2383814)
Utilizator | Data | 19 martie 2019 20:04:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
int n,a,b,minx,i,j;
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
if(a>b)
{
minx=b;
}
else
{
minx=a;
}
x=0;
for(j=minx;x==0;i++)
{
if(a%j==0&&b%j==0)
{
x=j;
}
}
g<<j<<'\n';
}
return 0;
}