HACKERANK WAITER PROBLEM
HACKERRANK-WAITER PROBLEM https://www.hackerrank.com/challenges/waiter/problem vector < int > waiter ( vector < int > number , int q ) { /* * A0=number */ vector < vector < int >> B ( q ); vector < vector < int >> A ( q ); vector < int > result ; int r = 0 ; while ( ! number . empty ()) { // instead of copy number to A[0] r = number . back () % prime [ 0 ]; if ( r == 0 ) { // push to Bi if divisible B [ 0 ]. push_back ( number . back ()); } else { A [ 0 ]. push_back ( number . back ()); } number . pop_back (); } // end while for ( int i = 1 ; i < q ; i ++ ) { while ( ! A [ i - 1 ]. empty ()) { r = A [ i - 1 ]. back () % prime [ i ]; if ( r == 0 ) { // push to Bi if divisible B [ i ]. push_back ( A [ i - 1 ]. back ()); } else { A [ i ]. push_back ( A [ i ...