文档介绍：用递归法将一个正整数n的各个数字分别输出
int f(int num)
{
int x;
if(num==0)
return 0;
else{
x=num%10;
f(num/10);
}
穷举实例
int main()
{
int n=1,m,sum,i;
while(1)
{
m=n;
sum=0;
for(i=1;i<8;i++)
{
m=m*2;
sum=m+sum;
}
sum=sum+n;
if(sum==765)
{
cout<<"fist"<<n<<"\n";
cout<<"last"<<m;
break;
}
n++;
}
return 0;
}
宏定义可以定义函数例如交换函数swap
#Define swap(a,b) {int c;c=a;a=b;b=c;}
简单结构体成员号码姓名
#include ""
#include""
#include""
#include"iostream"
using namespace std;
struct student
{ int num;
char name[50];
struct student *next;
};
struct student *creat(int n)
{
int i;
struct student *head,*p1,*p2;
int num1;
char name1[50];
head=NULL;
for(i=n;i>0;--i)
{
p1=(struct student* )malloc(sizeof(struct student));
cout<<"输入编号";
cin>>num1;
cout<<"输入姓名";
cin>>name1;
p1->num=num1;
strcpy(p1->name,name1);
if(head==NULL)
{
head=p1;
p2=p1;
}
else
{
p2->next=p1;
p2=p1;
}
}p2->next=NULL;
return head;
}
void main()
{
int n;
struct student *q;
cin>>n;
q=creat(n);
while(q)
{
cout<<"编号"<<q->num<<"\n";
cout<<"姓名"<<q->name<<"\n";
q=q->next;
}
getchar();
}
利用栈实现进制转换
#include ""
#include<>
typedef struct tagSTACK
{
int stack[255];
int top;
}STACK;
STACK s;
void push(int i)
{
++;
[] = i;
}
int pop()
{
int ret;
if (> -1)
{
ret = [];
--;
return ret;
}
return -1;
}
void Bin(int i, int k, char str[])
{
int j, ret;
while (i)
{
push(i % k);
i /= k;
}
for (j = 0; ret = pop(), ret != -1; ++j)
{ if (ret > 9)
{
str[j] = ret + 'A' - 10;
}
else
{
str[j] = ret + '0'; }
}
str[j] = 0;
}
int main(void)
{
int i; int j;
char result[255];
= -1;
printf("Please inuput the Number:");
scanf("%d", &i);
getchar();
printf("Please inuput the mode (2,8,16):");
scanf("%d", &j);
getchar();