Created
December 26, 2014 21:29
-
-
Save gleba/bbac97ed8ea784cf14e1 to your computer and use it in GitHub Desktop.
Напишите функцию, которая из входящего массива целых чисел выберет все возможные сочетания чисел, сумма которых будет равняться заданному числу. Входящий массив содержит не больше 20 чисел.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //f([1,3,5], 4) | |
| //f([1,2,5,2], 4) | |
| //f([1,2,3,4,5,6,7,8,9,10,11], 10); | |
| //f([9,3,1,4,7,6,5,8,2,19,11], 10); | |
| //f([1,2,3,4,5,6,7,8,9,10,11,12,14], 30); | |
| var k:int = 20; | |
| var va:Array = []; | |
| while(k--){ | |
| va.push(int(Math.random()*20)); | |
| } | |
| var t:int = getTimer(); | |
| trace(va); | |
| //trace(f2(va, 20)); | |
| var out:Array =[]; | |
| for (var i:int = 0; i < source.length; i++) { | |
| var o:Object = f2(i,va,20); | |
| if (o) { | |
| out.push(o); | |
| } | |
| } | |
| trace(getTimer()-t); | |
| stop(); | |
| function f2(j:int;source:Array,v:int) { | |
| var m:int = 0; | |
| var g:int = 0; | |
| return f2(out; | |
| } | |
| function f(source:Array,v:int) { | |
| var m:int = 0; | |
| var g:int = 0; | |
| var limit:int = 1 << source.length; | |
| var out:Array = new Array(); | |
| while (m < limit) { | |
| var sum:int = 0; | |
| var a:Array = new Array(); | |
| for (var i:int = 0; i < source.length; i++) { | |
| if ((m & (1 << i)) != 0) { | |
| a.push(source[i]); | |
| sum += source[i]; | |
| g++; | |
| } | |
| } | |
| if (sum==v){ | |
| a.push(1 << i); | |
| out.push(a.join(":")); | |
| } | |
| m++; | |
| } | |
| return out; | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment