2021-05-28

/ arr/ /www.cplusplus.com/ /msdn/
#include “stdio.h’
#include"string.h”
strcat() /link/

strcat(ar,"c++")
printf("ar=%s=n\",ar)

strcump()/compare/

int ret=strcump(str1,str2);

1
<-1
= 0
warning
if(str1=str2)

memset()/re:0/

memset(&a,0,sizeof(a))

软考

自定义函数

int  _dasdsadas()
{}
void Max(int a ,int b)
{if(a>b)
   max_value=a;
   else
   max_value=b;
   *printf("%d",max_value);*
return max_value;
}
void main()
{
  *if(a>b)
   max_value=a;
   else
   max_value=b;
   printf("%d",max_value)*
   int a=10;
   int b=20
   int result=
   
}

传递

void swap(int *x,int *y)
{int tmp =*x;
int *x=*y ;
*y=tmp;
}

void main()
{
int a=100;
int b=20;
printf("a=%d,b=%d",a,b);
swap(&a,&b);
printf("a=%d,b=%d",a,b);
}

void main()
{
int a=100;
int b=20;
printf("a=%d,b=%d",a,b);
a=a+b;
b=a-b;
a=a-b;
printf("a=%d,b=%d",a,b);
}

素数

bool isprime(int value)
{
for(int i=2;i<value;i++)
{if(value%i==0)
return false;}
return ture;
}
void main()
{int value=4179471;
bool flag=isprime(value)
if(flag)
printf("is")
else
printf("not is")
}

bool isleap(int year)
{if((year%4==0&&year%100!=0)||(year%400==0))
return ture;
return false;
}

bool isleap(int year)
{return((year%4==0&&year%100!=0)||(year%400==0))}

gradually plus

*void*int fun()
{int num=0;
++num;
return num;}
void main()
{int ret=fun();
printf("ret=%d\n",ret);
ret=fun();
printf("ret=%d\n",ret)
}

rank

void new_line()
{printf()
}
int main()
{three_line()
return 0;
}

*void fun2()
{printf("2");
}*
void fun1()
{printf("1");
}
void fun2()
{printf("1");
}

void fun1();
void fun2();
void main()
(fun1();
fun1();
)

int Max(int a,int b)
{return a>b?a:b;
}
void main()
{int a=10;
omt b=5;
int c=20;
int ret=Max(Max(a,b),c);
printf()

head
“” <>

1. search the document
2. use as the head
   3.if writen by outself ,""

递归

void printnum(int value)
{int mod;
while (value)
{
}
}
 void printnum(int num)
 {
 if(value>9)
 { printnum(value/10;)
 }
 printf("%d".value%10)
 void main()
 {
 }

阶乘(递归)

size_t fact(int n)
{
size_t result =1'
for(int i=1;i<n;i++)
{result *=i}
return result;
}
void main()
{int n;
printf("n:")
scanf("%d",&n)
size_t result=fact (n)
printf("%d",n,result);

}

size_t fact(int n)
{
if(n==1)
return 1;
return n*fact(n-1);
}

斐波那契数列

size_t fib(int n)
{while(i<n+1)
case 1:1
case 2:1
case 3:2
for(i=0;i<n+1;i++)
{if(i<3)
{result+=1
continue}
if(i>=3)
{result+=i-1+i-2;
}return result;
}
void main()
{int n;
printf("n:")
scanf("%d",&n)
size_t result=fib (n)
printf("%d",n,result);

size_t fib(int n)
{if(i<3)
return 1;
size_t  fib1=1,fib2=1;
size_t fib;
for(int i=3;;i<=1;++i)
{fib=fib1+fib2
}
}