30 Day code challenge-python

Day 8— Dictionaries and Maps

Task

Given n names and phone numbers, assemble a phone book that maps friends’ names to their respective phone numbers. You will then be given an unknown number of names to query your phone book for. For each name queried, print the associated entry from your phone book on a new line in the form name=phoneNumber; if an entry for name is not found, print Not found instead.

Sample input and output

Input Format

The first line contains an integer, n, denoting the number of entries in the phone book. Each of the n subsequent lines describes an entry in the form of 2 space-separated values on a single line. The first value is a friend’s name, and the second value is an 8-digit phone number.

After the n lines of phone book entries, there are an unknown number of lines of queries. Each line (query) contains a name to look up, and you must continue reading lines until there is no more input.

Output Format

On a new line for each query, print Not found if the name has no corresponding entry in the phone book; otherwise, print the full name and phoneNumber in the format name=phoneNumber.

Solution

Explanation

Line 1: Gets the total number of names and phone numbers from the user

Line 2: Creates an empty dictionary

Line 3–5: Gets combined input from the user that contains both a string and a number. Then the name is assigned to the number

Line 6–14: Checks whether the input value is present in the dictionary. If yes, then the key-value pair is printed else “Not found” is printed.

Bonus Tip: Try and Except block is used to avoid exception

See you on day 9