Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Divide an array into 2 subsets to verify their sum is equal or not.

by BrowserUk (Pope)
on May 02, 2013 at 09:51 UTC ( #1031717=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    #! perl -slw
    use strict;
    ...
    else {
        print "No solution existed for the $N element set @set";
    }
    
  2. or download this
    C:\test>1031699 -N=1e1
    sum( 7 1 ) == sum( 5 3 )
    ...
    Took 0.000238 seconds
    No solution existed for the 1e4 elemet set 60 ...72 43 21 61 24 16
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1031717]
help
Chatterbox?
[stevieb]: thanks choroba for making the world right again by mentioning something as simple as a missing backslash ;)
[beech]: s/a/many a/\

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (6)
As of 2017-07-25 23:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (383 votes). Check out past polls.