Skip to content

Update 100+ Python challenging programming exercises.txt #52

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed

Update 100+ Python challenging programming exercises.txt #52

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 17 additions & 0 deletions 100+ Python challenging programming exercises.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2371,5 +2371,22 @@ solutions=solve(numheads,numlegs)
print solutions

#----------------------------------------#
Question:

In a regular table tennis match, the player who serves changes every time after 2 points are scored, regardless of which players scored them.

Chef and Cook are playing a different match — they decided that the player who serves would change every time after K points are scored instead (again regardless of which players scored them). When the game starts, it's Chef's turn to serve.

You are given the current number of points scored by Chef and Cook (P1 and P2 respectively). Find out whether Chef or Cook has to serve next.

Solution:

n=int(input())
for i in range(n):
a=list(map(int,input().split()))
if(((a[0]+a[1])//a[2])%2==0):
print('CHEF')
else:
print('COOK')