Pagini recente » preONI 2008, Clasament Runda Finala, Clasa a 9-a | Sandbox | Diferente pentru probleme-de-acoperire-1 intre reviziile 48 si 47 | Diferente pentru utilizator/fluture.godlike intre reviziile 21 si 20 | Diferente pentru blog/heaps-shortlist intre reviziile 1 si 2
Nu exista diferente intre titluri.
Diferente intre continut:
4. Given an array of n numbers, describe an efficient algorithm that prints out the smallest k numbers in the array.
5. A Young Tableau is a matrix where elements on each row or column appear in increasing order. Given a Young Tableau A, describe an efficient algorithm that returns the kth element of A.
6. Given a min heap A, give an efficient algorithm that outputs its kth smallest element.
7. Print out the first k numbers of the type 2^i * 3^j.
7. Print out the first k numbers of the type 2^i^ * 3^j^.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
