Bangladesh XI vs Zimbabwe 1st ODI Match Dream11 Team Playing11 ZIM vs B...

-






Team news:
Bangladesh Expected Playing XI:
Liton Das, Nazmul Hossain Shanto, Imrul Kayes, Mushfiqur Rahim, Mohammad Mithun, Mahmudullah, Mashrafe Mortaza (c), Mehidy Hasan, Rubel Hossain, Mustafizur Rahman, Nazmul Islam

ZIM Expected Playing XI:
Hamilton Masakadza (c), Soloman Mire, Craig Ervine, Brendan Taylor, Sean Williams, Sikandar Raza, Peter Moor, Elton Chigumbura, Donald Tiripano, Brandon Mavuta, Tendai Chatara

Comments

Post a Comment

Popular posts from this blog

URI Online Judge | 1013 The Greatest Solve with source code

-
Image
URI Online Judge | 1013 The Greatest Adapted by Neilor Tonin, URI  Brazil Timelimit: 1 Make a program that reads 3 integer values and present the greatest one followed by the message "eh o maior". Use the following formula: Input The input file contains 3 integer values. Output Print the greatest of these three values followed by a space and the message “eh o maior”. SOLVE                     A,B,S = input().split()                      A = int(A)                      B = int(B)                      S =int(S)                      P=max(A,B,S)                      print(P,"eh o maior")
Read more

URI Online Judge | 1020 Age in Days Solve with source code

-
Image
URI Online Judge | 1020 Age in Days Adapted by Neilor Tonin, URI  Brazil Timelimit: 1 Read an integer value corresponding to a person's age (in days) and print it in years, months and days, followed by its respective message “ano(s)”, “mes(es)”, “dia(s)”. Note: only to facilitate the calculation, consider the whole year with 365 days and 30 days every month. In the cases of test there will never a situation that allows 12 months and some days, like 360, 363 or 364. This is just an exercise for the purpose of testing simple mathematical reasoning. Input The input file contains 1 integer value. Output Print the output, like the following example. SOLVE                               N = int(input())                                year=N//365                     ...
Read more

How to solve an 8 puzzle problem using A* Algorithm in python

-
Two heuristics for an  8 puzzle problem   GoalNode=[[7,2,4],[5,0,6],[8,3,1]] StartNode=[[0,1,2],[3,4,5],[6,7,8]] temp = [] h1 = -1 h2 = 0 print("Given StartNode is: ",StartNode) print("\n\n\t Given GoalNode is: ",GoalNode) print("\n\n######################################") for i in range(len(StartNode)):     for j in range (len(StartNode)):         if StartNode[i][j] != GoalNode[i][j]:             h1+=1 print("\n\n\t h1 : Number of misplaced tiles =>",h1) print("\n\n######################################") print("\n\nDistances of the tiles from their goal positions are: \n") for i in range(len(StartNode)):     for j in range (len(StartNode)):         if (StartNode[i][j]==0):             pass         else:             if (GoalNode[0][0] == S...
Read more