Job Title: Lottery Combination Filter Program (C++ Preferred)

Objective:
Develop a program that compares two sets of lottery Unique Combinations (UC), removes exact matches from the first set.

Requirements:
User Interface & Language: C++ preferred.

Input:
Import my Set A large list of UC for a lottery (e.g., all 300M combinations for a 6-number lottery).

Import Set B (Control Filter) list of UC. Each entry in Set B will be checked against Set A for exact matches.

Processing Logic:
For each UC in Set B, search Set A for an exact match (same numbers, same order). If a match is found, remove that UC from Set A.

After processing all entries in Set B, condense Set A (remove gaps) while preserving the original sequence of remaining UC.

Iterative Filtering:
Support repeated imports of new Set B files to repeat the filtering process on the updated Set A.

UC Format:
Fixed-length combinations (5, 6, or 7 numbers per UC).
Both sets will use the same format (e.g., 6-number UCs in Set A and Set B).
Performance:

Optimize for large datasets (Set A may have hundreds of millions of UC).
Memory efficiency is critical; streaming/disk-based processing may be needed.

Deliverables:
Source code with comments.
Brief documentation on how to compile/run the program.
Test cases (sample input/output files).

See attached 2 excel sheets.