[I got this problem from Radu Grigore, who I think told me it was a problem used in the 2009 Math Olympics. I suppose perhaps the problem then involved 2009 cards.]
There is a table with a row of 2014 cards. Each card has a red side and a blue side. We’ll say that a card is red if the color on its visible face is red, and analogously for blue. Two players take turns to do the following move: select any 50 consecutive cards where the left-most card is red, then flip each of those 50 cards (thus, for those 50 cards, turning red cards into blue cards and blue cards into red cards). Both players look at the cards from the same side of the table, so "left-most" means the same to both of the players (that is, you can think of one of the ends of the table as being designated as the left end). When it is a player’s turn, if that player cannot make a move (that is, if there is no way to select 50 consecutive cards the left-most one of which is red), then that player loses and the other player wins. If you are one of the players and all cards are initially red, can you be sure to win, and if so, do you want to be the player who goes first or second?