133. Question-able Difficulty

Codeforces

IDCF10269133

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

You consider a string to be a _question_ if its last character is a question mark. Given a string, figure out whether or not it is a question. The only line of input contains a single string $s$. If the given string is a question (if it has a question mark on the end), output "YES" (no quotes). Otherwise, output "NO" (no quotes). ## Input The only line of input contains a single string $s$. ## Output If the given string is a question (if it has a question mark on the end), output "YES" (no quotes). Otherwise, output "NO" (no quotes). [samples]

**Definitions** Let $ s \in \Sigma^* $ be the input string, where $ \Sigma $ is the set of printable ASCII characters. **Constraints** $ s $ is non-empty and consists of characters from the ASCII character set. **Objective** Determine whether the last character of $ s $ is the question mark character $ \texttt{?} $. Output: $$ \begin{cases} \text{YES} & \text{if } s[|s|-1] = \texttt{?} \\ \text{NO} & \text{otherwise} \end{cases} $$

API Response (JSON)

{
  "problem": {
    "name": "133. Question-able Difficulty",
    "description": {
      "content": "You consider a string to be a _question_ if its last character is a question mark. Given a string, figure out whether or not it is a question. The only line of input contains a single string $s$. If",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10269133"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You consider a string to be a _question_ if its last character is a question mark. Given a string, figure out whether or not it is a question.\n\nThe only line of input contains a single string $s$.\n\nIf...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ s \\in \\Sigma^* $ be the input string, where $ \\Sigma $ is the set of printable ASCII characters.\n\n**Constraints**  \n$ s $ is non-empty and consists of characters from the ASCII...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments