JOIN
Get Time

   Problem Statement  

 Problem Statement for AkariDaisukiDiv2

Problem Statement

    

Consider the following function:

f(X) = Waai + X + Akari + X + Daisuki

Here, X is a string and + denotes string concatenation. Waai, Akari and Daisuki are constant non-empty strings.



You are given a String S. Compute and return the number of different tuples (Waai,Akari,Daisuki,X) such that f(X) equals S.

 

Definition

    
Class:AkariDaisukiDiv2
Method:countTuples
Parameters:String
Returns:int
Method signature:int countTuples(String S)
(be sure your method is public)
    
 

Notes

-Two tuples (A,B,C,D) and (E,F,G,H) are considered equal if and only if A=E, B=F, C=G, and D=H.
 

Constraints

-S will contain between 1 and 50 characters, inclusive.
-Each character of S will be a lowercase letter ('a'-'z').
 

Examples

0)
    
"topcoderdivtwo"
Returns: 2
The possible tuples of (Waai, Akari, Daisuki, X) are the following ones:
  • ("t", "pc", "derdivtwo", "o")
  • ("topco", "er", "ivtwo", "d")
("topc", "derdivtw", "", "o") is not allowed since Daisuki is empty.
1)
    
"foxciel"
Returns: 0
The answer can be zero.
2)
    
"magicalgirl"
Returns: 4
3)
    
"waaiusushioakariusushiodaisuki"
Returns: 75
4)
    
"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
Returns: 8924

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2010, TopCoder, Inc. All rights reserved.

This problem was used for:
       Single Round Match 541 Round 1 - Division II, Level One