{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"## 题目描述\n\n在一个回合制桌游中,有两名角色 $A$ 和 $B$,在每一个回合中 $A$ 和 $B$ 依次执行操作。\n\n有 $n$ 扇门,第 $i$ 扇门的耐久度为 $a_i$。\n\n在 $A$ 的操作中,$A$ 可以选择一扇门并破坏它。如果他选择了第 $i$ 扇门,并且当前这扇门的耐久度为 $b_i$,则此次破坏将这扇门的耐久度降低为 $\\max \\\\{ 0, b_i - x \\\\}$($x$ 是给定的)。\n\n在 $B$ 的操作中,$B$ 可以选择一扇门并修复它。如果他选择了第 $i$ 扇门,并且当前这扇门的耐久度为 $b_i$,则此次修复将这扇门的耐久度升高为 $b_i + y$($y$ 是给定的)。$B$ **不能选择**耐久度为 $0$ 的门。\n\n游戏持续 $10^{100}$ 个回合。如果在某一回合中某玩家无法执行操作,则跳过他的操作。\n\n$A$ 和 $B$ 都绝顶聪明,$A$ 想让最终耐久度为 $0$ 的门尽可能多,$B$ 想让最终耐久度为 $0$ 的门尽可能少。如果双方都按照最优策略来操作,游戏结束时有多少耐久度为 $0$ 的门?\n\n## 输入格式\n\n第一行包含 $n, x, y$($1 \\le n \\le 100, 1 \\le x, y \\le 10^5$),表示门的数量、$x$ 和 $y$ 的值。\n\n第二行包含 $n$ 个整数 $a_1, a_2, \\dots, a_n$($1 \\le a_i \\le 10^5$),表示每扇门的耐久度。\n\n## 输出格式\n\n如果 $A$ 和 $B$ 都按照最优策略来操作,游戏结束时耐久度为 $0$ 的门的数量。\n\n\u003cp\u003eYou are policeman and you are playing a game with Slavik. The game is turn-based and each turn consists of two phases. During the first phase you make your move and during the second phase Slavik makes his move.\u003c/p\u003e\u003cp\u003eThere are $$$n$$$ doors, the $$$i$$$-th door initially has durability equal to $$$a_i$$$.\u003c/p\u003e\u003cp\u003eDuring your move you can try to break one of the doors. If you choose door $$$i$$$ and its current durability is $$$b_i$$$ then you reduce its durability to $$$max(0, b_i - x)$$$ (the value $$$x$$$ is given).\u003c/p\u003e\u003cp\u003eDuring Slavik\u0027s move he tries to repair one of the doors. If he chooses door $$$i$$$ and its current durability is $$$b_i$$$ then he increases its durability to $$$b_i + y$$$ (the value $$$y$$$ is given). \u003cspan class\u003d\"tex-font-style-bf\"\u003eSlavik cannot repair doors with current durability equal to $$$0$$$\u003c/span\u003e.\u003c/p\u003e\u003cp\u003eThe game lasts $$$10^{100}$$$ turns. If some player cannot make his move then he has to skip it.\u003c/p\u003e\u003cp\u003eYour goal is to maximize the number of doors with durability equal to $$$0$$$ at the end of the game. You can assume that Slavik \u003cspan class\u003d\"tex-font-style-bf\"\u003ewants to minimize\u003c/span\u003e the number of such doors. What is the number of such doors in the end if you both play optimally?\u003c/p\u003e"}},{"title":"Input","value":{"format":"MD","content":"\u003cp\u003eThe first line of the input contains three integers $$$n$$$, $$$x$$$ and $$$y$$$ ($$$1 \\le n \\le 100$$$, $$$1 \\le x, y \\le 10^5$$$) — the number of doors, value $$$x$$$ and value $$$y$$$, respectively.\u003c/p\u003e\u003cp\u003eThe second line of the input contains $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$ ($$$1 \\le a_i \\le 10^5$$$), where $$$a_i$$$ is the initial durability of the $$$i$$$-th door.\u003c/p\u003e"}},{"title":"Output","value":{"format":"MD","content":"\u003cp\u003ePrint one integer — the number of doors with durability equal to $$$0$$$ at the end of the game, if you and Slavik both play optimally.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e6 3 2\n2 3 1 3 4 2\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e6\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 2","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5 3 3\n1 2 4 2 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 3","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5 5 6\n1 2 6 10 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"MD","content":"\u003cp\u003eClarifications about the optimal strategy will be ignored.\u003c/p\u003e"}}]}