实验三

#include<stdio.h>
int func(int ,int);
int main()
{int k=4,m=1,p1,p2;
p1=func(k,m);
p2=func(k,m);
printf("%d,%d\n",p1,p2);
return 0;
 } 
 int func(int a,int b)
 {static int m = 0,i=2;
 i +=m+1;
 m = i + a + b;
 return (m); 
  } 

 

 

#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! = %11d\n",i,fac(i)); 
    return 0;
}
long long fac(int n)
{  static long long p=1;
printf("p = %11d\n",p);
    p=p*n;
return p;
}

 

 

#include<stdio.h>
void printSymbol(int n,char symbol);
int main()
{int n;
char symbol;
while(scanf("%d %c",&n , &symbol) != EOF)
{
printSymbol(n , symbol);
printf("\n"); 
}
return 0;
}
void printSymbol(int n,char symbol)
{int i;
for(i=1;i<=n;++i)
printf("%c",symbol);
return;
}

 

 

#include<stdio.h>
void printSymbol(int n,char symbol);
int main()
{int n;
char symbol;
while(scanf("%d %c",&n , &symbol) != EOF)
{
printSymbol(n , symbol);
printf("\n"); 
}
return 0;
}
void printSymbol(int n,char symbol)
{if(n=1)
printf("%c",symbol);
else{
printf("%c",symbol);
printSymbol(n-1,symbol);}
return;
}

 

#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)
{int sum;
if(n==1)
sum=1;
else{
    sum=2*(fun(n-1)+1)-1;
}
return sum;
}

 

 

#include<stdio.h>
#include<math.h>
int isPrime(int e);
int main()
{int a,b;
b=0;
for(a=101;a<=200;a++)
if(isPrime(a)==1)
{printf("%d",a);
b++;
}
printf("101-200之间有%d个非素数",b);
return 0;
}
int isPrime(int e)
{int d,f;
f=sqrt(e);
for(d=2;d<=f;d++)
if(e%d==0)

return 0;
else if(d>f)
return 1;
}

 

 

#include <stdio.h>
long fun(long s); 
int main()
{
long s, t;
printf("Enter a number: ");
while (scanf("%ld", &s) != EOF)
{
t = fun(s); 
printf("new number is: %ld\n\n", t);
printf("Enter a number: ");
}
return 0;}
long fun(long s)
{long a=0,b=1,c=0;
while(s>0)
{

a=s%10;
if(a%2!=0)
{c+=a*b;

b=b*10;
}
s=s/10;
}
return c;
}

#include <stdio.h>
double fun(int n); 
int main()
{
int n;
double s;
printf("Enter n(1~10): ");
while (scanf("%d", &n) != EOF)
{
s = fun(n); 
printf("n = %d, s= %f\n\n", n, s);
printf("Enter n(1~10): ");
}
return 0;
}
double fun(int n)
{int i,p=1,q=1;
double sum,m;
for(i=1;i<=n;i++)
{p=p*i;
m=1.0/p;

sum=sum+m*q;
q=q*(-1);
}
return sum;
}