Problem 44356. Code breaker, Part II: Operation Orthos

Created by David Verrelli

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You have been tasked with decoding several batches of coded messages that have been intercepted.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Based on previous intelligence that has been gathered, you can be confident that the messages were all encoded using a simple</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://en.wikipedia.org/wiki/Caesar_cipher\"><w:r><w:t>Caesar cipher</w:t></w:r></w:hyperlink><w:r><w:t> (a type of</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://en.wikipedia.org/wiki/Substitution_cipher\"><w:r><w:t>substitution cipher</w:t></w:r></w:hyperlink><w:r><w:t>), an example of which is the</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://en.wikipedia.org/wiki/ROT13\"><w:r><w:t>ROT13 cipher</w:t></w:r></w:hyperlink><w:r><w:t> (discussed in</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/78-implement-a-rot13-cipher\"><w:r><w:t>Cody Challenge Problem 78</w:t></w:r></w:hyperlink><w:r><w:t>). As in the Cody Challenge Problem, uppercase and lowercase letters are handled independently of one another, and all other characters (e.g. punctuation &amp; numbers) are unchanged. Unlike the Cody Challenge Problem, here the number of letters to shift is not known in advance, and may vary between batches of messages — although it will be the same for all messages in a batch (also, here you need to decode, not encode).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You can also assume that the original batch of messages will relate to an activity that is referred to by those involved as \"Operation Orthos\". However, in their secret internal communications they might not use this exact phrase at all, nor this exact capitalisation. Therefore you should seek</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>simultaneous</w:t></w:r><w:r><w:t> occurrence of the separate words \"Operation\" and \"Orthos\" (with any capitalisation) in messages within the given batch.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Your task is to crack the codes and report back in a</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://au.mathworks.com/help/matlab/ref/struct.html\"><w:r><w:t>structure array</w:t></w:r></w:hyperlink><w:r><w:t>: (1) the shifting parameter that had been used in the encoding [as</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://au.mathworks.com/help/matlab/ref/uint8.html\"><w:r><w:t>uint8</w:t></w:r></w:hyperlink><w:r><w:t>]; (2) the decoded messages [as a</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://au.mathworks.com/help/matlab/ref/cell.html?s_tid=doc_ta\"><w:r><w:t>cell array</w:t></w:r></w:hyperlink><w:r><w:t> (containing</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://au.mathworks.com/help/matlab/ref/char.html\"><w:r><w:t>character arrays</w:t></w:r></w:hyperlink><w:r><w:t>)]. The name of the structure array shall be \"s\", with respective fields \"shift\" and \"message\".</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>EXAMPLE</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Suppose the batch contained two encoded messages —</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>\"qspdffe x/ pqfsbujpo\"</w:t></w:r><w:r><w:t> and</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>\"Psuipt jt HP!\"</w:t></w:r><w:r><w:t> (provided as character arrays within a cell array) — and a (right-shifting) ROT1 cipher had been applied. In that case A→B, B→C, ..., Y→Z, and Z→A; similarly, a→b, b→c, ..., y→z, and z→a. (Note that the shifting 'wraps' back around.) Thus the original messages would have been: </w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>\"proceed w/ operation\"</w:t></w:r><w:r><w:t> and</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>\"Orthos is GO!\"</w:t></w:r><w:r><w:t> .</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The correct answer would comprise:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[s.shift = uint8(1) \ns.message = {'proceed w/ operation', 'Orthos is GO!'}]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If the batch of messages cannot be decoded when following the above assumptions, then simply return 'scalar'</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://au.mathworks.com/help/matlab/ref/nan.html\"><w:r><w:t>NaN</w:t></w:r></w:hyperlink><w:r><w:t> in both fields (no need for a cell array).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:rFonts w:cs=\"monospace\"/></w:rPr><w:t>Note: Many Cody solutions are hard to read and not necessarily computationally efficient. To direct attention toward efficient runtime speed of execution, timings are measured in the Test Suite, and reported back (if the submission is runnable). Although the timings are not perfectly reproducible, they do provide an indication of computational resource demand. (Try resubmitting on another day if your code runs slowly, in case it is caused by a server issue.)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>To provide some extra motivation for you to get your code to run efficiently, it will fail the Test Suite if it is deemed \"too slow\".</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>----------</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Previous problem: </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/44351\"><w:r><w:t>Operation Phoenix</w:t></w:r></w:hyperlink><w:r><w:t>. Next problem: </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/44383\"><w:r><w:t>Operation Xiangliu</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

