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