Letters - Digital Password

If you use the number 1-26, English letters A - Z, that is, 1 - A, 2 - b, and so on ... 26 - z; then we can use the numbers to represent the corresponding words. However, there are many possibilities, such as 123 may represent ABC (1, 2, 3.), May also represent the LC (12, 3), or AW (1, 23) to request a program, calculate from the keyboard input The number of alphanumeric strings can be represented by the number of numbers, and the input 0 is overput: 2511411111111133333333330output: 6891 ========================= ============================================================================================================================================================================================================= ==

1 There is only one kind of dramatically. 1: 112: (1) 2 (1 of this is only one 1) because 12 can be there. (12) ............. ....... A total of two .121: (1 2) 1 (this is only 12 cases) (12) 1 (this is only 12 times) this time because 2 1 can be group. When you have a single 1st, the situation is in the case. (1) 21 (here is a single time) ........... A total of three.1212: (1 2 1) 2 (this is only 121 cases) (12 1) 2 (this is only 121 cases) (1 21) 2 (this is only 121 times) At this time Because 1 and 2 can be group. Gu many out 12 times. (1 2) 12 (this is only 12) (12) 12 (this is only 12 times) .. ........ A total of five. ----------------------------------------- - here. Rear, it is pushing. It should be the number of Fiboacci ........ ============================= ==================== Go back to the overall. Suppose there is one for: 12312612 glance, see the total result of this number: (123) (126) ( 12) Three single items .... Cause Simple. 123 3 and 12 1 unable to make a significant number. It is isolated. The 126 and 12 are isolated. That is, the number of three After the Bonanat, you can ...........

============================================================================================================================================================================================================= ========================== # include using namespace std; int f (int N) {if (n == 1) Return 1 ; If (n == 2) RETURN 2; RETURN F (N-1) f (n-2);} int make (char * str) {INT count = 1; int Len = strlen (STR); int i , J; for (i = 0, j = 1; i -1 && str [i]> 54 && str [i-1] == 50) J -; count * = f (j); j = 0;}} int main () {char * STR [200]; INT i; for (i = 0; i <200; i ) STR [i] = new char [200]; i = 0; cin >> STR [I]; While (STRCMP (STR [I], "0")) CIN >> STR [ I]; i = 0; while (strCMP (STR [I], "0")) Cout << Make (STR [i ]) << endl; for (i = 0; i <200; i ) delete str [i]; system ("pause"); return 0;}