Please provide me another testcase

#1

since question is not understood by me please provide another testcase.
please check my submitted code.

#2

SAMPLE TESTCASE :
Initially:

A= [3, 4, 7, 6, 5]<-TOP

After 1 iteration:

A1= [6, 4]<-TOP

B1= [5, 7, 3]<-TOP

We should output numbers in B1 first from top to bottom, and then output numbers in A1 from top to bottom.

#3

Sample Input 1

5 2 3 3 4 4 9

Sample Output 1

Explanation 1

Initially:

A0= [3, 3, 4, 4, 9]<-TOP

After 1st iteration:

A0= []<-TOP

A1= [4, 4]<-TOP

B1= [3, 3, 9]<-TOP

After 2nd iteration:

A1= []<-TOP

B1= [4, 4]<- TOP

B2= [3, 3, 9]<-TOP

We should output numbers in B1 first from top to bottom, and then output numbers in B2 from top to bottom.

4 4 9 3 3

#4

what’s wrong in my code. actually you printed alter first b1 have to print then a2(means 1st divisible stack then non didvisble stack)

#5

i think you don’t understand problem completely
please check you code again
approach
first you have to make q iteration
in each iteration first calculate ith prime no
and then check which nos from stack A are divisible with this ithprime no, which are divisible put them into stack B and which are not put them into stack temp and after that again pour it into stack A

i think you don’t understand problem completely
please check your code again

you can use this code as refrence

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.