解決済み


Take it out
Consider the integer number sequence N (1 to infinity). After each iteration, take out the (k+1)th elements; where k is the n...

6年以上 前

解決済み


Takuzu row
Takuzu row is one row in a logic puzzle of a rectangular grid. The rules are as follows: (1) The row is filled with 1s and 0s...

6年以上 前

解決済み


Lost days
Given two dates in a particular format, calculate the difference between them.

6年以上 前

解決済み


Connect Four - 01
Connect four is a two player board game. <https://en.wikipedia.org/wiki/Connect_Four> Given a complete connect-four board,...

6年以上 前

解決済み


Sum! Sum! Sum!
Calculate the sum of the sequence up to nth term >> a,aa,aaa,aaaa,... 2,22,222,2222,... [for a=2]

6年以上 前

解決済み


Be happy
check whether the given number is happy in b-base. * A happy number can be defined as a number which will yield 1 when it is ...

6年以上 前

解決済み


Grazing-01
A cow is tied to an outside corner of a rectangular barn of size (a,b) with a rope of length l. What is the maximum area the cow...

6年以上 前

解決済み


dễ dàng
cho 2 số. tính tích của chúng

6年以上 前

解決済み


Determine whether a given point is inside or outside a polygon
A closed polygon may be described by an N x 2 array of nodes, where the last node and the first node are the same. Each row of ...

6年以上 前

解決済み


Find the centre of an arc and its radius
Given two points on an arc (x0,y0) and (x1,y1) and the angle between them, alpha. Return the centre of the circle and the rad...

6年以上 前

解決済み


Tribonacci Sequence
Generate the tribonacci sequence upto n

6年以上 前

解決済み


How many ways?
Create a program to determine in how many ways can a regular n-gon be divided into n-2 triangles?

6年以上 前

解決済み


Get the value 100
Knowing that 123-45-67+89=100, write a function that gives this result for any order of the digits in the input. Otherwise, the ...

6年以上 前

解決済み


Sieve of Eratosthenes - 02
"Sift the Two's and Sift the Three's, The Sieve of Eratosthenes. When the multiples sublime, The numbers that remain a...

6年以上 前

解決済み


Sky full of stars - 03
draw the following pattern with asterisks. For example, for n=6 '************' '***** *****' '**** ****' ...

6年以上 前

解決済み


Sky full of stars - 02
draw an isosceles triangle with asterisks of size n. For example, for n=6 ' * ' ' *** ' ' **...

6年以上 前

解決済み


Sky full of stars - 01
Draw a right triangle with asterisks of size n. For example, for n=5 '* ' '** ' '*** ' '**** ' ...

6年以上 前

解決済み


Do they touch?
The center and radius of two circles are given. Determine whether they touch.

6年以上 前

解決済み


Count the days
Count the occurrence of a particular day (e.g. Monday) in a given year.

6年以上 前

解決済み


Pell numbers
Find the nth pell number <https://en.wikipedia.org/wiki/Pell_number>

6年以上 前

解決済み


Orthogonal lines
Check whether two given lines are orthogonal or not. Two lines are orthogonal if they create a right angle at their intersect...

6年以上 前

解決済み


XOR fibonacci
a & b are the first two terms in the xor fibonacci sequence. Find the nth term of that sequence. XOR fib sequence is that in ...

6年以上 前

解決済み


Exponentiation
Given 3 integers b,e,k; find -- mod(b^e,k)

6年以上 前

解決済み


Sum of series
a(n) = n^2 - (n-1)^2 find the summation of the series upto n i.e. a(1)+a(2)+...+a(n)

6年以上 前

解決済み


Calculating large fibonacci numbers
The fibonacci sequence starts 1,1,2,3,5,8... Find the the n'th fibonacci number. Then calculate round(log10( . )) of that n't...

6年以上 前

解決済み


lucky
check whether n is a lucky number <https://oeis.org/A000959>

6年以上 前

解決済み


Ugly numbers - 03
For this case, a number is defined ugly if it has prime factors consisting of only elements of x. Find the nth ugly number. ...

6年以上 前

解決済み


Ugly numbers - 01
Ugly numbers are those whose prime factors are 2, 3 or 5. find the nth ugly number.

6年以上 前

解決済み


Ugly numbers - 02
Ugly numbers are those whose prime factors are 2, 3 or 5. find the nth ugly number. n.b. unlike the previous problem,trivi...

6年以上 前

解決済み


Area-07
This is a follow up of the problem <https://www.mathworks.com/matlabcentral/cody/problems/45341-area-06> in this case, fi...

6年以上 前

さらに読み込む