Algorithm · Geico · Easy
An airplane's occupied seats are provided as a collection of labels. A label has the form " ", such as 1A, 2B, or 13F, and identifies a single seat in a particular row. Create a program that: Accepts the occupied-seat labels; Separates each label into its numeric row and alphabetic seat designation; Calculates and prints how many seats are not occupied. Apply these fixed rules: The aircraft contains R rows numbered from 1 through R, with C seat letters per row arranged from…