题解(如下)
2026-11-03 15:57:28
发布于:浙江
6阅读
0回复
0点赞
#include <iostream>
using namespace std;
int x[105], d[105];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> d[i];
}
// 暴力枚举所有两两组合
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
// i 吐到 j,并且 j 吐到 i
bool i_spit_j = (x[i] + d[i] == x[j]);
bool j_spit_i = (x[j] + d[j] == x[i]);
if (i_spit_j && j_spit_i) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
这里空空如也







有帮助,赞一个