Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem C
The Marriage Interview ;-)
Input: standard input
Output: standard output
Time Limit: 2 seconds

Tanbir has recently got married with Nupa. But the steps prior to this event were not easy. He had to submit a novel like curriculum vitae and also he had to face a long interview. A senior computer engineer from the bride’s family took the interview. Just before the interview Tanbir solved a lot of problems from Valladolid Site and many packing problems of Erich Friedman and did well on most parts of the interview. But he had a tough time solving a different type of problem. It may be mentioned that Tanbir loved (!) to solve Geometric (Problem-setter of Problem H of this contest) and Parsing Problems. After the interview Tanbir went to one of his problem-setter friends to discuss about the problem. Tanbir and his so-called veteran problem-setter friend solved that problem correctly (hopefully) in seven days and thirteen nights (!). Now here is that problem for you (Who knows you may have to face a similar interview on a similar occasion in near future!!! Very few of you may arrange such an interview).

You can see a function named trib() below. This function is called with two-integer parameter from main() function.

/*

__int64 is a 64-bit integer data type in Visual C++. So the following code was written in Visual C++.

*/

typedef unsigned __int64 datatype;

datatype count;

datatype trib(int n, unsigned int back)

{

    datatype sum=0;

    int i;

    count++;

    if(n<=0) return 0;

    if(n==1) return 1;

    for(i=1;i<=back;i++)

         sum+=trib(n-i,back);

    return sum;

}

void main(void)

{

    count=0;

    trib(5,5);

    printf(“%I64u\n”,count);

}

If you test you will find that the function trib() is invoked 41 times when it is called from the main function as trib(5, 5). You will have to determine the number of times the function is invoked for different values of n and back.

Input

The input file contains several lines of input. Each line contains two integers n(n<=61) and back(back<=60).  

Output

For each line of input produce one line of output. This line contains the case number and then an integer which denotes the number of times the trib() function is invoked for the corresponding input values of n and back. Input is terminated by a case where the value of n is greater than 60. This line should not be processed.

Sample Input             

3 3

4 4

5 5

6 6

7 7

8 8

9 9

61 61

Sample Output

Case 1: 7

Case 2: 17

Case 3: 41

Case 4: 97

Case 5: 225

Case 6: 513

Case 7: 1153

(Problem-setter: Shahriar Manzoor, ACM Valladolid Online Judge)