結果
問題 | No.1580 I like Logarithm! |
ユーザー | OmameBeans |
提出日時 | 2021-07-04 04:18:34 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 30 ms / 2,000 ms |
コード長 | 3,141 bytes |
コンパイル時間 | 1,762 ms |
コンパイル使用メモリ | 170,988 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-30 19:25:14 |
合計ジャッジ時間 | 4,212 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 13 ms
6,940 KB |
testcase_07 | AC | 28 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 3 ms
6,940 KB |
testcase_10 | AC | 5 ms
6,940 KB |
testcase_11 | AC | 19 ms
6,944 KB |
testcase_12 | AC | 19 ms
6,944 KB |
testcase_13 | AC | 16 ms
6,940 KB |
testcase_14 | AC | 27 ms
6,940 KB |
testcase_15 | AC | 22 ms
6,944 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,944 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | AC | 1 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,944 KB |
testcase_26 | AC | 29 ms
6,944 KB |
testcase_27 | AC | 29 ms
6,940 KB |
testcase_28 | AC | 29 ms
6,944 KB |
testcase_29 | AC | 29 ms
6,944 KB |
testcase_30 | AC | 29 ms
6,944 KB |
testcase_31 | AC | 30 ms
6,940 KB |
testcase_32 | AC | 29 ms
6,940 KB |
testcase_33 | AC | 29 ms
6,940 KB |
testcase_34 | AC | 29 ms
6,940 KB |
testcase_35 | AC | 29 ms
6,944 KB |
testcase_36 | AC | 29 ms
6,944 KB |
testcase_37 | AC | 29 ms
6,940 KB |
testcase_38 | AC | 29 ms
6,940 KB |
testcase_39 | AC | 29 ms
6,940 KB |
testcase_40 | AC | 29 ms
6,940 KB |
testcase_41 | AC | 29 ms
6,944 KB |
testcase_42 | AC | 29 ms
6,940 KB |
testcase_43 | AC | 29 ms
6,940 KB |
testcase_44 | AC | 29 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for (int i = 0; i < (n); ++i) #define DREP(i,s,n) for(int i = (s); i < (n); i++) template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;} template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;} using ll = long long; using P = pair<int,int>; using Pl = pair<long long,long long>; using veci = vector<int>; using vecl = vector<long long>; using vecveci = vector<vector<int>>; using vecvecl = vector<vector<long long>>; const int MOD = 1000000007; const double pi = acos(-1); ll gcd(ll a, ll b) {if(b == 0) return a; else return gcd(b,a%b);} ll lcm(ll a, ll b) {return a*b/gcd(a,b);} template<int MOD> struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; } constexpr int getmod() { return MOD; } constexpr Fp operator - () const noexcept { return val ? MOD - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= MOD) val -= MOD; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += MOD; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % MOD; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = MOD, u = 1, v = 0; while (b) { long long 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; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept { return os << x.val; } friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; using mint = Fp<MOD>; int main() { int a; cin >> a; mint A = (mint)a; string B; cin >> B; mint ans = 0; int N = B.size(); reverse(B.begin(),B.end()); mint tot = 0; REP(i,N) tot += (mint)(B[i]-'0')* modpow(A,i); mint l = 1, r = A; mint k = 0; mint t = 0; REP(i,N-1) { mint diff = r-l; ans = ans + k*diff; k = k+1; l *= A, r *= A; } mint ret = tot-l; ret = ret + 1; ans = ans + (mint)(N-1)*ret; cout << ans << endl; return 0; }