結果
問題 | No.16 累乗の加算 |
ユーザー |
|
提出日時 | 2022-11-30 21:12:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,859 bytes |
コンパイル時間 | 2,570 ms |
コンパイル使用メモリ | 249,276 KB |
最終ジャッジ日時 | 2025-02-09 02:48:04 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 14 |
ソースコード
#pragma region Macros#include <bits/extc++.h>using namespace std;using namespace __gnu_pbds;// using namespace __gnu_cxx;#define TO_STRING(var) # var#define pb emplace_back#define int ll#define endl '\n'using ll = long long;using ld = long double;const ld PI = acos(-1);const ld EPS = 1e-10;const int INF = 1 << 30;const ll INFL = 1LL << 62;// const int MOD = 998244353;const int MOD = 1000003;int ceil(int x, int y) {return (x > 0 ? (x + y - 1) / y : x / y);}int POW(int x, int y) {if (y != (int)(y) or y < 0 or x != 0 && x != 1 && y > 64) {cout << "Error" << endl;return 0;}if (y == 0) return 1;if (y % 2 == 0) return POW(x * x, y / 2);return x * POW(x, y - 1);}__attribute__((constructor))void constructor() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);}#pragma endregiontemplate<int mod> class modint{public:int val = 0;modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }modint(const modint &r) { val = r.val; } // コピーコンストラクタmodint operator -(){ return modint(-val); } // 単項modint operator +(const modint &r) { return modint(*this) += r; }modint operator -(const modint &r) { return modint(*this) -= r; }modint operator *(const modint &r) { return modint(*this) *= r; }modint operator /(const modint &r) { return modint(*this) /= r; }modint &operator +=(const modint &r) {val += r.val;if (val >= mod) val -= mod;return *this;}modint &operator -=(const modint &r) {if (val < r.val) val += mod;val -= r.val;return *this;}modint &operator *=(const modint &r) {val = val * r.val % mod;return *this;}modint &operator /=(const modint &r) {int a = r.val, b = mod, u = 1, v = 0;while (b) {int t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % mod;if (val < 0) val += mod;return *this;}bool operator ==(const modint& r) { return this -> val == r.val; }bool operator <(const modint& r) { return this -> val < r.val; }bool operator !=(const modint& r) { return this -> val != r.val; }};using mint = modint<MOD>;istream &operator >>(istream &is, mint& x) {int t; is >> t;x = t;return (is);}ostream &operator <<(ostream &os, const mint& x) {return os << x.val;}mint modpow(const mint &a, int n){if (n == 0) return 1;mint t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}signed main() {int x, N;cin >> x >> N;vector<int> A(N);for (int i = 0; i < N; i++) cin >> A[i];mint ans = 0;for (int i = 0; i < N; i++) {ans += modpow(x, A[i]);}cout << ans << endl;}