๐Ÿ’ป FE/๐Ÿ“ ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต๋ฌธ์ œ <์ •์ˆ˜ ์ œ๊ณฑ๊ทผ ํŒ๋ณ„>

Roy Miller 2022. 9. 14. 16:49

 

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต 1 ๋‹จ๊ณ„ ์—ฐ์Šต๋ฌธ์ œ Python3 

https://school.programmers.co.kr/learn/courses/30/lessons/12934

 

 

๋‚ด ์ฝ”๋“œ

def solution(n):
    answer = 0
    for i in range(10000000):
        if i * i == n:
            answer = (i+1) ** 2
            break
        else:
            answer = -1
    return answer

n ์˜ ์ตœ๋Œ“๊ฐ’์ด 50000000000000์ด๋ผ i*i ํ•ด์„œ 100000000000000 ๋˜๋Š” ์ˆ˜ ๊นŒ์ง€ ๋ฐ˜๋ณตํ–ˆ๋‹ค. ๋„ˆ๋ฌด ๋‹จ์ˆœํ•œ ์ƒ๊ฐ์ผ์ง€๋„~ 

 

 

 

ํƒ€์ธ ์ฝ”๋“œ

def nextSqure(n):
    sqrt = n ** (1/2)

    if sqrt % 1 == 0:
        return (sqrt + 1) ** 2
    return 'no'

- **(1/2)๊ฐ€ ์ œ๊ณฑ๊ทผ