04. [S/W 문제해결 기본] 4일차 - 거듭 제곱 (1217)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14dUIaAAUCFAYD 

SW Expert Academy

 

// 1217

#include <iostream>

using namespace std;

int mult(int n, int m) {
	if ( m == 0) 
		return 1;
	
	else
		return n * mult(n, m -1);
	
}

int main(void) {
	
	int testCase = 10;
	int testCaseNum;
	for (int t = 1; t <= testCase; t++) {
		cin >> testCaseNum;
		int inputN, inputM;
		cin >> inputN >> inputM;
		
		cout << "#" << testCaseNum << " " << mult(inputN, inputM) << endl;
	}
	return 0;
}