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

• 問題: No.420 mod2漸化式
• ユーザー: is_eri23
• 提出日時: 2016-09-10 00:31:23
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 2 ms / 1,000 ms
• コード長: 3,654 bytes
• コンパイル時間: 1,381 ms
• コンパイル使用メモリ: 157,828 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-12-24 11:24:11
• 合計ジャッジ時間: 2,341 ms
• ジャッジサーバーID （参考情報）: judge4 / 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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); 
    deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << 
    (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain 
    == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << 
    "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int x;
  cin >> x;
  if (x > 31) {
    cout << 0 << ' ' << 0 << endl;
    return 0;
  }
  /*
  ll ans[40] = {0};
  int cnt[40] = {0};
  for (ll i = 0; i <= (1LL<<31) - 1; i++) {
    ans[__builtin_popcount(i)] += i;
    cnt[__builtin_popcount(i)] += 1;
  }
  for (int i = 0; i < 35; i++) {
    cout << ans[i] << ',' << endl;
  }
  cout << endl;
  for (int i = 0; i < 35; i++) {
    cout << cnt[i] << ',' << endl;
  }
  */
  ll ans[50] = {
    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,
    0
  };
  int cnt[50] = {
    1,
    31,
    465,
    4495,
    31465,
    169911,
    736281,
    2629575,
    7888725,
    20160075,
    44352165,
    84672315,
    141120525,
    206253075,
    265182525,
    300540195,
    300540195,
    265182525,
    206253075,
    141120525,
    84672315,
    44352165,
    20160075,
    7888725,
    2629575,
    736281,
    169911,
    31465,
    4495,
    465,
    31,
    1,
    0
  };
  cout << cnt[x] << ' ' << ans[x] << endl;
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX