Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: nate213121
Problemset: จับคู่เลขมงคล
Language: cpp
Time: 0.004 second
Submitted On: 2026-09-17 19:33:53
#include <bits/stdc++.h>
using namespace std;
int main()
{
set<int> existing;
int n;
cin >> n;
vector<int> v;
for(int i = 0; i < n; i++)
{
int tmp;
cin >> tmp;
v.push_back(tmp);
existing.insert(tmp);
}
int target;
cin >> target;
set<int> done;
int c = 0;
for(int i = 0; i < n; i++)
{
int complement = target - v[i];
if(complement != v[i] && done.find(v[i]) == done.end() && existing.find(complement) != existing.end())
{
cout << v[i] << " " << complement << endl;
done.insert(v[i]);
done.insert(complement);
c++;
}
}
if(c == 0)
{
cout << "No";
}
return 0;
}