#715573 (C++14) No.1740 Alone 'a'

• 問題: No.1740 Alone 'a'
• ユーザー: auaua
• 提出日時: 2021-11-12 22:09:16
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 42 ms / 2,000 ms
• コード長: 1,475 bytes
• コンパイル時間: 1,537 ms
• コンパイル使用メモリ: 168,780 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-25 18:56:06
• 合計ジャッジ時間: 3,028 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 38

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=100010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
//二分累乗
ll rui(ll a,ll b){
    ll res=1;
    ll x=a;
    while(b){
        if(b&1)res=res*x%mod;
        x=x*x%mod;
        b/=2;
    }
    return res;
}
void solve(){
    ll n;cin>>n;
    string s;cin>>s;
    ll cnt=0;
    ll ans=0;
    rep(i,n){
        if(s[i]=='a'){
            cnt++;
            continue;
        }
        ll pl=s[i]-'b';
        if(cnt==0){
            if(i<n-1){
                ans+=rui(25,n-i-2)*(n-i-1)%mod*pl%mod;
                ans%=mod;
            }
            ans+=rui(25,n-i-1);
            ans%=mod;
        }else if(cnt==1){
            ans+=rui(25,n-i-1)*pl;
            ans%=mod;
        }
    }
    cout<<ans<<endl;
}
signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX