#116374 (C++11) No.420 mod2漸化式

• 問題: No.420 mod2漸化式
• ユーザー: sntea
• 提出日時: 2016-09-10 08:08:28
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 2 ms / 1,000 ms
• コード長: 1,782 bytes
• コンパイル時間: 1,570 ms
• コンパイル使用メモリ: 159,068 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-12-24 11:29:01
• 合計ジャッジ時間: 2,703 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

ファイルパターン	結果
sample	AC * 1
other	AC * 35

ソースコード

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
75
76
77
#ifdef LOCAL111
#else
    #define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e8;
using namespace std;
#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
    #define DEBUG(x) cout<<#x<<": "<<(x)<<endl
    template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
    #define DEBUG(x) true
    template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
typedef pair<LL,LL> LP;
void ios_init(){
    //cout.setf(ios::fixed);
    //cout.precision(12);
#ifdef LOCAL111
    return;
#endif
    ios::sync_with_stdio(false); cin.tie(0);    
}
LL comb(LL x, LL y){
    LL com = 1;
    REP(i,y){
        com *= x-i;
        com /= i+1;
    }
    return com;
}
int main()
{
    ios_init();
    LL x;
    cin >> x;
    LL com = 1;
    LL sum = 0;
    if(x > 31){
        com = 0;
    }else if(x == 0){
        com = 1;
    }else{
        com = comb(31,x);
        REP(i,31){
            sum += (1LL<<i)*comb(30,x-1);
        }
    }
    cout << com << ' ' << sum << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX