# One zero, two zeros(CodeEval)

2進数変換して、0の数を数える問題。少し凝った内容。
マネーロンダリングする悪のネットワークを見つけたとか、問題文はすごい方向へ向かっている。

## CHALLENGE DESCRIPTION:

Our agent uncovered a global criminal money-laundering network that used offshore companies to defraud international organizations of total \$1,000,000,000! The agent changes his location each hour, but he manages to send us the code that we need to decipher. Deciphering code includes many stages, and you are taking part in one of them. Therefore, your task is the following: you have two numbers – the first one is the number of zeros in a binary code and the second one shows the range from 1 to this number, where you have to find these zeros. For example, for the given numbers 2 and 4, you convert all numbers from 1 to 4 inclusive into the binary system. As a result, you get 1, 10, 11, and 100. As the first given number is 2, this means that we are looking for numbers with two zeros, so only 100 suits us. Hence, the result will be 1: there is only one number with two zeros.

## INPUT SAMPLE:

The first argument is a path to a file. Each line includes a test case with two numbers: the first one is the number of zeros in a binary code that we need to find and the second one is the range from 1 to this number where you have to find these zeros.

```1 8
2 4```

## OUTPUT SAMPLE:

Print the total number of numerals that contain the needed amount of zeros in a binary system.

```3
1```

## CONSTRAINTS:

1. Range can be from 5 to 1000.
2. Number of zeros does not exceed the length of binary code number.
3. The number of test cases is 40.

## My Code

```#!/usr/bin/env ruby -w

def binary_zero_count(number, max_decimal)
bins = (1..max_decimal).map { |n| n.to_s(2) }
bins.find_all { |b| b.scan("0").size == number }.size
end

ARGF.each_line do |line|
number, max_decimal = line.chomp.split.map(&:to_i)
puts binary_zero_count(number, max_decimal)
end
```