Author: Ionut Paun

Cerinta completa We define the diameter of a strongly-connected oriented graph, , as the minimum integer such that for each there is a path from to of length (recall that a path’s length is its number of edges). Given two

Cerinta completa DNA is a nucleic acid present in the bodies of living things. Each piece of DNA contains a number of genes, some of which are beneficial and increase the DNA’s total health. Each gene has a health value,

Cerinta completa Killgrave wants to use his mind control powers to get money from the Justice League superheroes living in houses in Happy Harbor that are numbered sequentially from to . There are roads, and each road connects two different

Cerinta completa When a contiguous block of text is selected in a PDF viewer, the selection is highlighted with a blue rectangle. In this PDF viewer, each word is highlighted independently. For example: There is a list of character heights

Cerinta completa Let be a connected, directed graph with vertices numbered from to such that any vertex is reachable from vertex . In addition, any two distinct vertices, and , are connected by at most one edge . Consider the

Cerinta completa Marie invented a Time Machine and wants to test it by time-traveling to visit Russia on the Day of the Programmer (the 256th day of the year) during a year in the inclusive range from 1700 to 2700.

Cerinta completa Alex has a board game consisting of: A chip for marking his current location on the board. fields numbered from to . Each position has a value, , denoting the next position for the chip to jump to

Cerinta completa Alice and Bob are playing a game with a rooted tree. The tree has vertices and the first node, , is always the root. Here are the basic rules: They move in alternating turns, and both players always

Cerinta completa Alice gives Bob a board composed of wooden squares and asks him to find the minimum cost of breaking the board back down into its individual squares. To break the board down, Bob must make cuts along its

Cerinta completa There is an undirected tree where each vertex is numbered from to , and each contains a data value. The sum of a tree is the sum of all its nodes’ data values. If an edge is cut,