int sum int n int sum0 i for

  • Slides: 12
Download presentation

解答例 解答例1 int sum (int n) { int sum=0, i; for (i=0; i<=n; i=i+1)

解答例 解答例1 int sum (int n) { int sum=0, i; for (i=0; i<=n; i=i+1) sum = sum + i; return sum; } 解答例2 int sum (int n) { if (n<=0) return 0; else return n + sum (n-1); }

解答例 解答例1 int max 3 (int n 1, int n 2, int n 3)

解答例 解答例1 int max 3 (int n 1, int n 2, int n 3) { int max; max = n 1; if (max < n 2) max = n 2; if (max < n 3) max = n 3; return max; } 解答例2 int max 2 (int n 1, int n 2) { if (n 1 > n 2) return n 1; else return n 2; } int max 3 (int n 1, int n 2, int n 3) { return max 2 (n 1, max 2 (n 2, n 3)); }

解答例 #include <stdio. h> int main (void) { int x; x = 1; while

解答例 #include <stdio. h> int main (void) { int x; x = 1; while (x <= 10) { if (x == 5) { x=x+1; continue; } printf (“羊が%d匹n", x); x=x+1; } return 0; }