/* Given a list of strictly positive integers, go through each distinct number and replace all occurrences of it with successive indices (zero or one based) of a new series. Examples [] → []/[] [42] → [0]/[1] [7,7,7] → [0,1,2]/[1,2,3] [10,20,30] → [0,0,0]/[1,1,1] [5,12,10,12,12,10] → [0,0,0,1,2,1]/[1,1,1,2,3,2] [2,7,1,8,2,8,1,8,2,8] → [0,0,0,0,1,1,1,2,2,3]/[1,1,1,1,2,2,2,3,3,4] [3,1,4,1,5,9,2,6,5,3,5,9] → [0,0,0,1,0,0,0,0,1,1,2,1]/[1,1,1,2,1,1,1,1,2,2,3,2] */ #include #define V std::vector V f(V x) { int i,t,z=x.size(); for(;z;x[--z]=t) for(i=t=0;i // overload ostream operator << () // prints list [1,2,3,...,n] std::ostream& operator <<( std::ostream& stream, const std::vector& data ) { stream<<'['; if ( !data.empty() ){ for ( std::size_t i = 0 ; i < data.size() -1 ; ++i ) stream<< data[ i ]<< ','; stream << data.back(); } stream << ']'; return stream; } // test cases V sample_0{1,2,3,4,3,2}; V sample_1; V sample_2{42}; V sample_3{7,7,7}; V sample_4{10,20,30}; V sample_5{5,12,10,12,12,10}; V sample_6{2,7,1,8,2,8,1,8,2,8}; V sample_7{3,1,4,1,5,9,2,6,5,3,5,9}; std::string code = "#include_#define V std::vector_V f(V x){int i,t,z=x.size();for(;z;x[--z]=t)for(i=t=0;i " << f( sample_0 ) << '\n' << sample_1 << " ==> " << f( sample_1 ) << '\n' << sample_2 << " ==> " << f( sample_2 ) << '\n' << sample_3 << " ==> " << f( sample_3 ) << '\n' << sample_4 << " ==> " << f( sample_4 ) << '\n' << sample_5 << " ==> " << f( sample_5 ) << '\n' << sample_6 << " ==> " << f( sample_6 ) << '\n' << sample_7 << " ==> " << f( sample_7 ) << '\n'; return 0; }

CodeGolf [CHALLENGE] List