[問題] 找零錢的問題
開發平台(Platform): (Ex: VC++, GCC, Linux, ...)
額外使用到的函數庫(Library Used): (Ex: OpenGL, ...)
問題(Question):
假設銅板有1元、5元、50元共三種,媽媽請小明去菜市場買水果,給了小明N元
老闆找小明的零錢的數目要最少,而小明到了水果攤買了a1顆蘋果,a2顆柳丁,及a3顆桃子,
1顆蘋果15元,1顆柳丁20元,1顆桃子30元,請問老問需找多少個1元、5元、50元,
其銅板數目最少.
輸入說明:
先輸入媽媽給小明多少錢,N,接著輸入a1, a2, a3 ,在此N, a1, a2, a3為整數,
且a1*15+a2*20+ a3*30小於或等於N。
餵入的資料(Input):
500,1,2,3
預期的正確結果(Expected Output):
0,1,7
錯誤結果(Wrong Output):
自己測試了幾組,感覺都是對的,但試驗證過不了....
程式碼(Code):(請善用置底文網頁, 記得排版)
http://pastie.org/2191070 這是我的程式碼,不知道錯在哪裡
能否幫小弟看看??
補充說明(Supplement):
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.118.79.84
→
07/10 16:00, , 1F
07/10 16:00, 1F
→
07/10 16:03, , 2F
07/10 16:03, 2F
→
07/10 16:03, , 3F
07/10 16:03, 3F
→
07/10 16:08, , 4F
07/10 16:08, 4F
→
07/10 16:09, , 5F
07/10 16:09, 5F
→
07/10 16:10, , 6F
07/10 16:10, 6F
→
07/10 16:10, , 7F
07/10 16:10, 7F
→
07/10 16:10, , 8F
07/10 16:10, 8F
→
07/10 16:20, , 9F
07/10 16:20, 9F
→
07/10 16:23, , 10F
07/10 16:23, 10F
→
07/10 16:24, , 11F
07/10 16:24, 11F
→
07/10 16:31, , 12F
07/10 16:31, 12F
→
07/10 16:33, , 13F
07/10 16:33, 13F
→
07/10 16:37, , 14F
07/10 16:37, 14F
→
07/10 16:39, , 15F
07/10 16:39, 15F
→
07/10 16:46, , 16F
07/10 16:46, 16F
→
07/10 16:56, , 17F
07/10 16:56, 17F
→
07/10 17:05, , 18F
07/10 17:05, 18F
→
07/10 17:47, , 19F
07/10 17:47, 19F
→
07/10 17:48, , 20F
07/10 17:48, 20F
→
07/10 19:20, , 21F
07/10 19:20, 21F
→
07/10 19:22, , 22F
07/10 19:22, 22F
→
07/10 19:25, , 23F
07/10 19:25, 23F
→
07/10 19:35, , 24F
07/10 19:35, 24F
推
07/10 19:47, , 25F
07/10 19:47, 25F
→
07/10 19:49, , 26F
07/10 19:49, 26F
→
07/10 19:49, , 27F
07/10 19:49, 27F
→
07/10 20:01, , 28F
07/10 20:01, 28F
→
07/10 20:01, , 29F
07/10 20:01, 29F
→
07/10 20:02, , 30F
07/10 20:02, 30F
推
07/10 20:06, , 31F
07/10 20:06, 31F
→
07/10 20:27, , 32F
07/10 20:27, 32F
→
07/10 20:27, , 33F
07/10 20:27, 33F
→
07/10 20:44, , 34F
07/10 20:44, 34F
C_and_CPP 近期熱門文章
PTT數位生活區 即時熱門文章