Phillip and Thomas got into an argument over who is the better tennis player. After realizing that they could debate for hours without actually proving anything, they grabbed their rackets and ran out to the courts. When they came back, they admitted that they lost track of who actually won. They did, however, record who scored each point. When Phillip scored a point, they wrote down an “A.” When Thomas scored a point, they wrote down a “B.” Write a program that takes a list of "A"s and "B"s and outputs who won the game and the final set score.
Input
A list of A’s and B’s.
Output
A and B’s final score and who won.
Tips:
Here is a website about the tennis scoring system .
Example
Input:
a a b a a a b b b a a a a b b b b a b a a b a b b b b b b b b a a a a a b a a a b a b b a b a a b b a a
b b b b b b a b b a a a b a a a b a a b b b a b b b b b a a a b a b b b a b b b b b
a a a a a b a a a b a a a a a a a b a a a a a b b a b b b a b b b a b a b b b b a b b b b a b b a b a a a b a b a b b a b a a a b a a a b a a
b b a b b a a a b a a b a a a a a b a a a a a a a a a b b b b a a a b b b a b a b a b a b a a
Output:
A: 3 sets
B: 1 sets
A wins
Author: pwf7
Tags: pwf7
Date Added: 22-02-2015
Time Limit: 10 secs
Source Limit: 50000 Bytes
Languages: C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, PYP3, CLOJ, FS