Emoji Search

View as PDF

Submit solution

Points: 5
Time limit: 2.0s
Memory limit: 64M

Problem types
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Emojis can be sent easily by formatting an emoji in form :x:, where x is a string containing alphanumeric characters and spaces that identifies the emoji, this is called an identifier. Emojis are always scanned left to right and terminate at the first colon. After an emoji is found, the identifier and the colons that surround it are replaced with a character that represents the specific emoji, called an emoji character. The scanning then continues at the emoji character until the end of the string.

Can you write a program that outputs a list of emoji identifiers in a sentence?

Input Specification

The first line will contain a sentence S\ (1 \le |S| \le 2\ 000), the sentence to check for emojis. Sentence S will only contain alphanumeric characters, colons, and spaces. It is guaranteed there will be no adjacent spaces and colons, and no trailing/leading spaces.

Output Specification

Output the emoji names in the sentence S in the order they appear in the sentence, one emoji name per line. It is guaranteed there will be at least one emoji.

Sample Input 1

JavaScript is the best language in the world :smiley:

Sample Output 1


Sample Input 2

:hudab: :hudab: :hudab: :hudab:

Sample Output 2


Sample Input 3

aosij:a sd:asio:asoi:asd:

Sample Output 3

a sd