2033.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

import java.util.*;
import java.io.*;
import java.lang.reflect.Array;

public class Main {
		
	static public void main( String [] string ) throws Exception{
		Scanner cin = new Scanner( System.in );
		while( true ) {
			String w = cin.next();
			if( w.charAt(0) == '0' )
				break;
				
			if( w.length() == 1 ) {
				System.out.println( 1 );
				continue;
			}
			
			int a[] = new int[]{ 1, 1, 0 };
			for( int i=1; i<w.length(); i++ ) {
				if( w.charAt(i) != '0' )
					a[2] = a[1];
				else
					a[2] = 0;
				
				if( w.charAt(i-1) == '1' || 
						w.charAt(i-1) == '2' && w.charAt(i) <= '6' )
					a[2] += a[0];
				
				a[0] = a[1];
				a[1] = a[2];
			}
			System.out.println( a[2] );
		}
		return;
	}
}