CT1858

Smith's inscriptions Mirror

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Caravans arrive at the herring shoals of Silverfin with crates of inscriptions, and Smith the clerk must account for every last one. Task: Read a string s and print it reversed. Input format: One line with a single lowercase string s. Output format: Print s reversed. Constraints: 1 <= |s| <= 102; s contains lowercase English letters.

Example 1:

Input: tjziswtolmvzyjtyumjfsizmk
Output: kmzisfjmuytjyzvmlotwsizjt

Example 2:

Input: viibvahhncugmoeroovjsburplqmitoqfibegdztbwqrlollkobldtltsjokxajwhoensxdlp
Output: pldxsneohwjaxkojstltdlbokllolrqwbtzdgebifqotimqlprubsjvooreomgucnhhavbiiv

Example 3:

Input: ctwbtefnojimxgfcugugcvaqhjlliaxsyrnz
Output: znrysxailljhqavcgugucfgxmijonfetbwtc

Constraints:

1 <= |s| <= 102; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.
Smith's inscriptions Mirror - EASY Coding Problem | CodeTikki