1-2-5组合问题的最高效完整算法

        1-2-5组合问题的最高效完整算法       

2010-01-17 16:11 94人阅读 评论(3) 收藏 举报

问题描述：用1，2，5这三个数组合，和为N。1，2，5的个数自己定，求有多少种不同的组合方法？

[cpp] view plain copy print ?

1. /************************************************************************
2. ***By       : Summon                                                  ***
3. ***Data     : 2010.01.17                                              ***
4. ***Function : 1-2-5组合之和等于100，文总共有多少种                           ***
5. ***           组合方式。                                                      ***
6. ***Method   : 首先使用蛮力发，复杂度O(n^3/)                              ***
7. ***           其次使用蛮力法的改进，复杂度O(n^2)                          ***
8. ***           最后是超级算法，复杂度O(n)                            ***                                                                    
9. /************************************************************************/ 
10. #include "stdafx.h" 
11. #include <stdio.h> 
12. #include <stdlib.h> 
13. #include <string.h> 
14. #include <time.h> 
15.  
16. typedef int STATUS; 
17.  
18. STATUS FoolHardinessMethod(int N, int *result); 
19. STATUS FoolHardinessMethodImproved(int N, int *result); 
20. STATUS SuperMethod(int N, int *result); 
21.  
22. int main(int argc, char* argv[]) 
23. { 
24.     clock_t start; 
25.     clock_t end; 
26.     double realTime; 
27.     int N; 
28.  
29.     printf("Please input the N!/n"); 
30.     fflush(stdin); 
31.     scanf("%d", &N); 
32.  
33.     int result = 0; 
34.     start = clock(); 
35.     FoolHardinessMethod(N, &result); 
36.     end = clock(); 
37.     realTime = ((double)(end - start))/CLOCKS_PER_SEC; 
38.     printf("N= %d/n", N); 
39.     printf("FoolHardinessMethod Running Time = %f/n", realTime); 
40.     printf("result = %d/n", result); 
41.     printf("/n");     
42.  
43.     start = clock(); 
44.     FoolHardinessMethodImproved(N, &result); 
45.     end = clock(); 
46.     realTime = ((double)(end - start))/CLOCKS_PER_SEC; 
47.     printf("N= %d/n", N); 
48.     printf("FoolHardinessMethodImproved Running Time = %f/n", realTime); 
49.     printf("result = %d/n", result); 
50.     printf("/n"); 
51.  
52.     start = clock(); 
53.     SuperMethod(N, &result); 
54.     end = clock(); 
55.     realTime = ((double)(end - start))/CLOCKS_PER_SEC; 
56.     printf("N= %d/n", N); 
57.     printf("SuperMethod Running Time = %f/n", realTime); 
58.     printf("result = %d/n", result); 
59.     printf("/n"); 
60.  
61.     return 1; 
62. } 
63.  
64. STATUS FoolHardinessMethod(int N, int *result) 
65. { 
66.     if (result == NULL) 
67.     { 
68.         return 0; 
69.     } 
70.  
71.     int N1 = N/1; 
72.     int N2 = N/2; 
73.     int N5 = N/5; 
74.     *result = 0; 
75.  
76.     for (int i=0; i<=N5; i++) 
77.     { 
78.         for (int j=0; j<=N2; j++) 
79.         { 
80.             for (int k=0; k<=N1; k++) 
81.             { 
82.                 if (5*i + 2*j + k == N) 
83.                 { 
84.                     *result += 1; 
85.                 } 
86.             } 
87.         } 
88.     } 
89.     return 1; 
90. } 
91.  
92. STATUS FoolHardinessMethodImproved(int N, int *result) 
93. { 
94.     if (result == NULL) 
95.     { 
96.         return 0; 
97.     } 
98.  
99.     int N2 = N/2; 
100.     int N5 = N/5; 
101.     *result = 0; 
102.  
103.     for (int i=0; i<=N5; i++) 
104.     { 
105.         for (int j=0; j<=N2; j++) 
106.         { 
107.             if (((N - 5*i - 2*j) >= 0) && ((N - 5*i - 2*j) <= N)) 
108.             { 
109.                 *result += 1;  
110.             } 
111.         } 
112.     } 
113.     return 1; 
114. } 
115.  
116. STATUS SuperMethod(int N, int *result) 
117. { 
118.     if (result == NULL) 
119.     { 
120.         return 0; 
121.     } 
122.  
123.     *result = 0; 
124.      
125.     for (int i=0; i<=N; i+=5) 
126.     { 
127.         *result += (i+2)/2; 
128.     } 
129.  
130.     switch (N%5) 
131.     { 
132.     case 0:  
133.         { 
134.             break; 
135.         } 
136.     case 1: 
137.         { 
138.             *result += (1*(N - N%5))/10; 
139.             break; 
140.         } 
141.     case 2: 
142.         { 
143.             *result += (2*(N - N%5))/10 + 1; 
144.             break; 
145.         } 
146.     case 3: 
147.         { 
148.             *result += (3*(N - N%5))/10 + 1; 
149.             break; 
150.         } 
151.     case 4:  
152.         { 
153.             *result += (4*(N - N%5))/10 + 2; 
154.             break; 
155.         } 
156.     } 
157.     return 1; 
158. }