![]() |
||||||||||
|
||||||||||
CircleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1036 Accepted Submission(s): 350 Problem Description $\ \ \ \ $Satiya August is in charge of souls. $\ \ \ \ $He finds $n$ souls,and lets them become a circle.He ordered them to play Joseph Games.The souls will count off from the soul $1$.The soul who is numbered $k$ will be taken out,and will not join in the game again. $\ \ \ \ $Now Satiya August has got the sequence in the Out Ordered,and ask you the smallest $k$.If you cannot give him a correct answer,he will kill you! Input $\ \ \ \ $The first line has a number T,means testcase number. $\ \ \ \ $Each test,first line has a number $n$. $\ \ \ \ $The second line has $n$ numbers,which are the sequence in the Out Ordered**(The person who is out at $ai_{th}$ round was numbered $i$)**. $\ \ \ \ $The sequence input must be a permutation from $1$ to $n$. $\ \ \ \ 1\le T \le 10,2 \le n \le 20$. Output $\ \ \ \ $For each case,If there is a eligible number $k$,output the smallest $k$,otherwise,output¡±Creation August is a SB!¡±. Sample Input
Sample Output
Source | ||||||||||
|