{"problem":{"name":"Distinct Strings","description":{"content":"You are given a string $S$ of length $3$ consisting of lowercase English letters. How many different strings can be obtained by permuting the characters in $S$?","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc225_a"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$ of length $3$ consisting of lowercase English letters.\nHow many different strings can be obtained by permuting the characters in $S$?\n\n## Constraints\n\n*   $S$ is a string $S$ of length $3$ consisting of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc225_a","tags":[],"sample_group":[["aba","3\n\nBy permuting the characters in $S=$ `aba`, three different strings can be obtained: `aab`, `aba`, `baa`."],["ccc","1\n\nBy permuting the characters in $S=$ `ccc`, just one string can be obtained: `ccc`."],["xyz","6\n\nBy permuting the characters in $S=$ `xyz`, six different strings can be obtained: `xyz`, `xzy`, `yxz`, `yzx`, `zxy`, `zyx`."]],"created_at":"2026-03-03 11:01:13"}}