TIME LIMIT = 1 SEC.
- Okay, this problem has no story. A straightforward problem for your reading pleasure. Given N phone numbers, count the number of times each key has to be pressed to obtain each phone number.
|The first line will contain N - the number of phone numbers.
The following N lines will contain the N different phone numbers.
|Ten space-separated integers, indicating the number of times each key from 0−9 was pressed for every phone number on a new line.|
- 1 ≤ N ≤ 100
- 0000000000 ≤ Phone Number ≤ 9999999999