diff --git a/problems/0503.下一个更大元素II.md b/problems/0503.下一个更大元素II.md
index fdbdc1cf..b466337d 100644
--- a/problems/0503.下一个更大元素II.md
+++ b/problems/0503.下一个更大元素II.md
@@ -185,7 +185,7 @@ class Solution:
 
 > 版本二：针对版本一的优化
 
-```python3
+```python
 class Solution:
     def nextGreaterElements(self, nums: List[int]) -> List[int]:
         res = [-1] * len(nums)
diff --git a/problems/kamacoder/0099.岛屿的数量广搜.md b/problems/kamacoder/0099.岛屿的数量广搜.md
index e603ef6d..d654e236 100644
--- a/problems/kamacoder/0099.岛屿的数量广搜.md
+++ b/problems/kamacoder/0099.岛屿的数量广搜.md
@@ -254,6 +254,7 @@ directions = [[0, 1], [1, 0], [0, -1], [-1, 0]]
 def bfs(grid, visited, x, y):
     que = deque([])
     que.append([x,y])
+    visited[x][y] = True
     while que:
         cur_x, cur_y = que.popleft()
         for i, j in directions:
diff --git a/problems/kamacoder/0101.孤岛的总面积.md b/problems/kamacoder/0101.孤岛的总面积.md
index af5ce089..acb76c3a 100644
--- a/problems/kamacoder/0101.孤岛的总面积.md
+++ b/problems/kamacoder/0101.孤岛的总面积.md
@@ -261,10 +261,10 @@ public class Main {
 from collections import deque
 
 # 处理输入
-n, m = list(map(int, input().strip()))
+n, m = list(map(int, input().split()))
 g = []
 for _ in range(n):
-    row = list(map(int, input().strip()))
+    row = list(map(int, input().split()))
     g.append(row)
 
 # 定义四个方向、孤岛面积（遍历完边缘后会被重置）