cf Round #505 (Div. 1 + Div. 2) B:Weakened Common Divisor （思维+gcd+最小因子）

题目链接：

B. Weakened Common Divisor

昊神讲的很好，必须码，这里是传送门：昊神的传送门

AC代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<set>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

typedef long long ll ;

const ll mod=1e9+7;
const int MAX=1e5+10;

ll solve(ll m)//最小因子
{
	for(int i=2;i*i<=m;i++)
	{
		if(m%i==0)
		{
			return i;
		}
	}
	return m;
}

ll gcd(ll m,ll n)//求最大公约数
{
	if(n==0)
	return m;
	
	return gcd(n,m%n);
}

int main()
{
	ll T;
	scanf("%lld",&T);
	if(T == 1)
	{
		ll a,b;
		scanf("%lld%lld",&a,&b);
		printf("%lld\n",a);
	}
	else if(T != 1)
	{
		ll a,b,a1,b1;
		scanf("%lld%lld",&a,&b);
		ll ans1,ans2;
		ans1=a;
		ans2=b;
		//printf("%lld %lld",ans1,ans2);
		for(ll i=1;i<T;i++)
		{
			scanf("%lld%lld",&a1,&b1);
			ans1=gcd(ans1,a1*b1);
			ans2=gcd(ans2,a1*b1);
			//printf("%lld %lld",ans1,ans2);
		}
		
		if(ans1!=1)
		{
			printf("%lld\n",solve(ans1));
		}
		else if(ans2!=1)
		{
			printf("%lld\n",solve(ans2));
		}
		else
		{
			printf("-1\n");
		}
	}
}