實(shí)驗(yàn)源代碼 //Warshall.cpp #include<stdio.h> void warshall(int k,int n) { int i , j, t; int temp[20][20]; for(int a=0;a<k;a++) { printf("請(qǐng)輸入矩陣第%d 行元素:",a); for(int b=0;b<n;b++) { scanf ("%d",&temp[a][b]); } } for(i=0;i<k;i++){ for( j=0;j<k;j++){ if(temp[ j][i]==1) { for(t=0;t<n;t++) { temp[ j][t]=temp[i][t]||temp[ j][t]; } } } } printf("可傳遞閉包關(guān)系矩陣是:\n"); for(i=0;i<k;i++) { for( j=0;j<n;j++) { printf("%d", temp[i][ j]); } printf("\n"); } } void main() { printf("利用 Warshall 算法求二元關(guān)系的可傳遞閉包\n"); void warshall(int,int); int k , n; printf("請(qǐng)輸入矩陣的行數(shù) i: "); scanf("%d",&k); 四川大學(xué)實(shí)驗(yàn)報(bào)告 printf("請(qǐng)輸入矩陣的列數(shù) j: "); scanf("%d",&n); warshall(k,n); }
標(biāo)簽： warshall 離散 實(shí)驗(yàn)
上傳時(shí)間： 2016-06-27
上傳用戶：梁雪文以
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*運(yùn)動(dòng)員*/ { char name[20]; int score; /*分?jǐn)?shù)*/ int range; /**/ int item; /*項(xiàng)目*/ }ATH; typedef struct schoolstruct /*學(xué)校*/ { int count; /*編號(hào)*/ int serial; /**/ int menscore; /*男選手分?jǐn)?shù)*/ int womenscore; /*女選手分?jǐn)?shù)*/ int totalscore; /*總分*/ ATH athlete[MaxSize]; /**/ struct schoolstruct *next; }SCH; int nsc,msp,wsp; int ntsp; int i,j; int overgame; int serial,range; int n; SCH *head,*pfirst,*psecond; int *phead=NULL,*pafirst=NULL,*pasecond=NULL; void create(); void input () { char answer; head = (SCH *)malloc(sizeof(SCH)); /**/ head->next = NULL; pfirst = head; answer = 'y'; while ( answer == 'y' ) { Is_Game_DoMain: printf("\nGET Top 5 when odd\nGET Top 3 when even"); printf("\n輸入運(yùn)動(dòng)項(xiàng)目序號(hào) (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n這個(gè)項(xiàng)目已經(jīng)存在請(qǐng)選擇其他的數(shù)字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n項(xiàng)目不存在"); printf("\n請(qǐng)重新輸入"); goto Is_Game_DoMain; } switch ( overgame%2 ) { case 0: n = 3;break; case 1: n = 5;break; } for ( i = 1 ; i <= n ; i++ ) { Is_Serial_DoMain: printf("\n輸入序號(hào) of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超過學(xué)校數(shù)目,請(qǐng)重新輸入"); goto Is_Serial_DoMain; } if ( head->next == NULL ) { create(); } psecond = head->next ; while ( psecond != NULL ) { if ( psecond->serial == serial ) { pfirst = psecond; pfirst->count = pfirst->count + 1; goto Store_Data; } else { psecond = psecond->next; } } create(); Store_Data: pfirst->athlete[pfirst->count].item = overgame; pfirst->athlete[pfirst->count].range = i; pfirst->serial = serial; printf("Input name:) : "); scanf("%s",pfirst->athlete[pfirst->count].name); } printf("\n繼續(xù)輸入運(yùn)動(dòng)項(xiàng)目(y&n)？"); answer = getchar(); printf("\n"); } } void calculate() /**/ { pfirst = head->next; while ( pfirst->next != NULL ) { for (i=1;i<=pfirst->count;i++) { if ( pfirst->athlete[i].item % 2 == 0 ) { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 5;break; case 2:pfirst->athlete[i].score = 3;break; case 3:pfirst->athlete[i].score = 2;break; } } else { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 7;break; case 2:pfirst->athlete[i].score = 5;break; case 3:pfirst->athlete[i].score = 3;break; case 4:pfirst->athlete[i].score = 2;break; case 5:pfirst->athlete[i].score = 1;break; } } if ( pfirst->athlete[i].item <=msp ) { pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score; } else { pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score; } } pfirst->totalscore = pfirst->menscore + pfirst->womenscore; pfirst = pfirst->next; } } void output() { pfirst = head->next; psecond = head->next; while ( pfirst->next != NULL ) { // clrscr(); printf("\n第%d號(hào)學(xué)校的結(jié)果成績(jī):",pfirst->serial); printf("\n\n項(xiàng)目的數(shù)目\t學(xué)校的名字\t分?jǐn)?shù)"); for (i=1;i<=ntsp;i++) { for (j=1;j<=pfirst->count;j++) { if ( pfirst->athlete[j].item == i ) { printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break; } } } printf("\n\n\n\t\t\t\t\t\t按任意建 進(jìn)入下一頁"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n運(yùn)動(dòng)會(huì)結(jié)果:\n\n學(xué)校編號(hào)\t男運(yùn)動(dòng)員成績(jī)\t女運(yùn)動(dòng)員成績(jī)\t總分"); pfirst = head->next; while ( pfirst->next != NULL ) { printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore); pfirst = pfirst->next; } printf("\n\n\n\t\t\t\t\t\t\t按任意建結(jié)束"); getchar(); } void create() { pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct)); pfirst->next = head->next ; head->next = pfirst ; pfirst->count = 1; pfirst->menscore = 0; pfirst->womenscore = 0; pfirst->totalscore = 0; } void Save() {FILE *fp; if((fp = fopen("school.dat","wb"))==NULL) {printf("can't open school.dat\n"); fclose(fp); return; } fwrite(pfirst,sizeof(SCH),10,fp); fclose(fp); printf("文件已經(jīng)成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 運(yùn)動(dòng)會(huì)分?jǐn)?shù)統(tǒng)計(jì)\n"); printf("輸入學(xué)校數(shù)目 (x>= 5):"); scanf("%d",&nsc); printf("輸入男選手的項(xiàng)目(x<=20):"); scanf("%d",&msp); printf("輸入女選手項(xiàng)目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
標(biāo)簽： 源代碼
上傳時(shí)間： 2016-12-28
上傳用戶：150501
#include<stdio.h> #define TREEMAX 100 typedef struct BT { char data; BT *lchild; BT *rchild; }BT; BT *CreateTree(); void Preorder(BT *T); void Postorder(BT *T); void Inorder(BT *T); void Leafnum(BT *T); void Nodenum(BT *T); int TreeDepth(BT *T); int count=0; void main() { BT *T=NULL; char ch1,ch2,a; ch1='y'; while(ch1=='y'||ch1=='y') { printf("\n"); printf("\n\t\t 二叉樹子系統(tǒng)"); printf("\n\t\t*****************************************"); printf("\n\t\t 1---------建二叉樹 "); printf("\n\t\t 2---------先序遍歷 "); printf("\n\t\t 3---------中序遍歷 "); printf("\n\t\t 4---------后序遍歷 "); printf("\n\t\t 5---------求葉子數(shù) "); printf("\n\t\t 6---------求結(jié)點(diǎn)數(shù) "); printf("\n\t\t 7---------求樹深度 "); printf("\n\t\t 0---------返 回 "); printf("\n\t\t*****************************************"); printf("\n\t\t 請(qǐng)選擇菜單號(hào) （0--7）"); scanf("%c",&ch2); getchar(); printf("\n"); switch(ch2) { case'1': printf("\n\t\t請(qǐng)按先序序列輸入二叉樹的結(jié)點(diǎn):\n"); printf("\n\t\t說明：輸入結(jié)點(diǎn)（‘0’代表后繼結(jié)點(diǎn)為空）后按回車。\n"); printf("\n\t\t請(qǐng)輸入根結(jié)點(diǎn):"); T=CreateTree(); printf("\n\t\t二叉樹成功建立！\n");break; case'2': printf("\n\t\t該二叉樹的先序遍歷序列為:"); Preorder(T);break; case'3': printf("\n\t\t該二叉樹的中序遍歷序列為:"); Inorder(T);break; case'4': printf("\n\t\t該二叉樹的后序遍歷序列為:"); Postorder(T);break; case'5': count=0;Leafnum(T); printf("\n\t\t該二叉樹有%d個(gè)葉子。\n",count);break; case'6': count=0;Nodenum(T); printf("\n\t\t該二叉樹總共有%d個(gè)結(jié)點(diǎn)。\n",count);break; case'7': printf("\n\t\t該樹的深度為:%d",TreeDepth(T)); break; case'0': ch1='n';break; default: printf("\n\t\t***請(qǐng)注意：輸入有誤！***"); } if(ch2!='0') { printf("\n\n\t\t按【Enter】鍵繼續(xù)，按任意鍵返回主菜單！\n"); a=getchar(); if(a!='\xA') { getchar(); ch1='n'; } } } } BT *CreateTree() { BT *t; char x; scanf("%c",&x); getchar(); if(x=='0') t=NULL; else { t=new BT; t->data=x; printf("\n\t\t請(qǐng)輸入%c結(jié)點(diǎn)的左子結(jié)點(diǎn):",t->data); t->lchild=CreateTree(); printf("\n\t\t請(qǐng)輸入%c結(jié)點(diǎn)的右子結(jié)點(diǎn):",t->data); t->rchild=CreateTree(); } return t; } void Preorder(BT *T) { if(T) { printf("%3c",T->data); Preorder(T->lchild); Preorder(T->rchild); } } void Inorder(BT *T) { if(T) { Inorder(T->lchild); printf("%3c",T->data); Inorder(T->rchild); } } void Postorder(BT *T) { if(T) { Postorder(T->lchild); Postorder(T->rchild); printf("%3c",T->data); } } void Leafnum(BT *T) { if(T) { if(T->lchild==NULL&&T->rchild==NULL) count++; Leafnum(T->lchild); Leafnum(T->rchild); } } void Nodenum(BT *T) { if(T) { count++; Nodenum(T->lchild); Nodenum(T->rchild); } } int TreeDepth(BT *T) { int ldep,rdep; if(T==NULL) return 0; else { ldep=TreeDepth(T->lchild); rdep=TreeDepth(T->rchild); if(ldep>rdep) return ldep+1; else return rdep+1; } }
上傳時(shí)間： 2020-06-11
上傳用戶：ccccy
隨著電力電子技術(shù)的飛速發(fā)展，高頻開關(guān)電源由于其諸多優(yōu)點(diǎn)已經(jīng)廣泛深入到國(guó)防、工業(yè)、民用等各個(gè)領(lǐng)域，與人們的工作、生活密切相關(guān)，由此引發(fā)的電網(wǎng)諧波污染也越來越受到人們的重視，對(duì)其性能，體積，效率，功率密度等的要求也越來越高。因此，研究具有高功率因數(shù)、高效率的ACDC變換技術(shù)，對(duì)于抑制諧波污染、節(jié)釣?zāi)茉醇皩?shí)現(xiàn)綠色電能變換具有重要意義通過分析目前功率因數(shù)校正PFC）技術(shù)與直流變換（DcDC）技術(shù)的研究現(xiàn)狀，采用了具有兩級(jí)結(jié)構(gòu)的AcDc變換技術(shù)，對(duì)PFC控制技術(shù)，直流變換軟開關(guān)實(shí)現(xiàn)等內(nèi)容進(jìn)行了研究。前級(jí)PFC部分采用先進(jìn)的單周期控制技術(shù)，通過對(duì)其應(yīng)用原理、穩(wěn)定性與優(yōu)勢(shì)性能的研究，實(shí)璄了主電路及控電路的參數(shù)設(shè)計(jì)與優(yōu)化，簡(jiǎn)化了PFC控制電路結(jié)構(gòu)、根據(jù)控制電路特點(diǎn)與系統(tǒng)環(huán)路穩(wěn)性要求，完成了電流環(huán)路與整個(gè)控制環(huán)路設(shè)計(jì)，確保了系統(tǒng)穩(wěn)定性，提高了系統(tǒng)動(dòng)態(tài)響應(yīng)。通過建立電路閉環(huán)仿真模型，驗(yàn)證了單周期控制抑制輸入電壓與負(fù)載擾動(dòng)的優(yōu)勢(shì)性能及連續(xù)功率因數(shù)校正的優(yōu)點(diǎn)，優(yōu)化了電路參數(shù)后級(jí)直流變換主電路采用LLC諧振拓?fù)洌ㄟ^變頻控制使直流變換環(huán)節(jié)具有軾開關(guān)特性。分析了不同開關(guān)頻率范圍內(nèi)電路工作原理，并建立了基波等效電路，采用基波分析法對(duì)VLc需城電路的電反增益性，輸入阻抗持性進(jìn)行了研究，確定了電路軟開關(guān)工作范圖。以基波分析結(jié)果為基礎(chǔ)進(jìn)行了合理的電路參數(shù)優(yōu)化設(shè)計(jì)，保證了直流變換環(huán)節(jié)在全輸入電壓范圍、全負(fù)載范圍內(nèi)能實(shí)現(xiàn)橋臂開關(guān)管零電壓開通zVS}，較大范圍內(nèi)邊整流二極管零電流關(guān)斷區(qū)CS），并將諧振電路中的電壓電流應(yīng)力降到最小，極大的提高了系統(tǒng)效率同時(shí)，為了提高系統(tǒng)功率密度，選擇了優(yōu)化的磁性元器件結(jié)構(gòu)，實(shí)現(xiàn)了諧振感性元件與變壓器的磁性器件集成，大大減小了變換電路的體積在理論研究與參數(shù)設(shè)計(jì)的基礎(chǔ)上，搭建了實(shí)驗(yàn)樣機(jī)，分別對(duì)PFC部分和DcDC部分進(jìn)行了實(shí)驗(yàn)驗(yàn)證與結(jié)果分析。經(jīng)實(shí)驗(yàn)驗(yàn)證ACDc變換電路功率因數(shù)在0.988以上，直瓿變換電路能實(shí)現(xiàn)全范圖軟開關(guān)，實(shí)現(xiàn)了高效率AcDC變換。關(guān)鍵詞：ACDC變換：功率因數(shù)校正：；高效率；LLC諧振電路：?jiǎn)沃芷诳刂?/p>
上傳時(shí)間： 2022-03-24
上傳用戶：
網(wǎng)絡(luò)監(jiān)控工具服務(wù)器端
標(biāo)簽：
上傳時(shí)間： 2015-01-19
上傳用戶：xcy122677
採(cǎi)用ROM監(jiān)控器的調(diào)試技巧分析
上傳時(shí)間： 2015-02-23
上傳用戶：wfl_yy
一般軟件做出來后,都只能在一個(gè)環(huán)境下，運(yùn)行（繁體或者簡(jiǎn)體）如我們加入Delphi的繁簡(jiǎn)轉(zhuǎn)換代碼,即可解決這個(gè)問題
標(biāo)簽：
上傳時(shí)間： 2014-11-15
上傳用戶：wanqunsheng
利用msp430作網(wǎng)路資料傳輸,可監(jiān)控溫度..,的源碼
上傳時(shí)間： 2013-12-10
上傳用戶：冇尾飛鉈
embedded visual C++和基本的OpenGLES設(shè)定環(huán)境程式
標(biāo)簽： embedded OpenGLES visual 程式
上傳時(shí)間： 2014-01-16
上傳用戶：wanqunsheng
rtems 於 Redhat 9.0 上的開發(fā)環(huán)境建立步驟
上傳時(shí)間： 2013-12-10
上傳用戶：亞亞娟娟123
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
