实验3
task 1
#include <stdio.h> #include <stdlib.h> #include <time.h> #include <windows.h> #define N 80 void printText(int line, int col, char text[]); void printSpaces(int n); void printBlankLines(int n); int main() { int line, col, i; char text[N] = "hi, May~"; srand(time(0)); for (i = 1; i <= 10; ++i) { line = rand() % 25; col = rand() % 80; printText(line, col, text); Sleep(1000); } return 0; } void printSpaces(int n) { int i; for (i = 1; i <= n; ++i) printf(" "); } void printBlankLines(int n) { int i; for (i = 1; i <= n; ++i) printf("\n"); } void printText(int line, int col, char text[]) { printBlankLines(line - 1); printSpaces(col - 1); printf("%s", text); }
task 2.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; }
task 2.2
#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; }
task 3
#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 m,i,s=1; for(i=0;i<n;i++) {s=s*2; m=s-1; } return m; }
task 4
#include<stdio.h> #include<math.h> void hanoi(unsigned int n,char from,char temp,char to); void moveplate(unsigned int n,char from,char to); int main() { unsigned int n,t; while(scanf("%u",&n)!=EOF) { hanoi(n,'A','B','C'); t = pow(2,n)-1; printf("\n一共移动了%d次\n\n",t); } return 0; } void hanoi(unsigned int n,char from,char temp,char to) { if(n==1) moveplate(n,from,to); else { hanoi(n-1,from,to,temp); moveplate(n,from,to); hanoi(n-1,temp,from,to); } } void moveplate(unsigned int n,char from,char to) { printf("第%u个盘子:%c-->%c\n",n,from,to); }
task 5
#include <stdio.h> int Isprime(int n){ int i; for(i=2;i<=n-1;i++) { if(n%i==0) return 0; } return 1; } int main(){ int i,n; for(n=4;n<=20;n+=2) { for(i=2;i<=n/2;i++) { if(Isprime(i)*Isprime(n-i)){ printf("%d=%d+%d\n",n,i,n-i); break; } } } return 0; }
task 6
#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: %1d\n\n", t); printf("enter a number:"); } return 0; } long fun(long s) { int m=1,k,s0=0; while (s != 0) { k = s % 10; if (k % 2 == 1) { s0 = s0 + k * m; m = 10 * m; } s = s / 10; } return s0; }