# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919662 | TIN | Pot (COCI15_pot) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define FNAME "test"
typedef long long ll;
const int N = 11;
int n;
ll P;
ll X = 0;
void Task() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(9);
if (fopen(FNAME".inp","r")) {
freopen(FNAME".inp","r",stdin);
freopen(FNAME".out","w",stdout);
}
}
ll binpow(ll b, ll p) {
if (p == 0) return 1LL;
if (p == 1) return b;
ll res = 1;
while (p) {
if (p & 1) res *= b;
b *= b;
p >>= 1;
}
return res;
}
void Solve() {
//Your Code
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> P;
X += binpow(P / 10, P % 10);
}
cout << X << '\n';
}
int main() {
Task();
Solve();
cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
return 37^37;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |