百钱买鸡问题

题目描述
公元前五世纪，我国古代数学家张丘建在《算经》一书中提出了“百鸡问题”：鸡翁一值钱五，鸡母一值钱三，鸡雏三值钱一。百钱买百鸡，问鸡翁、鸡母、鸡雏各几何？

详细描述：

接口说明

原型：

int GetResult(vector &list)

输入参数：

        无

输出参数（指针指向的内存区域保证有效）：

    list  鸡翁、鸡母、鸡雏组合的列表

返回值：

     -1 失败     

     0 成功

 

 

输入描述:
输入任何一个整数，即可运行程序。

输出描述:
 

示例1
输入
1
输出
0 25 75
4 18 78
8 11 81
12 4 84

O(n^3)

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		while (scanner.hasNext()) {
			int nextInt = scanner.nextInt();
			getResults();
		}
	}

	public static void getResults() {
		int amount = 100;
		int remain = amount;
		int hen = 0;
		int cock = 0;
		int chick = 0;
		for (int i = 0; i <= remain / 5; i++) {
			cock = i;
			remain -= cock * 5;
			for (int j = 0; j <= remain / 3; j++) {
				hen = j;
				remain -= j * 3;
				for (int k = 0; k <= remain / 1; k++) {
					chick = k * 3;
					remain -= k;
					if (remain == 0 && (hen + cock + chick) == 100) {
						System.out.println(cock+" "+hen+" "+chick);
					}
					remain += k;
				}

				remain += j * 3;
			}
			remain += cock * 5;
		}

	}
}

O(n^2)

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();
			for (int i = 0; i <=20; i++) {
				for (int j = 0; j <=40; j++) {
					int k = 100-i-j;
					if(k%3==0&&i*5+j*3+k/3==100) {
						System.out.println(i+" "+j+" "+k);
					}
				}
			}
		}
	}
}