dididisailor的博客

#include <stdio.h> int Coconut(int n); int main() { printf("y = %d\n",Coconut(5)); return 0; } int Coconut(int n) { int i = 1; float x=1,y; y = n*x+1; do{ y=y*n/(n-1)+1; i++;

#include<stdio.h> //#include<malloc.h> #include<stdlib.h> typedef struct Node { int data; struct Node * pnext; }NODE, * PNODE; PNODE create_list() { PNODE phead=(PNODE)malloc(sizeof(NODE));

#include <stdio.h> #include <Stdlib.h> typedef struct node { int data; struct node *pNext; }NODE,*PNODE; typedef struct Stack { PNODE pTop; PNODE pBottom; }STACK,* PSTACK; void init(PST

#include <stdio.h> #include <Stdlib.h> typedef struct node { int data; struct node *pNext; }NODE,*PNODE; typedef struct Stack { PNODE pTop; PNODE pBottom; }STACK,* PSTACK; void init(PST

#include <stdio.h> #include <Stdlib.h> typedef struct node { int data; struct node *pNext; }NODE,*PNODE; typedef struct Stack { PNODE pTop; PNODE pBottom; }STACK,* PSTACK; void init(PST

#include <stdio.h> #include <malloc.h> #include <stdlib.h>typedef struct node { int * base; int * top; int stacksize; }Sqstack; void InitStack(Sqstack *S) { S->base = (int *)malloc(size

#include <stdio.h> #include <malloc.h>typedef struct node { int data; struct node * next; }Node;int main() { Node * Head; Node * q; Node * last; Node * delet; Head = (Node*)

#include <stdio.h> #include <stdlib.h> typedef char TElmType; typedef struct BiNode{ TElmType data; struct BiNode *lchild,*rchild; }BiTNode,*BiTree; void CreateBiTree(BiTree *T) { TElmType

int Depth(BiTree *T) { int d=0; if (*T) { int ld = Depth(&((*T)->lchild)); int rd = Depth(&((*T)->rchild)); d = ld >= rd ? (ld+1) : (rd+1); } return d; } ld和rd在这

void DestroyBiTree(BiTree *T) { if (*T) { if ((*T)->lchild) DestroyBiTree(&((*T)->lchild)); if ((*T)->rchild) DestroyBiTree(&((*T)->rchild)); free(*T);

#include <stdio.h> #include <stdlib.h> typedef char TElmType; typedef struct BiNode{ TElmType data; struct BiNode *lchild,*rchild; }BiTNode,*BiTree;void CreateBiTree(BiTree *T) { TElmType c

#include <stdio.h> #include <stdlib.h> #define MAXVEX 20 typedef char VertexType; typedef int EdgeType; typedef struct EdgeNode{ int adjvex; // EdgeType weight;//权值 struct EdgeNode * ne

#include <stdio.h> #include <stdlib.h> #define MAXVEX 20 typedef char VertexType; typedef int EdgeType; typedef struct EdgeNode{ int adjvex; // EdgeType weight;//权值 struct EdgeNode * ne

1、在终端中输入sudo su mysqld_safe --skip-grant-tables --skip-networking &这时便能越过权限表，直接登陆MySQL了。 2、新建一个终端，输入PATH="$PATH":/usr/local/mysql/bin mysql -u root -p。。。卸载mysql命令。。。sudo rm /usr/local/mysql sudo rm

#include <stdio.h> typedef struct clock { int hour,minute,second; }CLOCK; //函数功能：时分秒时间的更新 void Update(CLOCK *t) { t->second++; if (t->second == 60) { t->second=0; t->min

#include <stdio.h> #include <stdlib.h> struct link *AppendNopde(struct link *head); void DisplyNode(struct link *head); void DeleteMemory(struct link *head); struct link { int data ; struct lin

小学生计算机辅助系统

#include <stdio.h> #include <stdlib.h> void Gcd(int a,int b) { for (int i = a<b?a:b; i > 0; --i) { if (a%i==0&&b%i==0) { printf("%d\n",i); exit(0); /* code */ } /

#include int hour,minute,second; void update() {     second++;     if (second==60)     {         second=0;         minute++;         /* code */     }     if (minute==

聪明的调用了exit（）

#include <stdio.h> int magic(int m); int main() { int m,ret; printf("Input a sum:\n"); scanf("%d",&m); ret = magic(m); if (ret!=1) { printf("Wrong\n"); /*

C语言

#include <stdio.h> void Move(int n,char a,char b) { printf("Move %d : from %c to %c\n",n,a,b); } //函数功能：用递方法将n个圆盘借助于柱子c从源柱子a移动到目标柱子b上 void Hanoi(int n,char a,char b,char c) { if(n == 1) {

#include <stdio.h> #define N 20 void Insert(int a[],int n,int x); int main() { int a[N+1]; int x,i,n; printf("Input array size :"); scanf("%d",&n); printf("Input array:"); for (

#include <stdio.h> #define N 40 int ReadScore(int score[],long num[]); int LinSearch(long num[],long x,int n); int main() { int score[N],n,pos; long num[N],x; n = ReadScore(score,num);

#include <stdio.h> #define N 40 int ReadScore(int score[],long num[]); int FindMax(int score[],int n); void DataSort(int score[],long num[],int n); void PrintScore(int score[],long nnum[],int n); int m

#include <stdio.h> #define STUDENT_N 40 #define COURSE_N 3void ReadScore(int score[][COURSE_N],long num[],int n); void AverforStud(int score[][COURSE_N],int sum[],float aver[],int n); void AverforC(int

#include <stdio.h> #define N 10 void Bubble(int a[],int n); int main() { int n,a[N]; printf("Input n:"); scanf("%d",&n); printf("Input %d numbers :\n", n ); for (int i = 0; i < n; +

#include <stdio.h> #define N 30 #define M 5 void ReadScore(int score[],long num[],int n); int SumC(int score[],int n); void SortByScore(int score[],long num[],int n); void SortByNum(int score[],long nu

2016.10.11 16:33