Write an expression for Best(i) in terms of Best(j) with j<i, with base case Best(1) = 1. Solve this recurrence using dynamic programming.
l=[]
s=input()
s=int(s)
st=[]
for y in range(s):
l.append(int(input()))
st.append(0)
def best(k):
st[0]=1
for i in range(0,len(l)):
m=1
for j in range(0,i):
if(k[i]%k[j]==0):
m=max(m,st[j]+1)
st[i]=m
best(l)
print (max(st))
l=[]
s=input()
s=int(s)
st=[]
for y in range(s):
l.append(int(input()))
st.append(0)
def best(k):
st[0]=1
for i in range(0,len(l)):
m=1
for j in range(0,i):
if(k[i]%k[j]==0):
m=max(m,st[j]+1)
st[i]=m
best(l)
print (max(st))
This assignment contains only one problem, and requires you to write a standalone Python program that can be directly executed, not just a function.
ReplyDeleteHere are some basic facts about tennis scoring:
A tennis match is made up of sets. A set is made up of games.
To win a set, a player has to win 6 games with a difference of 2 games. At 6-6, there is often a special tie-breaker. In some cases, players go on playing till one of them wins the set with a difference of two games.
Tennis matches can be either 3 sets or 5 sets. The player who wins a majority of sets wins the match (i.e., 2 out 3 sets or 3 out of 5 sets)
The score of a match lists out the games in each set, with the overall winner's score reported first for each set. Thus, if the score is 6-3, 5-7, 7-6 it means that the first player won the first set by 6 games to 3, lost the second one 5 games to 7 and won the third one 7 games to 6 (and hence won the overall match as well by 2 sets to 1).
You will read input from the keyboard (standard input) containing the results of several tennis matches. Each match's score is recorded on a separate line with the following format:
Winner:Loser:Set-1-score,...,Set-k-score, where 2 <= k <= 5
For example, an input line of the form
Williams:Muguruza:3-6,6-3,6-3
indicates that Williams beat Muguruza 3-6, 6-3, 6-3 in a best of 3 set match.
The input is terminated by a blank line.
You have to write a Python program that reads information about all the matches and compile the following statistics for each player:
Number of best-of-5 set matches won
Number of best-of-3 set matches won
Number of sets won
Number of games won
Number of sets lost
Number of games lost
You should print out to the screen (standard output) a summary in decreasing order of ranking, where the ranking is according to the criteria 1-6 in that order (compare item 1, if equal compare item 2, if equal compare item 3 etc, noting that for items 5 and 6 the comparison is reversed).
For instance, given the following data
Djokovic:Murray:2-6,6-7,7-6,6-3,6-1
Murray:Djokovic:6-3,4-6,6-4,6-3
Djokovic:Murray:6-0,7-6,6-7,6-3
Murray:Djokovic:6-4,6-4
Djokovic:Murray:2-6,6-2,6-0
Murray:Djokovic:6-3,4-6,6-3,6-4
Djokovic:Murray:7-6,4-6,7-6,2-6,6-2
Murray:Djokovic:7-5,7-5
Williams:Muguruza:3-6,6-3,6-3
your program should print out the following
Djokovic 3 1 13 142 16 143
Murray 2 2 16 143 13 142
Williams 0 1 2 15 1 12
Muguruza 0 0 1 12 2 15
You can assume that there are no spaces around the punctuation marks ":", "-" and ",". Each player's name will be spelled consistently and no two players have the same name.
I never look for a complete solution dea....
Deletehow much u can do.please help.can u please help me if u can.i am not getting any result
Deletewithing tommorrow morning if possible
DeleteThis comment has been removed by the author.
ReplyDeletecan u please help me if u can.i am not getting any result
ReplyDelete