Im looking for some real c++ programming challenge...please post the most difficult you have encountered yourself....thanks in advance....
IndianaRonaldo
-3
Light Poster
Recommended Answers
Jump to PostRead 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 …
All 3 Replies
drkybelk
0
Junior Poster in Training
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.
IndianaRonaldo
-3
Light Poster
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...:)
mrnutty
761
Senior Poster
Given a very large large number( for example one with 1024 digits ), find all of its factors in polynomial time.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.