B. Make Almost Equal With Mod

最新推荐文章于 2024-11-12 12:29:51 发布

KQYaili

最新推荐文章于 2024-11-12 12:29:51 发布

阅读量463

点赞数 6

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/KQYaili/article/details/135178892

版权

xi - Solar Storm

⠀

You are given an array $a_1, a_2, \dots, a_n$ of distinct positive integers. You have to do the following operation exactly once:

choose a positive integer $k$ ;
for each $i$ from $1$ to $n$ , replace $a_i$ with $a_i \text{ mod } k^\dagger$ .

Find a value of $k$ such that $\leq k \leq 10^{18}$ and the array $a_1, a_2, \dots, a_n$ contains exactly $2$ distinct values at the end of the operation. It can be shown that, under the constraints of the problem, at least one such $k$ always exists. If there are multiple solutions, you can print any of them.

$^\dagger$ $\text{ mod } b$ denotes the remainder after dividing $a$ by $b$ . For example:

$\text{ mod } 3=1$ since $\cdot 2 + 1$
$\text{ mod } 4=3$ since $\cdot 3 + 3$
$\text{ mod } 1=0$ since $\cdot 1 + 0$
Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $\le t \le 500$ ). The description of the test cases follows.

The first line of each test case contains a single integer $n$ ( $\le n \le 100$ ) — the length of the array $a$ .

The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $\le a_i \le 10^{17}$ ) — the initial state of the array. It is guaranteed that all the $a_i$ are distinct.

Note that there are no constraints on the sum of $n$ over all test cases.
Output

For each test case, output a single integer: a value of $k$ ( $\leq k \leq 10^{18}$ ) such that the array $a_1, a_2, \dots, a_n$ contains exactly $2$ distinct values at the end of the operation.

#include<bits/stdc++.h>
using namespace std;
const int N = 110;
typedef long long LL;
LL f[N];
int n;
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		cin >> n;
		for (int i = 0; i < n; i++) cin >> f[i];
		LL k = 1;
		while (1)
		{
			set<LL> s;
			for (int i = 0; i < n; i++)s.insert(f[i] % k);
			if (s.size() == 2)
			{
				cout << k << endl;
				break;
			}
			k *= 2;
		}
	}
}