문제를 풀었습니다

3년 초과 전

문제

Chain multiplication - 05
Following up on the problem in 55305, you found the optimal way of multiplying a chain of matrices. In problem 55315, you had t...

3년 초과 전 | 0 | 솔버 수: 3

문제를 풀었습니다

Find the slope of a line that passes through two vectors
Given two vectors p1 and p2, return the slope of a line that passes through p1 and p2. Examples: Input [p1,p2] = deal([0,1],[...

3년 초과 전

문제를 풀었습니다

Remove Upper Case Letters
Example Matlab --> atlab proBlem --> prolem Enter --> nter

3년 초과 전

문제를 풀었습니다

Sum of 2 numbers in array
Given an array and a target sum, return true if any 2 numbers in the array sum up to the given target sum. Both numbers cannot h...

3년 초과 전

문제를 풀었습니다

Simulate one complete step in the Biham–Middleton–Levine traffic model
The <http://en.wikipedia.org/wiki/Biham%E2%80%93Middleton%E2%80%93Levine_traffic_model Biham–Middleton–Levine traffic model> is ...

3년 초과 전

문제를 풀었습니다

Data Regularization
Provided is an m-by-n integer data matrix A whose elements are drawn arbitrarily from a set *S* = [1,2,3,...,S] for any large in...

3년 초과 전

문제를 풀었습니다

Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock.
Submit your answer to this problem a multiple of 5 seconds after the hour. Your answer is irrelevant; the only thing that matte...

3년 초과 전

문제를 풀었습니다

Generalised Hamming Number
Inspired by Project Euler n°204 and Problem 1308 by James A generalised Hamming number of type n, has no prime factor larger ...

3년 초과 전

문제를 풀었습니다

Give me Hamming on five, hold the mayo
A Hamming Number is a positive number that has no prime factor greater than 5. Given a number X, determine how many Hamming num...

3년 초과 전

문제를 풀었습니다

Nth roots of unity
First, find the n nth roots of unity. eg if n = 6, find the n distinct (complex) numbers such that n^6 = 1. <https://en.wiki...

3년 초과 전

문제를 풀었습니다

Polar Form Complex Number Entry
Write a function that takes the magnitude and angle(in degrees) of a complex number and returns a complex variable. Positive ang...

3년 초과 전

문제를 풀었습니다

Easy Sequences 10: Sum of Cumsums of Fibonacci Sequence
The function F(n) is defined as the set of Fibonacci numbers from the first up to the n-th. S(n) is the result of applying to F,...

3년 초과 전

문제를 풀었습니다

Find all prime factors of the input
Given an input x, find its all prime factors. Return the vector with all factors in ascending order. Efficiency is the key here...

3년 초과 전

문제를 풀었습니다

Sequence
Let S be a sequence of numbers Let Find for some , where and .

3년 초과 전

문제를 풀었습니다

Summy's odd sum

3년 초과 전

문제를 풀었습니다

Summy's even sum

3년 초과 전

문제를 풀었습니다

Check if a matrix Diagonal is equal to its secondary diagonal
Your function should return True if the secondary diagonal is equal to diagonal, and False otherwise. Eg: M = [1 2 1 ...

3년 초과 전

문제를 풀었습니다

Total resistance of resistors in parallel
What is the total resistance of a number of resistors in parallel? A vector R contains the resistances (in Ohm) of n resistors,...

3년 초과 전

문제를 풀었습니다

Add the number of horizontal and vertical movements to each matrix element
Given n, create a square matrix and with element (1,1) = 1, add 1 to each element for each horitizonal and vertical movement. E...

3년 초과 전

문제를 풀었습니다

Exhaust all possible logical vectors
Input a length argument and list all possible logical vectors of that length. My solution is of size 29. Can you find an even s...

3년 초과 전

문제를 풀었습니다

Area of the yellow shaded region

3년 초과 전

문제를 풀었습니다

Momentum Calculation
A shopping cart of mass 'm1' is traveling with velocity 'u' and collides with a second shopping cart of mass 'm2.' The two shopp...

3년 초과 전

문제를 풀었습니다

Wrap a vector, but insert NaN's at the wrap-positions.
When you plot a line that wraps, and do not want the sawtooth shape to show up in the plot, you can either draw all separate lin...

3년 초과 전

문제

Chain multiplication - 04
Following up on the problem in 55305, you found the optimal way to multiply a chain of matrices. However, here in this problem,...

3년 초과 전 | 2 | 솔버 수: 4

문제를 풀었습니다

Chain multiplication - 03
Following up the problem in 55305, you found the minimum number of multiplications needed to multiply a chain of matrices. In ...

3년 초과 전

문제

Chain multiplication - 03
Following up the problem in 55305, you found the minimum number of multiplications needed to multiply a chain of matrices. In ...

3년 초과 전 | 0 | 솔버 수: 9

문제를 풀었습니다

Chain multiplication - 02
Following up the problem in 55295, you found the number of multiplications needed to multiply two matrices. Now, you are given ...

3년 초과 전

문제

Chain multiplication - 02
Following up the problem in 55295, you found the number of multiplications needed to multiply two matrices. Now, you are given ...

3년 초과 전 | 1 | 솔버 수: 22

문제를 풀었습니다

Sort Non-zeros
Consider 0s in a vector creates a break-point. sort all the sub-arrays created by those break points. For example, a = [3, 4, 1...

3년 초과 전