Anton and Danik

Problem link : http://codeforces.com/problemset/problem/734/A

This problem requires you to count how many times someone wins, and based on that number of wins decide who is the winner. No actual array needed since the problem has only two players, and each round’s outcome is never draw. I counted how many times Anton won, and based on number of Anton’s win and total round , I decide the winner.

Leave a Reply

Your email address will not be published. Required fields are marked *