![]() |
|
|
|
Thread Tools | Display Modes |
|
|
|
|
#1 |
|
Newbie
Join Date: Jul 2007
Posts: 3
Rep Power: 0
![]() |
can anyone help me how to solve this problem...
The cost of a long distance call is based on the destination; the time of day the call was made, as well as the duration of the call. The rates are as follows: America Region Asian Region African Region Europe Region DAYTIME 50 every 3 minutes 30 every 2 minutes 40 every 3 minutes 35 every 2 minutes NIGHTTIME 45 every 3 minutes 27 every 2 minutes 36 every 3 minutes 30 every 2 minutes it is using a switch statement. Last edited by mae67; Jul 31st, 2007 at 7:38 PM. Reason: the problem is not complete. |
|
|
|
| Bookmarks |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
| Thread Tools | |
| Display Modes | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| <td> height problem | grimpirate | HTML / XHTML / CSS | 19 | May 4th, 2007 6:01 AM |
| Storing BLOBs in a database - problem | jonyzz | Other Programming Languages | 8 | Jan 31st, 2007 4:38 AM |
| cgi/perl script + IE problem | joyceshee | Perl | 2 | Jan 24th, 2006 11:10 AM |
| help with recursion problem | the_new_guy_in_town | Java | 3 | Apr 7th, 2005 3:04 AM |