You have been tasked with decoding several batches of coded messages that have been intercepted.Based on previous intelligence that has been gathered, you can be confident that the messages were all encoded using a simple <a href = "https://en.wikipedia.org/wiki/Caesar_cipher">Caesar cipher</a> (a type of <a href = "https://en.wikipedia.org/wiki/Substitution_cipher">substitution cipher</a>), an example of which is the <a href = "https://en.wikipedia.org/wiki/ROT13">ROT13 cipher</a> (discussed in <a href = "https://www.mathworks.com/matlabcentral/cody/problems/78-implement-a-rot13-cipher">Cody Challenge Problem 78</a>). As in the Cody Challenge Problem, uppercase and lowercase letters are handled independently of one another, and all other characters (e.g. punctuation & numbers) are unchanged. Unlike the Cody Challenge Problem, here the number of letters to shift is not known in advance, and may vary between batches of messages — although it will be the same for all messages in a batch (also, here you need to decode, not encode).You can also assume that the original batch of messages will relate to an activity that is referred to by those involved as "Operation Orthos". However, in their secret internal communications they might not use this exact phrase at all, nor this exact capitalisation. Therefore you should seek simultaneous occurrence of the separate words "Operation" and "Orthos" (with any capitalisation) in messages within the given batch.Your task is to crack the codes and report back in a <a href = "http://au.mathworks.com/help/matlab/ref/struct.html">structure array</a>: (1) the shifting parameter that had been used in the encoding [as <a href = "http://au.mathworks.com/help/matlab/ref/uint8.html">uint8</a>]; (2) the decoded messages [as a <a href = "http://au.mathworks.com/help/matlab/ref/cell.html?s_tid=doc_ta">cell array</a> (containing <a href = "http://au.mathworks.com/help/matlab/ref/char.html">character arrays</a>)]. 
The name of the structure array shall be "s", with respective fields "shift" and "message".EXAMPLESuppose the batch contained two encoded messages — "qspdffe x/ pqfsbujpo" and "Psuipt jt HP!" (provided as character arrays within a cell array) — and a (right-shifting) ROT1 cipher had been applied. In that case A→B, B→C, ..., Y→Z, and Z→A; similarly, a→b, b→c, ..., y→z, and z→a. (Note that the shifting 'wraps' back around.) 
Thus the original messages would have been: "proceed w/ operation" and "Orthos is GO!" .The correct answer would comprise:<pre class="language-matlab">s.shift = uint8(1) 
s.message = {'proceed w/ operation', 'Orthos is GO!'}
</pre>If the batch of messages cannot be decoded when following the above assumptions, then simply return 'scalar' <a href = "http://au.mathworks.com/help/matlab/ref/nan.html">NaN</a> in both fields (no need for a cell array).<tt>Note: Many Cody solutions are hard to read and not necessarily computationally efficient. To direct attention toward efficient runtime speed of execution, timings are measured in the Test Suite, and reported back (if the submission is runnable). Although the timings are not perfectly reproducible, they do provide an indication of computational resource demand. (Try resubmitting on another day if your code runs slowly, in case it is caused by a server issue.)</tt>To provide some extra motivation for you to get your code to run efficiently, it will fail the Test Suite if it is deemed "too slow".----------Previous problem: <a href = "https://www.mathworks.com/matlabcentral/cody/problems/44351">Operation Phoenix</a>. Next problem: <a href = "https://www.mathworks.com/matlabcentral/cody/problems/44383">Operation Xiangliu</a>.

You have been tasked with decoding several batches of coded messages that have been intercepted.

Based on previous intelligence that has been gathered, you can be confident that the messages were all encoded using a simple <https://en.wikipedia.org/wiki/Caesar_cipher Caesar cipher> (a type of <https://en.wikipedia.org/wiki/Substitution_cipher substitution cipher>), an example of which is the <https://en.wikipedia.org/wiki/ROT13 ROT13 cipher> (discussed in <https://www.mathworks.com/matlabcentral/cody/problems/78-implement-a-rot13-cipher Cody Challenge Problem 78>). As in the Cody Challenge Problem, uppercase and lowercase letters are handled independently of one another, and all other characters (e.g. punctuation & numbers) are unchanged. Unlike the Cody Challenge Problem, here the number of letters to shift is not known in advance, and may vary between batches of messages — although it will be the same for all messages in a batch (also, here you need to decode, not encode).

