結果

問題 No.420 mod2漸化式
ユーザー is_eri23is_eri23
提出日時 2016-09-10 00:31:23
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 3,654 bytes
コンパイル時間 1,490 ms
コンパイル使用メモリ 159,176 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-06 18:22:25
合計ジャッジ時間 2,642 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 1 ms
6,940 KB
testcase_12 AC 1 ms
6,944 KB
testcase_13 AC 2 ms
6,944 KB
testcase_14 AC 1 ms
6,940 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 1 ms
6,940 KB
testcase_17 AC 1 ms
6,944 KB
testcase_18 AC 1 ms
6,944 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 1 ms
6,944 KB
testcase_21 AC 1 ms
6,940 KB
testcase_22 AC 1 ms
6,940 KB
testcase_23 AC 2 ms
6,944 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 2 ms
6,944 KB
testcase_26 AC 1 ms
6,944 KB
testcase_27 AC 1 ms
6,940 KB
testcase_28 AC 2 ms
6,944 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 2 ms
6,940 KB
testcase_31 AC 1 ms
6,940 KB
testcase_32 AC 1 ms
6,940 KB
testcase_33 AC 1 ms
6,940 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;
}
0