Problem 563. How to add?
- Imagine you are in 2222 Anno Domini, when everyone must learn how to add,
- and competing for the highly prestigious post of,
- Chief Comptroller of Dda Corporation.
- You are being tested via MATLAB Cody for addition of two positive integers X and Y,
- both are fortunately in decimal system, and only a few dozen digits or less,
- and delivered as ASCII strings.
- Please output the result Z in similar style.
- Please adopt a general strategy, as X and Y may be changed later.
- Please rename the function Z = dda(X,Y).
- Function Template:
function Z = dda(X,Y) X='98765432109876543210987654321098765432109876543210987654321' Y='98765432109876543210987654321098765432109876543210987654321' Z='197530864219753086421975308642197530864219753086421975308642'; end
Solution Stats
Problem Comments
-
2 Comments
赵思铭
on 28 Aug 2024
why I can't use sym to solve this problem
Dyuman Joshi
on 28 Aug 2024
@赵思铭, Cody only supports basic MATLAB. It does not support any Toolboxes. Thus, you can't use 'sym' which is a part of the Symbolic Math Toolbox.
This is officially mentioned in the "Notes" section on this page - https://in.mathworks.com/matlabcentral/content/cody/about.html
Solution Comments
Show commentsGroup

Number theory
- 44 Problems
- 21 Finishers
- Pseudo-vampire number
- Pell numbers
- Frugal number
- Be happy
- Bell Triangle
- find nth even fibonacci number
- Cantor counting
- check whether a number is a pentatope number
- generate nth pentatope number
- Fangs of a vampire number
- Find all vampire fangs
- Balanced number
- Mandelbrot Numbers
- Parasitic numbers
- Woodall number
- Kaprekar numbers
- Project Euler: Problem 4, Palindromic numbers
- Fangs of pseudo-vampire number
- Project Euler: Problem 9, Pythagorean numbers
- Mersenne Primes
- Sophie Germain prime
- Determine if input is a Narcissistic number
- Determine if input is a perfect number
- Ordinal numbers
- Lychrel Number Test (Inspired by Project Euler Problem 55)
- Circular Primes (based on Project Euler, problem 35)
- Largest Twin Primes
- Golomb's self-describing sequence (based on Euler 341)
- Is it an Armstrong number?
- Champernowne Constant
- Last non-zero digit
- Generate a Parasitic Number
- Smith numbers
- Evil Number
- Armstrong Number
- Polite numbers. Politeness.
- Polite numbers. N-th polite number.
- Narcissistic number ?
- Is this number Munchhausen?
- P-smooth numbers
- Iccanobif numbers 1
- Amicable numbers
- Extra safe primes
- Pentagonal Numbers
Problem Recent Solvers147
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!