Problem 74. Balanced number
Given a positive integer find whether it is a balanced number. For a balanced number the sum of first half of digits is equal to the second half.
Examples:
Input n = 13722 Output tf is true
because 1 + 3 = 2 + 2.
Input n = 23567414 Output tf = true
All palindrome numbers are balanced.
This is partly from Project Euler, Problem 217.
Solution Stats
Problem Comments
-
1 Comment
there is a problem with the test.
it does not accept the following code:
s1=[]
s2=[]
l=length(s)
if mod(l,2)~= 0
for i = 1:ceil(length(s)/2)-1
s1 = [s1,str2double(s(i))]
end
for i = ceil(length(s)/2)+1:l
s2=[s2,str2double(s(i))]
end
else
for i = 1:ceil(length(s)/2)
s1 = [s1,str2double(s(i))]
end
for i = ceil(length(s)/2)+1:l
s2=[s2,str2double(s(i))]
end
end
if sum(s1)==sum(s2)
tf = 1
else
tf = 0
end
Solution Comments
Show commentsProblem Recent Solvers2971
Suggested Problems
-
7276 Solvers
-
1618 Solvers
-
Project Euler: Problem 7, Nth prime
1409 Solvers
-
Getting the indices from a vector
9299 Solvers
-
13889 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!