oj.uz

Submission #542723

# Submission time Handle Problem Language Result Execution time Memory
542723 2022-03-27T17:27:34 Z Olympia Pot (COCI15_pot) C++17
50 / 50
 1 ms 328 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <limits.h>

using namespace std;
long long binPow (long long x, long long y) {
    if (y == 0) {
        return 1;
    }
    return x * binPow(x, y - 1);
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<string> vec(n);
    int64_t ans = 0;
    for (int i = 0; i < n; i++) {
        cin >> vec[i];
        char c = vec[i].back();
        vec[i].pop_back();
        ans += binPow(stoll(vec[i]), c - '0');
    }
    cout << ans;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 328 KB Output is correct