epic 面试题+答案
4星 · 超过85%的资源 需积分: 50 102 浏览量
2013-11-03
23:11:12
上传
评论 4
收藏 125KB PDF 举报 
Write algorithm to return change in denominations of 10$, 5$, 1$, 25 cents, 10 cents
double deno[]= {10, 5, 1, 0.25, 0.10, 0.05, 0.01};
//Scanner reader = new Scanner(System.in);
float cost = 67.9500f;
float cash = 100.00f;
float change = cash-cost;
System.out.println(change);
for(int i=0;i<deno.length;i++)
{
float quo = (float) ((float) change/deno[i]);
float rem = (float) ((float) change%deno[i]);
if (quo>=1)
{
float num = (float) ((float) (change-rem)/deno[i]);
System.out.printf("Number of "+deno[i]+"s: "+num+"");
change = (float) (change-(num*deno[i]));
}
}
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
/* Function declarations */
void giveTheChange(int dollar, int cents, vector<int> &inDollar, vector<int> &inCent);
void process(int &sum,vector<int> &denom,bool dollar);
/* Function definitions */
void giveTheChange(int dollar, int cents, vector<int> &inDollar, vector<int> &inCent){
/* Find minmum number of dollars needed to give the change */
int sum=dollar;
Business Unit/Tier 3 (Optional)
|
Practice Group/Tier 4 (Optional)
Proprietary & Confidential (Optional)
|
Legal Disclaimer (Optional)
剩余16页未读，继续阅读
评论7