Problem F. Cities Input file: Output file: Time limit: standard input standard output 1 second 256 megabytes Memory limit: Jonathan is a very curious boy. He has a list of countries and list of cities of each country. His task is for each city determining country where is located. But Jonathan doesn't know geography and needs your help. Input In the first line of the input given an integer n. The next n lines given the name of country, count of cities k, and cities of of this country. It is guaranteed that their names are unique. In the next line given m - the number of names of cities which Jonathan asked. The next m lines given names of cities. Output For each Jonathan's query - print country name, if we know in which country is located. Otherwise, print "Unknown". Example standard input standard output Kazakshtan Kazakshtan 3 Kyzylorda Karaganda Uralsk USA USA 3 California Berkly Nev-York Unknovn England 1 London Kazakshtan 4 Kyzylorda New-York Atyrau Karaganda

Problem F. Cities Input file: Output file: Time limit: standard input standard output 1 second 256 megabytes Memory limit: Jonathan is a very curious boy. He has a list of countries and list of cities of each country. His task is for each city determining country where is located. But Jonathan doesn't know geography and needs your help. Input In the first line of the input given an integer n. The next n lines given the name of country, count of cities k, and cities of of this country. It is guaranteed that their names are unique. In the next line given m - the number of names of cities which Jonathan asked. The next m lines given names of cities. Output For each Jonathan's query - print country name, if we know in which country is located. Otherwise, print "Unknown". Example standard input standard output Kazakshtan Kazakshtan 3 Kyzylorda Karaganda Uralsk USA USA 3 California Berkly Nev-York Unknovn England 1 London Kazakshtan 4 Kyzylorda New-York Atyrau Karaganda

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a program that calculates the equivalent resistance of a circuit. n electrical resistors with resistance values R1, R2,.., Rn are said to be connected in parallel if the same voltage is applied across each. Their equivalent resistance Reg is related to the values R1, R2, ..., Rn by: 1 1 1 1 + +...+ R R R, R. "eq Write a program that prompts the user to enter the resistance of n resistors. The user should be prompted continuously by using a while loop until a zero or negative value is entered (the program should count the number of resistors n entered by the user and store the values in an array). Use another separate loop to print the resistance values entered by the user and the equivalent resistance Reg. Test your program with R1= 1 kn, R2= 2 kn, R3= 4 kQ and R4= 8 kQ.
Given a Binary Number B, find its decimal equivalent. Example 1: Input: B = 10001000 Output: 136 Example 2: Input: B = 101100 Output: 44 Your Task: You don't need to read or print anything. Your task is to complete the function binary_to_decimal() which takes the binary number as string input parameter and returns its decimal equivalent. Expected Time Complexity: 0(K* Log(K)) where K is number of bits in binary number. Expected Space Complexity: 0(1)
The Research team led by Bernadette Wolowitz at Cal-tech University has discovered a new Amoeba that grows in the order of a Fibonacci series every month. They are exhibiting this amoeba in a national. conference. They want to know the size of the amoeba at a particular time instant. If a particular month's index is given, write a program to display the amoeba's size. For Example, the size of the amoeba on month 1, 2, 3, 4, 5, 6,... will be 0, 1, 1, 2, 3, 5, 8.... respectively.
Given two numbers: n: number of consecutive letters beginning at a k: string length Output all possible k-length possible strings containing the first n letters of the alphabet. Letter repeats are allowed. Sample Run: # of letters: 4 length: 3 aaa aab aac aad aba abb abc abd aca acb acc acd ada adb adc add baa bab bac bad bba bbb bbc bbd bca bcb bcc bcd bda bdb bdc bdd caa cab cac cad cba cbb cbc cbd cca ccb ccc ccd cda cdb cdc cdd daa dab dac dad dba dbb dbc dbd dca dcb dcc dcd dda ddb ddc ddd
write easy program
Need help with a python program. Please follow instructions provided in assignmnet.
Python only Rajesh loves lucky numbers. Everyone knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, the numbers 47,744, 4 are lucky and 5, 17,467 are not. Let Fa(x) equal the number of digits d in the decimal representation of the positive integer x. Chef is only interested in F4(x) and F7(x) functions. For a given positive integer N, he wants to know the total number of distinct pairs (L; R) such that F4(L) + F4(L + 1) + ... + F4(R) equals F7(L) + F7(L + 1) + ... + F7(R) and 1
Given an integer N and a base X, the task is to find the minimum number of operations required to represent N as a sum of the distinct powers of X. In each operation, you can either increment or decrement N. You are allowed to make the given operation any number of times Examples: Input: N = 7, X = 3 Output: 3.
Do it in python language. fast
Oppkls.
Description Xiao Zhang is often distressed because there are too many things to arrange. Now he has n tasks at hand, and each task has a starting times, and an ending time e;. To complete a task, he must do it from the starting time to the ending time, and Xiao Zhang can only perform one task at the same time. Xiao Zhang wants to know how many tasks he can accomplish at most. Input The first line is an integer n (1sns300000), indicating the number of tasks Xiao Zhang has at hand. In the next n lines, each line contains two integers s₁, e¡ (1≤s;
vcbnvcbncvbn