实验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! = %lld\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 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 a; for(a=0;a<n;a++) printf("%c",symbol); }
#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 { printSymbol(n-1,symbol); printf("%c",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) { long long result; if(n==0) result=0; else result=2*fun(n-1)+1; return result; }
#include<stdio.h> #include<math.h> int isPrime(int n); int main() { int n,sum=0; for(n=101;n<=200;n++) { if(isPrime(n)==0) { printf("%d",n); sum++; if(sum%10==0) printf("\n"); } } printf("\n101~200之间一共有%d个非素数",sum); return 0; } int isPrime(int n) { int t; for(t=2;t<=sqrt(n);t++) if(n%t==0) return 0; 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 t=0,k,i=1; while(s!=0) { k=s%10; if(k%2!=0) { t=t+k*i; i*=10; } s/=10; } return t; }
#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) { double s=0; int t=-1,k; for(k=1;k<=n;++k) { t=-t*k; s=s+1/(double)t; } return s; }