[Python] BOJ 1025번. 제곱수 찾기

작성일 | In |

1025번. 제곱수 찾기

문제 링크

풀이 코드

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
# 1025번. 제곱수 찾기

import math

N, M = map(int, input().split())
box = [[0 for _ in range(M)] for _ in range(N)]
for i in range(N):
    box[i] = list(map(int, input()))

result = -1

for n in range(N):
    for m in range(M):
        for weight_n in range(-N, N):
            for weight_m in range(-M, M):
                if weight_n == 0 and weight_m == 0:
                    continue
                step = 0
                x = n
                y = m
                value = ''

                while(0 <= x < N) and (0 <= y < M):
                    value += str(box[x][y])
                    step += 1
                    value_int = int(''.join(value))
                    value_sqrt = math.sqrt(value_int)
                    value_decimal = value_sqrt - int(value_sqrt)
                    if value_decimal == 0 and value_int > result:
                        result = value_int

                    x = n + step * weight_n
                    y = m + step * weight_m
print(result)

비고