#include "stdafx.h"
#include
using namespace std;
class Teacher
{
public:
char name[20];
Teacher * tnext;
Teacher (char * name):tnext(tnext=NULL)
{
strcpy(this->name,name);
}
void Display()
{
cout<<name;
}
};
class Course
{
public:
char name[20];
Course * next;
Teacher * thead;
Course(char * name):thead(thead=NULL),next(next=NULL)
{
strcpy(this->name,name);
}
void Display()
{
cout<<name;
}
};
int _tmain(int argc, _TCHAR* argv[])
{
Course * head=NULL,*before;
Teacher * te=NULL,* pre;
FILE fp=fopen("E:\VC++\heminglen\组合排序test.txt","r");
do
{
char name[20];
fscanf(fp,"%s",name);
Course * temp= new Course (name);
do
{
fscanf(fp,"%s",name);
te=new Teacher (name);
if(strncmp(te->name,"end",3)==0)break;
else
{
if(NULL == temp->thead)
temp->thead=te;
else{pre->tnext=te;}
pre=te;
}
}
while (strncmp(te->name,"end",3)!=0);
if (NULL==head)
head= temp;
else
{
before->next=temp;
}
before=temp;
}
while(!feof(fp));
/*long int a=0;
Course * k=head,*u,*v,*w;
Teacher * p, q,*r,*s;
for(p=k->thead;p!=NULL;p=p->tnext)
for(q=k->next->thead;q!=NULL;q=q->tnext)
for(r=k->next->next->thead;r!=NULL;r=r->tnext)
for(s=k->next->next->next->thead;s!=NULL;s=s->tnext)
{
a+=1;
printf ("%ld",a);
printf("\n");
}
printf("=================================\n");*/
本意对如下原始文件
数学 赵老师 钱老师 end
语文 孙老师 李老师 end
历史 何老师 郑老师 end
化学 华老师 王老师 end
输出选课老师所有组合可能 如上有81种
现在需要输出所有的可能组合 需要通用方法 用链就是为了可扩展
