Pagini recente » Cod sursa (job #1818853) | Cod sursa (job #1165792) | Cod sursa (job #1200412) | cali_ma_incurca | Cod sursa (job #2232095)
#include <iostream>
#include <fstream>
using namespace std;
int t,a,b,nrp[5000],diviz;
bool ok[40001];
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int main()
{
int ind=1;
nrp[ind]=2;
for(int i=3;i<=40001;i+=2)
{
if(ok[i]==0)
{
ind++;
nrp[ind]=i;
for(int j=i+i;j<=40001;j+=i)
ok[j]=1;
}
}
in>>t;
for(int i=1;i<=t;i++)
{
in>>a>>b;diviz=1;
for(int j=1;j<=ind&&a>=j&&b>=j;j++)
{
if(a%nrp[j]==0&&b%nrp[j]==0)
{
while(a%nrp[j]==0&&b%nrp[j]==0)
{
a/=nrp[j];b/=nrp[j];
diviz*=nrp[j];
}
}
}
out<<diviz<<'\n';
}
return 0;
}