HDU 5902 GCD is Funny(GCD)

最新推荐文章于 2021-08-08 11:28:42 发布

原创最新推荐文章于 2021-08-08 11:28:42 发布 · 629 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

OJ题目同时被 2 个专栏收录

50 篇文章

订阅专栏

ACM

20 篇文章

订阅专栏

本文介绍了一款由Alex发明的新游戏，该游戏涉及选择并替换板上的数字，通过计算所选数字的最大公约数来更新板上的数值。最终目标是确定在进行特定次数的操作后，哪些相同的数字可能留在板上。文章提供了具体的输入输出示例及实现该逻辑的C++代码。

GCD is Funny

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 468 Accepted Submission(s): 125

Problem Description

Alex has invented a new game for fun. There are

n integers at a board and he performs the following moves repeatedly:

1. He chooses three numbers

b and

c written at the board and erases them.
2. He chooses two numbers from the triple

b and

c and calculates their greatest common divisor, getting the number

d (

d maybe

gcd(a,b),

gcd(a,c) or

gcd(b,c)).
3. He writes the number

d to the board two times.

It can be seen that after performing the move

n−2 times, there will be only two numbers with the same value left on the board. Alex wants to know which numbers can left on the board possibly. Can you help him?

Input

There are multiple test cases. The first line of input contains an integer

(1≤T≤100), indicating the number of test cases. For each test case:

The first line contains an integer

(3≤n≤500) -- the number of integers written on the board. The next line contains

n integers:

a1,a2,...,an

(1≤ai≤1000)-- the numbers on the board.

Output

For each test case, output the numbers which can left on the board in increasing order.

Sample Input

Sample Output

1 2
2
1 2 3



#include<stdio.h>
#include<string.h>
#define maxn 100000
int gcd(int x,int y)
{
    if(x%y==0) return y;
    else  return gcd(y,x%y);
}
int num[maxn],a[maxn];
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
       scanf("%d",&n);
        memset(num,0,sizeof(num));
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }

        for(int i=1;i<n;i++)
            for(int j=i+1;j<=n;j++)
                num[gcd(a[i],a[j])]=1;
        int flag=1,cnt=n-1;
        while(flag&&cnt>=3)
        {
            cnt--;
            flag=0;
            for(int i=1;i<=1000;i++)
                if(num[i])
                    for(int j=1;j<=n;j++)
                    {
                        int t=gcd(i,a[j]);
                        if(num[t]==0)
                        {
                            num[t]=1;
                            flag=1;
                        }
                    }
        }

        int t=0;
        for(int i=1;i<=1000;i++)
            if(num[i])
            {
                if(t)
                    printf(" %d",i);
                else{
                    printf("%d",i);
                    t=1;
                }
            }
        printf("\n");
    }
}