注意i和j的起始值,以防结果重复。
#include <iostream>
using namespace std;
int main() {
int array[10];
int k;
for (int i = 0; i < 10; ++i) {
cin >> array[i];
}
cin >> k;
bool found = false;
for (int i = 0; i < 10; i++) {
for (int j = i + 1; j < 10; j++) {
if (array[i] + array[j] == k) {
cout << array[i] << "+" << array[j] << "=" << k << endl;
found = true;
}
}
}
if (!found) {
cout << "does not exist" << endl;
}
return 0;
}