Gelöst

Draw a 'Z'.
Given _n_ as input, generate a n-by-n matrix like 'Z' by _0_ and _1_ . Example: n=5 ans= [1 1 1 1 1 0 0 0 1 ...

fast 4 Jahre vor

Gelöst

Draw a 'X'!
Given n as input Draw a 'X' in a n-by-n matrix. example: n=3 y=[1 0 1 0 1 0 1 0 1] n=4 y=[1 0 0...

fast 4 Jahre vor

Gelöst

Draw 'O' !
Given n as input, generate a n-by-n matrix 'O' using 0 and 1 . example: n=4 ans= [1 1 1 1 1 0 0 1 ...

fast 4 Jahre vor

Gelöst

Draw a 'N'!
Given n as input, generate a n-by-n matrix 'N' using 0 and 1 . Example: n=5 ans= [1 0 0 0 1 1 1 0 0 1 1 0 ...

fast 4 Jahre vor

Gelöst

Draw 'J'
Given n as input, generate a n-by-n matrix 'J' using 0 and 1 . Example: n=5 ans= [0 0 0 0 1 0 0 0 0 1 0 0 ...

fast 4 Jahre vor

Gelöst

Draw 'I'
Given n as input, draw a n-by-n matrix 'I' using 0 and 1. example: n=3 ans= [0 1 0 0 1 0 0 1 0] n=...

fast 4 Jahre vor

Gelöst

Draw 'H'
Draw a x-by-x matrix 'H' using 1 and 0. (x is odd and bigger than 2) Example: x=5 ans= [1 0 0 0 1 1 0 0 0 1 ...

fast 4 Jahre vor

Gelöst

Draw 'F'
Draw a x-by-x matrix 'F' using 1 and 0. (x is odd and bigger than 4) Example: x=5 ans= [1 1 1 1 1 1 0 0 0 0 ...

fast 4 Jahre vor

Gelöst

Draw 'E'
Draw a x-by-x matrix 'E' using 1 and 0. (x is odd and bigger than 4) Example: x=5 ans= [1 1 1 1 1 1 0 0 0 0 ...

fast 4 Jahre vor

Gelöst

Draw 'D'.
Draw a x-by-x matrix 'D' using 0 and 1. example: x=4 ans= [1 1 1 0 1 0 0 1 1 0 0 1 1 1 1 0]

fast 4 Jahre vor

Gelöst

Draw 'C'.
Given x as input, generate a x-by-x matrix 'C' using 0 and 1. example: x=4 ans= [0 1 1 1 1 0 0 0 ...

fast 4 Jahre vor

Gelöst

Draw 'B'
Draw a x-by-x matrix 'B' using 1 and 0. (x is odd and bigger than 4) Example: x=5 ans= [1 1 1 1 0 1 0 0 0 1 ...

fast 4 Jahre vor

Gelöst

Smith numbers
Return true if the input is a Smith number in base ten. Otherwise, return false. Read about Smith numbers at <http://en.wikipedi...

fast 4 Jahre vor

Gelöst

Factorize THIS, buddy
List the prime factors for the input number, in decreasing order. List each factor only once, even if the factorization includes...

fast 4 Jahre vor

Gelöst

Get all prime factors
List the prime factors for the input number, in decreasing order. List each factor. If the prime factor occurs twice, list it as...

fast 4 Jahre vor

Gelöst

Rotate Matrix @180 degree
Rotate Matrix @180 degree Example A=[8 1 6; 3 5 7; 4 9 2], then answer would be [2 9 4;...

fast 4 Jahre vor

Gelöst

Converts numbers into characters
Converts numbers into characters

fast 4 Jahre vor

Gelöst

Find the max element of the array
Find the max element of the array

fast 4 Jahre vor

Gelöst

Square root
Given x (a matrix), give back another matrix, where all the elements are the square roots of x's elements.

fast 4 Jahre vor

Gelöst

Calculate the average value of the elements in the array
Calculate the average value of the elements in the array

fast 4 Jahre vor

Gelöst

to the 2 all elements
to the 2 all elements

fast 4 Jahre vor

Gelöst

the average value of the elements
Calculate the average value of the elements in the array

fast 4 Jahre vor

Gelöst

Double all elements in the array
Duplicate all elements in the array

fast 4 Jahre vor

Gelöst

calculate the length of matrix
input 1 array, calculate the length

fast 4 Jahre vor

Gelöst

Draw a '0' in a one matrix!

fast 4 Jahre vor

Gelöst

Symmetry of vector
Determine whether the vector is symmetric or not (vector could be even or odd in length). For example: x = [1 2 3 3 2 1] ...

fast 4 Jahre vor

Gelöst

Project Euler: Problem 6, Natural numbers, squares and sums.
The sum of the squares of the first ten natural numbers is, 1^2 + 2^2 + ... + 10^2 = 385 The square of the sum of the first ...

fast 4 Jahre vor

Gelöst

Project Euler: Problem 10, Sum of Primes
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below the input, N. Thank you <http:/...

fast 4 Jahre vor

Gelöst

Number of Even Elements in Fibonacci Sequence
Find how many even Fibonacci numbers are available in the first d numbers. Consider the following first 14 numbers 1 1 2...

fast 4 Jahre vor

Gelöst

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...

fast 4 Jahre vor