{"problem":{"name":"116. Diverse String","description":{"content":"You consider a string to be a _diverse string_ if every pair of adjacent characters are different. For example _coderams_ is a diverse string, while _hello_ is not. Given a string, figure out whether","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269116"},"statements":[{"statement_type":"Markdown","content":"You consider a string to be a _diverse string_ if every pair of adjacent characters are different. For example _coderams_ is a diverse string, while _hello_ is not.\n\nGiven a string, figure out whether or not it is a diverse string.\n\nThe only line of input contains a single string, not containing spaces.\n\nIf the string is a diverse string, output \"YES\" (no quotes). Otherwise, output \"NO\" (no quotes).\n\n## Input\n\nThe only line of input contains a single string, not containing spaces.\n\n## Output\n\nIf the string is a diverse string, output \"YES\" (no quotes). Otherwise, output \"NO\" (no quotes).\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ s = s_1 s_2 \\dots s_n $ be a string of length $ n \\geq 1 $, where each $ s_i $ is a character.\n\n**Constraints**  \n$ n \\geq 1 $, and $ s_i \\in \\Sigma $ for some alphabet $ \\Sigma $, with no spaces in $ s $.\n\n**Objective**  \nDetermine whether $ s $ is a *diverse string*, i.e.,  \n$$\n\\forall i \\in \\{1, 2, \\dots, n-1\\}, \\quad s_i \\neq s_{i+1}\n$$  \nIf true, output \"YES\"; otherwise, output \"NO\".","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269116","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}