LOADING

加载过慢请开启缓存,浏览器默认开启

daily 1

2023/5/4 daily

CF 1789A

void solve(){
  int n;
  cin>>n;
  vector<int>a(n);
  for(int i=0;i<n;++i)cin>>a[i];
  bool flag=false;
  for(int i=0;i<n;++i){
    for(int j=0;j<i;++j){
       if(gcd(a[i],a[j])<=2){
            flag=true;
            break;
       } 
    }
  }
  cout<<(flag?"YES":"NO")<<'\n';
  return;
}