069. Word Rotation

Codeforces

IDCF10269069

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

Bob is attempting to encrypt information so that only those he trusts with the secret code can decode his secret information. Instead of using a highly secure encryption method, bob uses a method called rotation, where he shifts each letter of his phrase a certain number of characters up or down. This shift works by moving the character up and down the alphabet, so the character 'a' shifted by 5 would become 'f'. A shift also wraps around the alphabet, so if you were to shift 'a' by -5, it would become 'v'. In addition, a character can be shifted by values greater than 26, so for example 'a' shifted by 30 would become 'e', wrapping all the way back around the alphabet. To solve this problem, you will be given a single lowercase string and a series of rotations, with each rotation corresponding to the character in the string with the same index. Perform each rotation on each character and determine what the resulting string would be. The first line contains a single lowercase string of length $N$ with no spaces that represents the text to be rotated. The next line contains $N$ space-separated integers that represent the shift performed on the corresponding character of the original string. A single lowercase string that represents the original string after performing the shifts. ## Input The first line contains a single lowercase string of length $N$ with no spaces that represents the text to be rotated. The next line contains $N$ space-separated integers that represent the shift performed on the corresponding character of the original string. ## Output A single lowercase string that represents the original string after performing the shifts. [samples]

**Definitions** Let $ s = s_1 s_2 \dots s_N $ be a string of $ N $ lowercase letters, where $ s_i \in \{ \texttt{a}, \texttt{b}, \dots, \texttt{z} \} $. Let $ r = (r_1, r_2, \dots, r_N) $ be a sequence of $ N $ integers representing the shift for each character. **Constraints** 1. $ N \geq 1 $ 2. For all $ i \in \{1, \dots, N\} $: - $ s_i $ is a lowercase English letter. - $ r_i \in \mathbb{Z} $ **Objective** For each $ i \in \{1, \dots, N\} $, compute the shifted character $ s_i' $ as follows: Let $ p_i = (s_i - \texttt{a} + r_i) \mod 26 $, where $ s_i - \texttt{a} $ is the 0-based index of $ s_i $ in the alphabet. Then $ s_i' = \texttt{a} + p_i $, with arithmetic modulo 26. Output the string $ s' = s_1' s_2' \dots s_N' $.

API Response (JSON)

{
  "problem": {
    "name": "069. Word Rotation",
    "description": {
      "content": "Bob is attempting to encrypt information so that only those he trusts with the secret code can decode his secret information. Instead of using a highly secure encryption method, bob uses a method call",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10269069"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Bob is attempting to encrypt information so that only those he trusts with the secret code can decode his secret information. Instead of using a highly secure encryption method, bob uses a method call...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ s = s_1 s_2 \\dots s_N $ be a string of $ N $ lowercase letters, where $ s_i \\in \\{ \\texttt{a}, \\texttt{b}, \\dots, \\texttt{z} \\} $.  \nLet $ r = (r_1, r_2, \\dots, r_N) $ be a seq...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments