C / C++ / MFC

// Assusme an array A of ints of size N.
bool sorted = false; // THIS MAKES THE TRICK
for (int i=1; i<N && !sorted; ++i)
{
  sorted = true;
  for (int j=0; j<N-i; ++j)
  {
    int k = j + 1;
    if (A[j] > A[k]) {
      int t = A[j];
      A[j] = A[k];
      A[k] = t;
      sorted = false;
    }
  }
}

int ipow(int x, int y)
{
   return (int)pow((double)x, (double)y);
}

int main(void)
{
  const std::string s("PICK ANY TWO: 10 2 F F");
  const string name(s.substr(0, s.find(":"));

  return 0;
}

char name[41] = {0};
int m,n;
char c,d;
int i = sscanf_s(buf, "%[^:]%*c%d %d %c %c",name, _countof(name), &m, &n, &c, 1, &d, 1);

#include <regex>
#include <iostream>
#include <string>

int main(void)
{
   std::tr1::regex re("^([^:]*):" // get first part of string terminated by colon
                      "(\\d+)\\s+(\\d+)\\s+" // numbers and separating whitespace
                      "(\\S)\\s+(\\S)$"); // Characters and separating whitespace
   std::string s("PICK ANY TWO:10 2 F F");
   std::tr1::smatch matches;

   if (boost::regex_match(s, matches, re))
   {
      std::string name = matches[1];
      int m = atol(matches.str(2).c_str());
      int n = atol(matches.str(3).c_str());
      char c = matches.str(4)[0];
      char d = matches.str(5)[0];
   }
}