HDU 6917 Shorten the array

题目链接

Problem Description

Alice has an array a. The array has N positive numbers. She thinks the array is too long, so she wants to shorten the array. She decides to shorten the array via the following operation: every time she will choose an index $i(1\le i<n)$ which $ai>0$ and $a_i+1>0$. She will delete$a_i$ and $a_i+1$ and use $(a_i$ $mod$ $ai+1)$ or $(ai+1$ $mod$ $a_i)$ to replace them.

For example, for array $[3,2,4,5]$, if Alice choose $i=2$, she can change the array to $[3,2,5]$ or $[3,0,5]$. Alice wants you to tell her the shortest possible length of the array after several options.

Input

The first line contains a single integer $T(1\le T\le 10)$, indicating the number of test cases.

For each test cases:

The first line contains one integer $N(2\le N\le 10^6)$, indicating the size of the array.

The next line contains$N$ integers $a_i(a_i\le 10^9)$, representing the array.

Output

Output $T$ lines.

The $i-th$ line contains a single integer, representing the answer of $i-th$ test case.

Sample Input

2
4
1 1 1 1
4
2 3 4 5

Sample Output

2
1

Hint

For the first sample, Alice first choose $i=1$ to change the array to $[0,1,1]$, then choose $i=2$ to change the array to $[0,0]$, which is the best result she can reach.

解题思路：

取模运算有如下性质：
$$a\%b=a(a<b)$$
Case1:对于样例2：$2345$

我们可以用最小的数$2$对其余数进行取模运算，即$2\%3,2\%4,2\%5$，最后数组元素只剩2，长度为1。

Case2:题目要求做运算的数必须大于0。对于样例1：$1111$
得到最终结果为$00$，数组长度为2

可知，当数组中只存在相同的数时，数组长度为$i$与$i+1$将得到同样的结果，都是$(i+1)/2$。

Case3:对于样例$$222345$$
按如上做法将会得到答案为$2(02)$。但若进行运算时可以得到比最小数(min=2)更小的数，如3%2=1，将此更小的数保存下来（而不是保存2%3=2），此时最小数将更新。于是如此处理后的数组将变为$$221$$
最后可以将其他所有的数吞并，最终答案一定为1。

注意：第二次更新的最小数$x$需满足 $(x>0\&\&x<min)$，并且只能转换一个更小的数来达到目标。

AC代码：

#include<iostream>
#define int long long
using namespace std;
int a[1000005];
int t,n;
signed main()
{
    // ATTENTION %LLD FOR LONG LONG !!!
    scanf("%lld",&t);
    while(t--)
    {
        int minn=1000000005;
        scanf("%lld",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&a[i]);
            if(minn>a[i])   minn=a[i];
        }
        int s=0,f=0;
        for(int i=0;i<n;i++)
        {
        	if((a[i]%minn>0&&a[i]%minn<minn))
        	//判断运算后是否能生成更小的数
        	//此处只需判断与minn的余数即可
        	{
        		f=1;
        		break;
			}
            if(minn==a[i])  s++;
        }
		if(f==1)	printf("1\n");
        else printf("%lld\n",(s+1)/2);
    }
    return 0;
}