Submission

Status:

-PP---PP--

Subtask/Task Score:

40/100

Score: 40

User: KurtCobain

Problemset: จับคู่เลขมงคล

Language: cpp

Time: 0.004 second

Submitted On: 2025-10-03 16:03:50

#include <iostream>
#include <set>
#include <vector>
using namespace std;

/*
   ????᡹?Ҥ??Ẻ????
   ?????? O^2 ????
   ?ͺ?á ??????˹??á ?? ? loop ??????????
   ?ͺ?ͧ ??????˹觶Ѵ???¨ҡ?ͺ?á ????ͧǹ???? ??????????ѹ????͹??Ѻ
*/
int main(){
    int n;
    cin >> n;
    vector<int> birthdays = {};
    for (int i=0;i<n;i++){
        int x;
        cin >> x;
        birthdays.push_back(x);
    }
    int check;
    cin >> check;
    set<pair<int, int>> pairs = {};
    for (int i=0;i<n;i++){
        for (int j=i+1;j<n;j++){
            if (birthdays[i] + birthdays[j] == check){
                 int max_birth = max(birthdays[i], birthdays[j]);
                 int min_birth = min(birthdays[i], birthdays[j]);
                 pairs.insert({max_birth, min_birth});
            }
        }
    }
    if (!pairs.empty()){
        for (auto &p : pairs){
        cout << p.first << " " << p.second << '\n';
    }
    }
    else {
        cout << "No";
    }
}