冬天的柚子

#include using namespace std; int main() { char str[110][110]; int len[110] = {0}; int flag[110] = {0}; int n, m, i, j, k, max = 0, min; cin >> n >> m; for (i = 0; i < m; i++) { cin >> str[

#include #include using namespace std; int main() { char ch; int i; while ((ch = getchar()) != EOF && ch != '#') { switch (ch) { case ' ': cout << "%20"; break; case '!': cout

#include using namespace std; int N, M;char field[110][110];void dfs(int x, int y){field[x][y] = '.';for (int dx = -1; dx <= 1; dx++){for (int dy = -1; dy <= 1; dy++){int nx = x + dx, ny = y + dy;if

#include #include using namespace std; int main() { int X[1010]; int R, N; while (cin >> R >> N) { int i, ans = 0; if (R == -1 && N == -1) break; for (i = 0; i < N; i++) cin >> X[i]

#include #define MAX_N 2000 char S[MAX_N + 1]; int N; void solve() { int a = 0, b = N - 1; while (a <= b) { bool left = false; for (int i = 0; a + i <= b; i++) { if (S[a + i] < S[b - i])