Please do not answer in this topic. The problem is from ongoing TopCoder SRM 504.
On Apr 26, 6:04 pm, kamlesh yadav <kamleshlu2...@gmail.com> wrote: > Problem Statement (here is the question pleasesolve it) > > The most famous math contest is going to start soon. As usual in math > contests, there is going to be a problem that involves an abstract > machine of sorts and predicting how will it process a sequence of > colored balls. This time, the machine will use the balls as a special > language that works as follows: The process begins when the machine is > given a stack of balls that are colored either white or black. The > next steps are as follows: > Take the top ball out of the stack, show it to the audience and discard it. > If the taken ball was white, the contents of the stack will be dumped > into a new stack and the new stack will be used in the next step. In > other words, the order of the balls in the stack will be reversed. > If the taken ball was black, the balls inside the stack will get their > colors inverted. Every originally-white ball will turn black and every > originally-black ball will turn white. > The process is repeated until there are no balls left in the stack. > You have been hired to make a program to grade the answers to this > contest question. Given the contents of the stack, return the number > of black balls that will be shown to the audience. Due to limitations > in the input size, the contents of the stack are given by String > ballSequence, and int repetitions. To form the sequence of balls, > repeat ballSequence repetitions times. The final sequence will contain > 'B' and 'W' characters denoting a black or a white ball respectively > from the top of the stack to the bottom. > Definition > > Class: > MathContest > Method: > countBlack > Parameters: > String, int > Returns: > int > Method signature: > int countBlack(String ballSequence, int repetitions) > (be sure your method is public) > > Constraints > - > ballSequence will contain between 1 and 50 characters, inclusive. > - > Each character in ballSequence will be 'B' or 'W'. > - > repetitions will be between 1 and 3500, inclusive. > - > The total number of balls after generating the sequence will be > between 1 and 100000, inclusive. > Examples > 0) > > "BBWWB" > 1 > Returns: 2 > The starting contents of the stack from top to bottom are: BBWWB. The > process can be simulated as follows: (Stack contents: BBWWB). Take a > black ball, change the contents from BWWB to WBBW. (Stack contents: > WBBW). Take a white ball, change the contents from BBW to WBB. (Stack > contents: WBB). Take a white ball, change the contents from BB to BB. > (Stack contents: BB). Take a black ball, change the contents from B to > W. (Stack contents: W). Take a white ball. > 1) > > "BBB" > 10 > Returns: 1 > There are initially 30 black balls in the stack. After the first one > is processed, all the remaining balls become white. A white ball > cannot change the color of the remaining balls. > 2) > > "BW" > 10 > Returns: 20 > A series of alternating black and white balls which begins with a > black ball. Initially, a black ball inverts the colors of the > remaining balls, making them a new alternation of black and white > balls that begins with a black ball. The process will repeat for each > ball and each ball will be black when picked. > 3) > > "WWWWWWWBWWWWWWWWWWWWWW" > 1 > Returns: 2 > Eventually, the black ball will be reached after reversing the order > 14 times. It will turn all of the remaining balls black. But the next > black ball that is processed will turn all the remaining balls white > once again > > this is the ques please solve it an d send me within 45 minutes > > On Tue, Apr 26, 2011 at 8:16 PM, Juliano Silva Gomes > > > > > > > > > > <juliano.go...@gmail.com> wrote: > > Oh, ok. So you will send some question and need it's answer in 45 minutes. > > Smells like cheating. > > > ----- > > Juliano Silva Gomes > > 2º Semestre de Análise e Desenvolvimento de Sistemas > > FATEC > > > On Tue, Apr 26, 2011 at 11:08, kamlesh yadav <kamleshlu2...@gmail.com> > > wrote: > > >> plaese be online at 8.30 pm today if possible and please help me. > > >> On Tue, Apr 26, 2011 at 7:19 PM, kamlesh yadav <kamleshlu2...@gmail.com> > >> wrote: > >> > hello friends > >> > i NEED UR HUMBLE SUPPORT > > >> > I will post a question after an hour, if > >> > anybody can solve it for me as early as possible (probably within 45 > >> > minutes), then please solve it and send it ti me. I urgently need it > >> > my id kamleshlu2...@gmail.com > > >> > -- > >> > You received this message because you are subscribed to the Google > >> > Groups "Algorithm Geeks" group. > >> > To post to this group, send email to algogeeks@googlegroups.com. > >> > To unsubscribe from this group, send email to > >> > algogeeks+unsubscr...@googlegroups.com. > >> > For more options, visit this group at > >> >http://groups.google.com/group/algogeeks?hl=en. > > >> -- > >> Kamlesh Kumar Yadav > >> MCA Department of Computer Science > >> Delhi University > > >> -- > >> You received this message because you are subscribed to the Google Groups > >> "Algorithm Geeks" group. > >> To post to this group, send email to algogeeks@googlegroups.com. > >> To unsubscribe from this group, send email to > >> algogeeks+unsubscr...@googlegroups.com. > >> For more options, visit this group at > >>http://groups.google.com/group/algogeeks?hl=en. > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algogeeks@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > Kamlesh Kumar Yadav > MCA Department of Computer Science > Delhi University -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
