{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"family":"qf-app21-lp-feasible-inventory"},"total":25,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0026","number":2426,"title":{"zh-Hant":"第 2426 題：有限線性規劃候選","en":"Question 2426: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"12c2c9e8d9adc0e5bcc2ae1c342b7c174319eb9ce7ae4e27089bbf8bf9ce30f2","derivation_sha256":"9498c117f311ea99982306e5e787dd87a7d668f13ac16a58b23118b82ea930b4"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0027","number":2427,"title":{"zh-Hant":"第 2427 題：有限線性規劃候選","en":"Question 2427: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"ecc12118c005744da83aacf2d9bb9903886b3a3706e6b382503c981748389e53","derivation_sha256":"586f56d2b418f061725cc0d5980a86db694ef0b977d175d1697ebd216849a4b7"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0028","number":2428,"title":{"zh-Hant":"第 2428 題：有限線性規劃候選","en":"Question 2428: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"a1755bee90401f376edf4520cd5b646bb6b5f9bff8268d284a36d38bf7280459","derivation_sha256":"8177a1841766e97fdd4a8ec4ae7051976f2d7c5d1fabcc623e4d167b53d0a577"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0029","number":2429,"title":{"zh-Hant":"第 2429 題：有限線性規劃候選","en":"Question 2429: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"6e6fe2ef7959d7073e0deb0d52d8afaa629b3f97de79fdb07579b6cbf836e946","derivation_sha256":"877a1bb55b9c89de7d710e1bc8285cf3d0c77b72ea048b52cebb371f85bdd6b8"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0030","number":2430,"title":{"zh-Hant":"第 2430 題：有限線性規劃候選","en":"Question 2430: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"b3a7a20d4e38968deb550ac1f6aa2c4129378310c06f2fc7e9672b8352b89caa","derivation_sha256":"940ae38a96255aaf3f668ca84b4965cdecd365aae94fe1212a88b62534069fc4"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0031","number":2431,"title":{"zh-Hant":"第 2431 題：有限線性規劃候選","en":"Question 2431: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"5e77d80dd0393ea2996f66285df2e164efb6d30366348900d62afbcca0d96aac","derivation_sha256":"1774fd99bb898d6a4a2b7f8a185c9ff2e9c54897950f178d9c2f887c76a4fadc"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0032","number":2432,"title":{"zh-Hant":"第 2432 題：有限線性規劃候選","en":"Question 2432: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"16d3c16ef84012e3ee9eda475f1e9dd2254c17d1763ab588fa619acfa6391be4","derivation_sha256":"b3a4c83016e72719b003a78c59c42ca9f6dd4a70b05c71e9fdb0ef903484e1dd"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0033","number":2433,"title":{"zh-Hant":"第 2433 題：有限線性規劃候選","en":"Question 2433: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"05c7c11209ffe88f1dc95372d00ec43e4e2de3157c9ebb48ee3a29452d97da2c","derivation_sha256":"0d1ede312b2e35c912ac5b7e0d6ca15752ebad3d3fbbf4ddf6d59e9fc86d6fdc"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0034","number":2434,"title":{"zh-Hant":"第 2434 題：有限線性規劃候選","en":"Question 2434: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"533341e9eed39d9c7e3ad3f4684886fb56883d702d03c311c18aeefb42ea6402","derivation_sha256":"b009cf5e8cf8c8cce099f995b23cb13e062d7920c8bda778fbf93d9a79b9ab3a"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0035","number":2435,"title":{"zh-Hant":"第 2435 題：有限線性規劃候選","en":"Question 2435: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"87515ff57ea1cfc9ab4c282c6088c54af0270cb0998d5c1be727ed070367b19f","derivation_sha256":"51154635e23ae135412badcfb2dd835b30c58babd48229696ba8b8dbdca78b5a"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0036","number":2436,"title":{"zh-Hant":"第 2436 題：有限線性規劃候選","en":"Question 2436: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"1f39e28a501cdd272910cd99d5786f03d836eab27f00277c6b01e5401a2791f3","derivation_sha256":"ac3b45b66b1fbbfa38ba1b99a9c5a92d3b6d517de60a4ee90b6bb0ee309fa45f"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0037","number":2437,"title":{"zh-Hant":"第 2437 題：有限線性規劃候選","en":"Question 2437: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"6e86c2c5523cc83d7ea7c04c167c91b0221f107c1f290832c078c2861028ff80","derivation_sha256":"cf8e788bed42076cd3a561f4090e51544ec0f9ab559ddd36a06d9ffbe577454d"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0038","number":2438,"title":{"zh-Hant":"第 2438 題：有限線性規劃候選","en":"Question 2438: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"966b017ee9ca238532e7c2fcfd0062856b5be8d701d3969856159cbc6013fe84","derivation_sha256":"b4b5175aec6f59c0a4335a0050f029f33b7d5661d9372bcefbe29bcf97d1b1e5"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0039","number":2439,"title":{"zh-Hant":"第 2439 題：有限線性規劃候選","en":"Question 2439: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"ab4245a9f412249ee5a740e06e29a0ed27cc8144285956075d2fcc10427ad191","derivation_sha256":"02c1c7c9e4c8431a76fb1e59a24f3c17b2abac3b99e431e9d848ea9a59e6164b"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0040","number":2440,"title":{"zh-Hant":"第 2440 題：有限線性規劃候選","en":"Question 2440: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"f7e2d59e9a30e9bab933b7022c14058f9fef4c69ad2331b12a29acb12663affc","derivation_sha256":"683310457d4fdb84f9df05e670e8c61dec99fdbd0b5651f09ccd8057423b5eaf"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0041","number":2441,"title":{"zh-Hant":"第 2441 題：有限線性規劃候選","en":"Question 2441: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"719c66ff140f732deb80dd754b7137cd31ee3e44b2337c0ce4c44a776c17b087","derivation_sha256":"f2b2634ccb1e2e3d3e53fd50eb9865904e06f7a79d5be943d87155c9e43fe91b"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0042","number":2442,"title":{"zh-Hant":"第 2442 題：有限線性規劃候選","en":"Question 2442: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"8fd65c8047337e9ca58507ac04db5a686c4a3b02d43f1c0d372638dd95ae70d0","derivation_sha256":"f5ddbbd37cf3d96060cdcce9f5395fb5b7084b3638a19036495507cc4757039c"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0043","number":2443,"title":{"zh-Hant":"第 2443 題：有限線性規劃候選","en":"Question 2443: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"0760c69fbf1d220c62b4218ae641c87e1ebbd65b0280c870ce7716e7c1e62872","derivation_sha256":"32b136b4b3491c0607d0721b87de8a55aa00ea813214d49e240eb61b97a246d2"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0044","number":2444,"title":{"zh-Hant":"第 2444 題：有限線性規劃候選","en":"Question 2444: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"83563eb91c5ecb00f2ff5676c0c192f38bc887d523ea7e2347988a3e13d7677d","derivation_sha256":"e58bd8ce99f0d8ca930a253bc0a6ad9c0114c5e692cb5da28e887e39c0cba524"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0045","number":2445,"title":{"zh-Hant":"第 2445 題：有限線性規劃候選","en":"Question 2445: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"3a5f7aa5df612d19b090896cb6b49da5e1c719b352162f78df3ae4b1c70c76a1","derivation_sha256":"b461f289492a948d72fcd29f5d288e1077c18d9c84b01ac34515fa5af53515a5"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0046","number":2446,"title":{"zh-Hant":"第 2446 題：有限線性規劃候選","en":"Question 2446: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"c708a8655d9d50bf0591dfffbf6a63b0492e3c7827d9e1ed6a0a798fa8db56e7","derivation_sha256":"d064865ca26fa27d73db351a535d429745826c154bf47baafe012d3d1c53fa4d"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0047","number":2447,"title":{"zh-Hant":"第 2447 題：有限線性規劃候選","en":"Question 2447: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"6cc5699a7678411fbdeb97761035caf5a3dd721d2eadd382e04a7a21f5bbac6d","derivation_sha256":"047b48b271359b489c3b2c927e2ad97dc6cc72f1228e1061bfe12dc556684f80"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0048","number":2448,"title":{"zh-Hant":"第 2448 題：有限線性規劃候選","en":"Question 2448: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"78fecc369480a93ab1d17d3aab7f81f66b5a9cb0446b44cc00744ce259422a44","derivation_sha256":"3ffec88f5eee10cc3a3d2f2c2f332aead68b773b5255bf386b5bc5f4c84dff38"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0049","number":2449,"title":{"zh-Hant":"第 2449 題：有限線性規劃候選","en":"Question 2449: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"89649f59363d633044b74a1780c21efe72eda17970a625df40fed369227cc5b6","derivation_sha256":"daffcd6c7735e40b5590841fda54b36247aaa78b7d0b4fcbee8527a457d2b627"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0050","number":2450,"title":{"zh-Hant":"第 2450 題：有限線性規劃候選","en":"Question 2450: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"408ec442daffb7ddd3e78a8391591bf184207377281f9521628ab8b7806b21de","derivation_sha256":"faa039a2fc713b3cfe069405e5971c6dae9c1425752d4b05d7ba72ca0a76ce9e"}]}