河內塔問題 #include<stdio.h> #include<stdlib.h> int fun_a(int) VOID fun_b(int,int,int,int) int main(VOID) { int n int option printf("題目二:河內塔問題\n") printf("請輸入要搬移的圓盤數目\n") scanf("%d",&n) printf("最少搬移的次數為%d次\n",fun_a(n)) printf("是否顯示移動過程? 是請輸入1,否則輸入0\n") scanf("%d",&option) if(option==1) { fun_b(n,1,2,3) } system("pause") return 0 } int fun_a(int n) { int sum1=2,sum2=0,i for(i=n i>1 i--) { sum1=sum1*2 } sum2=sum1-1 return sum2 } VOID fun_b(int n,int left,int mid,int right) { if(n==1) printf("把第%d個盤子從第%d座塔移動到第%d座塔\n",n,left,right) else { fun_b(n-1,left,right,mid) printf("把第%d個盤子從第%d座塔移動到第%d座塔\n",n,left,right) fun_b(n-1,mid,left,right) } }
上传时间: 2016-12-08
上传用户:努力努力再努力
指定一個數字轉換回十進位,八進位,十六進位#include <stdio.h> #include <stdlib.h> int main(VOID) { int number =89 printf("數字 %d\n",number) /* %d 為十進位輸出格式*/ printf("八進位為 %o\n",number) /* %o 為八進位輸出格式*/ printf("十六進位為%x\n",number) /* %x 為十六進位輸出格式*/ system("pause") return 0 }
上传时间: 2013-11-29
上传用户:tyler
//DS1302工作开始 VOID TimeWorkStart(VOID) { unsigned char val val = TimeByteRead(timereadseg) //读秒数据 val &= 0x7f //打开晶振 TimeWrieDisbale() //开放DS1302写保护 TimeByteWrite(timewriteseg, val) //打开晶振 TimeByteWrite(tricklewrite, 0xa5) //打开充电二极管 TimeWriteEnable() //使能DS1302写保护 }
标签: VOID TimeWorkStart TimeByteRead timereadseg
上传时间: 2013-12-11
上传用户:爺的气质
VOID UART_init() { //初始化串行口和波特率发生器 SCON =0x58 //选择串口工作方式,打开接收允许 TMOD =0x21 //定时器1工作在方式2,定时器0工作在方式1 TH1 =0xfd //实现波特率9600(系统时钟11.0592MHZ) TR1 =1 //启动定时器T1 ET1 =0 ES=1 //允许串行口中断 PS=1 //设计串行口中断优先级 EA =1 //单片机中断允许 }
上传时间: 2014-08-30
上传用户:彭玖华
VOID insert_sort(int *a,int n) { if(n==1) return insert_sort(a,n-1) int temp=a[n-1] for(int i=n-2 i>=0 i--) { if(temp<a[i]) a[i+1]=a[i] else break } a[i+1]=temp }
标签: insert_sort int return VOID
上传时间: 2014-01-22
上传用户:banyou
VOID Knight(int i , int j) { // printf("%d %dn",i,j) if (board[i][j] != 0 || i < 0 || i >= Size || j < 0 || j >= Size ) { return } step++ board[i][j]=step if (step == Size*Size) { showboard() system("PAUSE") return } //DFS Knight(i-2,j-1) //left Knight(i-2,j+1) Knight(i+2,j-1) //right Knight(i+2,j+1) Knight(i-1,j-2) //up Knight(i+1,j-2) Knight(i+1,j+2) //down Knight(i-1,j+2) // board[i][j]=0 step-- }
上传时间: 2014-01-17
上传用户:cxl274287265
.NET平台下专题地图实现的C#代码 private VOID 点密度图ToolStripMenuItem_Click(object sender, EventArgs e) { //获取当前图层 ,并把它设置成IGeoFeatureLayer的实例 IMap pMap = axMapControl1.Map ILayer pLayer = pMap.get_Layer(0) as IFeatureLayer IFeatureLayer pFeatureLayer = pLayer as IFeatureLayer IGeoFeatureLayer pGeoFeatureLayer = pLayer as IGeoFeatureLayer //获取图层上的feature IFeatureClass pFeatureClass = pFeatureLayer.FeatureClass IFeatureCursor pFeatureCursor = pFeatureClass.Search(null, false) IFeature pFeature = pFeatureCursor.NextFeature()
标签: ToolStripMenuItem_Click EventArgs private object
上传时间: 2013-11-27
上传用户:xlcky
Dijkstra最短路径 VOID output_path(int v)
标签: output_path Dijkstra VOID int
上传时间: 2013-12-25
上传用户:changeboy
:#include <stdlib.h>#include <stdio.h>#include <time.h> VOID InsertSort(int a[],int *(k1),int *(k2))//0:直接插入排序{ int i,j int temp *(k1)=0 *(k2)=0 for(i=0 i<149 i++) { temp=a[i+1] *(k2)++ ...
标签: include InsertSort gt lt
上传时间: 2014-11-30
上传用户:362279997
很多时候我们对VOID很不了解,这篇文章详细描述了VOID的功能。
标签: VOID
上传时间: 2013-12-21
上传用户:hfmm633