

Kiki & Little Kiki 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3986 Accepted Submission(s): 2129 Problem Description There are n lights in a circle numbered from 1 to n. The left of light 1 is light n, and the left of light k (1< k<= n) is the light k1.At time of 0, some of them turn on, and others turn off. Change the state of light i (if it's on, turn off it; if it is not on, turn on it) at t+1 second (t >= 0), if the left of light i is on !!! Given the initiation state, please find all lights¡¯ state after M second. (2<= n <= 100, 1<= M<= 10^8) Input The input contains one or more data sets. The first line of each data set is an integer m indicate the time, the second line will be a string T, only contains '0' and '1' , and its length n will not exceed 100. It means all lights in the circle from 1 to n. If the ith character of T is '1', it means the light i is on, otherwise the light is off. Output For each data set, output all lights' state at m seconds in one line. It only contains character '0' and '1. Sample Input
Sample Output
Source  
