摘要：n = int(input)matrix = [input.strip for _ in range(n)]# 构建前缀和矩阵prefix = [[0] * (n + 1) for _ in range(n + 1)]for i in range(1, n +
n = int(input)matrix = [input.strip for _ in range(n)]# 构建前缀和矩阵prefix = [[0] * (n + 1) for _ in range(n + 1)]for i in range(1, n + 1): for j in range(1, n + 1): prefix[i][j] = prefix[i-1][j] + prefix[i][j-1] - prefix[i-1][j-1] + int(matrix[i-1][j-1])# 统计每个k的完美矩形数量result = [0] * nfor k in range(1, n + 1): count = 0 for i in range(n - k + 1): for j in range(n - k + 1): # 计算子矩阵中1的个数 total_ones = prefix[i + k][j + k] - prefix[i][j + k] - prefix[i + k][j] + prefix[i][j] if total_ones * 2 == k * k: count += 1 result[k - 1] = count# 输出结果for num in result: print(num) 来源：小橘喵科技
免责声明：本站系转载，并不代表本网赞同其观点和对其真实性负责。如涉及作品内容、版权和其它问题，请在30日内与本站联系，我们将在第一时间删除内容!
