Mexico football predictions tomorrow

Rogério Funes Mori (México)

Cuja habilidade em cabecear gols e iniciar ataques pode ser um trunfo fundamental contra defesas congestionadas.

Lionel Messi (Argentina)#include//insertion sort (make_inertion_sort) #include using namespace std; void make_inertion_sort(int N){ int arr[N]; for(int i=0;i=0;j--){ // if(arr[j]>arr[j+1]) // swap(arr[j],arr[j+1]); // else break; // } // } for(int i=1;i0&&arr[j-1]>reptile){ arr[j]=arr[j-1]; j--; } arr[j]=reptile; } for(int i=0;i#include using namespace std; int calculate(int N){ int dp[N+1][N+1]; for(int k=1;k<=N;k++){ for(int i=1;i<=N-k+1;i++){ int j=i+k-1; if(i==j){ dp[i][j]=0; } else if(i==j-1){ dp[i][j]=1; } else{ dp[i][j]=99999; for(int k_=i;k_>N; int arr[N+1]; for(int i=0;i>arr[i]; } calculate(N); } <|repo_name|>KevinCaian/TIL<|file_sep|>/Data Structures and Algorithms/Hackerrank Algorithms/Implementation/Infinite Island.cpp #include using namespace std; void dfs(int i,int j,int m,int n,vector>> &arr,bool visited[100][100]){ cout<=m||j>=n)//좌표가 벗어나면 그냥 진행 return; else if(visited[i][j]||arr[i][j]==0)//방문했던 곳이나 0이면 그냥 진행 return; else{ visited[i][j]=true;//방문안했고 land면 방문 dfs(i+1,j,m,n,arr,visited);//방문했다면 해당 좌표를 재방문하지 않게 하기 위함 dfs(i-1,j,m,n,arr,visited); dfs(i,j+1,m,n,arr,visited); dfs(i,j-1,m,n,arr,visited); } } int island_counter_main(){ int m,n;cin>>m>>n;// m,N is row and column in array vector>> arr(m,v>()); bool visited[100][100]={}; for(int i=0;i>arr[i][j]; visited[i][j]=false; } } dfs(0,0,m,n,arr,visited); } // run program: Ctrl + F5 or Debug > Start Without Debugging menu // debug program: F5 or Debug > Start Debugging menu // Tips for Getting Started: // 1. Use the Solution Explorer window to add/manage files // 2. Use the Team Explorer window to connect to source control // 3. Use the Output window to see build output and other messages // 4. Use the Error List window to view errors // 5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project // 6. In the future, to open this project again, go to File > Open > Project and select the .sln file <|file_sep|>#include using namespace std; int arr[10]; int main(){ vector v(10); v.push_back(0); int n;cin>>n;// 입력값 출력 while(n--){ int cnt=0; for(int i=0;i<10;i++){ cin>>arr[i]; if(arr[i]!=0)//맨 처음과 같다면 제외함 v.push_back(arr[i]); } for(int i=0;i<10;i++){//값 중복을 없애기 위해 여기서 체크 for(int j=0;j<10;j++){ if(arr[i]!=arr[j]&&i!=j&&arr[i]==0) continue; else if(arr[i]==arr[j]&&i!=j) { v.push_back(arr[i]); break; } } } sort(v.begin(),v.end()); cout<#include using namespace std; int main(){ int N; cin>>N; if(N==1){ cout<<5; } else{ vector s; v::iterator it; s.resize(5); for(int i=0;i::iterator it; for(it=s.begin();it!=s.end();it++){ int cur=*it; // when if statement is satisfied insert the value of cur into vector if( i%cur!=0 ) { s.push_back(i); } } s.erase(s.begin(),s.begin()+s_len); cout<<*s.rbegin()<KevinCaian/TIL<|file_sep|>/Data Structures and Algorithms/Leetcode/weekly contests/Cont