14 1. 12 5 main 1.23 3 1.230000 3 1.860867 1
2. 1988 1925 1911 1867 void JPcalendar(int x) 1987 1 64 1 1 1 while(1) Ctrl C void JPcalendar(int x){ if (x > 1988) printf(" %d %d \n", x, x-1988); else if(x > 1925) /* */ else printf(" \n"); int num; while(1){ printf(" "); scanf("%d", &num); JPcalendar(num); return 0; 2013 2013 25 1980 1980 55 1900 1900 33 1925 1925 14 1912 1912 1 1860 ^C 2
3. 2 1989 1989 1 64 1926 1912 void JPcalendar(int x){ if (x > 1989) printf(" %d %d \n", x, x-1988); else if(x == 1989) printf(" %d 1 %d \n", x, x-1925); /* */ else printf(" \n"); /* 2 */ 1912 1912 1 45 1926 1926 1 15 1989 1989 1 64 2010 2010 22 ^C 3
4. 13 5 int gcd(int n, int r) void reducefrac(int a, int b) int gcd(int n, int r){ /* */ return tmp; void reducefrac(int a, int b){ int na, nb; /* */ if(nb!= 1) printf("%d/%d %d/%d \n", a, b, na, nb); else printf("%d/%d %d \n", a, b, na); int n1, n2, m; printf(" \n"); while(1){ printf(" :"); scanf("%d", &n1); printf(" :"); scanf("%d", &n2); reducefrac(n1, n2); return 0; 4
:20 :30 20/30 2/3 :21 :49 21/49 3/7 :25 :75 25/75 1/3 :72 :12 72/12 6 :^C 5
5. (Fibonacci) 1, 1, 2, 3, 5, 8, 13, 21, 34, 1 2 1 2 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8, m void fibonacci(int m)? void fibonacci(int m){ int i, n3; int n1=0; int n2=1; printf("%d\n", n2); for(i=1; i<m; i++){ n3 =?; printf("%d\n", n3); n1 =?; n2 =?; int num; printf(" "); scanf("%d", &num); fibonacci(num); return 0; 6
20 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 7
6. 4 na nb main int na, nb; // int gcd(int n, int r){ /* */ void reducefrac(int a, int b){ /* */ int n1, n2; printf(" \n"); while(1){ printf(" :"); scanf("%d", &n1); printf(" :"); scanf("%d", &n2); reducefrac(n1, n2); // if(nb!= 1) printf("%d/%d %d/%d \n", n1, n2, na, nb); else printf("%d/%d %d \n", n1, n2, na); return 0; 8
:6 :15 6/15 2/5 :63 :7 63/7 9 :13 :91 13/91 1/7 :39 :91 39/91 3/7 :^C 9
7. s t + u v = sv + tu tv void addfrac(int s, int t, int u, int v) 2 n1/n2 n3/n4 p=sv+tu q=tv int p, q; // void addfrac(int s, int t, int u, int v){ /* */ int n1, n2, n3, n4; while(1){ printf(" 1 \n"); printf(" :"); scanf("%d", &n1); printf(" :"); scanf("%d", &n2); printf(" 2 \n"); printf(" :"); scanf("%d", &n3); printf(" :"); scanf("%d", &n4); addfrac(n1, n2, n3, n4); printf("%d/%d+%d/%d=%d/%d\n", n1, n2, n3, n4, p, q); return 0; 10
1 :1 :2 2 :2 :3 1/2+2/3=7/6 1 :3 :5 2 :7 :11 3/5+7/11=68/55 1 :1 :6 2 :2 :6 1/6+2/6=18/36 1 :^C 11
8. 7 int gcd(int n, int r) void reducefrac(int a, int b) p/q int na, nb; // int gcd(int n, int r){ /* */ void reducefrac(int a, int b){ /* */ void addfrac(int s, int t, int u, int v){ /* */ int n1, n2, n3, n4; while(1){ printf(" 1 \n"); printf(" :"); scanf("%d", &n1); printf(" :"); scanf("%d", &n2); printf(" 2 \n"); printf(" :"); scanf("%d", &n3); printf(" :"); scanf("%d", &n4); addfrac(n1, n2, n3, n4); if(nb!=1) printf("%d/%d+%d/%d=%d/%d\n", n1, n2, n3, n4, na, nb); else printf("%d/%d+%d/%d=%d\n", n1, n2, n3, n4, na); return 0; 12
1 :1 :8 2 :3 :8 1/8+3/8=1/2 1 :3 :7 2 :4 :7 3/7+4/7=1 1 :1 :6 2 :1 :2 1/6+1/2=2/3 1 :22 :123 2 :9 :11 22/123+9/11=1349/1353 1 :^C 13