实验3
#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> 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> void printsymbol(int,char); 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); }
#include <stdio.h> void printsymbol(int,char); 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){ printf("%c",symbol); if(n==1) ; else printsymbol(n-1,symbol); }
#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> #include<math.h> int isprime(int); int s=0; int main(){ int i; for(i=101;i<=200;i++){ if(isprime(i)==1) ; else if(isprime(i)==0){ s=s+1; printf("%5d",i); } } printf("\n一共有%d个非素数",s); return 0; }
#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){ int wei,s1=0,s2=0; while(s!=0){ wei=s%10; if(wei%2==1) s1=s1*10+wei; s=s/10; } while(s1!=0){ wei=s1%10; s2=s2*10+wei; s1=s1/10; } return s2; }
#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; double t=-1,s=0; for(i=1;i<=n;i++){ t=-t*i; s=s+1/t; } return s; }