Problem 250. KleofasTail
\n\u7ed9\u5b9a\u4e0b\u9762\u7684\u53d8\u5e7b\u89c4\u5219 \u3002\u3002\u3002<\/p>\n
\r\nx->2x | x \u662f\u4efb\u610f\u6570\r\nx->2x+1 | x \u662f\u5076\u6570\r\n<\/pre>\n\u95ee\u4ece x \u5f00\u59cb\u53d8\u5e7b\uff0c\u843d\u5728\u533a\u95f4 [l, r] \u4e4b\u95f4\u7684\u6570\u5b57\u7684\u4e2a\u6570\u3002<\/p>\n
Problem 500. FavouriteDigits
\n\u6c42\u6ee1\u8db3\u6570\u4f4d\u4e2d\u6709 c1 \u4e2a d1, c2 \u4e2a d2 \u7684\u5927\u4e8e\u7b49\u4e8e n \u7684\u6700\u5c0f\u6570\u3002<\/p>\nProblem 1000. FleaCircus
\n\u8bbe P \u662f\u4e00\u4e2a\u7f6e\u6362\uff0c\u73b0\u5728\u7ed9\u5b9a P^4 \u3002\u3002\u3002
\n\u8ba1\u6570\uff1a\u6240\u6709\u53ef\u80fd\u6ee1\u8db3\u7684 P\u3002<\/p>\n<\/p>\n
Analysis: <\/h3>\n
Problem 250. KleofasTail
\n\u3002\u3002\u3002\u73b0\u573a\u751f\u4ee3\u7801\u76f4\u63a5\u66b4\u529b TLE \u4e86\u3002\u3002\u3002
\n\uff08\u6211\u53ea\u7565\u5fae\u4f30\u8ba1\u4e86\u4e00\u4e0b\u66b4\u529b\u662f O(n) \u7684\u5c31\u4ea4\u4e86\uff0c\u6ca1\u8003\u8651\u4e00\u4e9b\u6bd4\u8f83\u6781\u9650\u7684\u60c5\u51b5\u3002
\n\u5b9e\u9645\u4e0a\u5728\u8fd9\u4e2a\u57fa\u7840\u4e0a\u7a0d\u52a0\u8003\u8651\u5c31\u4e0d\u96be\u53d1\u73b0\u5206\u9636\u6bb5\u540e\u53d8\u5e7b\u7684\u6570\u5b57\u603b\u662f\u5728\u4e00\u4e2a\u533a\u95f4\u5185\u3002\u3002\u6c42\u4ea4\u7d2f\u52a0\u5373\u53ef\u3002\u3002\u3002<\/p>\nProblem 500. FavouriteDigits
\n1. \u6784\u9020\u51fa\u542b\u6709 c1 \u4e2a d1, c2 \u4e2a d2 \u7684\u6700\u5c0f\u6570 t\u3002
\n2. \u5982\u679c t <= n \u6253\u5370 t\u3002\u3002\u3002\u5426\u5219\uff0c\u8bbe n \u7684\u4f4d\u6570\u7b49\u4e8e len\u3002\u6784\u9020\u51fa len \u4f4d\u6700\u5927\u7b26\u5408\u6761\u4ef6\u7684\u6570 t\u3002\n3. \u5982\u679c t <= n \uff0c\u8fd0\u884c\u4e00\u4e2a len \u4f4d\u7684 dfs() \u6784\u9020\u3002\u3002\n4. \u5982\u679c t >= n \uff0c\u8fd0\u884c\u4e00\u4e2a (len+1) \u4f4d\u7684 dfs() \u6784\u9020\u3002\u3002 \uff08\u8bbe\u7f6e\u7b2c\u4e00\u4f4d\u7b49\u4e8e 1\u3002\u3002\u3002<\/p>\n\u3002\u3002\u3002\uff08\u73b0\u573a\u751f\u4ee3\u7801 dfs() \u5199\u9519\u4e86\u51e0\u4e2a\u5730\u65b9\u3002\u3002\u7136\u540e\u5bf9 (d1 == 0) \u7684\u4e00\u4e9b\u60c5\u51b5\u3002\u3002
\n\u5728\u6c42 t \u7684\u65f6\u5019\u4e5f\u6ca1\u6709\u8fdb\u884c\u4e00\u4e9b\u8c03\u6574\u3002\u3002\u3002 \/$:^ ^ <\/p>\nProblem 1000. FleaCircus
\n\u8fdb\u884c\u4e00\u6b21\u63a8\u5e7f\u3002\u3002\uff084 \u8fd9\u4e2a\u6761\u4ef6\u660e\u663e\u4e0d\u81ea\u7136\u3002\u3002
\n\u90a3\u4e48\u6b63\u5411\u8003\u5bdf\u4e00\u4e2a\u7f6e\u6362 P \u548c\u5b83\u7684 k \u6b21\u5e42\u7684\u5faa\u73af\u8282\u3002
\n\u5bf9\u4e8e\u957f\u5ea6\u4e3a l \u7684\u4e00\u4e2a\u5faa\u73af\u8282\uff0c\u90a3\u4e48\u53d8\u5e7b\u8fc7\u540e
\n\u5c06\u4f1a\u751f\u6210 gcd(k, l) \u4e2a l \/ gcd(k, l) \u957f\u5ea6\u7684\u5faa\u73af\u8282\u3002\u3002<\/p>\n\uff08\u6240\u4ee5\u4e3b\u7b97\u6cd5\u6846\u67b6\u5373\u5bf9\u4e0d\u540c\u957f\u5ea6\u7684\u5faa\u73af\u8282\u5f53\u505a\u6574\u4f53\u8fdb\u884c\u8ba1\u6570\uff0c\u7136\u540e\u5168\u90e8\u4e58\u8d77\u6765\u3002
\n\u8003\u8651\u53cd\u5411\u95ee\u9898\u7684\u8bdd\u5927\u6982\u8fd8\u8981\u8fdb\u884c\u4e00\u4e9b\u679a\u4e3e\uff0c\u6211\u4eec\u8bbe P^4 \u4e2d\u957f\u5ea6\u4e3a l \u7684\u5faa\u73af\u8282\u6709 cnt[l] \u4e2a\u3002\uff09<\/p>\n\u5bf9\u4e8e k = 4 \u7684\u60c5\u51b5\u8fdb\u884c\u7ec6\u90e8\u5206\u6790\u3002\u3002\u5f97\u5230\u4ee5\u4e0b\u7ed3\u8bba\uff1a
\n\u5982\u679c l \u662f\u5076\u6570\uff0c\u90a3\u4e48\u53ea\u53ef\u80fd\u901a\u8fc7 4l \u5f97\u5230\u3002\u3002\uff08\u6b64\u65f6\u5982\u679c cnt[l] \u4e0d\u80fd\u6574\u9664 4 \u5c06\u9020\u6210\u65e0\u89e3\u3002\u3002\u8fd9\u91cc\u4e5f\u662f\u9020\u6210\u65e0\u89e3\u7684\u552f\u4e00\u60c5\u51b5\u3002
\n\u5982\u679c l \u662f\u5947\u6570\uff0c\u90a3\u4e48 l \u53ef\u4ee5\u901a\u8fc7 l, 2l \u548c 4l \u5f97\u5230\u3002\u3002\uff08\u5177\u4f53\u9700\u8981\u679a\u4e3e\u3002\u3002\u3002<\/p>\n\u3002\u3002\u3002\u5148\u505a\u597d\u51fd\u6570 f(a, b)
\n\uff08\u8fd9\u91cc\u8868\u793a\u5faa\u73af\u8282\u957f\u5ea6\u4e3a b\uff0c\u4e14\u5728\u539f\u7f6e\u6362\u4e2d\u662f\u7531\u957f\u5ea6 ab \u7684\u5faa\u73af\u8282\u5f97\u5230\u7684\u3002\u3002a \u53ea\u6709 2 \u548c 4 \u4e24\u79cd\u53ef\u80fd\u3002\u3002\u3002<\/p>\n\r\nint f(int a, int b){\r\n return a == 4 ? cub(b)*6 : b;\r\n}\r\n<\/pre>\n\uff08\u8fd9\u91cc\u53ea\u7ed9\u51fa f(4, 3)\u7684\u56fe\u4f8b\u3002\u3002\u5bf9\u4e8e 1 \u53ef\u4ee5\u5bfb\u627e\u672c\u7ec4\u5916\u7684 9 \u4e2a\u6570\u5b57\u4e2d\u7684\u4efb\u610f\u4e00\u4e2a\u5bf9\u5e94\uff0c\u5e76\u4e14\u4e00\u65e6 1 \u627e\u5230\u5f52\u5bbf\u540e\uff0c
\n\u672c\u7ec4\u5185\u7684\u5176\u4ed6\u51e0\u4e2a\u6570\u4e5f\u4f1a\u4f9d\u6b21\u627e\u5230\u60c5\u611f\u7684\u5f52\u5bbf\u3002\u3002\uff08\u54a6\uff1f\u3002\u3002
\n\u6240\u4ee5\u662f (b*3) * (b*2) * (b*1) = b^3 * 6 …<\/p>\n\r\n{1 -> 2 -> 3 -> 1 .. . }\r\n{4 -> 5 -> 6 -> .. .. .}\r\n{7 -> 8 -> 9 .. .}\r\n{10 -> 11 -> 12 .. .}\r\n<\/pre>\n\u90a3\u4e48\u73b0\u5728\u53ea\u8981\u8003\u8651 l \u7b49\u4e8e\u5947\u6570\u65f6\u7684\u5b50\u95ee\u9898\u5373\u53ef\u4e86\u3002\u3002
\n\u6709 n \u4e2a\u4e92\u4e0d\u76f8\u540c\u7684\u7403\uff0c\u95ee\u5206\u6210\u82e5\u5e72\u4e2a 1\u4e2a1\u4e2a \u4e00\u7ec4\uff0c\u6216\u80052\u4e2a2\u4e2a \u4e00\u7ec4 \u6216\u8005 4\u4e2a4\u4e2a \u4e00\u7ec4\u4e00\u5171\u6709\u591a\u5c11\u79cd\u5206\u7ec4\u65b9\u6848\u3002<\/p>\n\r\n.. .\r\n int res = 1, tmp, r1, n1, r2, n2; REP_1(i, n) if (cnt[i]){\r\n if (i&1){\r\n tmp = 0, r1 = 1, n1 = cnt[i]; FOR_1_C(j, 0, n1\/4){\r\n r2 = r1, n2 = n1; FOR_1_C(k, 0, n2\/2){\r\n INC(tmp, qtt(r2, pdt(F[j], F[k]))), MUL(r2, C[n2][2]), MUL(r2, f(2, i)), n2 -= 2;\r\n }\r\n MUL(r1, C[n1][4]), MUL(r1, f(4, i)), n1 -= 4;\r\n }\r\n }\r\n else {\r\n tmp = _I(F[(n1=cnt[i])\/4]);\r\n while (n1) MUL(tmp, C[n1][4]), MUL(tmp, f(4, i)), n1 -= 4;\r\n\r\n }\r\n MUL(res, tmp);\r\n }\r\n.. .\r\n<\/pre>\n\u3002\u3002\u8fd9\u91cc\u5916\u5c42\u5faa\u73af\u679a\u4e3e\u6709\u591a\u5c11\u7ec4 4\u4e2a4\u4e2a \u4e00\u7ec4\u7684\u3002\u3002\u5185\u5c42\u5faa\u73af\u679a\u4e3e\u6709\u591a\u5c11 2\u4e2a2\u4e2a \u4e00\u7ec4\u7684\u3002\u3002
\nr1, n1 \u8868\u793a\u5f53\u524d\u5916\u5c42\u8ba1\u7b97\u7684\u7ed3\u679c\uff0cn1 \u8868\u793a\u679a\u4e3e\u8fc7 4\u4e2a4\u4e2a \u540e\u8fd8\u5269\u591a\u5c11\u4e2a\u7403\u3002\u3002
\nr2, n2 \u7c7b\u4f3c\u3002\u3002\uff08\u6ce8\u610f\u7d2f\u52a0\u65f6\u907f\u514d\u91cd\u590d\u8ba1\u6570\u5373\u53ef\u3002\u3002\u3002 <\/p>\n\r\n\/* -&$&#*( &#*@)^$@&*)*\/\r\n\r\nclass KleofasTail {\r\npublic:\r\n\tlong long countGoodSequences(LL s, LL l, LL r) {\r\n\t LL res = 0; if (!s){s = 1; if (!l) res = 1;}\r\n LL ll = s, rr = s + !(s&1);\r\n\t while (true){\r\n\t if (ll > r) break;\r\n\t res += max(0LL, min(r, rr) - max(l, ll) + 1);\r\n\t ll <<= 1, rr <<= 1, rr |= 1;\r\n\t }\r\n\t return res;\r\n\t}\r\n};\r\n<\/pre>\n\r\n\/* &*#()&*#)&E*F& *\/\r\n\r\n#include <iostream>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <ctime>\r\n#include <cmath>\r\n#include <algorithm>\r\n#include <sstream>\r\n#include <string>\r\n#include <vector>\r\n#include <map>\r\n\r\nusing namespace std;\r\n\r\n#define REP(I, N) for (int I=0;I<int(N);++I)\r\n#define FOR(I, A, B) for (int I=int(A);I<int(B);++I)\r\n#define DWN(I, B, A) for (int I=int(B-1);I>=int(A);--I)\r\n#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)\r\n\r\n#define ALL(A) A.begin(), A.end()\r\n#define CLR(A) A.clear()\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 SRT(A) sort(ALL(A))\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\r\ntypedef long long LL;\r\ntypedef double DB;\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\n\r\ntemplate<class T> inline void checkMin(T &a, T b){if (b<a) a=b;}\r\ntemplate<class T> inline void checkMax(T &a, T b){if (b>a) a=b;}\r\n\r\n\/* -&$&#*( &#*@)^$@&*)*\/\r\n\r\nconst int MOD = 1000000007;\r\nconst int INF = 0x7fffffff;\r\n\r\nconst int N = 50;\r\n\r\nint A[N], d1, d2;\r\nLL t, res; int len;\r\n\r\n\/\/ c1 c1 .. c1 + 1 .. c2\r\n\/\/ c2 c2 c2 + 1 ...\r\n\/\/ f f, f+1, c1, c2 ...\r\n\/\/ 0000c1c1c1c2c2c2\r\n\r\nbool dfs(int depth, int c1, int c2, bool flag){\r\n if (flag){\r\n int c3 = (len - depth) - max(0, c1) - max(0, c2);\r\n if (c3 < 0) return false;\r\n REP(i, c3) res *= 10;\r\n REP(i, c1) res *= 10, res += d1;\r\n REP(i, c2) res *= 10, res += d2;\r\n\r\n return true;\r\n }\r\n\r\n if (depth == len){\r\n return c1<=0 && c2<=0;\r\n }\r\n else {\r\n if (A[depth] == d2){\r\n\r\n \/\/cout << depth << " " << A[depth] << endl;\r\n\r\n res *= 10, res += d2;\r\n if (dfs(depth+1, c1, c2-1, false)) return true;\r\n res \/= 10;\r\n \/\/#\r\n }\r\n else if (A[depth] == d1){\r\n\r\n \/\/cout << depth << " " << A[depth] << endl;\r\n\r\n res *= 10, res += d1;\r\n if (dfs(depth+1, c1-1, c2, false)) return true;\r\n res \/= 10;\r\n\r\n res *= 10, res += d1+1; \/\/#\r\n if (dfs(depth+1, c1, c2 - (d1 + 1 == d2), true)) return true;\r\n res \/= 10;\r\n\r\n if (d1 + 1 < d2){\r\n res *= 10, res += d2; \/\/#\r\n if (dfs(depth+1, c1, c2 - 1, true)) return true;\r\n res \/= 10;\r\n }\r\n\r\n }\r\n else {\r\n res *= 10, res += A[depth];\r\n if (dfs(depth+1, c1, c2, false)) return true;\r\n res \/= 10;\r\n\r\n if (A[depth] == 9) return false;\r\n\r\n res *= 10, res += A[depth] + 1;\r\n if (dfs(depth+1, c1 - (A[depth] + 1 == d1), c2 - (A[depth] + 1 == d2), true)) return true;\r\n res \/= 10;\r\n\r\n if (d1 > A[depth]){\r\n res *= 10, res += d1;\r\n if (dfs(depth+1, c1-1, c2, true)) return true;\r\n res \/= 10;\r\n }\r\n if (d2 > A[depth]){\r\n res *= 10, res += d2;\r\n if (dfs(depth+1, c1, c2-1, true)) return true;\r\n res \/= 10;\r\n }\r\n\r\n return false;\r\n }\r\n }\r\n\r\n return false;\r\n}\r\n\r\nclass FavouriteDigits {\r\npublic:\r\n\tlong long findNext(LL n, int _d1, int c1, int _d2, int c2) {\r\n\r\n\t\td1 = _d1, d2 = _d2, res = 0;\r\n\r\n if (d1 > d2) swap(c1, c2), swap(d1, d2);\r\n\r\n if (!d1){\r\n t = c2 ? d2 : 1; REP(i, c1) t *= 10, t += d1;\r\n REP(i, c2-1) t *= 10, t += d2;\r\n }\r\n else{\r\n t = 0; REP(i, c1) t *= 10, t += d1;\r\n REP(i, c2) t *= 10, t += d2;\r\n }\r\n\r\n if (t >= n){\r\n return t;\r\n }\r\n else {\r\n len = int ((DB) log(n-1) \/ (DB) log(10)) + 1;\r\n \r\n int c3 = max(len - c1 - c2, 0);\r\n t = 0; REP(i, c3) t *= 10, t += 9;\r\n REP(i, c2) t *= 10, t += d2;\r\n REP(i, c1) t *= 10, t += d1;\r\n\r\n if (t >= n){\r\n DWN(i, len, 0) A[i] = n % 10, n \/= 10;\r\n dfs(0, c1, c2, false);\r\n if (res == 0) res = t;\r\n return res;\r\n }\r\n else {\r\n DWN(i, len, 0) A[i+1] = n % 10, n \/= 10;\r\n ++len, A[0] = 0; res = 1;\r\n dfs(1, c1 - (d1 == 1), c2 - (d2 == 1), true);\r\n return res;\r\n }\r\n\r\n }\r\n\t}\r\n};\r\n\r\n\r\n\/\/ BEGIN CUT HERE\r\nnamespace moj_harness {\r\n\tint run_test_case(int);\r\n\tvoid run_test(int casenum = -1, bool quiet = false) {\r\n\t\tif (casenum != -1) {\r\n\t\t\tif (run_test_case(casenum) == -1 && !quiet) {\r\n\t\t\t\tcerr << "Illegal input! Test case " << casenum << " does not exist." << endl;\r\n\t\t\t}\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tint correct = 0, total = 0;\r\n\t\tfor (int i=0;; ++i) {\r\n\t\t\tint x = run_test_case(i);\r\n\t\t\tif (x == -1) {\r\n\t\t\t\tif (i >= 100) break;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tcorrect += x;\r\n\t\t\t++total;\r\n\t\t}\r\n\r\n\t\tif (total == 0) {\r\n\t\t\tcerr << "No test cases run." << endl;\r\n\t\t} else if (correct < total) {\r\n\t\t\tcerr << "Some cases FAILED (passed " << correct << " of " << total << ")." << endl;\r\n\t\t} else {\r\n\t\t\tcerr << "All " << total << " tests passed!" << endl;\r\n\t\t}\r\n\t}\r\n\r\n\tint verify_case(int casenum, const long long &expected, const long long &received, clock_t elapsed) {\r\n\t\tcerr << "Example " << casenum << "... ";\r\n\r\n\t\tstring verdict;\r\n\t\tvector<string> info;\r\n\t\tchar buf[100];\r\n\r\n\t\tif (elapsed > CLOCKS_PER_SEC \/ 200) {\r\n\t\t\tsprintf(buf, "time %.2fs", elapsed * (1.0\/CLOCKS_PER_SEC));\r\n\t\t\tinfo.push_back(buf);\r\n\t\t}\r\n\r\n\t\tif (expected == received) {\r\n\t\t\tverdict = "PASSED";\r\n\t\t} else {\r\n\t\t\tverdict = "FAILED";\r\n\t\t}\r\n\r\n\t\tcerr << verdict;\r\n\t\tif (!info.empty()) {\r\n\t\t\tcerr << " (";\r\n\t\t\tfor (int i=0; i<(int)info.size(); ++i) {\r\n\t\t\t\tif (i > 0) cerr << ", ";\r\n\t\t\t\tcerr << info[i];\r\n\t\t\t}\r\n\t\t\tcerr << ")";\r\n\t\t}\r\n\t\tcerr << endl;\r\n\r\n\t\tif (verdict == "FAILED") {\r\n\t\t\tcerr << " Expected: " << expected << endl;\r\n\t\t\tcerr << " Received: " << received << endl;\r\n\t\t}\r\n\r\n\t\treturn verdict == "PASSED";\r\n\t}\r\n\r\n\tint run_test_case(int casenum) {\r\n\t\tswitch (casenum) {\r\n\t\tcase 0: {\r\n\t\t\tlong long N = 701234568901234LL;\r\n\t\t\tint digit1 = 6;\r\n\t\t\tint count1 = 14;\r\n\t\t\tint digit2 = 0;\r\n\t\t\tint count2 = 0;\r\n\t\t\tlong long expected__ = 766666666666666LL;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 1: {\r\n\t\t\tlong long N = 47;\r\n\t\t\tint digit1 = 4;\r\n\t\t\tint count1 = 8;\r\n\t\t\tint digit2 = 7;\r\n\t\t\tint count2 = 7;\r\n\t\t\tlong long expected__ = 444444447777777;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 2: {\r\n\t\t\tlong long N = 47;\r\n\t\t\tint digit1 = 5;\r\n\t\t\tint count1 = 0;\r\n\t\t\tint digit2 = 3;\r\n\t\t\tint count2 = 1;\r\n\t\t\tlong long expected__ = 53;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 3: {\r\n\t\t\tlong long N = 47;\r\n\t\t\tint digit1 = 2;\r\n\t\t\tint count1 = 1;\r\n\t\t\tint digit2 = 0;\r\n\t\t\tint count2 = 2;\r\n\t\t\tlong long expected__ = 200;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 4: {\r\n\t\t\tlong long N = 123456789012345LL;\r\n\t\t\tint digit1 = 1;\r\n\t\t\tint count1 = 2;\r\n\t\t\tint digit2 = 2;\r\n\t\t\tint count2 = 4;\r\n\t\t\tlong long expected__ = 123456789012422LL;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 5: {\r\n\t\t\tlong long N = 92;\r\n\t\t\tint digit1 = 1;\r\n\t\t\tint count1 = 1;\r\n\t\t\tint digit2 = 0;\r\n\t\t\tint count2 = 0;\r\n\t\t\tlong long expected__ = 100;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\r\n\t\t\/\/ custom cases\r\n\r\n\/* case 6: {\r\n\t\t\tlong long N = ;\r\n\t\t\tint digit1 = ;\r\n\t\t\tint count1 = ;\r\n\t\t\tint digit2 = ;\r\n\t\t\tint count2 = ;\r\n\t\t\tlong long expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\/* case 7: {\r\n\t\t\tlong long N = ;\r\n\t\t\tint digit1 = ;\r\n\t\t\tint count1 = ;\r\n\t\t\tint digit2 = ;\r\n\t\t\tint count2 = ;\r\n\t\t\tlong long expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\/* case 8: {\r\n\t\t\tlong long N = ;\r\n\t\t\tint digit1 = ;\r\n\t\t\tint count1 = ;\r\n\t\t\tint digit2 = ;\r\n\t\t\tint count2 = ;\r\n\t\t\tlong long expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tlong long received__ = FavouriteDigits().findNext(N, digit1, count1, digit2, count2);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\t\tdefault:\r\n\t\t\treturn -1;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint main(int argc, char *argv[]) {\r\n\tif (argc == 1) {\r\n\t\tmoj_harness::run_test();\r\n\t} else {\r\n\t\tfor (int i=1; i<argc; ++i)\r\n\t\t\tmoj_harness::run_test(atoi(argv[i]));\r\n\t}\r\n}\r\n\/\/ END CUT HERE\r\n<\/pre>\n\r\n#define LOCAL\r\n\r\n\/** ` Micro Mezzo Macro Flation -- Overheated Economy ., **\/\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <iomanip>\r\n#include <sstream>\r\n#include <cstring>\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\nusing namespace std;\r\n\r\n#define REP(i, n) for (int i=0;i<int(n);++i)\r\n#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)\r\n#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)\r\n#define REP_1(i, n) for (int i=1;i<=int(n);++i)\r\n#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)\r\n#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)\r\n#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_N(i, n) for (i=0;i<int(n);++i)\r\n#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)\r\n#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)\r\n#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)\r\n#define REP_1_N(i, n) for (i=1;i<=int(n);++i)\r\n#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)\r\n#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)\r\n#define REP_C_N(i, n) for (n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;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 DO(n) while(n--)\r\n#define DO_C(n) int n____ = n; while(n____--)\r\n#define TO(i, a, b) int s_=a<b?1:-1,b_=b+s_;for(int i=a;i!=b_;i+=s_)\r\n#define TO_1(i, a, b) int s_=a<b?1:-1,b_=b;for(int i=a;i!=b_;i+=s_)\r\n#define SQZ(i, j, a, b) for (int i=int(a),j=int(b)-1;i<j;++i,--j)\r\n#define SQZ_1(i, j, a, b) for (int i=int(a),j=int(b);i<=j;++i,--j)\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\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 BSC(A, X) find(ALL(A), X) \/\/ != A.end()\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\r\n#define Rush int T____; RD(T____); DO(T____)\r\n#pragma comment(linker, "\/STACK:36777216")\r\n\/\/#pragma GCC optimize ("O2")\r\n#define Ruby system("ruby main.rb")\r\n#define Haskell system("runghc main.hs")\r\n#define Pascal system("fpc main.pas")\r\n\r\ntypedef long long LL;\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> VD;\r\ntypedef set<int> SI;\r\ntypedef set<string> SS;\r\ntypedef set<LL> SL;\r\ntypedef set<DB> SD;\r\ntypedef map<int, int> MII;\r\ntypedef map<string, int> MSI;\r\ntypedef map<LL, int> MLI;\r\ntypedef map<DB, int> MDI;\r\ntypedef map<int, bool> MIB;\r\ntypedef map<string, bool> MSB;\r\ntypedef map<LL, bool> MLB;\r\ntypedef map<DB, bool> MDB;\r\ntypedef pair<int, int> PII;\r\ntypedef pair<int, bool> PIB;\r\ntypedef vector<PII> VII;\r\ntypedef vector<VI> VVI;\r\ntypedef vector<VII> VVII;\r\ntypedef set<PII> SII;\r\ntypedef map<PII, int> MPIII;\r\ntypedef map<PII, bool> MPIIB;\r\n\r\n\/** I\/O Accelerator **\/\r\n\r\n\/* ... :" We are I\/O Accelerator ... Use us at your own risk ;) ... " .. *\/\r\n\r\ntemplate<class T> inline void RD(T &);\r\ntemplate<class T> inline void OT(const T &);\r\n\r\ninline int RD(){ int x; RD(x); return x;}\r\ntemplate<class T> inline T& _RD(T &x){ RD(x); return x;}\r\ninline void RC(char &c){scanf(" %c", &c);}\r\ninline void RS(char *s){scanf("%s", s);}\r\n\r\ntemplate<class T0, class T1> inline void RD(T0 &x0, T1 &x1){RD(x0), RD(x1);}\r\ntemplate<class T0, class T1, class T2> inline void RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void 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);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void 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);}\r\ntemplate<class T0, class T1> inline void OT(T0 &x0, T1 &x1){OT(x0), OT(x1);}\r\ntemplate<class T0, class T1, class T2> inline void OT(T0 &x0, T1 &x1, T2 &x2){OT(x0), OT(x1), OT(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void OT(T0 &x0, T1 &x1, T2 &x2, 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(T0 &x0, T1 &x1, T2 &x2, T3 &x3, 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(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, 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(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}\r\n\r\ntemplate<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}\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\n\r\n\r\ntemplate<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){\r\n while (!Q.empty()) Q.pop();\r\n}\r\n\r\ntemplate<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){\r\n while (!Q.empty()) Q.pop();\r\n}\r\n\r\ntemplate<class T> inline void CLR(T &A){A.clear();}\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\ntemplate<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}\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){FLC(A0), FLC(A1), FLC(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3){FLC(A0), FLC(A1), FLC(A2), FLC(A3);}\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){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4);}\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){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5);}\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){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5), FLC(A6);}\r\n\r\ntemplate<class T> inline void SRT(T &A){sort(ALL(A));}\r\ntemplate<class T, class C> inline void SRT(T &A, C B){sort(ALL(A), B);}\r\n\r\n\/** Add - On **\/\r\n\r\nconst int MOD = 1000000009;\r\nconst int INF = 10009;\r\nconst DB EPS = 1e-2;\r\nconst DB OO = 1e15;\r\nconst DB PI = 3.14159265358979323846264; \/\/M_PI;\r\n\r\n\/\/ <<= ` 0. Daily Use .,\r\n\r\ntemplate<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}\r\ntemplate<class T> inline void checkMax(T &a,const T b){if (b>a) a=b;}\r\ntemplate <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}\r\ntemplate <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}\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(min(a, b), max(c, d));}\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\nint Ceil(int x, int y){return (x - 1) \/ y + 1;}\r\n\r\n\/\/ <<= ` 1. Bitwise Operation .,\r\ninline bool _1(int x, int i){return x & 1<<i;}\r\ninline bool _1(LL x, int i){return x & 1LL<<i;}\r\ninline LL _1(int i){return 1LL<<i;}\r\n\/\/inline int _1(int i){return 1<<i;}\r\ninline LL _U(int i){return _1(i) - 1;};\r\n\/\/inline int _U(int i){return _1(i) - 1;};\r\n\r\ninline int count_bits(int x){\r\n x = (x & 0x55555555) + ((x & 0xaaaaaaaa) >> 1);\r\n x = (x & 0x33333333) + ((x & 0xcccccccc) >> 2);\r\n x = (x & 0x0f0f0f0f) + ((x & 0xf0f0f0f0) >> 4);\r\n x = (x & 0x00ff00ff) + ((x & 0xff00ff00) >> 8);\r\n x = (x & 0x0000ffff) + ((x & 0xffff0000) >> 16);\r\n return x;\r\n}\r\n\r\ninline int count_bits(LL x){\r\n x = (x & 0x5555555555555555LL) + ((x & 0xaaaaaaaaaaaaaaaaLL) >> 1);\r\n x = (x & 0x3333333333333333LL) + ((x & 0xccccccccccccccccLL) >> 2);\r\n x = (x & 0x0f0f0f0f0f0f0f0fLL) + ((x & 0xf0f0f0f0f0f0f0f0LL) >> 4);\r\n x = (x & 0x00ff00ff00ff00ffLL) + ((x & 0xff00ff00ff00ff00LL) >> 8);\r\n x = (x & 0x0000ffff0000ffffLL) + ((x & 0xffff0000ffff0000LL) >> 16);\r\n x = (x & 0x00000000ffffffffLL) + ((x & 0xffffffff00000000LL) >> 32);\r\n return x;\r\n}\r\n\r\nint reverse_bits(int x){\r\n x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa);\r\n x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc);\r\n x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0);\r\n x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00);\r\n x = ((x >> 16) & 0x0000ffff) | ((x << 16) & 0xffff0000);\r\n return x;\r\n}\r\n\r\n\/\/ <<= ` 2. Modular Arithmetic Basic .,\r\n\r\ninline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}\r\ninline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}\r\ninline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}\r\ninline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;}\r\ninline void MUL(int &a, int b){a = (LL)a * b % MOD;}\r\ninline int pdt(int a, int b){return (LL)a * b % MOD;}\r\ninline int pdt(int a, int b, int c){return pdt(pdt(a, b), c);}\r\n\r\ninline int pow(int a, int b){\r\n int c = 1;\r\n while (b) {\r\n if (b&1) MUL(c, a);\r\n MUL(a, a), b >>= 1;\r\n }\r\n return c;\r\n}\r\n\r\ntemplate<class T>\r\ninline int pow(T a, int b){\r\n T c(1);\r\n while (b) {\r\n if (b&1) MUL(c, a);\r\n MUL(a, a), b >>= 1;\r\n }\r\n return c;\r\n}\r\n\r\ninline int _I(int b){\r\n int a = MOD, x1 = 0, x2 = 1, q;\r\n while (true){\r\n q = a \/ b, a %= b;\r\n if (!a) return (x2 + MOD) % MOD;\r\n DEC(x1, pdt(q, x2));\r\n\r\n q = b \/ a, b %= a;\r\n if (!b) return (x1 + MOD) % MOD;\r\n DEC(x2, pdt(q, x1));\r\n }\r\n}\r\n\r\ninline void DIV(int &a, int b){MUL(a, _I(b));}\r\ninline int qtt(int a, int b){return pdt(a, _I(b));}\r\n\r\ninline int sum(int a, int b, int MOD){\r\n a += b; if (a >= MOD) a -= MOD;\r\n return a;\r\n}\r\n\r\ninline int phi(int n){\r\n int res = n;\r\n for (int i=2;sqr(i)<=n;++i) if (!(n%i)){\r\n DEC(res, qtt(res, i));\r\n do{n \/= i;} while(!(n%i));\r\n }\r\n if (n != 1)\r\n DEC(res, qtt(res, n));\r\n return res;\r\n}\r\n\r\n\/\/ <<= '9. Comutational Geometry .,\r\n\r\nstruct Po; struct Line; struct Seg;\r\n\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\nstruct Po{\r\n DB x, y;\r\n Po(DB _x = 0, DB _y = 0):x(_x), y(_y){}\r\n\r\n friend istream& operator >>(istream& in, Po &p){return in >> p.x >> p.y;}\r\n friend ostream& operator <<(ostream& out, Po p){return out << "(" << p.x << ", " << p.y << ")";}\r\n\r\n friend bool operator ==(Po, Po);\r\n friend bool operator !=(Po, Po);\r\n friend Po operator +(Po, Po);\r\n friend Po operator -(Po, Po);\r\n friend Po operator *(Po, DB);\r\n friend Po operator \/(Po, DB);\r\n\r\n bool operator < (const Po &rhs) const{return sgn(x, rhs.x) < 0 || sgn(x, rhs.x) == 0 && sgn(y, rhs.y) < 0;}\r\n Po operator-() const{return Po(-x, -y);}\r\n Po& operator +=(Po rhs){x += rhs.x, y += rhs.y; return *this;}\r\n Po& operator -=(Po rhs){x -= rhs.x, y -= rhs.y; return *this;}\r\n Po& operator *=(DB k){x *= k, y *= k; return *this;}\r\n Po& operator \/=(DB k){x \/= k, y \/= k; return *this;}\r\n\r\n DB length_sqr(){return sqr(x) + sqr(y);}\r\n DB length(){return sqrt(length_sqr());}\r\n\r\n DB atan(){\r\n return atan2(y, x);\r\n }\r\n\r\n void input(){\r\n scanf("%lf %lf", &x, &y);\r\n }\r\n};\r\n\r\nbool operator ==(Po a, Po b){return sgn(a.x - b.x) == 0 && sgn(a.y - b.y) == 0;}\r\nbool operator !=(Po a, Po b){return sgn(a.x - b.x) != 0 || sgn(a.y - b.y) != 0;}\r\nPo operator +(Po a, Po b){return Po(a.x + b.x, a.y + b.y);}\r\nPo operator -(Po a, Po b){return Po(a.x - b.x, a.y - b.y);}\r\nPo operator *(Po a, DB k){return Po(a.x * k, a.y * k);}\r\nPo operator *(DB k, Po a){return a * k;}\r\nPo operator \/(Po a, DB k){return Po(a.x \/ k, a.y \/ k);}\r\n\r\nstruct Line{\r\n Po a, b;\r\n Line(Po _a = Po(), Po _b = Po()):a(_a), b(_b){}\r\n Line(DB x0, DB y0, DB x1, DB y1):a(Po(x0, y0)), b(Po(x1, y1)){}\r\n Line(Seg);\r\n\r\n friend ostream& operator <<(ostream& out, Line p){return out << p.a << "-" << p.b;}\r\n};\r\n\r\nstruct Seg{\r\n Po a, b;\r\n Seg(Po _a = Po(), Po _b = Po()):a(_a), b(_b){}\r\n Seg(DB x0, DB y0, DB x1, DB y1):a(Po(x0, y0)), b(Po(x1, y1)){}\r\n Seg(Line l);\r\n\r\n friend ostream& operator <<(ostream& out, Seg p){return out << p.a << "-" << p.b;}\r\n DB length(){return (b - a).length();}\r\n};\r\n\r\nLine::Line(Seg l):a(l.a), b(l.b){}\r\nSeg::Seg(Line l):a(l.a), b(l.b){}\r\n\r\n#define innerProduct dot\r\n#define scalarProduct dot\r\n#define dotProduct dot\r\n#define outerProduct det\r\n#define crossProduct det\r\n\r\ninline DB dot(DB x1, DB y1, DB x2, DB y2){return x1 * x2 + y1 * y2;}\r\ninline DB dot(Po a, Po b){return dot(a.x, a.y, b.x, b.y);}\r\ninline DB dot(Po p0, Po p1, Po p2){return dot(p1 - p0, p2 - p0);}\r\ninline DB dot(Line l1, Line l2){return dot(l1.b - l1.a, l2.b - l2.a);}\r\ninline DB det(DB x1, DB y1, DB x2, DB y2){return x1 * y2 - x2 * y1;}\r\ninline DB det(Po a, Po b){return det(a.x, a.y, b.x, b.y);}\r\ninline DB det(Po p0, Po p1, Po p2){return det(p1 - p0, p2 - p0);}\r\ninline DB det(Line l1, Line l2){return det(l1.b - l1.a, l2.b - l2.a);}\r\n\r\ntemplate<class T1, class T2> inline DB dist(T1 x, T2 y){return sqrt(dist_sqr(x, y));}\r\n\r\ninline DB dist_sqr(Po a, Po b){return sqr(a.x - b.x) + sqr(a.y - b.y);}\r\ninline DB dist_sqr(Po p, Line l){Po v0 = l.b - l.a, v1 = p - l.a; return sqr(fabs(det(v0, v1))) \/ v0.length_sqr();}\r\ninline DB dist_sqr(Po p, Seg l){\r\n Po v0 = l.b - l.a, v1 = p - l.a, v2 = p - l.b;\r\n if (sgn(dot(v0, v1)) * sgn(dot(v0, v2)) <= 0) return dist_sqr(p, Line(l));\r\n else return min(v1.length_sqr(), v2.length_sqr());\r\n}\r\n\r\ninline DB dist_sqr(Line l, Po p){return dist_sqr(p, l);}\r\ninline DB dist_sqr(Seg l, Po p){return dist_sqr(p, l);}\r\n\r\ninline DB dist_sqr(Line l1, Line l2){\r\n if (sgn(det(l1, l2)) != 0) return 0;\r\n return dist_sqr(l1.a, l2);\r\n}\r\ninline DB dist_sqr(Line l1, Seg l2){\r\n Po v0 = l1.b - l1.a, v1 = l2.a - l1.a, v2 = l2.b - l1.a; DB c1 = det(v0, v1), c2 = det(v0, v2);\r\n return sgn(c1) != sgn(c2) ? 0 : sqr(min(fabs(c1), fabs(c2))) \/ v0.length_sqr();\r\n}\r\n\r\nbool isIntersect(Seg l1, Seg l2){\r\n\r\n \/\/if (l1.a == l2.a || l1.a == l2.b || l1.b == l2.a || l1.b == l2.b) return true;\r\n\r\n return\r\n min(l1.a.x, l1.b.x) <= max(l2.a.x, l2.b.x) &&\r\n min(l2.a.x, l2.b.x) <= max(l1.a.x, l1.b.x) &&\r\n min(l1.a.y, l1.b.y) <= max(l2.a.y, l2.b.y) &&\r\n min(l2.a.y, l2.b.y) <= max(l1.a.y, l1.b.y) &&\r\n sgn( det(l1.a, l2.a, l2.b) ) * sgn( det(l1.b, l2.a, l2.b) ) <= 0 &&\r\n sgn( det(l2.a, l1.a, l1.b) ) * sgn( det(l2.b, l1.a, l1.b) ) <= 0;\r\n\r\n}\r\n\r\ninline DB dist_sqr(Seg l1, Seg l2){\r\n if (isIntersect(l1, l2)) return 0;\r\n else return min(dist_sqr(l1.a, l2), dist_sqr(l1.b, l2), dist_sqr(l2.a, l1), dist_sqr(l2.b, l1));\r\n}\r\n\r\ninline bool isOnExtremePoint(const Po &p, const Seg &l){\r\n return p == l.a || p == l.b;\r\n}\r\n\r\ninline bool isOnseg(const Po &p, const Seg &l){\r\n\r\n \/\/if (p == l.a || p == l.b) return false;\r\n\r\n return sgn(det(p, l.a, l.b)) == 0 &&\r\n sgn(l.a.x, p.x) * sgn(l.b.x, p.x) <= 0 && sgn(l.a.y, p.y) * sgn(l.b.y, p.y) <= 0;\r\n}\r\n\r\ninline Po intersect(const Line &l1, const Line &l2){\r\n return l1.a + (l1.b - l1.a) * (det(l2.a, l1.a, l2.b) \/ det(l2, l1));\r\n}\r\n\r\n\/\/ perpendicular foot\r\ninline Po intersect(const Po & p, const Line &l){\r\n return intersect(Line(p, p + Po(l.a.y - l.b.y, l.b.x - l.a.x)), l);\r\n}\r\n\r\ninline Po rotate(Po p, DB alpha, Po o = Po()){\r\n p.x -= o.x, p.y -= o .y;\r\n return Po(p.x * cos(alpha) - p.y * sin(alpha), p.y * cos(alpha) + p.x * sin(alpha)) + o;\r\n}\r\n\r\n\/\/ <<= ' A. Random Event ..\r\n\r\ninline int rand32(){return (bool(rand() & 1) << 30) | (rand() << 15) + rand();}\r\ninline int random32(int l, int r){return rand32() % (r - l + 1) + l;}\r\ninline int random(int l, int r){return rand() % (r - l + 1) + l;}\r\nint dice(){return rand() % 6;}\r\nbool coin(){return rand() % 2;}\r\n\r\n\/\/ <<= ' 0. I\/O Accelerator interface .,\r\n\r\ntemplate<class T> inline void RD(T &x){\r\n \/\/cin >> x;\r\n scanf("%d", &x);\r\n \/\/char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n \/\/char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n}\r\n\r\ntemplate<class T> inline void OT(const T &p){\r\n printf("%.0lf\\n", p);\r\n}\r\n\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst int N = 1009;\r\n\r\nVI P; bool vis[N]; int cnt[N];\r\nint F[N], C[N][N], n;\r\n\r\nint dfs(int u){\r\n if (vis[u]) return 0; vis[u] = true;\r\n return 1 + dfs(P[u]);\r\n}\r\n\r\nint f(int a, int b){\r\n return a == 4 ? cub(b)*6 : b;\r\n}\r\n\r\nclass FleaCircus {\r\npublic:\r\n\tint countArrangements(vector <string> S) {\r\n\r\n\t REP(i, N){C[i][0] = 1; FOR_1(j, 1, min(i, 4)) C[i][j] = sum(C[i-1][j-1], C[i-1][j]);}\r\n\t F[0] = 1; FOR(i, 1, N) F[i] = pdt(F[i-1], i);\r\n\r\n string s; REP(i, SZ(S)) s += S[i]; istringstream iss(s);\r\n CLR(P); int t; while (iss >> t) P.PB(t); n = SZ(P);\r\n RST(vis, cnt); REP(i, n) if (!vis[i]) ++cnt[dfs(i)];\r\n\r\n REP_1(i, n) if (!(i&1) && (cnt[i]%4)) return 0;\r\n\r\n int res = 1, tmp, r1, n1, r2, n2; REP_1(i, n) if (cnt[i]){\r\n if (i&1){\r\n tmp = 0, r1 = 1, n1 = cnt[i]; FOR_1_C(j, 0, n1\/4){\r\n r2 = r1, n2 = n1; FOR_1_C(k, 0, n2\/2){\r\n INC(tmp, qtt(r2, pdt(F[j], F[k]))), MUL(r2, C[n2][2]), MUL(r2, f(2, i)), n2 -= 2;\r\n }\r\n MUL(r1, C[n1][4]), MUL(r1, f(4, i)), n1 -= 4;\r\n }\r\n }\r\n else {\r\n tmp = _I(F[(n1=cnt[i])\/4]);\r\n while (n1) MUL(tmp, C[n1][4]), MUL(tmp, f(4, i)), n1 -= 4;\r\n\r\n }\r\n MUL(res, tmp);\r\n }\r\n\r\n\t\treturn res;\r\n\t}\r\n};\r\n\r\n\/\/ 8\r\n\r\n\r\n\/\/ BEGIN CUT HERE\r\nnamespace moj_harness {\r\n\tint run_test_case(int);\r\n\tvoid run_test(int casenum = -1, bool quiet = false) {\r\n\t\tif (casenum != -1) {\r\n\t\t\tif (run_test_case(casenum) == -1 && !quiet) {\r\n\t\t\t\tcerr << "Illegal input! Test case " << casenum << " does not exist." << endl;\r\n\t\t\t}\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tint correct = 0, total = 0;\r\n\t\tfor (int i=0;; ++i) {\r\n\t\t\tint x = run_test_case(i);\r\n\t\t\tif (x == -1) {\r\n\t\t\t\tif (i >= 100) break;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tcorrect += x;\r\n\t\t\t++total;\r\n\t\t}\r\n\r\n\t\tif (total == 0) {\r\n\t\t\tcerr << "No test cases run." << endl;\r\n\t\t} else if (correct < total) {\r\n\t\t\tcerr << "Some cases FAILED (passed " << correct << " of " << total << ")." << endl;\r\n\t\t} else {\r\n\t\t\tcerr << "All " << total << " tests passed!" << endl;\r\n\t\t}\r\n\t}\r\n\r\n\tint verify_case(int casenum, const int &expected, const int &received, clock_t elapsed) {\r\n\t\tcerr << "Example " << casenum << "... ";\r\n\r\n\t\tstring verdict;\r\n\t\tvector<string> info;\r\n\t\tchar buf[100];\r\n\r\n\t\tif (elapsed > CLOCKS_PER_SEC \/ 200) {\r\n\t\t\tsprintf(buf, "time %.2fs", elapsed * (1.0\/CLOCKS_PER_SEC));\r\n\t\t\tinfo.push_back(buf);\r\n\t\t}\r\n\r\n\t\tif (expected == received) {\r\n\t\t\tverdict = "PASSED";\r\n\t\t} else {\r\n\t\t\tverdict = "FAILED";\r\n\t\t}\r\n\r\n\t\tcerr << verdict;\r\n\t\tif (!info.empty()) {\r\n\t\t\tcerr << " (";\r\n\t\t\tfor (int i=0; i<(int)info.size(); ++i) {\r\n\t\t\t\tif (i > 0) cerr << ", ";\r\n\t\t\t\tcerr << info[i];\r\n\t\t\t}\r\n\t\t\tcerr << ")";\r\n\t\t}\r\n\t\tcerr << endl;\r\n\r\n\t\tif (verdict == "FAILED") {\r\n\t\t\tcerr << " Expected: " << expected << endl;\r\n\t\t\tcerr << " Received: " << received << endl;\r\n\t\t}\r\n\r\n\t\treturn verdict == "PASSED";\r\n\t}\r\n\r\n\tint run_test_case(int casenum) {\r\n\t\tswitch (casenum) {\r\n\t\tcase 0: {\r\n\t\t\tstring afterFourClicks[] = {"0 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 5", "3 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 10", "2 103 104 105 106 107 108 109 110 111 112 113 114 ", "115 116 117 118 119 120 121 122 123 124 125 126 12", "7 128 129 130 131 132 133 134 135 136 137 138 139 ", "140 141 142 143 144 145 146 147 148 149 150 151 15", "2 153 154 155 156 157 158 159 160 161 162 163 164 ", "165 166 167 168 169 170 171 172 173 174 175 176 17", "7 178 179 180 181 182 183 184 185 186 187 188 189 ", "190 191 192 193 194 195 196 197 198 199 200 201 20", "2 203 204 205 206 207 208 209 210 211 212 213 214 ", "215 216 217 218 219 220 221 222 223 224 225 226 22", "7 228 229 230 231 232 233 234 235 236 237 238 239 ", "240 241 242 243 244 245 246 247 248 249 250 251 25", "2 253 254 255 256 257 258 259 260 261 262 263 264 ", "265 266 267 268 269 270 271 272 273 274 275 276 27", "7 278 279 280 281 282 283 284 285 286 287 288 289 ", "290 291 292 293 294 295 296 297 298 299 300 301 30", "2 303 304 305 306 307 308 309 310 311 312 313 314 ", "315 316 317 318 319 320 321 322 323 324 325 326 32", "7 328 329 330 331 332 333 334 335 336 337 338 339 ", "340 341 342 343 344 345 346 347 348 349 350 351 35", "2 353 354 355 356 357 358 359 360 361 362 363 364 ", "365 366 367 368 369 370 371 372 373 374 375 376 37", "7 378 379 380 381 382 383 384 385 386 387 388 389 ", "390 391 392 393 394 395 396 397 398 399 400 401 40", "2 403 404 405 406 407 408 409 410 411 412 413 414 ", "415 416 417 418 419 420 421 422 423 424 425 426 42", "7 428 429 430 431 432 433 434 435 436 437 438 439 ", "440 441 442 443 444 445 446 447 448 449 450 451 45", "2 453 454 455 456 457 458 459 460 461 462 463 464 ", "465 466 467 468 469 470 471 472 473 474 475 476 47", "7 478 479 480 481 482 483 484 485 486 487 488 489 ", "490 491 492 493 494 495 496 497 498 499 500 501 50", "2 503 504 505 506 507 508 509 510 511 512 513 514 ", "515 516 517 518 519 520 521 522 523 524 525 526 52", "7 528 529 530 531 532 533 534 535 536 537 538 539 ", "540 541 542 543 544 545 546 547 548 549 550 551 55", "2 553 554 555 556 557 558 559 560 561 562 563 564 ", "565 566 567 568 569 570 571 572 573 574 575 576 57", "7 578 579 580 581 582 583 584 585 586 587 588 589 ", "590 591 592 593 594 595 596 597 598 599 600 601 60", "2 603 604 605 606 607 608 609 610 611 612 613 614 ", "615 616 617 618 619 620 621 622 623 624 625 626 62", "7 628 629 630 631 632 633 634 635 636 637 638 639 ", "640 641 642 643 644 645 646 647 648 649 650 651"};\r\n\t\t\tint expected__ = 92639029;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 1: {\r\n\t\t\tstring afterFourClicks[] = {"1 2 ", "0 3"};\r\n\t\t\tint expected__ = 1;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 2: {\r\n\t\t\tstring afterFourClicks[] = {"0 1 2"};\r\n\t\t\tint expected__ = 4;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 3: {\r\n\t\t\tstring afterFourClicks[] = {"0 1 2 3 5 4"};\r\n\t\t\tint expected__ = 0;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 4: {\r\n\t\t\tstring afterFourClicks[] = {"3 6 7 9 8 2 1", "0 5 1 0 4"};\r\n\t\t\tint expected__ = 4;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 5: {\r\n\t\t\tstring afterFourClicks[] = {"1 0 7 5 6 3 4 2"};\r\n\t\t\tint expected__ = 48;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\r\n\t\t\/\/ custom cases\r\n\r\n\/* case 6: {\r\n\t\t\tstring afterFourClicks[] = ;\r\n\t\t\tint expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\/* case 7: {\r\n\t\t\tstring afterFourClicks[] = ;\r\n\t\t\tint expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\/* case 8: {\r\n\t\t\tstring afterFourClicks[] = ;\r\n\t\t\tint expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = FleaCircus().countArrangements(vector <string>(afterFourClicks, afterFourClicks + (sizeof afterFourClicks \/ sizeof afterFourClicks[0])));\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\t\tdefault:\r\n\t\t\treturn -1;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint main(int argc, char *argv[]) {\r\n\tif (argc == 1) {\r\n\t\tmoj_harness::run_test();\r\n\t} else {\r\n\t\tfor (int i=1; i<argc; ++i)\r\n\t\t\tmoj_harness::run_test(atoi(argv[i]));\r\n\t}\r\n}\r\n\/\/ END CUT HERE\r\n<\/pre>\nExternal link: <\/h3>\n