250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록거듭제곱 (2)
N
(Leet Code c++)Power of Three
326. Power of Three Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there exists an integer x such that n == 3x. Example 1: Input: n = 27 Output: true Example 2: Input: n = 0 Output: false Example 3: Input: n = 9 Output: true Example 4: Input: n = 45 Output: false Constraints: -231
Leet Code 알고리즘
2021. 8. 3. 10:14
(SWEA c++)1217. [S/W 문제해결 기본] 4일차 - 거듭 제곱
swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14dUIaAAUCFAYD&categoryId=AV14dUIaAAUCFAYD&categoryType=CODE SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com 거듭제곱을 재귀호출로 구현. 간단한 코드. #include using namespace std; int num(int N, int M) { if(M ans; cin >> N >> M;..
SW Expert Academy
2020. 10. 12. 08:47