#326276 (C++14) No.287 場合の数

• 問題: No.287 場合の数
• ユーザー: daleksprinter
• 提出日時: 2019-03-19 19:02:22
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 36 ms / 5,000 ms
• コード長: 2,652 bytes
• コンパイル時間: 1,915 ms
• コンパイル使用メモリ: 167,052 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-14 03:39:02
• 合計ジャッジ時間: 2,971 ms
• ジャッジサーバーID （参考情報）: judge3 / judge6

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	22 ms; 5,248 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	36 ms; 6,944 KB
testcase_04	AC	35 ms; 6,944 KB
testcase_05	AC	23 ms; 6,940 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	8 ms; 6,940 KB
testcase_08	AC	14 ms; 6,940 KB
testcase_09	AC	23 ms; 6,940 KB
testcase_10	AC	34 ms; 6,940 KB
testcase_11	AC	6 ms; 6,940 KB
testcase_12	AC	31 ms; 6,940 KB
testcase_13	AC	3 ms; 6,940 KB
testcase_14	AC	10 ms; 6,940 KB
testcase_15	AC	22 ms; 6,944 KB
testcase_16	AC	11 ms; 6,944 KB
testcase_17	AC	29 ms; 6,940 KB
testcase_18	AC	8 ms; 6,940 KB
testcase_19	AC	26 ms; 6,940 KB
testcase_20	AC	12 ms; 6,940 KB
testcase_21	AC	23 ms; 6,940 KB
testcase_22	AC	22 ms; 6,944 KB
testcase_23	AC	17 ms; 6,944 KB
testcase_24	AC	10 ms; 6,944 KB

ソースコード

#include "bits/stdc++.h"
using namespace std;

/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define isin(a, b, c) (b <= a && a <= c)
#define println cout << "\n";
#define sz(v) (int)v.size()
#define bin(x) static_cast<bitset<16> >(x)



/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef tuple<int, int, int> ti;
typedef map<int, int> mi;
typedef set<int> si;


/* constant */
const int inf = 1LL << 62;
const int mod = 1e9 + 7;
const int dx[8]={1,0,-1,0,-1,1,-1,1};
const int dy[8]={0,1,0,-1,-1,-1,1,1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";

/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}
template<class T> void printans(vec<T> v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}

/* main */

int n;
void in(){
    cin >> n;
}

int dfs(int l, int r, int s){
    if(l == r) return 0 <= s && s <= n;

    int ans = 0;
    int len = r - l + 1;

    rep(i,max(0LL, s - n * (len / 2)), len / 2 * n + 1){
        int m = (l + r) / 2;
        ans += dfs(l, m, i) * dfs(m + 1, r, s - i);
    }

    return ans;

}


void solve(){
    
    print(dfs(0, 7, n * 6));


}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    in();
    solve();
    
}