#include<stdio.h>#define N 10intmain(){int a[N]={0,1,2,3,4,5,6,7,8,9};int i;printf("原数:\n");for(i=0;i<10;i++){printf("%3d",a[i]);}printf("\n");printf("逆序:\n");for(i=9;i>=0;i--){printf("%3d",a[i]);}}
#include<stdio.h>#define N 20intmain(){int fi[N]={1,1};int i;for(i=2;i<N;i++){
fi[i]=fi[i-1]+fi[i-2];}for(i=0;i<20;i++){printf("%7d",fi[i]);}}
#include<stdio.h>#define N 10intmain(){int a[N],i,j,t;printf("原数:\n");for(i=0;i<N;i++){scanf("%d",&a[i]);printf("%5d",a[i]);}printf("\n");for(i=0;i<N-1;i++)//冒泡排序法 {for(j=0;j<N-i-1;j++){if(a[j]>a[j+1]){
t=a[j];
a[j]=a[j+1];
a[j+1]=t;}}}printf("排序后的数:\n");for(i=0;i<N;i++){printf("%5d",a[i]);}}