1 //求出用1，2，5這三個(gè)數(shù)不同個(gè)數(shù)組合的和為1000的組合個(gè)數(shù)。
2 //如：100個(gè)1是一個(gè)組合，5個(gè)1加19個(gè)5是一個(gè)組合。。。。
3 public class getNumbers{
4 public static void sums1(int temp)
5 {
6 int num1 = temp/1;
7 int num2 = temp/2;
8 int num3 = temp/5;
9 int numbers = 0;
10 String values;
11 for(int i=0;i<num1;i++)
12 {
13 for(int j=0;j<num2;j++)
14 {
15 for(int k=0;k<num3;k++)
16 {
17 if((1*i+2*j+5*k)==temp)
18 {
19 numbers++;
20 values = i+“個(gè)1,“+j+“個(gè)2,“+k+“個(gè)5“;
21 System.out.println(“the “+numbers+“ groups numbers is:“+values);
22 }
23 }
24 }
25 }
26 System.out.println(“the numbers of group is ===>“+numbers);
27 }
28 public static void main(String[] args) {
29 int s = 1000;
30 sums1(s);
31 }
32 }
33
1 運(yùn)行結(jié)果：
2 E:\java\ProgramJava\csdn>javac getNumbers.java
3 E:\java\ProgramJava\csdn>java getNumbers >>groups.txt
4 groups.txt中的輸出結(jié)果如下：
5 the 1 groups numbers is:0個(gè)1,5個(gè)2,198個(gè)5
6 the 2 groups numbers is:0個(gè)1,10個(gè)2,196個(gè)5
7 the 3 groups numbers is:0個(gè)1,15個(gè)2,194個(gè)5
8 the 4 groups numbers is:0個(gè)1,20個(gè)2,192個(gè)5
9 the 5 groups numbers is:0個(gè)1,25個(gè)2,190個(gè)5
10 the 6 groups numbers is:0個(gè)1,30個(gè)2,188個(gè)5
11 the 7 groups numbers is:0個(gè)1,35個(gè)2,186個(gè)5
12 the 8 groups numbers is:0個(gè)1,40個(gè)2,184個(gè)5
13 the 9 groups numbers is:0個(gè)1,45個(gè)2,182個(gè)5
14 the 10 groups numbers is:0個(gè)1,50個(gè)2,180個(gè)5
15 the 11 groups numbers is:0個(gè)1,55個(gè)2,178個(gè)5
16 the 12 groups numbers is:0個(gè)1,60個(gè)2,176個(gè)5
17 the 13 groups numbers is:0個(gè)1,65個(gè)2,174個(gè)5
18 the 14 groups numbers is:0個(gè)1,70個(gè)2,172個(gè)5
19 the 15 groups numbers is:0個(gè)1,75個(gè)2,170個(gè)5
20 the 16 groups numbers is:0個(gè)1,80個(gè)2,168個(gè)5
21 …………
22 the 50379 groups numbers is:983個(gè)1,6個(gè)2,1個(gè)5
23 the 50380 groups numbers is:984個(gè)1,3個(gè)2,2個(gè)5
24 the 50381 groups numbers is:984個(gè)1,8個(gè)2,0個(gè)5
25 the 50382 groups numbers is:985個(gè)1,0個(gè)2,3個(gè)5
26 the 50383 groups numbers is:985個(gè)1,5個(gè)2,1個(gè)5
27 the 50384 groups numbers is:986個(gè)1,2個(gè)2,2個(gè)5
28 the 50385 groups numbers is:986個(gè)1,7個(gè)2,0個(gè)5
29 the 50386 groups numbers is:987個(gè)1,4個(gè)2,1個(gè)5
30 the 50387 groups numbers is:988個(gè)1,1個(gè)2,2個(gè)5
31 the 50388 groups numbers is:988個(gè)1,6個(gè)2,0個(gè)5
32 the 50389 groups numbers is:989個(gè)1,3個(gè)2,1個(gè)5
33 the 50390 groups numbers is:990個(gè)1,0個(gè)2,2個(gè)5
34 the 50391 groups numbers is:990個(gè)1,5個(gè)2,0個(gè)5
35 the 50392 groups numbers is:991個(gè)1,2個(gè)2,1個(gè)5
36 the 50393 groups numbers is:992個(gè)1,4個(gè)2,0個(gè)5
37 the 50394 groups numbers is:993個(gè)1,1個(gè)2,1個(gè)5
38 the 50395 groups numbers is:994個(gè)1,3個(gè)2,0個(gè)5
39 the 50396 groups numbers is:995個(gè)1,0個(gè)2,1個(gè)5
40 the 50397 groups numbers is:996個(gè)1,2個(gè)2,0個(gè)5
41 the 50398 groups numbers is:998個(gè)1,1個(gè)2,0個(gè)5
42 the numbers of group is ===>50398
43
1 #include<iostream>
2 using namespace std;
3 void main()
4 {
5 int i,j,n=0;
6 for(i=0;i<=20;i++)
7 {
8 for(j=0;j<=(100-i*5)/2;j++)
9 {
10 n++;
11 }
12 }
13 cout<<n<<endl;
14 }
1 #include <stdio.h>
2 int main(void)
3 {
4 int j,k,n;
5
6 for(j=0;j<=50;j++)
7 {
8 for(k=0;k<=20;k++)
9 {
10 if(2*j+5*k<=100)
11 n++;
12 }
13 }
14
15 printf(“count=%d\n“,n);
16 }
posted on 2006-01-19 14:51
★yesjoy★ 閱讀(2042)
評(píng)論(2) 編輯 收藏 所屬分類:
算法總結(jié)