提出 #55014589

---

ソースコード 拡げる

// I hate it here so I will go to secret gardens in my mind
// People need a key to get to, the only one is mine

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;

const int mod = 1e9 + 7;
void upd(int& a, int b) { a = (a + b) % mod; }
int add(int a, int b) { return (a + b) % mod; }
int mul(int a, int b) { return (a * 1ll * b) % mod; }
int pwr(int a, int b = mod - 2)
{
    if (!b) return 1;
    int h = pwr(a, b >> 1);
    h = mul(h, h);
    if (b & 1) h = mul(h, a);
    return h;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    string s;
    cin >> s;
    int ans = 1;
    int d = 0;
    for (int i = 0; i < n; i++)
    {
        if (i && s[i] == s[i - 1])
        {
            ans = mul(ans, (d + 1) / 2);
            d = 0;
        }
        d++;
    }
    ans = mul(ans, (d + 1) / 2);
    cout << ans << "\n";
    return 0;
}

提出情報

ジャッジ結果