백준 11772번: POT

https://www.acmicpc.net/problem/11772

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
 
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
 
    ll sum = 0;
 
    while (n--) {
        int d; cin >> d;
        int cand = d % 10;
        int num = d / 10;
        sum += pow(num, cand);
    }
 
    cout << sum << CENDL;
    return 0;
}