Intellectual Olympiad in Algorithms and Programming Fundamentals - 2026 ongoing

Subject: Algorithms and Programming Fundamentals
Level: XII
Category: student
Quiz questions: in English
Example question: A polynomial-time many-one reduction from decision problem A to decision problem B has been established. If A is NP-complete and B belongs to P, what follows? P equals co-NP, B is necessarily undecidable, P equals NP, A cannot be solved by a deterministic algorithm