## 20 Oct PMCA Friday 19:00 Python Homework 20.10.16.

**Question 1:**

Your teacher likes to give multiple choice tests. One benefit of giving these tests is that they are easy to mark, given an answer key. The other benefit is that students believe they have a one-in-five chance of getting the correct answer, assuming the multiple choice possibilities are A, B, C, D or E.

Write a program that your teacher can use to grade one multiple choice test.

**Input Specification**

The input will contain the number N (0<N<10000) followed by 2N lines. The 2N lines are composed of N lines of student responses (with one of A, B, C, D or E on each line), followed by N lines of correct answers (with one of A, B, C, D or E on each line), in the same order as the student answered the questions (that is, if line i is the student response, then line N+i contains the correct answer to that question).

**Output Specification**

Output the integer C (0≤C≤N) which corresponds to the number of questions the student answered correctly.

Sample Input 1

3

A

B

C

A

C

BOutput for Sample Input 1

1Sample Input 2

3

A

A

A

A

B

AOutput for Sample Input 2

2

**Question to Think:**

You and a friend are playing the classic game of Battleships. You each have a grid consisting of M rows of N cells (1≤N,M≤2000). Each cell is either empty or contains a player’s ship (in this version of the game, all ships are the size of one cell). The goal of the game is to destroy all of the opponent’s ships by hitting individual cells.

You and your friend have bet tons of CompSci points on this game. Unfortunately, your friend is completely owning you. So desperate times call for desperate measures.

You know for a fact that you can distract your friend for a brief moment by telling him that a famous programmer is behind him, but this trick will only work exactly once (programmers are so predictable). While he isn’t looking, you’ll have time to snatch up some of his ships with one hand. Your hand can cover a square of exactly S×S cells (1≤S≤N,M), and you can gather all the ships within such a square at once.

Of course, your friend is no fool, so he’s got his grid well concealed. As such, you don’t know anything about it except its size, so when the time comes, you’ll just choose a random square of size S×S that’s completely within the grid.

As usual, these bets attract large crowds. One of the bystanders who can see your opponent’s grid knows your plan, and is curious as to the expected number of ships that you will grab (in other words, the average number of ships out of all the possible snatches you could make). Nerdy though he is, he can’t calculate it in his head, so he runs to a computer and codes up a program…

**Input Specification**

Line 1: 3 integers – M, N, and S

The next M lines: N characters each, representing your opponent’s grid – an X represents a ship, while a . represents an empty cell.

**Output Specification**

A single number – the expected number of ships that you’ll grab. It must be within 10−8 of the correct answer.

Sample Input

3 4 2

XX.X

XX..

.X..Sample Output

2Explanation

There are 6 possible areas you could pick, yielding this many ships each:

4 2 1

3 2 0

This is a total of 12 ships, for an average of exactly 2.

Sorry, the comment form is closed at this time.