fork download
copy 
  1. def f(n):x=map(int,str(n));d=len(x)/2;print sum(x[:d])==sum(x[-d:])or d<1
  2.  
  3. for test in (1, 6, 11, 141, 1221, 23281453796004414, 523428121656666655655556655656502809745249552466339089702361716477983610754966885128041975406005088, 10, 12, 110, 15421, 5234095123508321, 6240911314399072459493765661191058613491863144152352262897351988250431140546660035648795316740212454):
  4. 	print test
  5. 	f(test)
  6. 	print ''
Success #stdin #stdout 0s 9024KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1
True

6
True

11
True

141
True

1221
True

23281453796004414
True

523428121656666655655556655656502809745249552466339089702361716477983610754966885128041975406005088
True

10
False

12
False

110
False

15421
False

5234095123508321
False

6240911314399072459493765661191058613491863144152352262897351988250431140546660035648795316740212454
False
https://ideone.com/I98HFT
language:
Python (cpython 2.7.16)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!