提出 #75423172

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define pb push_back

template<class T> inline bool chmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int MOD =  
998244353;

void solve() {
    string s;cin>>s;
    int n=s.size();
    ll ans=0,curr=1;
    for(int i=1;i<n;i++){
        if(s[i]!=s[i-1]){
            curr++;
        }
        else {
            ll sub=(curr*(curr+1)/2)%MOD;
            ans=(ans+sub)%MOD;
            curr=1;
        }
    }
    ll sub=(curr*(curr+1)/2)%MOD;
    ans=(ans+sub)%MOD;
    cout<<ans<<'\n';

    
  
    
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tt = 1;
    //cin>>tt;
    while (tt--) {
        solve();
    }

    return 0;
}

提出情報

ジャッジ結果