Problem 74. Balanced number

Created by Cody Team

Solve Later

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.

Solve

Solution Stats

4563 Solutions
2100 Solvers

Last Solution submitted on Jun 04, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

GEORGIOS BEKAS on 25 Jan 2018

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

Satadru Mukherjee on 25 Jun 2019

Simple code:

clc
clear all
close all
x=input('Enter the number');
Y=[];
c=0;
m=x;
while (m>0)
b=rem(m,10);
Y=[b Y];
c=c+1;
m=(m-b)/10;
end
r=c/2;
qw=floor(r);
if(qw==r)
t=0;
l=0;
for i=1:qw
t=t+Y(i);
end
for i=(qw+1):c
l=l+Y(i);
end
if(t==l)
disp('Yes');
else
disp('No');
end
else
t=0;
l=0;
for i=1:qw
t=t+Y(i);
end
for i=(qw+2):c
l=l+Y(i);
end
if(t==l)
disp('Yes');
else
disp('No');
end
end