{"problem":{"name":"09. Labyrinth-9","description":{"content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":8000,"memory_limit":524288},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF92109"},"statements":[{"statement_type":"Markdown","content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"请参见问题描述：http://codeforces.com/contest/921/problem/01。\n\n[samples]","is_translate":true,"language":"Chinese"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the length of the sequence.  \nLet $ A = (a_1, a_2, \\dots, a_n) $ be a sequence of positive integers.\n\n**Constraints**  \n$ 1 \\leq n \\leq 200 $,  \n$ 1 \\leq a_i \\leq 10^9 $ for all $ i \\in \\{1, \\dots, n\\} $.\n\n**Objective**  \nFind the maximum number of elements that can be selected from $ A $ such that the sum of the selected elements is odd.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF92109","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}