A very cool google puzzle: Let’s say that you have 25 horses, and you want to pick the fastest 3 horses out of those 25. In each race, only 5 horses can run at the same time because there are only 5 tracks. What is the minimum number of races required to find the 3 fastest horses without using a stopwatch?

No trials

Pointers are little shits

If you will treat these good they’ll become a little cuties

/kickme

Please help me

What's the problem?

I wrote the comment in the code

hello,everybody

Try debugging and see what's the problem with the socket

"Impossibile trovare o aprire il file PDB." ( It says it cannot open the PDB file )

If you will treat these good they’ll become a little cuties

Little cuties that you cuan only pet on one specific spot, else it explodes

Depends on you

Which is best ide for. C and CPP programming

Which is best ide for. C and CPP programming

Which is best ide for. C and CPP programming

you can then use some function to convert it to str

char *convert(const std::string & s) { char *pc = new char[s.size()+1]; std::strcpy(pc, s.c_str()); return pc; } // main something std::vector<std::string> vs; std::vector<char*> vc; std::transform(vs.begin(), vs.end(), std::back_inserter(vc), convert);

What is transform? I don't have this function.

char *convert(const std::string & s) { char *pc = new char[s.size()+1]; std::strcpy(pc, s.c_str()); return pc; } // main something std::vector<std::string> vs; std::vector<char*> vc; std::transform(vs.begin(), vs.end(), std::back_inserter(vc), convert);

Owa, good boy Klimi, that's how you make good code (even if using a unique_ptr would have seasonned the stuff well)

im not good boy sadly

https://en.cppreference.com/w/cpp/algorithm/transform

Which 85% of C++ devs never use

but im no dev

> admin badge

char *convert(const std::string & s) { char *pc = new char[s.size()+1]; std::strcpy(pc, s.c_str()); return pc; } // main something std::vector<std::string> vs; std::vector<char*> vc; std::transform(vs.begin(), vs.end(), std::back_inserter(vc), convert);