VC++实现排料算法源代码

看看源程序吧   
    
  #include"stdafx.h"   
  #include   <stdio.h>   
  #include   <malloc.h>   
    
  /*!   统计同种产品的生产次数，如果超过此种产品的产量，就跳到比他短的下个产品*/   
  int   cn=1;           
    
  /*存放产品的链表*/   
  typedef   struct   list                           
  {       
  /*   len存放长度*/   
  int   len;   
  /*   num存放数量*/   
  int   num;     
    
          struct   list   *next;   
  }ST;   
    
  /*存放切割方法的链表*/   
  typedef   struct   rlist                   
  {       
  /*times表示该产品用了几次*/   
  int   len;   
  int   num;   
  int   times;                                   
          struct   rlist   *next;   
  }RST;   
    

  /*函数接收输入的产品信息并升序排序存入链表*/   
  ST   *   init(int   pRawLen)                           
  {           
  int   i   =   1;   
  int   input_len,input_num;   
    
          ST   *head,*p,*t;   
  /*head是链表头结点，不存储信息*/   
          head   =   (ST   *)malloc(sizeof(ST));                   
          head->next   =   NULL;   
          p   =   head;   
          printf("请输入需要加工成的产品的长度和数量：（输入0表示结束）\n");   
          while(1)   
          {         
  printf("请输入第%d种长度：",i);   
                  scanf("%d",   &input_len);   
                  printf("请输入第%d种数量：",i);   
                  scanf("%d",   &input_num);   
                  if(   (input_len   ==   0)   ||   (input_num   ==   0)   )   
  {   
  break;   
  }   
    
                  if(   (input_len   >   pRawLen)   ||   (input_len   <0   )   ||   (input_num   <0   )   )   
  {   
  printf("长度或数量不正确！");   
  continue;   
  }   
    
                  t   =   (ST   *)malloc(sizeof(ST));