Metro Train Fare - TCS NQT

Metro Train Fare - TCS NQT 

Problem:

A metro train is a ring route train which runs in a circular fashion. There are N stations in the train's route. The names of the N stations and the distance between each station (from the previous station to the current station) are passed as the input to the program. For every 1000 meters, the ticket fare is X rupees. The name of the source station, the name of destination station and the value of X are also passed as the input to the program. The program must print the total ticket fare F as the output. The total ticket fare F must be ceiled. 

Boundary Condition(s): 

1 <= N <= 30 Length of each station's name = 2 

1 <= Distance between two stations <= 5000 1 <= X <= 25 

Input Format: The first line contains N. The second line contains the names of the N stations separated by a space. The third line contains the distance between each station separated by a space. The fourth line contains the name of the source station and the destination station separated by a space. The fifth line contains X. 

Output Format: The first line contains the total ticket fare F. 

Example Input/Output 1: 

Input: 

8 

AB DK GH KJ OP RS XY TK 

600 800 750 900 1600 900 1400 1500 

XY KJ 

5 

Output: 

23 

Explanation: 

The source station is XY and the destination station is KJ. The stations present between the source and the destination are XY, TK, AB, DK, GH and KJ. The distance between XY to TK is 1500 meters. The distance between TK to AB is 600 meters. The distance between AB to DK is 800 meters. The distance between DK to GH is 750 meters. The distance between GH to KJ is 900 meters. The total distance covered is 4550 meters. The total ticket cost is 22.75. After ceiling the ticket cost, it becomes 23. So 23 is printed as the output. 

Example Input/Output 2: 

Input: 

8 

AB DK GH KJ OP RS XY TK 

600 800 750 900 1600 900 1400 1500 

RS XY 

10 

Output: 

14 

Example Input/Output 3: 

Input: 

5 

GT XY AK VU MN 

1300 710 970 550 920 

MN GT 

7 

Output: 

10

Program:

import math

n = int(input())

name = input().split()

fare = list(map(int,input().split()))

s, d = input().split()

x = int(input())

total_distance = 0 

pos = name.index(s)+1

while name[pos%n] != d: 

    total_distance += fare[pos%n]

    pos += 1 

total_distance += fare[pos%n]    

print(math.ceil((total_distance/1000) * x)) 

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more