Think of the 8 vertices of a given cube. You are allowed to join three
vertices to form a triangle. How many such unique acute triangles can you make ??
Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
1 - 3 face diagonals forming a triangle
ReplyDeletenumber of such triangles is ??
ReplyDelete8
ReplyDelete