given an positive integer A (1 <= A <= 109), output the lowest bit of A. For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2. Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8.
The Game:
Make the snake grow longer by directing it to the food.
Extra bonus points are given from hearts, eat them as fast as possible as amount of bonus points decreases with time.
Higher level gives more points for the food but will also make it tougher to steer a long snake as speed increaces.
Five different mazes as well as play w/o maze are possible.
DAGON Approach
Object of this exercise:
given a subject graph and a set of pattern graph in canonical representation (2-input
NAND and INV), implement the second step of DAGON approach. (Both the subject
graph and the pattern graphs are trees.)
Returns weighted percentiles of a sample given the weight vector w
％ The idea is to give more emphasis in some examples of data as compared to
％ others by giving more weight. For example, we could give lower weights to
％ the outliers.
％ The motivation to write this function is to compute percentiles for Monte
％ Carlos simulations where some simulations are very bad (in terms of goodness
％ of fit between simulated and actual value) than the others and to give
％ the lower weights based on some goodness of fit criteria.
％ This program calculates Dilution of Precision with respect to a GPS *
％ receiver given its Cartesian ECEF position and the positions of four or *
％ more visible GPS satellites. It is a validation of the DOP algorithm and *
％ contains reference positions for which the DOP results are known. *
遺傳算法和“貨郎擔” 問題:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
Addfilter is a command-line application which adds and removes filter drivers for a given drive or volume. It is intended to demonstrate how to insert a filter driver into the driver stack of a device. The sample illustrates how to do this by using the SetupDi APIs. The sample works on the x86 platform. It has only been tested in a 32-bit environment. Since Addfilter is not a driver, it does not deal with Plug and Play or Power Management.
Software given here is to accompany the textbook: W.H. Tranter,
％ K.S. Shanmugan, T.S. Rappaport, and K.S. Kosbar, Principles of
％ Communication Systems Simulation with Wireless Applications,
％ Prentice Hall PTR, 2004.
中南賽區(qū)ACM競賽題
Description
given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle.
