ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 2167. Cipher Message 5

HINT
Posted by __Andrewy__ 31 Dec 2023 11:49
https://en.wikipedia.org/wiki/Prime_number_theorem

Prime numbers meets often. You can check that head-on decision (check every a XOR i, i=0,1,2...) uses a few numbers