#include <iostream> using namespace std; bool Slove(void) { int x=0, y=0; char grid[10][10]; for (int i=0; i<10; ++i) for (int j=0; j<10; ++j) grid[i][j]='0'; for (int i=0; i<8; ++i) for (int j=0; j<8; ++j) cin >> grid[i][j]; if ( cin.eof() ) return</iostream>…

#include <cstdio> #include <iostream> using namespace std; void Slove(int l[], int v1, int v2) { int distance=0; for (int i=0; i<10; ++i) distance+=l[i]; double left_collision=(double)distance/(v1+v2)*v1; distance=0; for (int i=0; i<10; ++i) { distance+=l[i</iostream></cstdio>…

#include <iostream> using namespace std; bool flg; void dfs(int A[], int B, int C, int count) { if (count == 10) flg=true; else { if (B==0 && C==0) { dfs(A,A[count],C,count+1); dfs(A,B,A[count],count+1); } else { if (A[count] > B) dfs(A,A[count],C,c</iostream>…