检查是否存在满足条件的数字组合
标题：检查是否存在满足条件的数字组合 | 时间限制：1秒 | 内存限制：262144K | 语言限制：不限
给定一个正整数数组，检查数组中是否存在满足规则的数字组合
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> nums;
for (int i = 0; i < n; i++) {
int tmp = 0;
cin >> tmp;
nums.push_back(tmp);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (j == i) {
continue;
}
for (int k = 0; k < n; k++) {
if (k == j || k == i) {
continue;
}
if (nums[i] == (nums[j] + 2 * nums[k])) {
cout << nums[i] << " " << nums[j] << " " << nums[k] << endl;
return 0;
}
}
}
}
cout << 0 << endl;
return 0;
}
