实验四
#include<stdio.h>
long long fun(int n);
int main(){
int n;
long long f;
while(scanf("%d", &n) != EOF){
f = fun(n);
printf("n = %d, f = %lld\n", n, f);
}
return 0;
}
long long fun(int n){
if(n == 1)
return 1;
else
return 2*(fun(n-1)+1)-1;
}

实验二
#include<stdio.h>
long long fac(int n);
int main(){
int i, n;
printf("Enter n:");
scanf("%d", &n);
for(i=1;i<=n;++i)
printf("%d! = %lld\n", i, fac(i));
return 0;
}
long long fac(int n){
static long long p = 1;
p = p*n;
return p;
}

#include<stdio.h>
long long fac(int n);
int main(){
int i, n;
printf("Enter n:");
scanf("%d", &n);
for(i=1;i<=n;++i)
printf("%d! = %lld\n", i, fac(i));
return 0;
}
long long fac(int n){
static long long p = 1;
printf("p = %lld\n", p);
p = p*n;
return p;
}

实验三
#include<stdio.h>
#define N 1000
int fun(int n, int m,int bb[N]) {
int i, j, k=0,flag;
for(j=n;j<=m;j++){
flag = 1;
for(i=2;i<j;i++)
if(j % i == 0){
flag = 0;
break;
}
if(flag == 1)
bb[k++] = j;
}
return k;
}
int main(){
int n=0, m=0, i, k, bb[N];
while(scanf("%d %d",&n, &m) != EOF){
for(i=0;i<m-n;i++)
bb[i] = 0;
k=fun(n,m,bb);
for(i=0;i<k;i++)
printf("%4d",bb[i]);
printf("\n");
}
return 0;
}

实验四
#include <stdio.h>
void dec2n(int x, int n);
int main() {
int x;
printf("输入一个十进制整数: ");
scanf("%d", &x);
dec2n(x, 2);
dec2n(x, 8);
dec2n(x,16);
return 0;
}
void dec2n(int x, int n) {
int i,a,N;
char b[100];
for(i=0;x!=0;i++){
b[i] = x % n;
x = x / n ;
}
if(b[i]>9)
switch(b[i])
{
case 10:b[i]='A';break;
case 11:b[i]='B';break;
case 12:b[i]='C';break;
case 13:b[i]='D';break;
case 14:b[i]='E';break;
case 15:b[i]='F';break;
}
printf("%2d进制:", n);
for(N=i-1;N>=0;N--)
printf("%X" ,b[N]);
printf("\n");
}


浙公网安备 33010602011771号