Cricket Tournament

Cricket Tournament  

Problem:

TCS NQT The program must accept the list of team names participating in a cricket tournament. The character q or Q in the input represents the end of the team list. Each team must play exactly one game against the other teams. The program must print the string value "Total Matches: " followed by the total number of matches possible excluding the semi-final and the final. Then the program must print the pairing of teams in the order of their occurrence as the output. 

Boundary Condition(s): 

3 <= Number of teams <= 12 

Input Format: 

The lines, each contains a string value representing the team name participating in a cricket tournament. 

Output Format: 

The first line contains the string value "Total Matches: " followed by the total number of matches possible excluding the semi-final and the final. The lines from the 2nd line containing the pairing of teams in the order of their occurrence 

Example Input/Output 1: 

Input: 

Chennai 

Mumbai 

Delhi 

Kolkata 

Q 

Output: 

Total Matches: 6 

Chennai vs Mumbai 

Chennai vs Delhi 

Chennai vs Kolkata 

Mumbai vs Delhi 

Mumbai vs Kolkata 

Delhi vs Kolkata 

Example Input/Output 2: 

Input: 

Mumbai 

Chennai 

Hyderabad 

Bangalore 

Kolkata 

q 

Output: 

Total Matches: 10 

Mumbai vs Chennai 

Mumbai vs Hyderabad 

Mumbai vs Bangalore 

Mumbai vs Kolkata 

Chennai vs Hyderabad 

Chennai vs Bangalore 

Chennai vs Kolkata 

Hyderabad vs Bangalore 

Hyderabad vs Kolkata 

Bangalore vs Kolkata

Program:

l = []

while 1: 

    s = input().strip()

    if s == 'q' or s == 'Q':

        break 

    l.append(s)

k = sum(list(range(1,len(l))))

print("Total Matches:",k)

for i in range(len(l)):

    for j in range(i+1,len(l)):

        print(l[i],"vs",l[j])

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

Grouping Colorful LEDs - Accenture

Grouping Colorful LEDs - Accenture Problem: The program must accept the names of the colors in an LED serial set as the input. The program must find the number of groups of LEDs having the same color at the beginning and the end in the given LED serial set. Also consider each LED in the given LED serial set as a group. Finally, the program must print the number of groups of LEDs as the output. Input 1: Red Blue Green Blue Output 1: 5 Input 2: Yellow Red Yellow Green Blue Yellow Green Output 2: 11 Program: color = input().split()  count = 0 for i in range(len(color)):     if color[i] in color[i+1:]:          count  +=  color[i+1:].count(color[i]) print(count + len(color))     Explanation:  1. Accept a list of color names.  2. Iterate through the list and find the count of each color from the position next to the current position. Since to cover all the possible sublists that start and end with the same color. 3. ...
Read more