0

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

3
Contributors
3
Replies
4
Views
6 Years
Discussion Span
Last Post by firstPerson
0

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.

0

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...:)

0

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

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.