You can also assume that the original batch of messages will relate to an activity that is referred to by those involved as "Operation Orthos". However, in their secret internal communications they might not use this exact phrase at all, nor this exact capitalisation.  Therefore you should seek _simultaneous_ occurrence of the separate words "Operation" and "Orthos" (with any capitalisation) in messages within the given batch.

Your task is to crack the codes and report back in a <http://au.mathworks.com/help/matlab/ref/struct.html structure array>: (1) the shifting parameter that had been used in the encoding [as <http://au.mathworks.com/help/matlab/ref/uint8.html uint8>]; (2) the decoded messages [as a <http://au.mathworks.com/help/matlab/ref/cell.html?s_tid=doc_ta cell array> (containing <http://au.mathworks.com/help/matlab/ref/char.html character arrays>)]. 
The name of the structure array shall be "s", with respective fields "shift" and "message".

EXAMPLE

Suppose the batch contained two encoded messages — _"qspdffe x/ pqfsbujpo"_ and _"Psuipt jt HP!"_ (provided as character arrays within a cell array) — and a (right-shifting) ROT1 cipher had been applied.  In that case A→B, B→C, ..., Y→Z, and Z→A;  similarly, a→b, b→c, ..., y→z, and z→a.  (Note that the shifting 'wraps' back around.)  
Thus the original messages would have been:  _"proceed w/ operation"_ and _"Orthos is GO!"_ .

The correct answer would comprise:

s.shift = uint8(1)  
  s.message = {'proceed w/ operation', 'Orthos is GO!'}

If the batch of messages cannot be decoded when following the above assumptions, then simply return 'scalar' <http://au.mathworks.com/help/matlab/ref/nan.html NaN> in both fields (no need for a cell array).

|Note:  Many Cody solutions are hard to read and not necessarily computationally efficient.  To direct attention toward efficient runtime speed of execution, timings are measured in the Test Suite, and reported back (if the submission is runnable).  Although the timings are not perfectly reproducible, they do provide an indication of computational resource demand. (Try resubmitting on another day if your code runs slowly, in case it is caused by a server issue.)|

To provide some extra motivation for you to get your code to run efficiently, it will fail the Test Suite if it is deemed "too slow".

----------

Previous problem: <https://www.mathworks.com/matlabcentral/cody/problems/44351 Operation Phoenix>. Next problem: <https://www.mathworks.com/matlabcentral/cody/problems/44383 Operation Xiangliu>.

Solve

Solution Stats

153 Solutions
23 Solvers

Last Solution submitted on Feb 09, 2023

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

Peng Liu on 3 Oct 2017

I recommend you to add additional test cases where only one key word, either operation or Orthos, appears in your input. Currently, the two words always appear simultaneously (unless they are both absent), and thus, one only needs to check the existence of a single word.

Peng Liu on 3 Oct 2017

I also noticed that the iteration number qBig currently being used is too small (and your timing result is only in milliseconds, but there are other overheads which can cause very unreliable measurements). You should use larger qBig, at least 10000. Please note that Cody allows for at least 30 seconds for solution evaluations. So the evaluation time should be in the scale of seconds. This way, any solution runs too slow (e.g., in the scale of minutes) won't pass. This way, without modifying Cody's default scoring system, you automatically force people to focus on improving the code performance, rather than just reducing the code size. Also note that your current modification of the scoring function is an outdated hack to Cody's default scoring system, which does not work any more.

David Verrelli on 4 Oct 2017

Hi, Peng Liu. Thanks for your feedback. TEST CASES: Even though both words always appear simultaneously, only checking for one would engender a high risk of failing Test 4. I do have planned one more decoding problem that would be like what you suggest, though. TIMING: Thanks for the extra information. Actually I'd cut down qBig — somehow I had the idea Cody only allowed a couple of seconds to run, at most. Based on your helpful advice I'll boost qBig. SCORING: Yes, I agree that it's an outdated hack. Hence I revised the wording of the introduction and commented out (almost) all of the size-related code in the Test Suite, compared to the Operation Phoenix problem.

Solution Comments

Show comments

Problem Recent Solvers23

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 44356. Code breaker, Part II: Operation Orthos

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers23

Suggested Problems

More from this Author32

Problem Tags

Community Treasure Hunt

Problem 44356. Code breaker, Part II: Operation Orthos

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers23

Suggested Problems

More from this Author32

Problem Tags

Community Treasure Hunt

Players