IT

Cerinta completa Dothraki are planning an attack to usurp King Robert’s throne. King Robert learns of this conspiracy from Raven and plans to lock the single door through which the enemy can enter his kingdom. But, to lock the door

Cerinta completa A company needs random numbers for its operation. random numbers have been generated using numbers as seeds and the following recurrence formula: The numbers used as seeds are . is the term of the recurrence. Due to a

Cerinta completa Alef the Frog is in an two-dimensional maze represented as a table. The maze has the following characteristics: Each cell can be free or can contain an obstacle, an exit, or a mine. Any two cells in the

Cerinta completa We define a magic square to be an matrix of distinct positive integers from to where the sum of any row, column, or diagonal of length is always equal to the same number: the magic constant. You will

Cerinta completa The median of a list of numbers is essentially its middle element after sorting. The same number of elements occur after it as before. Given a list of numbers with an odd number of elements, find the median?

Cerinta completa Sean invented a game involving a matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the

Cerinta completa Flatland is a country with a number of cities, some of which have space stations. Cities are numbered consecutively and each has a road of length connecting it to the next city. It is not a circular route,

Cerinta completa Implement a modified Fibonacci sequence using the following definition: Given terms and where , term is computed as: Given three integers, , , and , compute and print the term of a modified Fibonacci sequence. Example Return .

Cerinta completa An integer is a divisor of an integer if the remainder of . Given an integer, for each digit that makes up the integer determine whether it is a divisor. Count the number of divisors occurring within the

Cerinta completa You are given a tree that has N vertices and N-1 edges. Your task is to mark as small number of vertices as possible, such that, the maximum distance between two unmarked vertices is less than or equal