Rotate

AtCoder
IDabc235_a
Time2000ms
Memory256MB
Difficulty
Let $xyz$ denote the $3$\-digit integer whose digits are $x$, $y$, $z$ from left to right. Given a $3$\-digit integer $abc$ none of whose digits is $0$, find $abc+bca+cab$. ## Constraints * $abc$ is a $3$\-digit integer $abc$ none of whose digits is $0$. ## Input Input is given from Standard Input in the following format: $abc$ [samples]
Samples
Input #1
123
Output #1
666

We have $123+231+312=666$.
Input #2
999
Output #2
2997

We have $999+999+999=2997$.
API Response (JSON)
{
  "problem": {
    "name": "Rotate",
    "description": {
      "content": "Let $xyz$ denote the $3$\\-digit integer whose digits are $x$, $y$, $z$ from left to right. Given a $3$\\-digit integer $abc$ none of whose digits is $0$, find $abc+bca+cab$.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc235_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Let $xyz$ denote the $3$\\-digit integer whose digits are $x$, $y$, $z$ from left to right.\nGiven a $3$\\-digit integer $abc$ none of whose digits is $0$, find $abc+bca+cab$.\n\n## Constraints\n\n*   $abc$ ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}
Full JSON Raw Segments