#include
typedef struct node
{
int num;
struct node *next;
}*LINK,NODE;
LINK link_rev(LINK head);
LINK link_cr(int num);
void link_show(LINK head);
int main()
{
LINK *p,head,head1;
head=link_cr(5);
printf("Now create 5 NODE LINK,print:");[......]
#include
long muti(long n,long m);
int main()
{
printf("%ld",muti(1000,1000));
return 0;
}
long muti(long n,long m)
{
if(n==1) return m;
else
{
if(n%2==0)
{
return muti(n>>1,m1,m1,m[......]
/* 标准文档模板 */
#include "Stdio.h"
#include "Conio.h"
#define N 16
void Chess(int tr,int tc,int dr,int dc,int size);
void Show();
int board[N+1][N+1];
int main()
{
/* 此处添加你自己的代码 */
board[1][1]=-1;
Chess(1,1,1,1,N);
Show();
getch();
retu[......]
#include
typedef struct phone
{
long num;
char name[20];
struct phone *next;
} PHONE,*LINK;
LINK crate(int num);
void print(LINK head);
LINK insert(int pos,long num,char *name,LINK head);
LINK del(int pos,LINK head);
void find(long num,LINK[......]
二分法求根--c语言描述
#include
#include
double f(double x);
//求根主函数 x1 x2为求根区间！
void root(double x1,double x2);
int main()
{
root(0,20);
return 0;
}
double f(double x)
{
return exp(x)-2;
}
void root(double x1,double x2)
{
double x;
int flag=[......]