[SWEA] 1217. [S/W 문제해결 기본] Stack1 - 거듭 제곱

문제

https://www.swexpertacademy.com/main/learn/course/lectureProblemViewer.do

SW Expert Academy

 

 

풀이

 

import java.util.*;
 
public class Solution {
    static Scanner scan = new Scanner(System.in);
    
    static int get_power(int N, int M) {
        if(M==1)
            return N;
        return N*get_power(N,M-1);
    }
    static void solution() {
        int N,M;
        for(int i=1;i<=10;i++) {
            scan.nextInt();
            N = scan.nextInt();
            M = scan.nextInt();
            System.out.println("#"+i+" "+get_power(N,M));
        }
    }
 
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        solution();
    }
}