Submission #223133

#TimeUsernameProblemLanguageResultExecution timeMemory
223133Haunted_CppPot (COCI15_pot)C++17
50 / 50
5 ms384 KiB
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <cassert> #include <string> #include <cstring> #include <bitset> #pragma GCC optimize ("Ofast") #pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma GCC optimize("unroll-loops") #define FOR(i, a, b) for(int i = a; i < (int) b; i++) #define F0R(i, a) FOR (i, 0, a) #define ROF(i, a, b) for(int i = a; i >= (int) b; i--) #define R0F(i, a) ROF(i, a, 0) #define GO(i, a) for (auto i : a) #define rsz resize #define eb emplace_back #define pb push_back #define sz(x) (int) x.size() #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define f first #define s second using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vpii; typedef vector<vi> vvi; typedef vector<vpii> vvpii; typedef long long i64; typedef vector<i64> vi64; typedef vector<vi64> vvi64; typedef pair<i64, i64> pi64; typedef vector<pi64> vpi64; const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1}; const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1}; const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31}; i64 binpow (int a, int b) { i64 res = 1; while (b) { if (b & 1) res *= a; a *= a; b >>= 1; } return res; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; i64 res = 0; while (t--) { int n; cin >> n; int p = n % 10; n /= 10; res += binpow (n, p); } cout << res << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...