#603142 (C++17) No.1343 Dividing Digit

• 問題: No.1343 Dividing Digit
• ユーザー: blackyuki
• 提出日時: 2021-01-14 15:30:59
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 55 ms / 2,000 ms
• コード長: 2,673 bytes
• コンパイル時間: 1,948 ms
• コンパイル使用メモリ: 204,248 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-24 06:12:48
• 合計ジャッジ時間: 3,843 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	52 ms; 5,248 KB
testcase_04	AC	6 ms; 5,248 KB
testcase_05	AC	15 ms; 5,248 KB
testcase_06	AC	9 ms; 5,248 KB
testcase_07	AC	20 ms; 5,248 KB
testcase_08	AC	41 ms; 5,248 KB
testcase_09	AC	45 ms; 5,248 KB
testcase_10	AC	8 ms; 5,248 KB
testcase_11	AC	18 ms; 5,248 KB
testcase_12	AC	36 ms; 5,248 KB
testcase_13	AC	34 ms; 5,248 KB
testcase_14	AC	8 ms; 5,248 KB
testcase_15	AC	17 ms; 5,248 KB
testcase_16	AC	8 ms; 5,248 KB
testcase_17	AC	46 ms; 5,248 KB
testcase_18	AC	51 ms; 5,248 KB
testcase_19	AC	33 ms; 5,248 KB
testcase_20	AC	23 ms; 5,248 KB
testcase_21	AC	44 ms; 5,248 KB
testcase_22	AC	45 ms; 5,248 KB
testcase_23	AC	55 ms; 5,248 KB
testcase_24	AC	46 ms; 5,248 KB

ソースコード

// AC code



#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b,ll MOD){ll res=1;a%=MOD;while(b){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res;}
int main(){
    ll n,k;cin>>n>>k;
    vi v(n);rep(i,n)cin>>v[i];
    assert(1<=n&&n<=100000);
    assert(2<=k&&k<=10000);
    assert(v[0]!=0);
    rep(i,n)assert(0<=v[i]&&v[i]<k);
    ll s=0;rep(i,n)s+=v[i];
    ll ans=0;
    rep(i,n)ans+=v[i]*modpow(k,n-i-1,s)%s;
    out(ans%s);
}