結果
問題 | No.1407 Kindness |
ユーザー |
![]() |
提出日時 | 2021-02-26 22:27:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 2,524 bytes |
コンパイル時間 | 1,953 ms |
コンパイル使用メモリ | 194,648 KB |
最終ジャッジ日時 | 2025-01-19 05:50:50 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h>using namespace std;using Int = long long;const char newl = '\n';template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}template<typename T=int>vector<T> read(size_t n){vector<T> ts(n);for(size_t i=0;i<n;i++) cin>>ts[i];return ts;}template<typename T, T MOD = 1000000007>struct Mint{static constexpr T mod = MOD;T v;Mint():v(0){}Mint(signed v):v(v){}Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}Mint pow(long long k){Mint res(1),tmp(v);while(k){if(k&1) res*=tmp;tmp*=tmp;k>>=1;}return res;}static Mint add_identity(){return Mint(0);}static Mint mul_identity(){return Mint(1);}Mint inv(){return pow(MOD-2);}Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}Mint& operator/=(Mint a){return (*this)*=a.inv();}Mint operator+(Mint a) const{return Mint(v)+=a;}Mint operator-(Mint a) const{return Mint(v)-=a;}Mint operator*(Mint a) const{return Mint(v)*=a;}Mint operator/(Mint a) const{return Mint(v)/=a;}Mint operator-() const{return v?Mint(MOD-v):Mint(v);}bool operator==(const Mint a)const{return v==a.v;}bool operator!=(const Mint a)const{return v!=a.v;}bool operator <(const Mint a)const{return v <a.v;}static Mint comb(long long n,int k){Mint num(1),dom(1);for(int i=0;i<k;i++){num*=Mint(n-i);dom*=Mint(i+1);}return num/dom;}};template<typename T, T MOD> constexpr T Mint<T, MOD>::mod;template<typename T, T MOD>ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}// [0, n]template<typename T>vector<T> powers(int n,T x){vector<T> po(n+1,T(1));for(int i=0;i<n;i++) po[i+1]=po[i]*x;return po;}//INSERT ABOVE HEREsigned main(){cin.tie(0);ios::sync_with_stdio(0);string s;cin>>s;int n=s.size();using M = Mint<int>;auto po=powers(n,M(45));M ans{0};// n keta mimanfor(int i=1;i<n;i++) ans+=po[i];M res{1};// tyoudo nketafor(int i=0;i<n;i++){// [0, i) : fixed// i : 1 - s[i]// [i+1, n): 1-9ans+=res*M((s[i]-'0'-1)*(s[i]-'0')/2)*po[n-(i+1)];res*=M(s[i]-'0');}// [0, n)ans+=res;cout<<ans<<newl;return 0;}