发工资

题目描述
对于财务处的工作人员来说，发工资那天是最忙碌的。财务处的NowCoder最近在考虑一个问题：如果每个员工的工资额都知道，最少需要准备多少张人民币，才能在给每位同事发工资的时候都不用找零呢？
这里假设员工的工资都是正整数，单位元，人民币一共有100元、50元、20元、10元、5元、2元和1元七种。
输入描述:
输入数据包含多个测试实例，每个测试实例的第一行是一个整数n (n≤100)，表示人数，然后是n个员工的工资。
输出描述:
对于每个测试实例输出一个整数x,表示至少需要准备的人民币张数。每个输出占一行。
示例1
输入
3
1 2 3
3
100 200 300
输出
4
6

这个太简单，直接上代码：

// write your code here
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			int n = sc.nextInt();
			int[] money = new int[n];
			for (int i = 0; i < money.length; i++) {
				money[i] = sc.nextInt();
			}
			int count = getlowestcount(money);
			System.out.println(count);
		}
	}
	
	public static int getlowestcount(int[] money) {
		int lowestcount = 0;
		int remain = 0;
		for (int i = 0; i < money.length; i++) {
			if(money[i]%100==0) {
				lowestcount += money[i]/100;
			}else {
				lowestcount += money[i]/100;
				remain = money[i]%100;
				if(remain%50==0) {
					lowestcount += remain/50;
				}else {
					lowestcount += remain/50;
					remain = remain%50;
					if(remain%20==0) {
						lowestcount += remain/20;
					}else {
						lowestcount += remain/20;
						remain = remain%20;
						if(remain%10==0) {
							lowestcount += remain/10;
						}else {
							lowestcount += remain/10;
							remain = remain%10;
							if(remain%5==0) {
								lowestcount += remain/5;
							}else {
								lowestcount += remain/5;
								remain = remain%5;
								if(remain%2==0) {
									lowestcount += remain/2;
								}else {
									lowestcount += remain/2;
									remain = remain%2;
									lowestcount = lowestcount+remain;
								}
							}
						}
					}
				}
			}
		}
		return lowestcount;
	}
}