GitHub - MohanHarsha-Kota/Cipher-Cracker: The task is to find out if the given message fragment could be part of a given encrypted message, and if so, in how many positions? The encryption is done using substitution cipher. Unfortunately, the key is not available. The input consists of: one line with a string consisting of at least 1 and at most 250000 lowercase letters, the encrypted message; one line with a string consisting of at least 1 and at most 250000 lowercase letters, the decrypted fragment. If there is a unique position in the encrypted message where the message fragment could occur, output the substring of the encrypted message that could correspond to the fragment. Otherwise, output the number of positions in the encrypted message where the fragment could occur. This task was taken from NothWestern Europe Regional Contest (NWERC). This program tries to solve this problem.

MohanHarsha-Kota / Cipher-Cracker Public

Notifications You must be signed in to change notification settings
Fork 1
Star 1

The task is to find out if the given message fragment could be part of a given encrypted message, and if so, in how many positions? The encryption is done using substitution cipher. Unfortunately, the key is not available. The input consists of: one line with a string consisting of at least 1 and at most 250000 lowercase letters, the encrypted m…