解決済み

Easy Sequences 8: Triangles with integer sides and prime perimeters

The triangle below is special. It has integer sides and a prime perimeter. Given an integer "n" we want to know how many t...

約2ヶ月 前

解決済み

Easy Sequences 4: Eliminate the Days of Confusion

If a date is written in purely numeric format some dates can be confusing, if we don't know the date format used. For example, "...

約2ヶ月 前

解決済み

Spherical surface triangulation

Create a triangulation of a spherical surface with approximately-uniform coverage http://www.alfnie.com/software/print_sphere...

約2ヶ月 前

解決済み

Reduce the logic

We have three logical input, x,y and z. The output is: y = ((x&y)|z)&((z|x&y)|(z&y|x))|((x&z)|z)&((y|x&z)|(z&x|y))|(x|y|z) ...

約2ヶ月 前

解決済み

How many complete pizzas (number 2)

x is a vector with numbers of pizza slices. A corresponding vector n indicates in how many slices the pizza slices of x were cut...

約2ヶ月 前

解決済み

make histogram

You probably know the function hist(x,n) to get the histogram. Now try to write the function yourself! For the cheaters wanting...

約2ヶ月 前

解決済み

Connect 4 (the boardgame)

You are playing the popular game "Connect 4" ( <https://en.wikipedia.org/wiki/Connect_Four>) against Matlab. Luckily, Matlab isn...

約2ヶ月 前

解決済み

Connect Four: find winning move

Inspired by <http://www.mathworks.com/matlabcentral/cody/problems/90-connect-four-win-checker this problem>... <http://en.wik...

約2ヶ月 前

解決済み

Rumis Scorer 4

This problem is very similar to <https://www.mathworks.com/matlabcentral/cody/problems/3101-rumis-scorer-3 Rumis Scorer 3>. The ...

約2ヶ月 前

解決済み

Rumis Scorer 2

<http://en.wikipedia.org/wiki/Rumis Rumis> is a multiplayer 3D block board game where the goal is to have the most squares visib...

約2ヶ月 前

解決済み

Rumis Scorer 3

<http://en.wikipedia.org/wiki/Rumis Rumis> is a multiplayer 3D block board game where the goal is to have the most squares visib...

約2ヶ月 前

解決済み

Rumis Scorer 1

<http://en.wikipedia.org/wiki/Rumis Rumis> is a multiplayer 3D block board game where the goal is to have the most squares visib...

約2ヶ月 前

解決済み

Mastermind V: Optimal Solver - average number of guesses

The following description contains a copy of Richard Zapor's <https://www.mathworks.com/matlabcentral/cody/problems/44239-master...

2ヶ月 前

解決済み

Mastermind IV: Optimal Solver - max of 5 guesses

<https://en.wikipedia.org/wiki/Mastermind_(board_game) Mastermind> is a code breaking logic puzzle. A pattern of 6 colors(values...

2ヶ月 前

解決済み

Mastermind III: Solve in 1

<https://en.wikipedia.org/wiki/Mastermind_(board_game) Mastermind> is a code breaking logic puzzle. A pattern of 6 colors(values...

2ヶ月 前

解決済み

Mastermind II: Solve in 8 or less

<https://en.wikipedia.org/wiki/Mastermind_(board_game) Mastermind> is a code breaking logic puzzle. A pattern of 6 colors(values...

2ヶ月 前

解決済み

Mastermind I: Solve all 1296 cases

<https://en.wikipedia.org/wiki/Mastermind_(board_game) Mastermind> is a code breaking logic puzzle. A pattern of 6 colors(values...

2ヶ月 前

解決済み

Mastermind

We are playing the boardgame mastermind <https://en.wikipedia.org/wiki/Mastermind_(board_game)>. The game master has created a 4...

2ヶ月 前

解決済み

Check capital letters

Check if each first letter of a string is a capital letter. for example: 'This Is Ok' gives a true answer and 'This Is not Ok' ...

2ヶ月 前

解決済み

Determine the Result of a Move in Reversi

Note: This is closely related to <http://www.mathworks.com/matlabcentral/cody/problems/2538-find-the-next-legal-move-in-reversi ...

2ヶ月 前

解決済み

Find the Next Legal Move in Reversi

<http://en.wikipedia.org/wiki/Reversi Reversi>, also known as Othello, is a game in which reversible white/black chips are place...

2ヶ月 前

解決済み

Give a matrix that matches itself when rotated

Given n and s, return a n-by-n matrix a of integers such that sum(sum(a == rot90(a))) is equal to exactly s. The integer...

2ヶ月 前

解決済み

Spot the rectangle

This problem is related to the <http://bit-player.org/2009/the-17x17-challenge 17x17 challenge>. Given a matrix filled with ones...

2ヶ月 前

解決済み

Dealfun (1.0)

*Short description.* Write a function _dealfun_: [y1,y2,...,yn]=dealfun(fhandle,x1,x2,...,xn) which evaluates the f...

3ヶ月 前

解決済み

Get to a number faster.

If you start with $1 and, with each move, you can either double your money or add another $1, what is the smallest number of mov...

3ヶ月 前

解決済み

Find the nth composite number.

Everyone heard about the nth prime number. Let's try to find out the nth composite. For example , 1 is the first composite, 10 i...

3ヶ月 前

解決済み

Seemingly impossible problem

This is a _seemingly_ 'impossible' problem, because variously your function, "impossibleFn", must return an output of either 1 o...

3ヶ月 前

解決済み

Anyone for tennis? Your chances of winning a tie-break game

Imagine you are playing tennis and the score has reached 'six games all' in a Tie-break Set, so therefore the next game shall be...

3ヶ月 前

解決済み

Anyone for tennis? Your chances of winning a (standard) game

Imagine you are playing tennis, and for _each point_ played your chance of winning is |x| % (input as a |<https://au.mathworks.c...

3ヶ月 前