Sri Lanka vs England Only T20I Match Dream11 Team Playing11 SL vs Eng D...

-



MATCH PREDICTION:
England will win the match.

SL VS ENG TEAM NEWS
Jonny Bairstow is no longer in the English squad after sustaining a thumb injury which means, he will not feature in this contest.
Sri Lanka have named Thisara Perera as the skipper of the shortest format.
Lasith Malinga makes a return to the T20 squad while the uncapped ambidextrous bowler Kamindu Mendis is the other inclusion in the side.

SL VS ENG PLAYING 11
Here’s how the two sides may lineup for Sri Lanka vs England 5th ODI match

Sri Lanka Playing 11 (Probable):

Wicket-keeper:  Niroshan Dickwella

Batsmen: Dinesh Chandimal, Dasun Shanaka, Kusal Perera, Kusal Mendis

All-rounders: Thisara Perera(c), Dhananjaya de Silva (Doubt: Kamindu Mendis)

Bowlers: Akila Dananjaya, Lakshan Sandakan, Lasith Malinga, Isuru Udana (Doubt: Kasun Rajitha, Dushmantha Chameera)



England Playing 11 (Probable):

Wicket-keeper: Jos Buttler

Batsmen: Joe Root, Alex Hales, Eoin Morgan(c), Jason Roy

All-rounders: Ben Stokes, Moeen Ali, Joe Denly

Bowlers: Chris Woakes, Liam Plunkett, Adil Rashid (Doubt: Tom Curran, Sam Curran)

Comments

Post a Comment

Popular posts from this blog

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] == StartNode[i][j]):                 temp.append(abs(i-0) + abs(j-0))                 print("\t",temp)  
Read more

Timus Online Judge 1000. A+B Problem question and SOLVE with sudo code

-
                                  1000. A+B Problem                                                                   Time limit: 1.0 second                                                                    Memory limit: 64 MB Calculate a + b Input a and b Output a+b   Sample input output 1 5 6                                                                           SOLVE #include <stdio.h> int main(void) {     // your code goes here     int a,b;         scanf("%d %d",&a,&b);         printf("%d",a+b);         return 0; }
Read more

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