参考代码:
dx = (-1, 0, 1, 0) dy = (0, -1, 0, 1) def judge(x, y): if x == 0 or x == n - 1 or y == 0 or y == n - 1: return True for d in range(4): tx, ty = x + dx[d], y + dy[d] if 0 <= tx < n and 0 <= ty < n and arr[tx][ty] > 50: return True return False n = int(input()) arr = [list(map(int, input().split())) for _ in range(n)] square = 0 circumference = 0 for i in range(n): for j in range(n): if arr[i][j] <= 50: square += 1 if judge(i, j): circumference += 1 print(square, circumference)
0.0分
0 人评分
【蟠桃记】 (C语言代码)浏览:659 |
上车人数 (C语言代码)浏览:784 |
ASCII帮了大忙浏览:760 |
C语言程序设计教程(第三版)课后习题8.3 (C语言代码)浏览:589 |
WU-输出正反三角形 (C++代码)浏览:1026 |
C语言程序设计教程(第三版)课后习题8.5 (C语言代码)浏览:578 |
C语言程序设计教程(第三版)课后习题8.8 (C语言代码)浏览:871 |
C语言程序设计教程(第三版)课后习题10.4 (C语言代码)浏览:556 |
简单的a+b (C语言代码)浏览:600 |
1014题解浏览:499 |