2018.5.31 Weird Requirements

最新推荐文章于 2024-08-08 07:12:15 发布

AAAAAAAC——

最新推荐文章于 2024-08-08 07:12:15 发布

阅读量237

点赞数

分类专栏：数学、思维

本文链接：https://blog.csdn.net/qq_37868325/article/details/80531069

版权

思维同时被 2 个专栏收录

50 篇文章 0 订阅

订阅专栏

数学、

36 篇文章 0 订阅

订阅专栏

题意：

It is hard to find teams for students to participate in ACM contests, most students have weird requirements for their team mates. For example, Ziad wants the GCD of all his team mate's ratings on all famous websites to be exactly X and the LCM of his ratings to be exactly Y.

There are N famous competitive programming websites. Ramzi's rating on the i^th website is A_i. Ramzi is very experienced, in one contest, he can change his rating on one website to any other value. What is the minimum number of contests that Ramzi must participate in, so that Ziad accepts him as his team mate?

Input

The first line contains one integer T, the number of test cases.

Each test case starts with one line containing three space-separated integers N, X, and Y, the number of famous websites, the required GCD value, and the required LCM value respectively. (1 ≤ N ≤ 10⁵) (1 ≤ X, Y ≤ 10⁹)

The next line contains N space-separated integers A_i, Ramzi's rating on all websites. (1 ≤ A_i ≤ 10⁹)

Output

For each test case print one line containing one integer, the minimum number of contests Ramzi must participate in so that he can become Ziad's team mate.

If it is impossible for Ziad to accept him as his team mate , print -1.

感想：

这是跟着下个周要去邀请赛的大佬一起打的比赛，一个人VS人家一个队，凉凉。。

这算是个思维题，就用了GCD，题意也比较难以理解，还因为漏掉了一个特别情况，一直WA在第二组。。。一个半小时终于调通。。感觉还是可以的。

代码：

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define mod 7901
int T,k,N,X,Y,pos[100005];
int ans,anss,tt,wt;
int GCD(int x,int y)
{
    if(x%y==0) return y;
    return GCD(y,x%y);
}
int main()
{
    cin>>T;
    wt=-1;
    while(T--)
    {
        k=0;
        ans=-1;
        tt=0;
        anss=-1;
        scanf("%d%d%d",&N,&X,&Y);
        if(Y%X!=0||(N==1&&(X!=Y))) {
            for(int i=1;i<=N;i++)
            scanf("%d",&pos[i]);
        printf("-1\n");

        }
        else
        {
            for(int i=1;i<=N;i++)
           {
               scanf("%d",&pos[i]);
               if((pos[i]%X!=0)||(Y%pos[i]!=0)) {k++;}
               else
               {
                   if(ans==-1) ans=Y/pos[i];
                   else ans=GCD(ans,Y/pos[i]);
                   if(anss==-1) anss=pos[i];
                   else
                   {
                       anss=GCD(anss,pos[i]);
                   }
               }
           }
           if(ans!=1) tt++;
           if(anss!=X) tt++;
           if(N==1&&X==Y&&k==1) printf("1\n");
           else if(k>=tt) printf("%d\n",k);
           else
           {
               printf("%d\n",tt<=N?tt:wt);
           }

        }

    }
}