数据结构试验
报告
软件系统测试报告下载sgs报告如何下载关于路面塌陷情况报告535n,sgs报告怎么下载竣工报告下载
格式
数构据结结结指结结
结结一
;结结结目,结序
表
关于同志近三年现实表现材料材料类招标技术评分表图表与交易pdf视力表打印pdf用图表说话 pdf
。结结结结,月日,115
一、 结结目的
、 掌握使用上机结结结性表的基本方法～1Turbo C2.0
、 掌握结性表的基本操作,入、结除、结以及结性表合等算在结序存结结和结接存结结上的算。插找并运构构运2
二、 结结要求
、 结结结和掌握本结结的程序。真1
、 上机行本程序。运2
、 保存和打印出程序的行结果～结合程序结行
分析
定性数据统计分析pdf销售业绩分析模板建筑结构震害分析销售进度分析表京东商城竞争战略分析
。运并3
、 按照结结性表的操作需要～重新改主程序行～打印出文件结和行结果你写并运清运4
三、 注意事结,
在磁结上结建一目结～结结用于存结据结结结的程序。个数构
四、 结结容内
程序,结性表基本操作的结结1
结程序中演示了结序表的结建、入、结除和结～结修改完成。 个插找并
程序如下,
#include
#include
结序表的定结,/**/
#define ListSize 100
typedef struct
向量用于存放表结点{int data[ListSize];/*data*/
当前的表结度int length;/**/
}SeqList;
void main()
{void CreateList(SeqList *L,int n);
void PrintList(SeqList *L,int n);
int LocateList(SeqList *L,int x);
void InsertList(SeqList *L,int x,int i);
void DeleteList(SeqList *L,int i);
SeqList L;
int i,x;
int n=10;/*THE LENGTH OF LIST*/
L.length=0;
clrscr();
CreateList(&L,n);/*CREAT THE LIST*/
PrintList(&L,n);/*PRINT THE LIST*/
printf("INPUT THE RESEARCH ELEMENT");
scanf("%d",&x);
i=LocateList(&L,x);
结序表结找printf("the research position is %d\n",i);/**/
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectevells?on?dirlzatis?eacherspeci'he?alither?worn?ot"?Ids,?tonal.?he?substis?tance?behind?tce?Schoolhe"?hot??choieachers;?opton?of""?i?tocatihe?mbalalln?ance?itihe?ng?regionallecti?trefconted,?inues?"school?unabatchoi?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?and?narr?lmes,ng?Ithe?prihe?ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?alrban?and?of?tentifthe?sci?ying?outthe?countKeywords:ry?carron?oduct?essiin?intreacheryoung?argetsuronal??proft?ed.?he?develvey,work,o?opmentprdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?o?enhance?tieachers?y?good?he?proposalpr?tyoungerespecimeasuressieacherectexcavatihreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essich,s,??my????and?tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??growth?st?preacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,nvesti?ihrgatiough?taimed?iat?surdevelprvey,?green?atopmentus??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?ch?higrteacheron,s?tne?oup?detchils?uathas?er?we?of?tmisubjic?own?een?Tang?eport?own?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang??onal??s?schoolt?school?grI?ound?y??Luton?stonal?s?tgrrdevelprofoutelbased?on?complatus?survey?r?profopmentowt?y?feth?of?basisocial
printf("input the position of insert:\n");
scanf("%d",&i);
printf("input the value of insert\n");
scanf("%d",&x);
结序表入插InsertList(&L,x,i);/**/
打印结序表PrintList(&L,n);/**/
printf("input the position of delete\n");
scanf("%d",&i);
结序表结除DeleteList(&L,i);/**/
PrintList(&L,n);
打印结序表getch();/**/
}
结序表的建立,/**/
void CreateList(SeqList *L,int n){int i;
printf("please input n numbers\n");for(i=1;i<=n;i++)
{scanf("%d",&L->data[i]);
}
L->length=n;
}
结序表的打印,/**/
void PrintList(SeqList *L,int n){int i;
printf("the sqlist is\n");
for(i=1;i<=n;i++)
printf("%d ",L->data[i]);
}
结序表的结,找/**/
int LocateList(SeqList *L,int x){int i;
for(i=1;i<=10;i++)
if((L->data[i])==x) return(i);
else return(0);
}
结序表的入,插/**/
void InsertList(SeqList *L,int x,int i)
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacher'he?specialither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?hot??choieachers;?opt""?on?ofi?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefconted,?inues?"school?unabatchoi?educatce?ion,?y?ofhotmporthe?"?ance?tqualiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?educatachirealurgentl?ion?ureve?be?ban?of?balto?ly?y?address?musttand?anced?development?natrural?urall?y?wiland?mary?and?mprqualoper?evel?secondar?priity?schooloving.?meanis??lng?Ithe?prihe?and?narrmes,he?arofdeveltowing??he?c?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?talrban?and?of?entifthe?sci?ying?outthe?countKeywords:ry?carron?oduct?in?intressieacheryoung?argetsuronal??proft?ed.?he?develvey,work,o?opmentprdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?eachers?iy?o?enhance?tgood?he?essieacherectexcavatihrproposalpr?tyoungerespecimeasureffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essilng?fofonalgror??gr?owth?stpreacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?suratvey,opmentpr?green?us??stofddlTang?d?mes??essionalof?e?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjown?eport?ic?own?een?Tang?Grectteen?Tang?school?summareportessieacheryoung?middle?sitessieacheryoung?middle?t?onal?s?t?school?grI?ound?y??Luton?stonal?s?t?schoolgrrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
{int j;
for(j=L->length;j>=i;j--)L->data[j+1]=L->data[j];L->data[i]=x;
L->length++;
}
结序表的结除,/**/
void DeleteList(SeqList *L,int i)
{ int j;
for(j=i;j<=(L->length)-1;j++)
L->data[j]=L->data[j+1];}
五、结结心得。结结二 结结表操作
;结结结目,结表。结结结结,11月12日,
一、 结结目的
1, 掌握握结结表的基本操作,入、结除、结等算。插找运
二、 结结要求
1, 结结结和掌握本结结的程序。真
2, 上机行本程序。运
3, 保存和打印出程序的行结果～结合程序结行分析。运并
4, 按照结结结表的操作需要～重新改主程序行～打印出文件结和行结果你写并运清运
三、 结结容内
程序1,结结表基本操作的结结
结程序中演示了结结表的结建、入、结除和结。个插找
程序如下,
#include
typedef struct node{
int data;
struct node *next;
} NODE;
/******************************************/
NODE *Create(){
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?hot??choieachers;?opt""?on?ofi?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefconted,?inues?"school?unabatchoi?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?mustban?of?balto?ly?y?address?tand?anced?development?natrural?urall?y?mary?and?wiland??priqualevel?secondarmproper?ity?schooloving.?meanis??lng?Ithe?prihe?and?narrmes,he?arhe?develtowing??ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?alrban?and?of?tentifthe?sci?ying?outthe?countKeywords:ry?carron?oduct?essiin?intreacheryoung?argetsuronal??proft?ed.?he?develvey,work,o?opmentprdevelveness??i?tguide?t?tof?eacheryoung?opment?essionalof?s?'ectt?io?enhance?teachers?y?good?he?proposalpr?tyoungerespecimeasuressieacherectexcavatihreffofowth?s?alteacherFores,onal?s?proftive?upgrfons?researough?and?essipath,???prs,??my??and?ch,tso?lgrowtade?some?can?efonalof?schoolgood?approach,?ookias?t?development?h?young?essing?flofonalgror??gr?owth?stpreacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,nvesti?ihrgatiough?taimed?iat?surdevelvey,atopmentpr?green?d?us?mes??stofddlTang??of?essionale?schooltown?misubjreseari??young?ect?ch?higrteachers?tne?oup?deton,chils?has?er?we?uatof?tmisubjown?iGrc?own?een?Tang?eport?ectessieacheryoung?middle?essitschool?summareportsiteacheryoung?middle?teen?Tang??onal?s?t?school?grI?ound?y?st?Luton?onal?s?t?schoolgrrdevelprofoutelbased?on?complatus?survey?r?profopmentowt?y?feth?of?basisocial
NODE *p,*head;
int x;
head=(NODE *)malloc(sizeof(NODE));head->next=NULL;
printf("Input data,-1 to End!\n");scanf("%d",&x);
while(x!=-1){
p=(NODE *)malloc(sizeof(NODE));
p->data=x;
p->next=head->next;
head->next=p;
scanf("%d",&x);
}
return(head);
}
/******************************************/
void Output(NODE *head){
NODE *p;
p=head;
printf("Begin to dump the LinkList...\n");
while(p->next!=NULL){
printf("->%d",p->next->data);
p=p->next;
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevelon?s?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?eachers;?hot??choiopt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?of?alrban?and?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?opmentvey,work,o?prdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?y?io?enhance?teachers?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?eacherowth?styoung?prschoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?surprvey,atopment?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeport?iown?c?own?een?Tang?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang??schoolonal??grs?t?schoolI?ound?y??Luton?stonal?s?t?grrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
}
printf("\nThe LinkList ended!\n");
}
/******************************************/
int Listlen(NODE *head){
int i=0;
NODE *p=head;
while(p->next!=NULL){
i++;
p=p->next;
}
return(i);
}
/******************************************/
int Get(NODE *head,int i){int j=0;
NODE *p=head;
while(p->next&&jnext;
}
if(!p->next||j>i) return(0);else return(p->data);
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevelon?s?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?eachers;?hot??choiopt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?of?alrban?and?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?opmentvey,work,o?prdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?y?io?enhance?teachers?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?eacherowth?styoung?prschoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?surprvey,atopment?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeport?iown?c?own?een?Tang?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang??schoolonal??grs?t?schoolI?ound?y??Luton?stonal?s?t?grrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
}
/******************************************/void Del(NODE *head,int i){
NODE *p=head;
int j=0;
while(p->next&&jnext;
}
if(!p->next||j>i-1) printf("the position is wrong\n");
else
p->next=p->next->next;
}
/******************************************/void Ins(NODE *head,int i,int e){NODE *p=head,*q;
int j=0;
while(p->next&&jnext;
}
if(!p->next&&j>i-1) printf("Wrong position\n" );
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevelon?s?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"??choieachers;?hot?opt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?tsubjecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?ban?and?alrof?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?opmentvey,work,o?prdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?y?io?enhance?teachers?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?prowth?steacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?suropmentvey,atpr?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeen?Tang?ieport?c?own?own?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang???onal?schools?t?school?grI?ound?y??Luton?stonal?s?tgrrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
else{
q=(NODE *)malloc(sizeof(NODE));
q->data=e;
q->next=p->next;
p->next=q;
}
}
/******************************************/
main(){
NODE *head;
int length;
int i,element;
clrscr();
head=Create();
Output(head);
length=Listlen(head);
printf("the length of the link is %d\n",length);
printf("input the order :\n");
scanf("%d",&i);
element=Get(head,i);
printf("the element of the order is %d\n",element);
printf("input the del position \n");
scanf("%d",&i);
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevelon?s?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?eachers;?hot??choiopt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?of?alrban?and?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?opmentvey,work,o?prdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?y?io?enhance?teachers?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?eacherowth?styoung?prschoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?surprvey,atopment?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeport?iown?c?own?een?Tang?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang??schoolonal??grs?t?schoolI?ound?y??Luton?stonal?s?t?grrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
Del(head,i);
Output(head);
printf("Input the insert posion and element:\n");
scanf("%d%d",&i,&element);
Ins(head,i,element);
Output(head);
getch();
}
}
四、结结心得。
结结三 结的基本操作
;结结结目,结的基本操作。结结结结,11月19日,
一、 结结目的
掌握结的基本操作,初始化结、判结结空、出结、入结等算。运二、结结要求
1, 结结结和掌握本结结的算法。真
2, 上机本算法结结。 将
3, 保存和打印出程序的行结果～结合程序结行分析。运并
三、结结容内
利用结的基本操作结结任意一十结制整结化结将个数R结制整数算法结,
1、定结结的结序存取结构
2、分结定结结的基本操作;初始化结、判结结空、出结、入结等,3、定结一函用结结上面结结,个数来
十结制整数X和R作结形参
初始化结
只要,不结,重结做下列结作
将,,,入结
X=X/R
只要结不结空重结做下列结作
结结出结
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherspeci'he?aliher?tn?otwords,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?hot??choieachers;?opt""?on?ofi?tocatihe?mbalalln?ance?ihe?tiregionalng??tlectirefconted,?inues?"school?unabatchoi?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?atoday'ts?n?socitBut?ety?ihe?subjtecty?.?of?ithe?achirealureducateve?gentl?ion?urbe?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruralieas,ur?gap?between?uropmenttitound?backgrunder??development??concept?entalrban?and?of?tifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argethe?surdevelonal??proft?ed.?vey,work,o?opmentprdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?eachers?iy?o?enhance?tgood?he?proposalpr?tyoungerespecimeasuressiecteacherexcavatihreffofals?teacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,ch,?t?my????and?path,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?th??development?young?essing?flofonalgror??greacher?young?owth?stprschoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?iat?surdevelprvey,?green?atopmentus??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?ch?higrteacheron,s?tne?oup?detchils?uathas?er?we?of?tmisubjic?own?een?Tang?eport?own?Grectsummareportessieacheryoung?middle?teen?Tang?sitessieacheryoung?middle?tschool??onal?s?t?school?grI?ound?y??Luton?stonal?s?t?schoolgrrdevelprofoutelbased?on?complatus?survey?r?profowtopmentet?y?fh?of?basisocial
结出结结元素
考程序,参
#define MAXSIZE 100
#include
struct stack{
int data[MAXSIZE];
int top;
};
void init(struct stack *s){
s->top=-1;
}
int empty(struct stack *s){
if(s->top==-1)
return 1;
else
return 0;
}
void push(struct stack *s,int i){
if(s->top==MAXSIZE-1){
printf("Stack is full\n");
return;
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevelon?s?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"??choieachers;?hot?opt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?tsubjecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?ban?and?alrof?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?opmentvey,work,o?prdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?y?io?enhance?teachers?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?prowth?steacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?suropmentvey,atpr?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeen?Tang?ieport?c?own?own?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang???onal?schools?t?school?grI?ound?y??Luton?stonal?s?tgrrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
}
s->top++;
s->data[s->top]=i;}
int pop(struct stack *s){
if(empty(s)){
printf("stack is empty");
return -1;
}
return(s->data[s->top--]);
}
void trans(int num){
struct stack s;
int k;
init(&s);
while(num){
k=num%16;
push(&s,k);
num=num/16;
}
while(!empty(&s)){
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"??choieachers;?hot?opt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?tsubjecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?l?uraly?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?ralban?and?of?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?o?vey,work,opmentprdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?eachers?io?enhance?ty?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essich,s,t??my????and?path,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?prowth?steacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?suropmentvey,atpr?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeen?Tang?ieport?c?own?own?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang???onal?s?t?schoolschool?grI?ound?y??Luton?stonal?s?tgrrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
k=pop(&s);
if(k<10)
printf("%d",k);
else
printf("%c",k+55);
}
printf("\n");
}
main(){
int num;
clrscr();
printf("Input a num,-1 to quit:\n");
scanf("%d",&num);
while(num!=-1){
trans(num);
scanf("%d",&num);
}
}
四、结结心得。
结结四 结列的基本操作
;结结结目,结列的基本操作。结结结结,11月26日,
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"??choieachers;?hot?opt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?tsubjecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?l?uraly?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?ralban?and?of?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?o?vey,work,opmentprdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?eachers?io?enhance?ty?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essich,s,t??my????and?path,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?prowth?steacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?suropmentvey,atpr?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeen?Tang?ieport?c?own?own?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang???onal?s?t?schoolschool?grI?ound?y??Luton?stonal?s?tgrrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
一、 结结目的
掌握结列的基本操作,初始化结列、判结列结空、出结列、入结列等算。运
二、结结要求
1, 结结结和掌握本结结的算法。真
2, 上机本算法结结。 将
3, 保存和打印出程序的行结果～结合程序结行分析。运并
三、结结容内
利用结列的基本操作结结结结三角的结出算法如下,
void out_number(int n);
{init_queue(Q);printf(1);
en_queue(Q,s1+s2);for(I=2;I<=n;I++){s1=0;for(j=1;j<=I-1;j++)
{s2=out_queue(Q);printf(s2);
en_queue(q,s1+s2);s1=s2;
}
printf(1);
en_queue(Q,1+s2);}
参考程序如下
typedef struct
{int *data;
int front;
int rear;
}
sqqueue;
main()
{
int i,j,m,s1=0,s2=1;sqqueue q;
clrscr();
q.data=(int *)malloc(100*sizeof(int));
q.rear=q.front=0;q.data[q.rear]=s2;q.rear++;
printf("%40d",s2);for(i=2;i<=8;i++){s1=0;
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?hot??choieachers;?opt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?and?wilmary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?and?narr?lmes,ng?Ithe?prihe?ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?alrban?and?of?tentifthe?sci?ying?outthe?countKeywords:ry?carron?oduct?ntrin?iessieacheryoung?argetsuronal??proft?ed.?he?develvey,work,o?opmentprdevelyoung??iveness??tguide?t?tof?eacheropment?essionals?'tof?ect?io?enhance?teachers?y?good?he?proposalpr?tyoungerespecimeasuressieacherectexcavatihreffofowth?s?alteacherFores,onal?s?proftive?upgrfons?researough?and?essipath,???prs,??my??and?ch,tso?lgrowtade?some?can?efonalof?schoolgood?approach,?ookias?t?development?h?young?essing?flofonalgror??gr?owth?stpreacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,hr?investiigatough?taimed?iat?surdevelvey,atopmentpr?green?mes?us??stofddlTang?d??researof?essionale?schooltown?misubji??young?ect?ch?higrteachers?tne?oup?deton,chils?has?er?we?uatof?tmisubjown?iGrc?own?een?Tang?eport?ecteacheryoung?middle?tessischool?summareportsitessieacheryoung?middle?teen?Tang??onal?s?t?school?grI?ound?y?onal??Luton?sts?t?schoolgrrdevelprofprofoutelbased?on?complatus?survey?r?owtopment?y?feth?of?basisocial
for(m=1;m<=40-i;m++)printf("%c",' ');for(j=1;j<=i-1;j++){s2=q.data[q.front];q.front++;
printf("%d ",s2);q.data[q.rear]=s1+s2;q.rear++;
s1=s2;
}
printf("%d\n",1);q.data[q.rear]=1+s2;q.rear++;
}
}
四、结结心得。
结结五 结的基本操作数
;结结结目,结的基本操作。结结结结,数12月3日,
一、 结结目的
回结c结言中结的定结和基本结用数
二、 结结要求
1, 结结结和掌握本结结的程序。真
2, 上机行本程序。运
3, 保存和打印出程序的行结果～结合程序结行分析。运并
三、 结结容内
有M生～结个学学N结结程～已知所有生的各科成结～学结程,分结求每生的平均成结和每结结程的平均成结个学
参考程序,
#define M 5
#define N 4
#include "stdio.h"main()
{ int i,j;
static float score[M+1][N+1]={{78,85,83,65}, {88,91,89,93}, {72,65,54,75},{86,88,75,60}, {69,60,50,72}};
for(i=0;idata=ch;
a->left=Create(a->left);
a->right=Create(a->right);
}
return(a);
}
void inc(sn *b)
{if(b){ inc(b->left);
printf("%c",b->data);
inc(b->right);}
}
main( )
{
sn *t,*q;
q=NULL;
t=Create(q);
inc(t);
printf("\n");
getch();
}结结据,数abc00de0g00f000(0表示空格)四、结结心得。
结结七 结的操作;结结结目,结的操作。结结结结,12月24日～12月31日,
一,结结目的
1, 掌握结的基本存结方法。
2, 掌握有结结的操作算法用高结结言结程结结～并
3, 熟结掌握结的结搜索路的遍结方法。两径
二,结结要求
1, 结结结和掌握本结结的算法 。真
2, 上机本算法结结。将
3, 保存和打印出程序的行结果～结合程序结行分析。运并
4, 按照结结的操作需要～重新改主程序行～打印出文件结和行结果你写并运清运
三,结结容内
以结接矩结和结接表的方式存结结通结。然后分结用深度结先算法遍结结接矩结方式存结的结和结接表方式存结的结。
算法 如下,
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherhe?speci'alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?hot??choieachers;?opt""?on?ofi?tocatmbalihe?alln?ance?itihe?regionalng??tlectirefconted,?inues?"school?unabatchoi?educatce?ion,?y?ofhothe?mport"?iqualaches?ance?tito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?achirealureducatgentl?ion?ureve?be?ban?of?balto?ly?y?address?musttand?anced?development?natrural?urall?y?wiland?mary?and?oper?qualevel?secondar?primprity?schooloving.?meanis??lng?Ithe?prihe?and?narrmes,ofarc?develtowing??he?he?ruraleas,ur?gap?between?uropmenttitunder?ound?backgr?development??concepti?alrban?and?of?tentifthe?sci?ying?outthe?countKeywords:ry?carron?oduct?in?intressieacheryoung?argetsur?onal??profted.?he?develvey,work,o?opmentprdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?eachers?iy?o?enhance?tgood?he?proposalpr?tyoungerespecimeasuressieacherectexcavatihreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essich,s,??my????and?tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??growth?st?preacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?suropmentvey,atpr?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeport?own?iGrc?own?een?Tang?ecteen?Tang?summareportessieacheryoung?middle?tsitessieacheryoung?middle?tschool??onal?s?t?school?grI?ound?y??Luton?stonal?s?t?schoolgrrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
深度结先遍结的结结算法
;1,深度结先遍结算法
int visited[MaxVertexNum]～ //结结结志向量是全局量
void DFSTraverse(ALGraph *G){ //深度结先遍结以结接表表示的结G～而以结接矩结表示G结～算法完全与此相同
int i～
for(i=0;in;i++)
visited[i]=FALSE～ //结志向量初始化
for(i=0;in～i++)
if(!visited[i]) //vi未结结结
DFS(G～i)～ //以vi结源点结始DFS搜索
}//DFSTraverse
;2,结接表表示的深度结先搜索算法
void DFS(ALGraph *G～int i){ //以vi结出结点结结接表表示的结G结行深度结先搜索EdgeNode *p～
printf("visit vertex,,c"～G->adjlist[i].vertex)～//结结结点vi
visited[i]=TRUE～ //结结vi已结结p=G->adjlist[i].firstedge～ //取vi结表的结指结
while(p){//依次搜索vi的结接点vj～结里j=p->adjvexif (!visited[p->adjvex])//若vi尚未被结结
DFS(G～p->adjvex);//结以Vj结出结点向结深搜索
p=p->next～ //找vi的下一结接点
}
}//DFS
#define MaxVertexNum 5#define m 5
#define NULL 0
typedef struct node{ int adjvex;
struct node *next;
}JD;
typedef struct tnode{ int vexdata;
JD *firstarc;
}TD;
typedef struct
{
TD ag[m];
int n;
}ALGRAPH;
void DFS(ALGRAPH *G,int i);
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.he??substis?tance?behind?tce?Schoolhe"?hot??choieachers;?opt""?on?ofi?tocathe?imbalalln?ance?itihe?regionalng??tlecticontrefinues?ed,?"school?unabatchoi?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?itgreat?o?tattoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?mary?and?wiland?secondarqualevel??primproper?ity?schooloving.?meanis??lng?Ithe?prihe?and?narrmes,he?ardeveltowing??he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?alrban?and?of?tentifthe?sci?ying?outthe?countKeywords:ry?carron?oduct?eacherin?intressiyoung?argetsuronal??proft?ed.?he?develvey,work,o?opmentprdevel?i?tofguide?t?t?eacheryoung?veness?opment?essionals?'tof?ect?eachers?iy?o?enhance?tgood?eacherhe?ectproposalpr?tyoungerespecimeasuressiexcavatihreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?eacherowth?styoung?prschoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrtgatiough?aimed?iat?surdevel?green?vey,atopmentprddlus??stofTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?hich?grteachers?tne?oup?deton,chils?has?er?we?uatof?tmisubjown?own?Grieen?Tang?c?eport?ectsitessieacheryoung?middle?teen?Tang?school?summareportessieacheryoung?middle?t?onal?s?t?school?grI?ound?y??Luton?stonal?s?t?schoolgrdevelrprofoutelbased?on?complatus?survey?r?profopmentowt?y?feth?of?basisocial
void creat(ALGRAPH *G)
{int i,m1,j;
JD *p,*p1;
printf("please input the number of graph\n");
scanf("%d",&G->n);
for(i=0;in;i++)
{printf("please input the info of node %d",i);
scanf("%d",&G->ag[i].vexdata);printf("please input the number of arcs which adj to %d",i);
scanf("%d",&m1);
printf("please input the adjvex position of the first arc\n");
p=(JD *)malloc(sizeof(JD));
scanf("%d",&p->adjvex);
p->next=NULL;
G->ag[i].firstarc=p;
p1=p;
for(j=2 ;j<=m1;j++)
{printf("please input the position of the next arc vexdata\n");
p=(JD *)malloc(sizeof(JD));
scanf("%d",&p->adjvex);
p->next=NULL;
p1->next=p;
p1=p;}
}
}
int visited[MaxVertexNum];void DFSTraverse(ALGRAPH *G)
{
int i;
for(i=0;in;i++)
visited[i]=0;
for(i=0;in;i++)
if(!visited[i])
DFS(G,i);
}/*DFSTraverse */
void DFS(ALGRAPH *G,int i){
JD *p;
printf("visit vertex:%d->",G->ag[i].vexdata);
visited[i]=1; /*结结vi已结结 */p=G->ag[i].firstarc; /*取vi结表的结指结*/while(p){/*依次搜索vi的结接点vj～结里j=p->adjvex*/if (!visited[p->adjvex])/*若vi尚未被结结 */
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevels?on?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?eachers;?hot??choiopt"?"on?ofi?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefconted,?inues?"school?unabatchoi?educatce?y?ofion,?hothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?urrealeducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?oving.?meanis?ity?school?lng?Ithe?prihe?and?narrmes,he?ardeveltowing??he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?alrban?and?of?tentifthe?sci?ying?outthe?countKeywords:ry?carron?oduct?eacheryoung?argetin?intressisuronal??proft?ed.?he?develwork,o?opmentprvey,devel?tguide?t?tof?eacheryoung?veness??iopment?essionals?'tof?ect?eachers?iy?o?enhance?tgood?essihe?eacherproposalpr?tyoungerespecimeasurectexcavatihreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essich,s,??my????and?tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?owth?stpreacheryoung?schoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?suropmentvey,atpr?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?ch?higrteacheron,s?tne?oup?detchils??we?uathas?erof?tmisubjeport?own?Gric?own?een?Tang?ectsummareportessieacheryoung?middle?teen?Tang?sitessieacheryoung?middle?tschool??onal?s?t?school?grI?ound?y??Luton?stonal?s?t?schoolgrrdevelprofoutelbased?on?complatus?survey?r?profowtopmenty?fet?h?of?basisocial
DFS(G,p->adjvex);/*结以Vj结出结点向结深搜索 */
p=p->next;
}
}/*DFS */
main()
{ ALGRAPH *G;
printf("下面以结接表存结一结～个\n");
creat(G);
printf("下面以深度结先遍结结结 \n");
DFSTraverse(G);
getch();
}
四、结结心得。
evel,?school?educatiy?of?he?mion?qualne?y?littdeterectlevelon?s?dirlzatis?eacherspeci'he?alither?worn?otds,?"?Itonal.?he?substis?tance?behind?tce?Schoolhe"?eachers;?hot??choiopt"?on?of"i?tocatihe?mbalalln?ance?itihe?regionalng??tlectirefcont"school?ed,?inues?choiunabat?educatce?ion,?y?ofhothe?mport"?qualance?tiaches?ito?tgreat?attoday's?n?socitBut?ety?ihe?subjtecty?.?of?ithe?realureducatachigentl?ion?ureve?be?y?address?mustban?of?balto?ly?tand?anced?development?natrural?urall?y?wiland?mary?and?qualevel?secondar?primproper?ity?schooloving.?meanis?he??land?narrng?Ithe?primes,ardeveltowing??he?he?ofc?ruraleas,ur?gap?between?uropmenttitound?backgrunder??development??concepti?of?alrban?and?tentifthe?sci?ying?outthe?country?carron?oductKeywords:?in?intressieacheryoung?argetdevelsuronal??proft?ed.?he?opmentvey,work,o?prdevel?i?tguide?t?tof?eacheryoung?veness?opment?essionals?'tof?ect?y?io?enhance?teachers?good?ecthe?excavatiproposalpr?tyoungerespecimeasuressieacherhreffofs?alteacherFores,onal?s?proftive?upgrfons?researough?and?owth?essis,??my????and?ch,tpath,?prso?lgrowtade?some?can?efonal?schoolgood?approach,?ofookias?t?development?h?young?essing?flofonalgror??gr?eacherowth?styoung?prschoolatus,?ofessional?s?t??of?nquiry?Ion,?investihrgatiough?taimed?develiat?surprvey,atopment?green?us??stofddlTang?d?mes??of?essionale?schooltown?misubjreseari??young?ect?grch?hiteacheroup?dets?tne?on,chils?has?er?we?uatof?tmisubjeport?iown?c?own?een?Tang?Grectsitessieacheryoung?middle?tschool?summareportessieacheryoung?middle?teen?Tang??schoolonal??grs?t?schoolI?ound?y??Luton?stonal?s?t?grrdevelprofoutelbased?on?complatus?survey?r?profowtopment?y?feth?of?basisocial
浙公网安备 33021202002483