Pagini recente » Diferente pentru problema/fbsearch intre reviziile 18 si 17 | Clasament preONI 2006, Clasa a IX-a si gimnaziu | Diferente pentru problema/roata intre reviziile 17 si 15 | Diferente pentru problema/euclid3 intre reviziile 7 si 17 | Diferente pentru blog/binary-search-shortlist intre reviziile 7 si 8
Nu exista diferente intre titluri.
Diferente intre continut:
# Given A, a sorted int array of length n. How many times does the value x occur in A.
# Given a real number x, find out it’s cubic root.
# Given A a sorted array, find out an i such that A[i] == i.
# Given A a sorted array of distinct integers, find out an i such that A[i] == i.
# Given the +,-,*,/,sqrt operations and a real number x find an algorithm to get log2x.
# Given an array A such that A[ 0] > A[ 1] and A[n-1] > A[n-2] find out a local minimum (find out an i such that A[i-1] > A[i] < A[i + 1]).
# Let A be a sorted array with distinct elements. A is rotated k positions to the right (k is unknown). Find out k.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
