{"problem":{"name":"182. Lucky Numbers","description":{"content":"You consider a number to be \"lucky\" if it has any digits equal to 7. For example, 7377, 87, and 98789 are lucky, while 6, 300, and 561 are not lucky. Given a number, figure out whether or not it is a ","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269182"},"statements":[{"statement_type":"Markdown","content":"You consider a number to be \"lucky\" if it has any digits equal to 7. For example, 7377, 87, and 98789 are lucky, while 6, 300, and 561 are not lucky. Given a number, figure out whether or not it is a lucky number.\n\nThe only line of input consists of a single integer $n$.\n\nIf $n$ is a lucky number, output \"YES\" (no quotes). Otherwise, output \"NO\" (no quotes).\n\n## Input\n\nThe only line of input consists of a single integer $n$.\n\n## Output\n\nIf $n$ is a lucky number, output \"YES\" (no quotes). Otherwise, output \"NO\" (no quotes).\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the input integer.\n\n**Constraints**  \n$ n \\in \\mathbb{Z} $, with no explicit bounds given.\n\n**Objective**  \nDetermine whether the decimal representation of $ n $ contains at least one digit equal to $ 7 $.  \nDefine:  \n$$\n\\text{Lucky}(n) = \n\\begin{cases}\n\\text{YES} & \\text{if } \\exists d \\in \\text{digits}(n) \\text{ such that } d = 7 \\\\\n\\text{NO} & \\text{otherwise}\n\\end{cases}\n$$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269182","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}