{"id":1660,"date":"2020-07-19T16:39:54","date_gmt":"2020-07-19T08:39:54","guid":{"rendered":"http:\/\/www.shuizilong.com\/house\/?p=1660"},"modified":"2022-07-07T07:18:07","modified_gmt":"2022-07-06T23:18:07","slug":"spoj-cake3-delicious-cake","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/spoj-cake3-delicious-cake\/","title":{"rendered":"SPOJ CAKE3. Delicious Cake"},"content":{"rendered":"

Vjudge<\/a> | SPOJ<\/a> | TG<\/a><\/p>\n

\u5148\u590d\u4e60\u4e00\u4e0b \u63d2\u5934 dp \u5927\u5b57\u5178<\/a>\u3002\u672c\u9898\u663e\u7136\u4f7f\u7528\u67d3\u8272\u6a21\u578b\u3002\u8f6e\u5ed3\u7ebf\u4e0a\u53ea\u6709 m \u4e2a\u4f4d\u7f6e\uff0c\u800c\u4e14\u4e0d\u9700\u8981 roll() \u64cd\u4f5c\uff08\u4e0d\u8fc7\u751f\u6210\u7684\u65b0\u63d2\u5934\uff0c\u8981\u6c42\u524d\u9762\u7684\u533a\u5206\u5f00\u6765\uff0c\u6240\u4ee5\u6211\u4eec\u8fd8\u662f\u7528 m+1 \u6765\u6807\u8bb0\uff09\u3002\u8fd9\u6837\u641e\u5f97\u8bdd\uff0c2\u00d72 \u6211\u4eec\u4f1a\u7b97\u51fa\u7b54\u6848\u7b49\u4e8e 14\uff0c\u4ed4\u7ec6\u89c2\u5bdf\uff0c\u662f\u56e0\u4e3a\u6211\u4eec\u591a\u7b97\u4e86\u4e0b\u9762\u4e24\u79cd\u4e0d\u5408\u6cd5\u7684\u60c5\u51b5\u3002<\/p>\n

\u6211\u4eec\u53d1\u73b0\u8fd9\u7c7b\u60c5\u51b5\u90fd\u662f\u56e0\u4e3a\u5728\u524d\u9762\u7684\u8f6c\u79fb\u4e2d\u4ea7\u751f\u4e86\u523b\u75d5\uff0c\u800c\u4f7f\u5f97\u540e\u7eed\u7684\u63d2\u5934\u5408\u5e76\u4e0d\u5408\u6cd5\uff0c\u9700\u8981\u8fdb\u4e00\u6b65\u7f16\u7801\u3002
\n\u6211\u4eec\u53ef\u4ee5\u7ed9\u6bcf\u4e2a\u8fde\u901a\u5757\u5f3a\u884c\u4e0a\u4e00\u4e2a\u989c\u8272\uff0c\u4e0d\u76f8\u540c\u7684\u989c\u8272\u4e0d\u53ef\u5408\u5e76\u3002\u4f46\u662f\u56e0\u4e3a\u539f\u95ee\u9898\u6ca1\u6709\u989c\u8272\uff0c\u8fd9\u6837\u8ba1\u6570\u8d77\u6765\u4f1a\u6bd4\u8f83\u9ebb\u70e6\uff08\u9700\u8981\u6700\u5c0f\u67d3\u8272\uff0c\u5e76\u4e14\u5fc5\u987b\u4fdd\u8bc1\u76f8\u540c\u989c\u8272\u7684\u8fde\u901a\u5757\u5fc5\u88ab\u5408\u5e76\uff09\u3002
\n\u6211\u4eec\u4e5f\u53ef\u4ee5\u66b4\u529b\u8bb0\u5f55 C(5,2) \u4e2a\u8fde\u901a\u5757\u4e4b\u95f4\u662f\u5426\u4ea7\u751f\u8fc7\u523b\u75d5\uff0c\u8fd9\u6837\u5408\u5e76\u7684\u65f6\u5019\u76f4\u63a5\u5224\u65ad\u5373\u53ef\u3002<\/p>\n

\u523b\u75d5\u7684\u7ef4\u62a4\uff0c\u9996\u5148\u6bcf\u6b21\u72b6\u6001\u8f6c\u79fb\uff0c\u5f53\u524d\u63d2\u5934\u90fd\u9700\u8981\u548c\u76f8\u90bb\u4e24\u4e2a\u63d2\u5934\uff08\u5de6\u63d2\u5934\u548c\u4e0a\u63d2\u5934\uff09\u90fd\u6807\u8bb0\u523b\u75d5\u3002
\n\u5176\u6b21\uff0c\u56e0\u4e3a\u6211\u4eec\u4f7f\u7528\u4e86\u6700\u5c0f\u8868\u793a\uff0c\u8fde\u901a\u5757\u7684\u8bb0\u53f7\u4f1a\u88ab relable\uff0c\u56e0\u800c\u7f16\u7801\u7684\u65f6\u5019\u4e5f\u9700\u8981\u91cd\u65b0\u6620\u5c04\u3002
\n\u6700\u540e\u63d2\u5934\u5408\u5e76\u7684\u65f6\u5019\uff0c\u523b\u75d5\u4fe1\u606f\u4e5f\u9700\u8981\u5408\u5e76\u3002<\/p>\n

\u6700\u540e\u4e0a\u4e00\u4e0b\u9ad8\u7cbe\u5ea6\u6a21\u677f\u5c31\u597d\u4e86\u3002\u7559\u4e2a OEIS<\/a> \u5730\u5740\u65b9\u4fbf\u5927\u5bb6 debug\u3002<\/p>\n

\r\n\/*\r\n    This code has been written by MinakoKojima, feel free to ask me question. Blog: https:\/\/www.shuizilong.com\/house\r\n    Template Date: 2015.10.12\r\n    Note: ...\r\n*\/\r\n\r\n#pragma comment(linker, "\/STACK:36777216")\r\n\/\/#pragma GCC optimize ("O2")\r\n#define LOCAL\r\n#include <functional>\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <fstream>\r\n#include <sstream>\r\n#include <iomanip>\r\n#include <numeric>\r\n#include <cstring>\r\n#include <climits>\r\n#include <cassert>\r\n#include <complex>\r\n#include <cstdio>\r\n#include <string>\r\n#include <vector>\r\n#include <bitset>\r\n#include <queue>\r\n#include <stack>\r\n#include <cmath>\r\n#include <ctime>\r\n#include <list>\r\n#include <set>\r\n#include <map>\r\n\r\n\/\/#include <tr1\/unordered_set>\r\n\/\/#include <tr1\/unordered_map>\r\n\/\/#include <array>\r\n\r\nusing namespace std;\r\n\r\n#define REP(i, n) for (int i=0;i<n;++i)\r\n#define FOR(i, a, b) for (int i=a;i<b;++i)\r\n#define DWN(i, b, a) for (int i=b-1;i>=a;--i)\r\n#define REP_1(i, n) for (int i=1;i<=n;++i)\r\n#define FOR_1(i, a, b) for (int i=a;i<=b;++i)\r\n#define DWN_1(i, b, a) for (int i=b;i>=a;--i)\r\n#define REP_C(i, n) for (int n____=n,i=0;i<n____;++i)\r\n#define FOR_C(i, a, b) for (int b____=b,i=a;i<b____;++i)\r\n#define DWN_C(i, b, a) for (int a____=a,i=b-1;i>=a____;--i)\r\n#define REP_N(i, n) for (i=0;i<n;++i)\r\n#define FOR_N(i, a, b) for (i=a;i<b;++i)\r\n#define DWN_N(i, b, a) for (i=b-1;i>=a;--i)\r\n#define REP_1_C(i, n) for (int n____=n,i=1;i<=n____;++i)\r\n#define FOR_1_C(i, a, b) for (int b____=b,i=a;i<=b____;++i)\r\n#define DWN_1_C(i, b, a) for (int a____=a,i=b;i>=a____;--i)\r\n#define REP_1_N(i, n) for (i=1;i<=n;++i)\r\n#define FOR_1_N(i, a, b) for (i=a;i<=b;++i)\r\n#define DWN_1_N(i, b, a) for (i=b;i>=a;--i)\r\n#define REP_C_N(i, n) for (int n____=(i=0,n);i<n____;++i)\r\n#define FOR_C_N(i, a, b) for (int b____=(i=0,b);i<b____;++i)\r\n#define DWN_C_N(i, b, a) for (int a____=(i=b-1,a);i>=a____;--i)\r\n#define REP_1_C_N(i, n) for (int n____=(i=1,n);i<=n____;++i)\r\n#define FOR_1_C_N(i, a, b) for (int b____=(i=a,b);i<=b____;++i)\r\n#define DWN_1_C_N(i, b, a) for (int a____=(i=b,a);i>=a____;--i)\r\n\r\n#define ECH(it, A) for (__typeof((A).begin()) it=(A).begin(); it != (A).end(); ++it)\r\n#define rECH(it, A) for (__typeof((A).rbegin()) it=(A).rbegin(); it != (A).rend(); ++it)\r\n#define REP_S(i, str) for (char*i=str;*i;++i)\r\n#define REP_L(i, hd, suc) for (int i=hd;i;i=suc[i])\r\n#define REP_G(i, u) REP_L(i,hd[u],suc)\r\n#define REP_SS(x, s) for (int x=s;x;x=(x-1)&s)\r\n#define DO(n) for ( int ____n = n; ____n-->0; )\r\n#define REP_2(i, j, n, m) REP(i, n) REP(j, m)\r\n#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)\r\n#define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l)\r\n#define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l)\r\n#define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn)\r\n#define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn)\r\n\r\n#define ALL(A) A.begin(), A.end()\r\n#define LLA(A) A.rbegin(), A.rend()\r\n#define CPY(A, B) memcpy(A, B, sizeof(A))\r\n#define INS(A, P, B) A.insert(A.begin() + P, B)\r\n#define ERS(A, P) A.erase(A.begin() + P)\r\n#define LBD(A, x) (lower_bound(ALL(A), x) - A.begin())\r\n#define UBD(A, x) (upper_bound(ALL(A), x) - A.begin())\r\n#define CTN(T, x) (T.find(x) != T.end())\r\n#define SZ(A) int((A).size())\r\n#define PB push_back\r\n#define MP(A, B) make_pair(A, B)\r\n#define PTT pair<T, T>\r\n#define Ts *this\r\n#define rTs return Ts\r\n#define fi first\r\n#define se second\r\n#define re real()\r\n#define im imag()\r\n\r\n#define Rush for(int ____T=RD(); ____T--;)\r\n#define Display(A, n, m) {                      \\\r\n  REP(i, n){\t\t                            \\\r\n        REP(j, m-1) cout << A[i][j] << " ";     \\\r\n        cout << A[i][m-1] << endl;\t\t        \\\r\n\t}\t\t\t\t\t\t                    \\\r\n}\r\n#define Display_1(A, n, m) {                    \\\r\n\tREP_1(i, n){\t\t                        \\\r\n        REP_1(j, m-1) cout << A[i][j] << " ";   \\\r\n        cout << A[i][m] << endl;\t\t        \\\r\n\t}\t\t\t\t\t\t                    \\\r\n}\r\n\r\ntypedef long long LL;\r\n\/\/typedef long double DB;\r\ntypedef double DB;\r\ntypedef unsigned uint;\r\ntypedef unsigned long long uLL;\r\n\r\ntypedef vector<int> VI;\r\ntypedef vector<char> VC;\r\ntypedef vector<string> VS;\r\ntypedef vector<LL> VL;\r\ntypedef vector<DB> VF;\r\ntypedef set<int> SI;\r\ntypedef set<string> SS;\r\ntypedef map<int, int> MII;\r\ntypedef map<string, int> MSI;\r\ntypedef pair<int, int> PII;\r\ntypedef pair<LL, LL> PLL;\r\ntypedef vector<PII> VII;\r\ntypedef vector<VI> VVI;\r\ntypedef vector<VII> VVII;\r\n\r\ntemplate<class T> inline T& RD(T &);\r\ntemplate<class T> inline void OT(const T &);\r\n\/\/inline int RD(){int x; return RD(x);}\r\ninline LL RD(){LL x; return RD(x);}\r\ninline DB& RF(DB &);\r\ninline DB RF(){DB x; return RF(x);}\r\ninline char* RS(char *s);\r\ninline char& RC(char &c);\r\ninline char RC();\r\ninline char& RC(char &c){scanf(" %c", &c); return c;}\r\ninline char RC(){char c; return RC(c);}\r\n\/\/inline char& RC(char &c){c = getchar(); return c;}\r\n\/\/inline char RC(){return getchar();}\r\n\r\ntemplate<class T> inline T& RDD(T &);\r\ninline LL RDD(){LL x; return RDD(x);}\r\n\r\ntemplate<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;}\r\ntemplate<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;}\r\ntemplate<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);}\r\ntemplate<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}\r\ninline char& RC(char &a, char &b){RC(a), RC(b); return a;}\r\ninline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;}\r\ninline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;}\r\ninline void RS(char *s1, char *s2){RS(s1), RS(s2);}\r\ninline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);}\r\ntemplate<class T0,class T1>inline T0& RDD(T0&a, T1&b){RDD(a),RDD(b); return a;}\r\ntemplate<class T0,class T1,class T2>inline T1& RDD(T0&a, T1&b, T2&c){RDD(a),RDD(b),RDD(c); return a;}\r\n\r\ntemplate<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}\r\ntemplate<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}\r\ntemplate<class T> inline void CLR(T &A){A.clear();}\r\n\r\ntemplate<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}\r\ntemplate<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}\r\ntemplate<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}\r\ntemplate<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x), FLC(A6, x);}\r\ntemplate<class T> inline void CLR(priority_queue<T> &Q){while (!Q.empty()) Q.pop();}\r\ntemplate<class T> inline void CLR(stack<T> &S){while (!S.empty()) S.pop();}\r\ntemplate<class T> inline void CLR(queue<T> &Q){while (!Q.empty()) Q.pop();}\r\n\r\ntemplate<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}\r\ntemplate<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}\r\ntemplate<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}\r\n\r\ntemplate<class T> inline bool EPT(T &a){return a.empty();}\r\ntemplate<class T> inline T& SRT(T &A){sort(ALL(A)); return A;}\r\ntemplate<class T, class C> inline T& SRT(T &A, C cmp){sort(ALL(A), cmp); return A;}\r\ntemplate<class T> inline T& RVS(T &A){reverse(ALL(A)); return A;}\r\ntemplate<class T> inline T& UNQQ(T &A){A.resize(unique(ALL(A))-A.begin());return A;}\r\ntemplate<class T> inline T& UNQ(T &A){SRT(A);return UNQQ(A);}\r\ntemplate<class T, class C> inline T& UNQ(T &A, C cmp){SRT(A, cmp);return UNQQ(A);}\r\n\r\n\r\n\/\/}\r\n\r\n\/** Constant List .. **\/ \/\/{\r\n\r\nconst int MOD = int(1e9) + 7;\r\nconst int INF = 0x3f3f3f3f;\r\nconst LL INFF = 0x3f3f3f3f3f3f3f3fLL;\r\nconst DB EPS = 1e-9;\r\nconst DB OO = 1e20;\r\nconst DB PI = acos(-1.0); \/\/M_PI;\r\n\r\nconst int dx[] = {-1, 1, 0, 0};\r\nconst int dy[] = {0, 0, 1, -1};\r\n\r\n\/\/}\r\n\r\n\/** Add On .. **\/ \/\/{\r\n\/\/ <<= '0. Nichi Joo ., \/\/{\r\n\r\ntemplate<class T> inline bool checkMin(T &a,const T b){return b < a ? a = b, 1 : 0;}\r\ntemplate<class T> inline bool checkMax(T &a,const T b){return a < b ? a = b, 1 : 0;}\r\ntemplate <class T, class C> inline bool checkUpd(T& a, const T b, C c){return c(b,a) ? a = b, 1 : 0;}\r\ntemplate<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}\r\ntemplate<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}\r\ntemplate<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}\r\ntemplate<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));}\r\ntemplate<class T> inline T min(T a, T b, T c, T d, T e){return min(min(min(a,b),min(c,d)),e);}\r\ntemplate<class T> inline T max(T a, T b, T c, T d, T e){return max(max(max(a,b),max(c,d)),e);}\r\ntemplate<class T> inline T sqr(T a){return a*a;}\r\ntemplate<class T> inline T cub(T a){return a*a*a;}\r\ntemplate<class T> inline T ceil(T x, T y){return (x - 1) \/ y + 1;}\r\ntemplate<class T> T abs(T x){return x>0?x:-x;}\r\ninline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}\r\ninline int sgn(DB x, DB y){return sgn(x - y);}\r\n\r\ninline DB cos(DB a, DB b, DB c){return (sqr(a)+sqr(b)-sqr(c))\/(2*a*b);}\r\ninline DB cot(DB x){return 1.\/tan(x);};\r\ninline DB sec(DB x){return 1.\/cos(x);};\r\ninline DB csc(DB x){return 1.\/sin(x);};\r\n\r\n\/\/}\r\n\r\n\/\/}\r\n\r\n\r\n\r\n\/** I\/O Accelerator Interface .. **\/ \/\/{\r\n#define g (c=getchar())\r\n#define d isdigit(g)\r\n#define p x=x*10+c-'0'\r\n#define n x=x*10+'0'-c\r\n#define pp l\/=10,p\r\n#define nn l\/=10,n\r\ntemplate<class T> inline T& RD(T &x){\r\n    char c;while(!d);x=c-'0';while(d)p;\r\n    return x;\r\n}\r\ntemplate<class T> inline T& RDD(T &x){\r\n    char c;while(g,c!='-'&&!isdigit(c));\r\n    if (c=='-'){x='0'-g;while(d)n;}\r\n    else{x=c-'0';while(d)p;}\r\n    return x;\r\n}\r\ninline DB& RF(DB &x){\r\n    \/\/scanf("%lf", &x);\r\n    char c;while(g,c!='-'&&c!='.'&&!isdigit(c));\r\n    if(c=='-')if(g=='.'){x=0;DB l=1;while(d)nn;x*=l;}\r\n        else{x='0'-c;while(d)n;if(c=='.'){DB l=1;while(d)nn;x*=l;}}\r\n    else if(c=='.'){x=0;DB l=1;while(d)pp;x*=l;}\r\n        else{x=c-'0';while(d)p;if(c=='.'){DB l=1;while(d)pp;x*=l;}}\r\n    return x;\r\n}\r\n#undef nn\r\n#undef pp\r\n#undef n\r\n#undef p\r\n#undef d\r\n#undef g\r\ninline char* RS(char *s){\r\n    \/\/gets(s);\r\n    scanf("%s", s);\r\n    return s;\r\n}\r\n\r\nLL last_ans; int Case; template<class T> inline void OT(const T &x){\r\n    \/\/printf("Case #%d: ", ++Case);\r\n    \/\/printf("%lld\\n", x);\r\n    \/\/printf("%I64d\\n", x);\r\n    \/\/printf("%.9f\\n", x);\r\n    \/\/printf("%d\\n", x);\r\n    cout << x << endl;\r\n    \/\/last_ans = x;\r\n}\r\n\r\n\r\n\/\/}\/* .................................................................................................................................. *\/\r\n\r\n\r\n\/\/ <<= 'Bignum ., \/\/{\r\nnamespace BIGNUM{\r\n\r\nconst int __base = 1e8;\r\nconst int P10[] = {1, 10, int(1e2), int(1e3), int(1e4), int(1e5), int(1e6), int(1e7), int(1e8), int(1e9)};\r\nconst int MAX_BUF_SIZE = 109;\r\nchar __buf[MAX_BUF_SIZE];\r\n\r\nclass bignum{\r\n          friend istream& operator>>(istream&, bignum&);\r\n          friend ostream& operator<<(ostream&, const bignum&);\r\n          friend bignum operator +(const bignum&, const bignum&);\r\n          friend bignum operator +(const bignum&, const int&);\r\n          friend bool operator ==(const bignum&, const bignum&);\r\n          friend bool operator !=(const bignum&, const bignum&);\r\n          friend bool operator <(const bignum&, const bignum&);\r\n          friend bool operator >(const bignum&, const bignum&);\r\n          friend bool operator <=(const bignum&, const bignum&);\r\n          friend bool operator >=(const bignum&, const bignum&);\r\n          friend bool operator ==(const bignum&, const int&);\r\n          friend bool operator !=(const bignum&, const int&);\r\n          friend bool operator <(const bignum&, const int&);\r\n          friend bool operator >(const bignum&, const int&);\r\n          friend bool operator <=(const bignum&, const int&);\r\n          friend bool operator >=(const bignum&, const int&);\r\n          friend int do_comp(const bignum&, const int&);\r\n          friend int do_comp(const bignum&, const bignum&);\r\n          friend void divide(const bignum&, const bignum&, bignum&, bignum&);\r\n          friend bignum pow(bignum, int);\r\n          friend bignum pow(int, int);\r\n    public:\r\n        inline bignum(){};\r\n        inline bignum(int s){\r\n            while (s) data.PB(s%__base), s\/=__base;\r\n            if (data.empty()) data.PB(0);\r\n        }\r\n\r\n        inline bignum(long long s){\r\n            while (s) data.PB(int(s%__base)), s\/=__base;\r\n            if (data.empty()) data.PB(0);\r\n        }\r\n\r\n        inline bignum(string s){\r\n            int t, i; CLR(data);\r\n            for (i=int(s.size())-8;i>0;i-=8){\r\n                istringstream(s.substr(i, 8)) >> t;\r\n                data.PB(t);\r\n            }\r\n            istringstream(s.substr(0, i+8)) >> t;\r\n            data.PB(t);\r\n        }\r\n\r\n        void input(){\r\n            CLR(data); RS(__buf); int t = 0, c = 0;\r\n            DWN(i, strlen(__buf), 0){\r\n                t += P10[c] * (int(__buf[i]) - '0'), ++c;\r\n                if (c == 8) data.PB(t), c = t = 0;\r\n            }\r\n            if (c) data.PB(t);\r\n        }\r\n\r\n        bignum&operator=(int);\r\n        bignum&operator=(const string&);\r\n        bignum&operator=(const bignum&);\r\n        bignum&operator +=(const bignum&);\r\n        bignum&operator -=(const bignum&);\r\n        bignum&operator *=(const bignum&);\r\n        bignum&operator \/=(const bignum&);\r\n        bignum&operator %=(const bignum&);\r\n        bignum&operator +=(const int&);\r\n        bignum&operator -=(const int&);\r\n        bignum&operator *=(const int&);\r\n        bignum&operator \/=(const int&);\r\n        bignum&operator %=(const int&);\r\n        bool undefined();\r\n        int do_try(const int&);\r\n        int do_try(const bignum&);\r\n        void do_trim();\r\n        list<int> data;\r\n\r\n    int size(){\r\n        list<int>::iterator it; int res = 0;\r\n        for (it=data.begin(); it!=data.end();it++)\r\n            res += 8;\r\n        it--;\r\n        if (*it >= 10000) {\r\n            if ( (*it) >= 1000000) {if (*it >=10000000) ; else res--;}\r\n            else {if ((*it) >= 100000) res-=2; else res-=3;}\r\n        }\r\n        else\r\n            if ( (*it) >= 100) {if (*it >=1000) res-=4; else res-=5;}\r\n            else {if ((*it) >= 10) res-=6; else res-=7;}\r\n\r\n        return res;\r\n    }\r\n\r\n    void do_reserve(int a){\r\n        if (a <= 0) return;\r\n        list<int>::iterator it;\r\n        for (it=data.begin(); it!=data.end() && a>0; it++) a-=8;\r\n        if (it == data.end() && a>=0) return;\r\n        a+=8, it--; int f = 1;\r\n        for (int i=0;i<a;i++) f *= 10; (*it) %= f;\r\n        data.erase(++it, data.end());\r\n        do_trim();\r\n    }\r\n};\r\n\r\ninline bignum&bignum::operator =(const bignum&a){\r\n    data.clear();\r\n    for (list<int>::const_iterator i=a.data.begin();i!=a.data.end();i++){\r\n        data.PB(*i);\r\n    }\r\n    return*this;\r\n}\r\ninline bignum&bignum::operator =(const string&a){\r\n    return*this=bignum(a);\r\n}\r\ninline bignum&bignum::operator =(int a){\r\n    return*this=bignum(a);\r\n}\r\n\r\ninline istream& operator>>(istream& input, bignum& a){\r\n    string s; int t, i; input >> s; a.data.clear();\r\n    for (i=int(s.size())-8;i>0;i-=8){\r\n        istringstream(s.substr(i, 8)) >> t;\r\n        a.data.PB(t);\r\n    }\r\n    istringstream(s.substr(0, i+8)) >> t;\r\n    a.data.PB(t);\r\n    return input;\r\n}\r\n\r\ninline ostream& operator<<(ostream& output, const bignum& a){\r\n    list<int>::const_reverse_iterator i=a.data.rbegin();\r\n    output << *i;\r\n    for (i++;i!=a.data.rend();i++){\r\n        if (*i >= 10000) {\r\n            if (*i >= 1000000) {if (*i>=10000000) cout << *i; else cout << 0 << *i;}\r\n            else {if (*i>=100000) cout << "00" << *i; else cout << "000" << *i;}\r\n        }\r\n        else {\r\n            if (*i >= 100) {if (*i>=1000)  cout << "0000" << *i; else cout << "00000" << *i;}\r\n            else { if (*i>=10) cout << "000000" << *i; else cout << "0000000" << *i;}\r\n        }\r\n    }\r\n    return output;\r\n}\r\n\r\ninline bool bignum::undefined(){\r\n    return data.empty();\r\n}\r\n\r\ninline int do_comp(const bignum& a, const bignum& b){\r\n    if (a.data.size()<b.data.size()) return -1; if (a.data.size()>b.data.size()) return 1;\r\n    list<int>::const_reverse_iterator i; list<int>::const_reverse_iterator j;\r\n    for (i=a.data.rbegin(),j=b.data.rbegin(); j!=b.data.rend(); i++,j++){\r\n        if (*i<*j) return -1;              \/\/!!!!\r\n        if (*i>*j) return 1;\r\n    }\r\n    return 0;\r\n}\r\ninline int do_comp(const bignum& a, const int& b){\r\n    return do_comp(a, bignum(b));\r\n}\r\n\r\ninline bool operator ==(const bignum& a, const bignum& b){\r\n    return do_comp(a, b) == 0;\r\n}\r\ninline bool operator !=(const bignum& a, const bignum& b){\r\n    return do_comp(a, b) != 0;\r\n}\r\ninline bool operator <(const bignum& a, const bignum& b){\r\n    return do_comp(a, b) == -1;\r\n}\r\ninline bool operator >(const bignum& a, const bignum& b){\r\n    return do_comp(a, b) == 1;\r\n}\r\ninline bool operator <=(const bignum& a, const bignum& b){\r\n    return do_comp(a, b) != 1;\r\n}\r\ninline bool operator >=(const bignum& a, const bignum& b){\r\n    return do_comp(a, b) != -1;\r\n}\r\n\r\ninline bool operator ==(const bignum& a, const int& b){\r\n    return do_comp(a, b) == 0;\r\n}\r\ninline bool operator !=(const bignum& a, const int& b){\r\n    return do_comp(a, b) != 0;\r\n}\r\ninline bool operator <(const bignum& a, const int& b){\r\n    return do_comp(a, b) == -1;\r\n}\r\ninline bool operator >(const bignum& a, const int& b){\r\n    return do_comp(a, b) == 1;\r\n}\r\ninline bool operator <=(const bignum& a, const int& b){\r\n    return do_comp(a, b) != 1;\r\n}\r\ninline bool operator >=(const bignum& a, const int& b){\r\n    return do_comp(a, b) != -1;\r\n}\r\n\r\ninline void bignum::do_trim(){\r\n    while (data.size()>1&&data.back()==0) data.pop_back();\r\n}\r\n\r\ninline bignum& bignum::operator +=(const bignum& a){\r\n    list<int>::iterator i; list<int>::const_iterator j; int t = 0;\r\n    for (i=data.begin(),j=a.data.begin(); i!=data.end()&&j!=a.data.end(); i++,j++){\r\n        *i+=*j+t; t=*i\/__base; *i%=__base;\r\n    }\r\n    while (i!=data.end()) {*i+=t; t=*i\/__base; *i%=__base; i++;}\r\n    while (j!=a.data.end()) {data.PB(t+*j); t=data.back()\/__base; data.back()%=__base; j++;}\r\n    if (t!=0) data.PB(t);\r\n    return *this;\r\n}\r\n\r\ninline bignum& bignum::operator +=(const int& a){\r\n    return (*this)+=bignum(a);\r\n}\r\n\r\ninline bignum operator +(const bignum& a, const bignum& b){\r\n    list<int>::const_iterator i, j; bignum c; int t = 0;\r\n    for (i=a.data.begin(),j=b.data.begin(); i!=a.data.end()&&j!=b.data.end(); i++,j++){\r\n        c.data.PB(t+*i+*j);\r\n        t=c.data.back()\/__base; c.data.back()%=__base;\r\n    }\r\n    while (i!=a.data.end()) {c.data.PB(t+*i); t=c.data.back()\/__base; c.data.back()%=__base; i++;}\r\n    while (j!=b.data.end()) {c.data.PB(t+*j); t=c.data.back()\/__base; c.data.back()%=__base; j++;}\r\n    if (t!=0) c.data.PB(t);\r\n    return c;\r\n}\r\n\r\ninline bignum operator +(const bignum& a, const int& b){\r\n    return a+bignum(b);\r\n}\r\n\r\n} using namespace BIGNUM;\r\n\/\/}\r\n\r\ntypedef int T_state;\r\ntypedef bignum T_key;\r\nconst int N = 8;\r\nint n, m;\r\n\r\n\/\/ 5*3 = 15\r\n\/\/ 4321 = 10\r\n\r\nconst int Offset = 3, Mask = (1 << Offset) - 1;\r\nbool ok[N][N], okk[N][N], _ok[N];\r\n\r\nint b[N+2], bb[N+3];\r\nT_state encode() {\r\n    T_state s = 0; memset(bb, -1, sizeof(bb)); int bn = 1; bb[0] = 0;\r\n#define bi bb[b[i]]\r\n#define bj bb[b[j]]\r\n    DWN(i, m, 0) {\r\n        if (!~bi) bi = bn++;\r\n    }\r\n\r\n    memset(okk, 1, sizeof(okk));\r\n    \/\/cout << "b: "; FOR(i, 0, m) cout << b[i] << " "; cout << endl;\r\n    REP(i, m) if (b[i]) {\r\n        REP(j, i) if (b[j]) {\r\n            okk[bi][bj] = okk[bj][bi] = ok[b[i]][b[j]];\r\n        }\r\n    }\r\n    DWN(i, m+1, 2) DWN(j, i, 1) {\r\n        s <<= 1; s |= !okk[i][j];\r\n    }\r\n    DWN(i, m, 0) {\r\n        s <<= Offset; s |= bi;\r\n    }\r\n    return s;\r\n}\r\nvoid decode(T_state s){\r\n    REP(i, m) {\r\n        b[i] = s & Mask;\r\n        s >>= Offset;\r\n    }\r\n    memset(ok, 1, sizeof(ok));\r\n    FOR(i, 2, m+1) FOR(j, 1, i) {\r\n        ok[i][j] = ok[j][i] = !(s&1);\r\n        s >>= 1;\r\n    }\r\n}\r\nconst int Prime = 9979, MaxSZ = 1 << 20;\r\nT_key d;\r\ntemplate<class T_state, class T_key> struct hashTable {\r\n    int head[Prime]; int next[MaxSZ], sz;\r\n    T_state state[MaxSZ]; T_key key[MaxSZ];\r\n    void clear() {\r\n        sz = 0;\r\n        memset(head, -1, sizeof(head));\r\n    }\r\n    void push(T_state s) {\r\n        int x = s % Prime;\r\n        for (int i = head[x]; ~i; i = next[i]) {\r\n            if (state[i] == s) {\r\n                key[i] += d;\r\n                return;\r\n            }\r\n        }\r\n        state[sz] = s, key[sz] = d;\r\n        next[sz] = head[x], head[x] = sz++;\r\n    }\r\n};\r\nhashTable<T_state, T_key> H[2], *H0, *H1;\r\n\r\n\/\/\r\n\/\/ 64 \/\/ 32 16 8 \/\/ . . .\r\n\r\nint j, lf, up;\r\nvoid push(int t) {\r\n    b[j] = t;\r\n    \/\/assert(ok[t][lf] == ok[lf][t]);\r\n    \/\/assert(ok[t][up] == ok[up][t]);\r\n    bool ok_lf = ok[t][lf], ok_up = ok[t][up];\r\n    ok[t][lf] = ok[lf][t] = ok[t][up] = ok[up][t] = 0;\r\n    H1->push(encode());\r\n    ok[t][lf] = ok[lf][t] = ok_lf;\r\n    ok[t][up] = ok[up][t] = ok_up;\r\n}\r\nvoid push() {\r\n    H1->push(encode());\r\n}\r\n\r\nvoid init() {\r\n    cin >> n >> m; if (m > n) swap(n, m);\r\n}\r\nvoid solve() {\r\n    H0 = H, H1 = H+1, H1->clear(), d = 1, H1->push(0);\r\n\r\n    REP(i, n) {\r\n        REP(j, m) {\r\n            ::j = j; swap(H0, H1), H1->clear();\r\n            REP(u, H0->sz) {\r\n                decode(H0->state[u]); d = H0->key[u];\r\n                lf = j ? b[j-1] : 0, up = b[j];\r\n\r\n                \/*cout << H0->state[u] << ": " << d << endl;\r\n                REP(i, m) cout << b[i] << " "; cout << endl;\r\n                cout << "c: "; FOR(i, 1, m+1) FOR(j, 1, i) cout << ok[i][j] << " "; cout << endl;\r\n*\/\r\n\r\n                push(m+1);\r\n                if (lf && up) {\r\n                    push(lf);\r\n                    if (lf!=up) {\r\n                        push(up);\r\n                        if (ok[lf][up]) {\r\n                            \/\/if (lf > up) swap(lf, up);\r\n                            REP(i, m) if (b[i] == up) b[i] = lf;\r\n                            FOR(t, 1, m+1) {\r\n                                _ok[t] = ok[lf][t];\r\n                                if (ok[lf][t] && !ok[up][t]) {\r\n                                    ok[lf][t] = ok[t][lf] = 0;\r\n                                }\r\n                            }\r\n                            push();\r\n                            FOR(t, 1, m+1) ok[lf][t] = ok[t][lf] = _ok[t];\r\n                        }\r\n                    }\r\n                } else if (lf | up) {\r\n                    push(lf|up);\r\n                }\r\n            }\r\n        }\r\n        \/\/H1->roll();\r\n    }\r\n\r\n    \/*H0 = H1;\r\n    REP(u, H0->sz) {\r\n        decode(H0->state[u]); d = H0->key[u];\r\n        cout << H0->state[u] << ": " << d << endl;\r\n        REP(i, m) cout << b[i] << " "; cout << endl;\r\n    }*\/\r\n}\r\nvoid print() {\r\n    T_key z = 0; REP(i, H1->sz) z += H1->key[i];\r\n    cout << z << endl;\r\n}\r\nint main(){\r\n#ifndef ONLINE_JUDGE\r\n    \/\/\/\/freopen("in.txt", "r", stdin);\r\n#endif\r\n    int T; cin >> T; while (T--) {\r\n        init(); solve();\r\n        print();\r\n    }\r\n}\r\n\r\n\/\/ \u4e0d\u8003\u8651\u5207\u75d5\u8ff9\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
Vjudge | SPOJ | TG \u5148\u590d\u4e60\u4e00\u4e0b \u63d2\u5934 dp \u5927\u5b57\u5178\u3002\u672c\u9898\u663e\u7136\u4f7f\u7528\u67d3\u8272\u6a21\u578b\u3002\u8f6e\u5ed3\u7ebf\u4e0a\u53ea\u6709 m \u4e2a\u4f4d\u7f6e\uff0c\u800c\u4e14\u4e0d\u9700\u8981 roll() \u64cd\u4f5c\uff08\u4e0d\u8fc7\u751f\u6210\u7684\u65b0\u63d2\u5934\uff0c\u8981\u6c42\u524d\u9762\u7684\u533a\u5206\u5f00\u6765\uff0c\u6240\u4ee5\u6211\u4eec\u8fd8\u662f\u7528 m+1 \u6765\u6807\u8bb0\uff09\u3002\u8fd9\u6837\u641e\u5f97\u8bdd\uff0c2\u00d72 \u6211\u4eec\u4f1a\u7b97\u51fa\u7b54\u6848\u7b49\u4e8e 14\uff0c\u4ed4\u7ec6\u89c2\u5bdf\uff0c\u662f\u56e0\u4e3a\u6211\u4eec\u591a\u7b97\u4e86\u4e0b\u9762\u4e24\u79cd\u4e0d\u5408\u6cd5\u7684\u60c5\u51b5\u3002 \u6211\u4eec\u53d1\u73b0\u8fd9\u7c7b\u60c5\u51b5\u90fd\u662f\u56e0\u4e3a\u5728\u524d\u9762\u7684\u8f6c\u79fb\u4e2d\u4ea7\u751f\u4e86\u523b\u75d5\uff0c\u800c\u4f7f\u5f97\u540e\u7eed\u7684\u63d2\u5934\u5408\u5e76\u4e0d\u5408\u6cd5\uff0c\u9700\u8981\u8fdb\u4e00\u6b65\u7f16\u7801\u3002 \u6211\u4eec\u53ef\u4ee5\u7ed9\u6bcf\u4e2a\u8fde\u901a\u5757\u5f3a\u884c\u4e0a\u4e00\u4e2a\u989c\u8272\uff0c\u4e0d\u76f8\u540c\u7684\u989c\u8272\u4e0d\u53ef\u5408\u5e76\u3002\u4f46\u662f\u56e0\u4e3a\u539f\u95ee\u9898\u6ca1\u6709\u989c\u8272\uff0c\u8fd9\u6837\u8ba1\u6570\u8d77\u6765\u4f1a\u6bd4\u8f83\u9ebb\u70e6\uff08\u9700\u8981\u6700\u5c0f\u67d3\u8272\uff0c\u5e76\u4e14\u5fc5\u987b\u4fdd\u8bc1\u76f8\u540c\u989c\u8272\u7684\u8fde\u901a\u5757\u5fc5\u88ab\u5408\u5e76\uff09\u3002 \u6211\u4eec\u4e5f\u53ef\u4ee5\u66b4\u529b\u8bb0\u5f55 C(5,2) \u4e2a\u8fde\u901a\u5757\u4e4b\u95f4\u662f\u5426\u4ea7\u751f\u8fc7\u523b\u75d5\uff0c\u8fd9\u6837\u5408\u5e76\u7684\u65f6\u5019\u76f4\u63a5\u5224\u65ad\u5373\u53ef\u3002 \u523b\u75d5\u7684\u7ef4\u62a4\uff0c\u9996\u5148\u6bcf\u6b21\u72b6\u6001\u8f6c\u79fb\uff0c\u5f53\u524d\u63d2\u5934\u90fd\u9700\u8981\u548c\u76f8\u90bb\u4e24\u4e2a\u63d2\u5934\uff08\u5de6\u63d2\u5934\u548c\u4e0a\u63d2\u5934\uff09\u90fd\u6807\u8bb0\u523b\u75d5\u3002 \u5176\u6b21\uff0c\u56e0\u4e3a\u6211\u4eec\u4f7f\u7528\u4e86\u6700\u5c0f\u8868\u793a\uff0c\u8fde\u901a\u5757\u7684\u8bb0\u53f7\u4f1a\u88ab relable\uff0c\u56e0\u800c\u7f16\u7801\u7684\u65f6\u5019\u4e5f\u9700\u8981\u91cd\u65b0\u6620\u5c04\u3002 \u6700\u540e\u63d2\u5934\u5408\u5e76\u7684\u65f6\u5019\uff0c\u523b\u75d5\u4fe1\u606f\u4e5f\u9700\u8981\u5408\u5e76\u3002 \u6700\u540e\u4e0a\u4e00\u4e0b\u9ad8\u7cbe\u5ea6\u6a21\u677f\u5c31\u597d\u4e86\u3002\u7559\u4e2a OEIS \u5730\u5740\u65b9\u4fbf\u5927\u5bb6 debug\u3002 \/* This code has been written by MinakoKojima, feel free to ask me question. Blog: https:\/\/www.shuizilong.com\/house Template Date: 2015.10.12 Note: … *\/ #pragma comment(linker, "\/STACK:36777216") […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-1660","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-qM","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1660","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=1660"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1660\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=1660"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=1660"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=1660"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}