Submission
Status:
-P----P---
Subtask/Task Score:
20/100
Score: 20
User: GONGGONG
Problemset: จับคู่เลขมงคล
Language: cpp
Time: 0.002 second
Submitted On: 2026-10-11 22:44:56
#include <iostream>
#include <unordered_map>
using namespace std;
int main() {
int n;cin>>n;
int arr[n];
for(int i=0;i<n;i++) cin>>arr[i];
int target;cin>>target;
unordered_map<int,int> m;
int ok=1;
for(int i=0;i<n;i++){
int c=target-arr[i];
if(m.find(arr[i])!=m.end()) {cout<<arr[i]<<' '<<c<<'\n';ok=0;}
m[c]=arr[i];
}
if(ok) cout<<"No";
}