Alphabet Soup
시간 제한1초메모리 제한2048 MB
대문자 문자열이 주어질 때 알파벳 26자가 모두 나오는지 판정하고, 빠진 글자가 있으면 알파벳 순서로 출력한다.
문제
Andrew is making himself a nice warm bowl of alphabet soup. However, before Andrew can eat the soup, he needs to make sure that it contains every letter of the alphabet. Can you write an algorithm that will tell him if his soup has all of the letters in it, and if not, which letters are missing?
입력
Input is a single line of uppercase letters (A-Z) of length (), possibly containing duplicates.
출력
If all letters A-Z are present in the input, the output should be "Alphabet Soup!". Otherwise, the output should be a single line containing all of the uppercase letters that were missing from the input string, in alphabetical order.