UVa 11609 - Teams

Problem Number - Problem Name

 * UVa 11609: Teams

Summary
How many ways a coach can select a team from his N players.

Explanation
Just calculate pow(2,n-1)*n

Implementations
int power(int x, int y) { int temp; if( y == 0) return 1; temp = power(x, y/2); if (y%2 == 0) return temp*temp; else return x*temp*temp; }

Input
4 1 2 3 1000000000

Output
Case #1: 1 Case #2: 4 Case #3: 12 Case #4: 7812500