POJ-1579-Function Run Fun

                                                Function Run Fun

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 14839		Accepted: 7675

Description

We all love recursion! Don't we?

Consider a three-parameter recursive function w(a, b, c):

if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:
1

if a > 20 or b > 20 or c > 20, then w(a, b, c) returns:
w(20, 20, 20)

if a < b and b < c, then w(a, b, c) returns:
w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)

otherwise it returns:
w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)

This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.

Input

The input for your program will be a series of integer triples, one per line, until the end-of-file flag of -1 -1 -1. Using the above technique, you are to calculate w(a, b, c) efficiently and print the result.

Output

Print the value for w(a,b,c) for each triple.

Sample Input

1 1 1
2 2 2
10 4 6
50 50 50
-1 7 18
-1 -1 -1

Sample Output

w(1, 1, 1) = 2
w(2, 2, 2) = 4
w(10, 4, 6) = 523
w(50, 50, 50) = 1048576
w(-1, 7, 18) = 1

Source

Pacific Northwest 1999

 

 

package 暑期培训_2013_08_04;

import java.util.Scanner;

public class POJ_1579_Function_Run_Fun_20130808_1758_动态规划 {

	 /*
	 * 1983210400 1579 Accepted 3092K 266MS Java 1118B 2013-08-09 20:30:35 
	 * @param args
	 */
	private static int [][][] arr = new int [22][22][22];
	private static int w(int a, int b, int c) {
		
		
		   if(a <= 0 || b <= 0 || c <= 0){
			   return 1;
		   }
		   
		   if(a > 20 || b > 20 || c > 20){
			  
			   return arr[20][20][20] = w(20,20,20);
		   }
		   if(arr[a][b][c]!=0) return arr[a][b][c];//返回数组里已存的非0值!!
		   if(a < b && b < c){
			   return arr[a][b][c] = w(a, b ,c-1)+w(a , b-1, c-1)-w(a, b-1, c);
		   }
		   else 
			   return   arr[a][b][c] = w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1); 
		
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
          Scanner scan= new Scanner(System.in);
          while(scan.hasNext()){
        	 int a = scan.nextInt();
        	 int b = scan.nextInt();
        	 int c = scan.nextInt();
        	 if(a==-1&&b==-1&&c==-1)break;
        	    
        	   int SUM=w(a,b,c);
        	 System.out.println("w"+"("+a+", "+b+", "+c+") "+"= "+SUM);
        	  
          }
	}

	
}