Task descriptionWrite a function:int solution(int A[], int N);that, given a non-empty zero-indexed array A of N integers, returns the minimal positive integer that does not occur in A.For example, giv
Task descriptionYou are given N counters, initially set to 0, and you have two possible operations on them:increase(X) counter X is increased by 1,max counter all counters are set to the m
Task descriptionA small frog wants to get to the other side of a river. The frog is currently located at position 0, and wants to get to position X. Leaves fall from a tree onto the surface of the riv
Task descriptionA non-empty zero-indexed array A consisting of N integers is given.A permutation is a sequence containing each element from 1 to N once, and only once.For example, array A such that:&n
Task descriptionA zero-indexed array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing.Your goal is
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
