2014
01-05

# A Game with Marbles

There are n bowls, numbered from 1 to n. Initially, bowl i contains mi marbles. One game step consists of removing one marble from a bowl. When removing a marble from bowl i (i > 1), one marble is added to each of the first i-1 bowls; if a marble is removed from bowl 1, no new marble is added. The game is finished after each bowl is empty.

Your job is to determine how many game steps are needed to finish the game. You may assume that the supply of marbles is sufficient, and each bowl is large enough, so that each possible game step can be executed.

The input contains several test cases. Each test case consists of one line containing one integer n (1 ≤ n ≤ 50), the number of bowls in the game. The following line contains n integers mi (1 ≤ i ≤ n, 0 ≤ mi ≤ 1000), where mi gives the number of marbles in bowl i at the beginning of the game.

The last test case is followed by a line containing 0.

The input contains several test cases. Each test case consists of one line containing one integer n (1 ≤ n ≤ 50), the number of bowls in the game. The following line contains n integers mi (1 ≤ i ≤ n, 0 ≤ mi ≤ 1000), where mi gives the number of marbles in bowl i at the beginning of the game.

The last test case is followed by a line containing 0.

10
3 3 3 3 3 3 3 3 3 3
5
1 2 3 4 5
0

3069
129

mark：直接模拟。没注意I64d，1wa。

# include <stdio.h>

long long num[60] ;

int main ()
{
int i, j, n ;
long long rtn ;
while (~scanf ("%d", &n),n)
{
rtn = 0 ;
num[n] = 0 ;
for(i = 0 ; i < n ; i++)
scanf ("%I64d", &num[i]) ;
for (i = n-1 ; i>= 0 ; i--)
{
rtn += num[i] ;
for (j = i-1 ; j>= 0; j--)
num[j] += num[i] ;
}
printf ("%I64d\n", rtn) ;
}
return 0 ;
}

1. #include <cstdio>

int main() {