@@ -0,0 +1,1257 @@
+/*%0A * Copyright (C) 2014 Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A *%0A * Licensed under the Apache License, Version 2.0 (the %22License%22);%0A * you may not use this file except in compliance with the License.%0A * You may obtain a copy of the License at%0A *%0A * http://www.apache.org/licenses/LICENSE-2.0%0A *%0A * Unless required by applicable law or agreed to in writing, software%0A * distributed under the License is distributed on an %22AS IS%22 BASIS,%0A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.%0A * See the License for the specific language governing permissions and%0A * limitations under the License.%0A */%0Apackage com.github.pedrovgs.problem67;%0A%0A/**%0A * You are given two 32-bit numbers,N and M, and two bit positions, i and j. Write a method to%0A * insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j%0A * through i have enough space to fit all of M. That is,if M= 10011, you can assume that there are%0A * at least 5 bits between j and i. You would not, for example, have j-3 and i=2, because M could%0A * not fully fit between bit 3 and bit 2.%0A *%0A * EXAMPLE:%0A *%0A * Input:N=16000000000, M=10011, i =2, j =6 Output: N = 10001001100%0A *%0A * @author Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A */%0Apublic class MergeBinaryNumbers %7B%0A%0A%7D%0A

Add statement to problem 67