CPMagical CP Library

Problem solution · Turing

CCC 2002 J2 - AmeriCanadian

CCC 2002 J2 - AmeriCanadian: a Turing solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to CCCSolutions.

Technique
Direct simulation
Source
CCCSolutions
Length
37 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For CCC 2002 J2 - AmeriCanadian, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 37 lines of Turing from the credited upstream file ccc02j2.t.
  • The implementation keeps its working state in language-native values and containers.
  • No explicit loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from CCCSolutions by CCCSolutions contributors · Milliken Mills High School and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCCC 2002 J2 - AmeriCanadian · TuringTuring
Use this to learn the idea, then write your own version.
% CCC 2002% problem J2: AmeriCanadian%% if a word has > 4 letters and ends with "..kor" %                       (k not a vowel: treat "y" as a vowel)% print the word with "..kour" % keybd and screen i/o, repeat until "quit!" entered function convert (s : string) : string    if length (s) > 4 then        if s (* - 1.. *) = "or" and                not (s (* - 2) = "a"                or s (* - 2) = "e"                or s (* - 2) = "i"                or s (* - 2) = "o"                or s (* - 2) = "u"                or s (* - 2) = "y") then            result s (1 .. * - 2) + "our"        else            result s        end if    else        result s    end ifend convert  var s : stringput "Please enter the words to be translated:"loop    get s    exit when s = "quit!"    put convert (s)end loop

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