从1,2,3,.....10这10个数字中选6个全组合,然后实现中六保五结果类似下面

可能太笨想好久没有解决请高手帮助

01-04-05-06-07-08
01-02-03-04-05-07
01-02-03-04-06-08
01-02-03-04-09-10
01-02-03-05-06-09
01-02-03-05-08-10
01-02-03-06-07-10
01-02-03-07-08-09
01-02-04-05-06-10
01-02-04-05-08-09
01-02-04-06-07-09
01-02-04-07-08-10
01-02-05-07-09-10
01-02-06-08-09-10
02-03-05-06-07-08
03-04-05-06-07-09
03-04-05-06-08-10
03-04-07-08-09-10
05-06-07-08-09-10

啥叫中6保5

中6保5即最少一行中含有5个数字，当然也有可能有几行含有5个数字相同

博彩类编程？

#include <stdio.h>
  #include <stdlib.h>
  #include <time.h>

  void init(void)
  {
   srand((int)time(0));
  }
  
  int main(void)
  {
   const int MAX_NUMBERS = 17;
   char result[MAX_NUMBERS];
   int count = 0;

   init();
   for (int i = 0; i < 10; i++)
   {  
   count = 0;
   bool isfirst = true;
   while (count < MAX_NUMBERS)
   {
    if (count >= 15)
    {
      int tempValue = 0;
      tempValue = rand() % 2;
      result[count] = tempValue + '0';
      count += 1;
     if (tempValue == 0)
     {
         result[count] = rand()%10+'0';
      count += 1;
     }
     else
     {
     result[count] = rand() % 1 + '0';
     count += 1;
     }
    }
   
    if (isfirst)
    {
     result[count] = '0';
     count += 1;
     isfirst = false;
        continue;
    }
    else
    {
      if (count < 15)
      {
      result[count] = rand()%10+'0';
      count += 1;
      }
      if (count < 15)
      {
      result[count] = '-';
      count += 1;
      }
      if (count < 15 )
      {
      result[count] = '0';
      count += 1;
      }
    }
   }
   result[count] = '\0';
   puts(result);
   }
   return 0;
  }//给不给分兄弟你看着办吧！  你的要求全办到了.