Cod sursa(job #2138411)
Utilizator | Data | 21 februarie 2018 17:06:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,x,y,m,j,b,i,c,z,l,t[1001],a,v[1001],ok=0,d,r;
int main()
{
f>>n;
for (i=1; i<=n; i++)
{
f>>a>>b;
r=0;
r=a%b;
if (a!=1 and b!=1)
{
while (r!=0)
{
a=b;
b=r;
r=a%b;
}
}
else b=1;
g<<b<<endl;
}
}