actually, thats total bullcrap

Why do you think so? It's good enough for the committee to add it to C++

Why do you think so? It's good enough for the committee to add it to C++

I was joking

Widely used in the Linux kernel

Yes, very usefull

I have the string s, and I copy this string in string t, after I realized the shuffle and I saved the index in k ..... How can I get the original string s? [I only have the shuffled string and the position indexes]

If you randomly shuffle the bits without saving the original information/original position of your bits, there is no way to get the information back. if you are interested in cryptography to gain back the obfuscated information, there are systems were this is possible. but it is not possible when you do this without a system and rely on fortune

If you randomly shuffle the bits without saving the original information/original position of your bits, there is no way to get the information back. if you are interested in cryptography to gain back the obfuscated information, there are systems were this is possible. but it is not possible when you do this without a system and rely on fortune

I saved the position

I have the string s, and I copy this string in string t, after I realized the shuffle and I saved the index in k ..... How can I get the original string s? [I only have the shuffled string and the position indexes]

wtf.....

How can i solve "double free or curruption (out) " error.

I saved the position

In the k array

@BurningTiles : you assign a nullptr to your pointer and check the pointer for nullptr before doing a free/delete on this pointer?

@nikola: then you have all the information. the k array is your "compressed" original. just put the 1 or 0 (depending on the logic you use) to the saved positions of an empty data type. then you have your orignal back

@nikola: then you have all the information. the k array is your "compressed" original. just put the 1 or 0 (depending on the logic you use) to the saved positions of an empty data type. then you have your orignal back

No, the k array contains the positions of the exchange

Do you mean, you save the destination position but not the source position?

No the source position

@BurningTiles : you assign a nullptr to your pointer and check the pointer for nullptr before doing a free/delete on this pointer?

I'm sorry I'm unable to understand. The issue is on line 82, if i use scanf than it works but not in cin.

if you save the source position, then you have all information you need to restore the original information

the element s[0] will be t [ traded position] and I saved this position in the k array

teach me how to program

ty

rtfm :)

what manual? just to be clear

https://pastebin.com/yRGUnHcR

https://pastebin.com/yRGUnHcR

Viktor Liehr

Ahahah

Oh guys, a few minutes ago I've seen the book's Stroustrup "A Tour of C++" here. Is it good book as re-learning material? I mean when you already had some practice and read some books and you something know yet and you just wanna remind yourself some aspects

Oh guys, a few minutes ago I've seen the book's Stroustrup "A Tour of C++" here. Is it good book as re-learning material? I mean when you already had some practice and read some books and you something know yet and you just wanna remind yourself some aspects

yes

read that!!

absolutely, read that one

Thanks for answers :3

np. andrei alexandrescu, scott meyers and herb sutter have also written some damn good books, if you want to dive deeper into cpp

read that!!

ty

#cppbook

np. andrei alexandrescu, scott meyers and herb sutter have also written some damn good books, if you want to dive deeper into cpp

Thanks for advice, but I need some practice yet and sometimes rolling through basic moments

effective c++ by scott meyers is a bit "outdated" but still damn good to get a better understanding for c++. it is a nice read and you have plenty of examples you can try out by yourself

Yeah, it is, thanks

Yeah, it is, thanks

np

effective c++ by scott meyers is a bit "outdated" but still damn good to get a better understanding for c++. it is a nice read and you have plenty of examples you can try out by yourself

Okay, I'll try to read Meyers, thank you

Have a good read. I was lucky to meet this guy twice in person before he retired.

Is there a function that performs random exchange within the vector?

shuffle() or the deprecated random_shuffle(). I thought we had this discussed yesterday, haven't we?

shuffle() or the deprecated random_shuffle(). I thought we had this discussed yesterday, haven't we?

but can I also use it on an array of integers?

or I can use it only for vector <int>

you can use this on any datastructure, you habe to state the begin and ending of the data structure you want to shuffle

therefore v [10] = {0,1,2,3,4,5,6,7,8,9}; random_shuffle(v[0], v[9]);

Program received signal SIGSEGV, Segmentation fault. 0x00007ffff7af7cba in std::local_Rb_tree_decrement ( __x=0x64c9e8 <WCP::ENV::UTIL::COOKIE_MAP[abi:cxx11]+8>) at ../../../../../libstdc++-v3/src/c++98/tree.cc:98 98 ../../../../../libstdc++-v3/src/c++98/tree.cc: No such file or directory. (gdb) bt #0 0x00007ffff7af7cba in std::local_Rb_tree_decrement ( __x=0x64c9e8 <WCP::ENV::UTIL::COOKIE_MAP[abi:cxx11]+8>) at ../../../../../libstdc++-v3/src/c++98/tree.cc:98 #1 0x0000000000431a0a in std::_Rb_tree<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::_Select1st<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >::_M_get_insert_unique_pos(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) () #2 0x000000000042f813 in std::_Rb_tree_iterator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > std::_Rb_tree<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::_Select1st<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >::_M_emplace_hint_unique<std::piecewise_construct_t const&, std::tuple<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&>, std::tuple<> >(std::_Rb_tree_const_iterator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::piecewise_construct_t const&, std::tuple<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&>&&, std::tuple<>&&) [clone .isra.119] () #3 0x000000000042fc5d in WCP::ENV::COOKIE(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) () #4 0x0000000000404539 in USER::isUserLoggedIn() () ---Type <return> to continue, or q <return> to quit--- #5 0x0000000000404d66 in __static_initialization_and_destruction_0(int, int) () #6 0x0000000000404fd4 in _GLOBAL__sub_I__ZN4USER14isSessionValidEv () #7 0x0000000000437d1d in __libc_csu_init () #8 0x00007ffff7158f7b in __libc_start_main () from /lib64/libc.so.6 #9 0x00000000004042fa in _start () (gdb) q A debugging session is active.

does anybody have a clue why the fuck I get this error on operator[] of std::map?

Maybe you overrun the map somewhere

Looks like it

"overrun"?

segmentation fault, you access memory that your application did not reserve for it

except I didnt write that code

Yeah, [] is not safe against out-of-bounds overruns

what are "overruns"?

check your buffers and how you access them

A bufferoverflow

oh okay

for example

wait map has a buffer which I need to size correctly?

what do you mean "[] is not safe against out-of-bounds overruns"?

what do you mean by "overrun"?

nvm, mentally I thought for some reason you're talking about vector lel

lol no

xD

I really should sleep when I'm under drugs

yes ;)

lol no

Yeee, well, most people how use vector and has some weird segfault it's cause of the use of []^^ But yeah I don't really feel fit

xDD

But like... what could be causing my problem?

But like... what could be causing my problem?

Me

No

you are nice

I dunno, I think I'm not a great help today 😆Sorry

Don't worry, shelly

Okay thanks c:

xD