Submission

Status:

PPP--PPP--

Subtask/Task Score:

60/100

Score: 60

User: KurtCobain

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-03 16:06:34

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

int main() {
    int n;
    cin >> n;
    vector<int> birthdays(n);
    for (int i = 0; i < n; i++) {
        cin >> birthdays[i];
    }
    int check;
    cin >> check;

    int found = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (birthdays[i] + birthdays[j] == check) {
                int big = max(birthdays[i], birthdays[j]);
                int small = min(birthdays[i], birthdays[j]);
                cout << big << " " << small << '\n';
                found++;
            }
        }
    }

    if (found == 0) {
        cout << "No";
    }
}