Im looking for some real c++ programming challenge...please post the most difficult you have encountered yourself....thanks in advance....

Read in from a file pairs of integer. Those N pairs represent 2D-vectors (in an XY- plane). Connect the vectors end-point of one connects to the startpoint of the next. Find the subset of size M<=N vectors that maximises the area this polygon encloses, if such a polygon exists.
The number of vectors N can be very big > Million.

Read in from a file pairs of integer. Those N pairs represent 2D-vectors (in an XY- plane). Connect the vectors end-point of one connects to the startpoint of the next. Find the subset of size M<=N vectors that maximises the area this polygon encloses, if such a polygon exists.
The number of vectors N can be very big > Million.

OK...nw dats really sumthng..:)..thnx...ill try it out...:)

Given a very large large number( for example one with 1024 digits ), find all of its factors in polynomial time.