#include <iostream>
char *result=(char *)malloc(sizeof(char)*200);
int fun(int n,int m);
int main()
{
std::cout< return 0;
}
int fun(int n,int m)
{
if(n<0||m<0) return 0;
if(n==1||m==1) return 1;
 [......]
#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
#define N 4
int used[N];
int out[N];
void f(int *num,int n,int p);
int main()
{
int num[N],i;
for(i=0;i[......]