oj.uz

답안 #1088263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088263 2024-09-14T07:26:31 Z nguyen31hoang08minh2003 Pot (COCI15_pot) C++17
50 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int MAX_N = 20;

signed main() {
    int N, P[MAX_N];
    long long X = 0, p, b, e;

    #ifdef LOCAL
    freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);

    cin >> N;

    for (int i = 0; i < N; ++i) {
        cin >> P[i];
        for (p = 1, b = P[i] / 10, e = P[i] % 10; e; --e)
            p *= b;
        X += p;
    }

    cout << X << '\n';

    return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct