Problem Statement

Problem Description Elena performs card magic for a living. Her working deck follows the usual format: 4 suits of 13 cards each, numbered 1 through 13, with the suits marked S, C, H, and D. Every card's label follows the pattern DXY, where D is the suit letter and XY is the two-digit number (so, for example, the 8 of suit S is written S08). Rushing out the door for a gig one evening, Elena grabbed whichever deck happened to be closest instead of her usual one. Once she arrived, she discovered this deck had actually been used before, so it might be short some cards or have cards from a different deck mixed in. Given the cards currently in her deck as one string, write a program that reports how many cards are missing from each suit. If a suit instead contains a repeated card, print DUPLICATE for that suit in place of a missing-card count. Read the input from STDIN and print the output to STDOUT. Do not print arbitrary strings anywhere in the program, as these contribute to the standard