Hello, could someone help me to solve the following problem?
A conversation time consists of N parts. Each of first N-1 parts last for K[i] minutes, the N-th part is considered to be infinite....
CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
Search:Type: Posts; User: lanamelach Search: Search took 0.03 seconds.
Results 1 to 1 of 1
|
Click Here to Expand Forum to Full Width |