Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- <script>
- function Solve(args){
- var S = parseInt(args[0]);
- var N = parseInt(args[1]);
- var answer = 0;
- var combinations = N * N;
- var binNumber = "";
- var sum;
- var arr = [N];
- for(var i = 0; i < N; i++){
- arr[i] = parseInt(args[i+2]);
- }
- for(var i = 1; i < combinations; i++){
- binNumber = convertToBinary(i);
- sum = 0;
- for(var j = 0; j < N; j++){
- var bit = binNumber[j];
- if(bit == "1"){
- sum += arr[j];
- }
- }
- if(sum == S){
- answer++;
- }
- }
- return answer;
- function convertToBinary(number){
- var result = "";
- while(number != 0){
- var remainder = number % 2;
- number = parseInt(number / 2);
- result = remainder + result;
- }
- if(result === "") result = "0";
- return result;
- }
- }
- console.log(Solve(0,5,-2,-1,1,2,3));
- </script>
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement