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