CT918

Last inscriptions of Viktor

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Before the gates of the railway depot of Cinderline close for winter, Viktor must finish the inscriptions ledger - one figure at a time. Task: Read a lowercase string s and print the number of consonants. Input format: One line with a single lowercase string s. Output format: Print the consonant count. Constraints: 1 <= |s| <= 163; s contains lowercase English letters.

Example 1:

Input: vdqcrpwyecsakcnhslipuphtzigrgpdzpbneryzgafzeskzydedjghsovvspqomjshpqusvjcnqkpfxoakuntqelkedqpjofxsjuobclynwmixxyolqdsqiqzoepvxxvlczy
Output: 107

Example 2:

Input: euvjbwcuvnojxyduzhwbysux
Output: 18

Example 3:

Input: xrvhcsvtwjplwnkxjvntlbxnajehkrueqjsbaygyokhnr
Output: 39

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Last inscriptions of Viktor - EASY Coding Problem | CodeTikki