結果
問題 | No.2203 POWER!!!!! |
ユーザー |
|
提出日時 | 2023-02-03 23:28:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 2,602 bytes |
コンパイル時間 | 1,797 ms |
コンパイル使用メモリ | 199,124 KB |
最終ジャッジ日時 | 2025-02-10 10:11:59 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
ソースコード
#line 1 "combined.cpp"#pragma region Macros#include <bits/stdc++.h>using namespace std;template <class T> inline bool chmax(T &a, T b) {if(a < b) {a = b;return 1;}return 0;}template <class T> inline bool chmin(T &a, T b) {if(a > b) {a = b;return 1;}return 0;}#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifstruct Setup {Setup() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}} __Setup;using ll = long long;#define OVERLOAD3(_1, _2, _3, name, ...) name#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()#define REP1(i, n) for(int i = 0; i < int(n); i++)#define REP2(i, a, b) for(int i = (a); i < int(b); i++)#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())#define SZ(v) ((int)(v).size())const int INF = 1 << 30;const ll LLINF = 1LL << 60;constexpr int MOD = 1000000007;constexpr int MOD2 = 998244353;const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};void Case(int i) { cout << "Case #" << i << ": "; }int popcount(int x) { return __builtin_popcount(x); }ll popcount(ll x) { return __builtin_popcountll(x); }#pragma endregion Macrosvoid solve() {int N;cin >> N;vector<int> cnt(9, 0);vector<int> a(N);REP(i, N) {cin >> a[i];cnt[a[i]]++;}ll ans = 0;vector P(9, vector<ll>(9));REP(i, 1, 9) {P[i][0] = 1;REP(j, 1, 9) P[i][j] = P[i][j-1] * i;}REP(i, N) {REP(j, 1, 9) {ans += cnt[j] * P[a[i]][j];}}cout << ans << endl;}int main() {int T = 1;// cin >> T;while(T--) solve();}