Feeds
문제를 풀었습니다
Binary numbers
Given a positive, scalar integer n, create a (2^n)-by-n double-precision matrix containing the binary numbers from 0 through 2^n...
대략 2년 전
문제를 풀었습니다
There are 10 types of people in the world
Those who know binary, and those who don't. The number 2015 is a palindrome in binary (11111011111 to be exact) Given a year...
대략 2년 전
문제를 풀었습니다
Find the longest sequence of 1's in a binary sequence.
Given a string such as s = '011110010000000100010111' find the length of the longest string of consecutive 1's. In this examp...
대략 2년 전
문제를 풀었습니다
Find longest run
Write a function longest_run that takes as input an array of 0's and 1's and outputs the length and index of the longest consecu...
대략 2년 전
문제를 풀었습니다
Bit Reversal
Given an unsigned integer _x_, convert it to binary with _n_ bits, reverse the order of the bits, and convert it back to an inte...
대략 2년 전
문제를 풀었습니다
Given an unsigned integer x, find the largest y by rearranging the bits in x
Given an unsigned integer x, find the largest y by rearranging the bits in x. Example: Input x = 10 Output y is 12 ...
대략 2년 전
문제를 풀었습니다
Convert binary numbers to hexadecimal numbers
Function must convert the input vector x composed of 0 and 1 (length is a multiple of 8) in hexadecimal. Most significant bit is...
대략 2년 전
문제를 풀었습니다
Find out sum and carry of Binary adder
Find out sum and carry of a binary adder if previous carry is given with two bits (x and y) for addition. Examples Previo...
대략 2년 전
문제를 풀었습니다
Binary code (array)
Write a function which calculates the binary code of a number 'n' and gives the result as an array(vector). Example: Inpu...
대략 2년 전
문제를 풀었습니다
Relative ratio of "1" in binary number
Input(n) is positive integer number Output(r) is (number of "1" in binary input) / (number of bits). Example: * n=0; r=...
대략 2년 전
문제를 풀었습니다
Convert given decimal number to binary number.
Convert given decimal number to binary number. Example x=10, then answer must be 1010.
대략 2년 전
문제를 풀었습니다
Converting binary to decimals
Convert binary to decimals. Example: 010111 = 23. 110000 = 48.
대략 2년 전
문제를 풀었습니다
Binary
Given a positive, integer n, create a function that returns the respective binary number in the form of a vector. Example: ...
대략 2년 전
문제를 풀었습니다
Convert binary numbers array into array of decimal numbers.
Convert binary numbers array into array of decimal numbers. Example x=[ 11001000 ; 11001001 ; 11001010 ; 11001011 ; 11001100 ;...
대략 2년 전
문제를 풀었습니다
Flip the bit
Given an input character string (e.g. '1001'), return a character string with the bits flipped ('0110').
대략 2년 전
문제를 풀었습니다
Integer Sequence - II : New Fibonacci
Crack the following Integer Sequence. (Hints : It has been obtained from original Fibonacci Sequence and all the terms are also ...
대략 2년 전
문제를 풀었습니다
Return fibonacci sequence do not use loop and condition
Calculate the nth Fibonacci number. Given n, return f where f = fib(n) and f(1) = 1, f(2) = 1, f(3) = 2, ... Examples: ...
대략 2년 전
문제를 풀었습니다
Return fibonacci sequence do not use loop and condition version 2
Calculate the nth Fibonacci number,return sequence Given n, return f where f = fib(n) and f(1) = 1, f(2) = 1, f(3) = 2, ... ...
대략 2년 전
문제를 풀었습니다
Find the next Fibonacci number
In the sequence of Fibonacci numbers, every number is the sum of the two preceding ones: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55...
대략 2년 전
문제를 풀었습니다
Return the Fibonacci Sequence
Write a code which returns the Fibonacci Sequence such that the largest value in the sequence is less than the input integer N. ...
대략 2년 전
문제를 풀었습니다
Get a Fibonacci number's index.
*N.B.* For the purpose of this exercise, the first Fibonacci number is 1, and the second is 2; that is, |fib(1) = 1| and |fib(2)...
대략 2년 전
문제를 풀었습니다
Compute Fibonacci Number
Compute the n-th Fibonacci Number f(0) = 0, f(1) = 1, f(2) = 1, f(3) = 2, ... f(42) = 267914296
대략 2년 전
문제를 풀었습니다
Create the following sequence : 0 1 1 4 9 25 64 169 ...
The sequence 0, 1, 1, 4, 9, 25, 64, 169, ... represents the square of the sequence of Fibonacci numbers. Let n repres...
대략 2년 전
문제를 풀었습니다
Prime factor digits
Consider the following number system. Calculate the prime factorization for each number n, then represent the prime factors in a...
대략 2년 전
문제를 풀었습니다
Smith numbers
Return true if the input is a Smith number in base ten. Otherwise, return false. Read about Smith numbers at http://en.wikipedia...
대략 2년 전
문제를 풀었습니다
Numbers with prime factors 2, 3 and 5.
Make a function which takes one positive integer n and returns a matrix with the numbers of the form (2^i)*(3^j)*(5^k) which are...
대략 2년 전
문제를 풀었습니다
Proper Factors
Generate the proper factors of input integer x and return them in ascending order. For more information on proper factors, refer...
대략 2년 전
문제를 풀었습니다
Multiples of a Number in a Given Range
Given an integer factor _f_ and a range defined by _xlow_ and _xhigh_ inclusive, return a vector of the multiples of _f_ that fa...
대략 2년 전
문제를 풀었습니다
Factorize THIS, buddy
List the prime factors for the input number, in decreasing order. List each factor only once, even if the factorization includes...
대략 2년 전
