Statistics

Problem Statement for "ReversedSum"

Problem Statement

For a given positive integer X we can obtain the reversed positive integer Rev(X) by reversing the order of X's digits and removing leading zeroes. For example, if X = 123 then Rev(X) = 321; and if X = 100, then Rev(X) = 1.


You will be given two positive integers x and y. Return their reversed sum, which is defined as Rev(Rev(x) + Rev(y)).

Definition

Class:
ReversedSum
Method:
getReversedSum
Parameters:
int, int
Returns:
int
Method signature:
int getReversedSum(int x, int y)
(be sure your method is public)

Constraints

  • x and y will each be between 1 and 1000, inclusive.

Examples

  1. 123

    100

    Returns: 223

    As mentioned in the problem statement, Rev(123) = 321 and Rev(100) = 1. So, the reversed sum is equal to Rev(322) = 223.

  2. 111

    111

    Returns: 222

  3. 5

    5

    Returns: 1

  4. 1000

    1

    Returns: 2

  5. 456

    789

    Returns: 1461

  6. 5

    4

    Returns: 9

  7. 146

    321

    Returns: 467

  8. 378

    834

    Returns: 1131

  9. 829

    88

    Returns: 6101

  10. 574

    541

    Returns: 26

  11. 731

    288

    Returns: 9101

  12. 860

    313

    Returns: 183

  13. 470

    332

    Returns: 703

  14. 209

    989

    Returns: 1981

  15. 157

    108

    Returns: 2551

  16. 386

    357

    Returns: 6341

  17. 439

    856

    Returns: 2951

  18. 35

    487

    Returns: 738

  19. 741

    763

    Returns: 415

  20. 378

    172

    Returns: 4411

  21. 916

    373

    Returns: 299

  22. 861

    893

    Returns: 665

  23. 473

    192

    Returns: 566

  24. 89

    26

    Returns: 61

  25. 596

    964

    Returns: 4611

  26. 135

    405

    Returns: 5301

  27. 944

    818

    Returns: 7621

  28. 396

    914

    Returns: 2111

  29. 66

    92

    Returns: 59

  30. 657

    37

    Returns: 928

  31. 575

    512

    Returns: 97

  32. 940

    380

    Returns: 231

  33. 275

    237

    Returns: 4031

  34. 480

    557

    Returns: 938

  35. 40

    428

    Returns: 828

  36. 208

    141

    Returns: 349

  37. 61

    151

    Returns: 761

  38. 163

    723

    Returns: 886

  39. 650

    640

    Returns: 201

  40. 653

    452

    Returns: 16

  41. 989

    332

    Returns: 2221

  42. 1

    585

    Returns: 685

  43. 1

    140

    Returns: 24

  44. 1

    529

    Returns: 629

  45. 1

    156

    Returns: 256

  46. 1

    173

    Returns: 273

  47. 1

    525

    Returns: 625

  48. 1

    910

    Returns: 2

  49. 1

    92

    Returns: 3

  50. 1

    195

    Returns: 295

  51. 1

    211

    Returns: 311

  52. 999

    999

    Returns: 8991

  53. 1000

    1000

    Returns: 2

  54. 123

    423

    Returns: 546

  55. 505

    505

    Returns: 101

  56. 101

    102

    Returns: 203

  57. 793

    450

    Returns: 154

  58. 909

    101

    Returns: 101

  59. 123

    234

    Returns: 357

  60. 203

    903

    Returns: 116

  61. 1

    999

    Returns: 1

  62. 101

    101

    Returns: 202

  63. 9

    9

    Returns: 81

  64. 102

    1

    Returns: 202

  65. 56

    89

    Returns: 361

  66. 3

    4

    Returns: 7

  67. 100

    1

    Returns: 2

  68. 405

    123

    Returns: 528

  69. 100

    456

    Returns: 556

  70. 101

    202

    Returns: 303

  71. 505

    1

    Returns: 605

  72. 567

    450

    Returns: 918

  73. 220

    220

    Returns: 44

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: