結果

問題 No.117 組み合わせの数
ユーザー Konton7
提出日時 2020-02-05 14:09:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 2,297 bytes
コンパイル時間 2,668 ms
コンパイル使用メモリ 197,668 KB
最終ジャッジ日時 2025-01-08 22:22:24
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other RE * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/istream:41,
                 from /usr/include/c++/13/sstream:40,
                 from /usr/include/c++/13/complex:45,
                 from /usr/include/c++/13/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127,
                 from main.cpp:1:
In member function ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]’,
    inlined from ‘int main()’ at main.cpp:115:17:
/usr/include/c++/13/ostream:204:25: warning: ‘ans’ may be used uninitialized [-Wmaybe-uninitialized]
  204 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function ‘int main()’:
main.cpp:42:25: note: ‘ans’ was declared here
   42 |     ll t, a, b, status, ans;
      |                         ^~~

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)

ll pow_mod(int p, int q, int mod)
{
    ll ret, r;
    ret = 1;
    r = p;

    while (q > 0)
    {
        if (q % 2)
        {
            ret *= r;
            ret %= mod;
        }
        r = (r * r) % mod;
        q /= 2;
    }

    return ret % mod;
}

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    const int mod = 1e9 + 7;
    const int imax = 1e6;
    ll t, a, b, status, ans;
    string s, sa, sb;
    vector<ll> frac, frac_inv;
    frac.push_back(1);
    frac_inv.push_back(1);
    a = b = 1;
    rep(i, imax)
    {
        a *= i + 1;
        a %= mod;
        frac.push_back(a);
        b *= pow_mod(i + 1, mod - 2, mod);
        b %= mod;
        frac_inv.push_back(b);
    }

    cin >> t;

    rep(i, t)
    {
        sa = sb = "";
        status = 0;
        cin >> s;
        for (auto z : s.substr(2, s.length() - 3))
        {
            if (z == ',')
            {
                status++;
            }
            else if (status == 0)
            {
                sa += z;
            }
            else if (status == 1)
            {
                sb += z;
            }
        }
        a = stoll(sa), b = stoll(sb);

        if (s[0] == 'C')
        {
            if (b > a)
            {
                ans = 0;
            }
            else
            {
                ans = frac[a] * frac_inv[b];
                ans %= mod;
                ans *= frac_inv[a - b];
                ans %= mod;
            }
        }
        else if (s[0] == 'P')
        {
            if (b > a)
            {
                ans = 0;
            }
            else
            {
                ans = frac[a] * frac_inv[a - b];
                ans %= mod;
            }
        }
        else if (s[0] == 'H')
        {
            ans = frac[a + b - 1] * frac_inv[b];
            ans %= mod;
            ans *= frac_inv[a - 1];
            ans %= mod;
        }
        cout << ans << endl;
    }

    return 0;
}
0