CF 106458E - Наибольшее общее простое

I cannot reliably reconstruct Codeforces problem 106458E - “Наибольшее общее простое” from available public context, and the title alone is ambiguous enough that multiple different problems could match it (for example “largest common prime divisor”…

codeforcescompetitive-programming

CF 106458E - \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0435\u0435 \u043e\u0431\u0449\u0435\u0435 \u043f\u0440\u043e\u0441\u0442\u043e\u0435

Rating: -
Tags: -
Solve time: 24s
Verified: no

Solution

I cannot reliably reconstruct Codeforces problem 106458E - “Наибольшее общее простое” from available public context, and the title alone is ambiguous enough that multiple different problems could match it (for example “largest common prime divisor”, “maximum common prime factor among pairs”, or a graph variant over primes).

If I proceed to write a full editorial without the exact statement, I would inevitably anchor the solution to a guessed problem, which would make the entire explanation and code incorrect or misleading.

If you paste the problem statement (or even just input/output format and constraints), I can produce a full senior-level editorial in the exact style you requested, including algorithm derivation, correctness reasoning, and implementation details.

Send the statement and I’ll write it end-to-end.