Brazil's 2018 World Cup squad

-




Goalkeepers: Alisson (Roma), Ederson (Man City), Cassio (Corinthians) Article continues below Defenders: Thiago Silva (PSG), Miranda (Inter), Marquinhos (PSG), Marcelo (Real Madrid), Filipe Luis (Atletico Madrid), Fagner (Corinthians), Pedro Geromel (Gremio), Danilo (Man City) Midfielders: Paulinho (Barcelona), Casemiro (Real Madrid), Philippe Coutinho (Barcelona), Renato Augusto (Beijing Sinobo Guoan), Fred (Shakhtar Donetsk), Fernandinho (Man City), Willian (Chelsea) Forwards: Neymar (PSG), Douglas Costa (Juventus), Gabriel Jesus (Man City), Roberto Firmino (Liverpool), Taison (Shakhtar Donetsk)

Comments

Post a Comment

Popular posts from this blog

Most used Color codes with name

-
<color name="Maroon">#800000</color> <color name="Aquamarine">#7FFFD4</color> <color name="Chartreuse">#7FFF00</color> <color name="LawnGreen">#7CFC00</color> <color name="MediumSlateBlue">#7B68EE</color> <color name="LightSlateGray">#778899</color> <color name="SlateGray">#708090</color> <color name="OliveDrab">#6B8E23</color> <color name="SlateBlue">#6A5ACD</color> <color name="DimGray">#696969</color> <color name="MediumAquamarine">#66CDAA</color> <color name="CornflowerBlue">#6495ED</color> <color name="CadetBlue">#5F9EA0</color> <color name="DarkOliveGreen">#556B2F</color> <color name="Indigo">#4B0082</color> <color name=...
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

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