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

• 問題: No.420 mod2漸化式
• ユーザー: conf
• 提出日時: 2016-09-10 00:12:39
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 2 ms / 1,000 ms
• コード長: 1,444 bytes
• コンパイル時間: 582 ms
• コンパイル使用メモリ: 54,236 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-12-24 11:23:20
• 合計ジャッジ時間: 1,753 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <iostream>
using namespace std;
int shit[18] = {
    1,
    31,
    465,
    4495,
    31465,
    169911,
    736281,
    2629575,
    7888725,
    20160075,
    44352165,
    84672315,
    141120525,
    206253075,
    265182525,
    300540195,
    300540195
};
unsigned long long int fuck[32] = {
0
,2147483647
,64424509410
,934155386445
,8718783606820
,58851789346035
,306029304599382
,1275122102497425
,4371847208562600
,12569060724617475
,30724370660176050
,64521178386369705
,117311233429763100
,185742786263791575
,257182319442172950
,312292816465495725
,333112337563195440
,312292816465495725
,257182319442172950
,185742786263791575
,117311233429763100
,64521178386369705
,30724370660176050
,12569060724617475
,4371847208562600
,1275122102497425
,306029304599382
,58851789346035
,8718783606820
,934155386445
,64424509410
,2147483647
};
int comb(int n, int k){
    /*
    double res=1;
    for(int i=0;i<k;i++){
        res*=n-i;
        res/=k-i;
    }
    return (int)res;
    */
    if(k<17)return shit[k];
    else return shit[31-k];
}
int main(){
    int x;
    cin>>x;
    /*
    int C=comb(31,x);
    unsigned long long int sum[32]={};
    for(unsigned int i=0;i<(1<<31);i++){
        sum[__builtin_popcount(i)]+=i;
    }
    for(int i=0;i<32;i++){
        cout<<i<<' '<<sum[i]<<endl;
    }*/
    if(x<32){
        cout<<comb(31,x)<<' '<<fuck[x]<<endl;
    }else{
        cout<<0<<' '<<0<<endl;
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX