-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCountOfTournament.c
More file actions
31 lines (26 loc) · 979 Bytes
/
CountOfTournament.c
File metadata and controls
31 lines (26 loc) · 979 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <stdio.h>
/* You are given an integer n, the number of teams in a tournament that has strange rules:
If the current number of teams is even, each team gets paired with another team. A total of n / 2 matches are played, and n / 2 teams advance to the next round.
If the current number of teams is odd, one team randomly advances in the tournament, and the rest gets paired. A total of (n - 1) / 2 matches are played, and (n - 1) / 2 + 1 teams advance to the next round.
Return the number of matches played in the tournament until a winner is decided. */
int main()
{
int n;
scanf("Enter number of players %d\n", n);
int match = 0;
while (n > 1)
{
if (n % 2 != 0)
{
match += (n - 1) / 2;
n = ((n - 1) / 2) + 1;
}
else
{
match += (n/2) ;
n = n/2;
}
}
printf("Count of matches are %d\n", match);
return 0;
}