A. Adding Two Integers

Codeforces

IDCF10221A

Time1000ms

Memory64MB

Difficulty—

English · Original

Formal · Original

Given two integers (a and b), get their sum: There will be one line with two integers given, a and b, separated by spaces. You should return the integer sum of a and b, sum. #cf_span(class=[tex-font-style-underline], body=[Constraints]): - 1, 000, 000, 000 ≤ a ≤ 1, 000, 000, 000 - 1, 000, 000, 000 ≤ b ≤ 1, 000, 000, 000 - 2, 000, 000, 000 ≤ sum ≤ 2, 000, 000, 000 ## Input There will be one line with two integers given, a and b, separated by spaces. ## Output You should return the integer sum of a and b, sum. [samples] ## Note #cf_span(class=[tex-font-style-underline], body=[Constraints]): - 1, 000, 000, 000 ≤ a ≤ 1, 000, 000, 000 - 1, 000, 000, 000 ≤ b ≤ 1, 000, 000, 000 - 2, 000, 000, 000 ≤ sum ≤ 2, 000, 000, 000

**Definitions** Let $ S \in \Sigma^n $ be a string of length $ n $, where $ \Sigma = \{a, b, \dots, z\} $ is the set of lowercase English letters. **Constraints** 1. $ 1 \le n \le 10^7 $ 2. Each character in $ S $ is in $ \Sigma $ **Objective** Find the lexicographically smallest permutation of $ S $.

API Response (JSON)

{
  "problem": {
    "name": "A. Adding Two Integers",
    "description": {
      "content": "Given two integers (a and b), get their sum: There will be one line with two integers given, a and b, separated by spaces. You should return the integer sum of a and b, sum.  #cf_span(class=[tex-fo",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 65536
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10221A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given two integers (a and b), get their sum:\n\nThere will be one line with two integers given, a and b, separated by spaces.\n\nYou should return the integer sum of a and b, sum. \n\n#cf_span(class=[tex-fo...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ S \\in \\Sigma^n $ be a string of length $ n $, where $ \\Sigma = \\{a, b, \\dots, z\\} $ is the set of lowercase English letters.\n\n**Constraints**  \n1. $ 1 \\le n \\le 10^7 $  \n2. Eac...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments