問題


String Find with Wildcards of a Cell array
Given a cell array of strings and a search string with single character (?) or multiple character (*) wildness return the indice...

約10年 前 | 2 | 15 個のソルバー

解決済み


Approximate e
Given a and n, compute and approximation to f = a * e ^ n, without the use of exp, string operations, or floating point numbers....

約10年 前

解決済み


Sum of Logarithms
Given a vector, v, of real positive numbers, compute the sum, s, of the base-10 logarithms of the elements of v, without the use...

約10年 前

解決済み


GJam 2016 Rd1A: Rank and File (Large)
This Challenge is derived from <http://code.google.com/codejam/contest/4304486/dashboard#s=p1 GJam Rd1A 2016 Rank and File>. Thi...

約10年 前

問題


GJam 2016 Rd1A: Rank and File (Large)
This Challenge is derived from <http://code.google.com/codejam/contest/4304486/dashboard#s=p1 GJam Rd1A 2016 Rank and File>. Thi...

約10年 前 | 1 | 11 個のソルバー

解決済み


GJam 2016 Rd1A: Rank and File (small)
This Challenge is derived from <http://code.google.com/codejam/contest/4304486/dashboard#s=p1 GJam Rd1A 2016 Rank and File>. Thi...

約10年 前

問題


GJam 2016 Rd1A: Rank and File (small)
This Challenge is derived from <http://code.google.com/codejam/contest/4304486/dashboard#s=p1 GJam Rd1A 2016 Rank and File>. Thi...

約10年 前 | 0 | 11 個のソルバー

解決済み


How many ways to write
How many ways to write a positive integer x as the sum of n numbers , where , x>n and no n number is less than -2.

約10年 前

解決済み


Number of divisors of a given number
Given a Number n, return the number of his divisors without listing them example: n=14 ; Divisors={1,7,2,14} ; y=4 n=...

約10年 前

解決済み


Rearrange string
Input is a given string. Output is the number of ways to rearrange the string.

約10年 前

解決済み


Column arrays: Transpose a row array
* Construct a row array countValues with elements 1 to endValue, using the colon operator. * Transpose countValues to result in...

約10年 前

解決済み


Variable sized row arrays
* Reverse the contents of row array mileMarkers

約10年 前

解決済み


Array resizing: Removing elements
* Remove elements 2, 4, and 6 from row array pendingTasks

約10年 前

解決済み


Integer indexing array: Reverse subsets
Construct an indexing array copySubset so that the statement reversedOrder = origOrder(copySubset); results in a row array begin...

約10年 前

解決済み


Find a subset that divides the vector into equal halves
Given a vector x, return the indices to elements that will sum to exactly half of the sum of all elements. Example: Inpu...

約10年 前

解決済み


N-th Odious
Given index n return n-th <https://oeis.org/A000069 odious number>.

約10年 前

解決済み


Is this number Munchhausen Narcissistic?
In this problem, simply return 1 if a supplied number is Munchhausen narcissistic or 0 if not. Example 153 is narcissistic...

約10年 前

解決済み


Armstrong Number
Determine whether the given input n-digit number is Armstrong Number or not. Return True if it is an Armstrong Number. An n-D...

約10年 前

解決済み


Is it an Armstrong number?
An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. Fo...

約10年 前

解決済み


Find the 9's Complement
Find the 9's complement of the given number. An example of how this works is <http://electrical4u.com/9s-complement-and-10s-c...

約10年 前

解決済み


Bell Number calculator
Calculate a vector of Bell numbers for sets up to length n. Bell numbers are the maximum number of partitions of a set. See the ...

約10年 前

解決済み


Evil Number
Check if a given natural number is evil or not. Read more at <https://oeis.org/A001969 OEIS>.

約10年 前

解決済み


Polite numbers. N-th polite number.
A polite number is an integer that sums of at least two consecutive positive integers. For example _7 = 3+4_ so 7 is a polite...

約10年 前

解決済み


Polite numbers. Politeness.
A polite number is an integer that sums of two or more consecutive positive integers. Politeness of a positive integer is a num...

約10年 前

解決済み


Narcissistic number ?
Inspired by Problem 2056 created by Ted. In recreational number theory, a narcissistic number is a number that is the sum of ...

約10年 前

解決済み


Compute Fibonacci Number
Compute the _n_-th Fibonacci Number f(0) = 0, f(1) = 1, f(2) = 1, f(3) = 2, ... f(42) = 267914296

約10年 前

解決済み


Polygonal numbers
The task of <http://www.mathworks.co.uk/matlabcentral/cody/problems/5 Problem 5> is to calculate triangular numbers. By playing ...

約10年 前

解決済み


Find vampire numbers
A <http://en.wikipedia.org/wiki/Vampire_number vampire number> is a number v that is the product of two numbers x and y such th...

約10年 前

解決済み


Spherical Volume
Calculate the volume of a sphere.

約10年 前

解決済み


nth Rational Number
Return the nth rational number. This is the inverse to Problem <http://www.mathworks.com/matlabcentral/cody/problems/1471 1...

約10年 前

さらに読み込む