zoukankan      html  css  js  c++  java
  • Objective-C 程序设计(第六版)第五章习题答案

    1.

            NSLog(@"数字N          N的平方");
            NSLog(@"--------------------");
            
            for (int n = 1; n <= 10; n++) {
                NSLog(@"%2d              %d",n,n*n);
            }
      //结果如下
    
    2014-09-27 15:00:26.457 prog1[1218:303] 数字N          N的平方
    2014-09-27 15:00:26.459 prog1[1218:303] --------------------
    2014-09-27 15:00:26.460 prog1[1218:303]  1              1
    2014-09-27 15:00:26.460 prog1[1218:303]  2              4
    2014-09-27 15:00:26.461 prog1[1218:303]  3              9
    2014-09-27 15:00:26.461 prog1[1218:303]  4              16
    2014-09-27 15:00:26.461 prog1[1218:303]  5              25
    2014-09-27 15:00:26.462 prog1[1218:303]  6              36
    2014-09-27 15:00:26.462 prog1[1218:303]  7              49
    2014-09-27 15:00:26.463 prog1[1218:303]  8              64
    2014-09-27 15:00:26.463 prog1[1218:303]  9              81
    2014-09-27 15:00:26.463 prog1[1218:303] 10              100

    2.

            NSLog(@"整数N      N的三角数");
            NSLog(@"-------------------");
            
            int n, triangularNumber;
            
            for (n = 5;  n <= 50;  n += 5) {
                triangularNumber = n * (n + 1) / 2;
                NSLog(@" %2d           %d", n , triangularNumber);
            }
            
        //结果如下
    2014-09-27 15:14:33.348 prog1[1367:303] 整数N      N的三角数
    2014-09-27 15:14:33.350 prog1[1367:303] -------------------
    2014-09-27 15:14:33.351 prog1[1367:303]   5           15
    2014-09-27 15:14:33.351 prog1[1367:303]  10           55
    2014-09-27 15:14:33.352 prog1[1367:303]  15           120
    2014-09-27 15:14:33.352 prog1[1367:303]  20           210
    2014-09-27 15:14:33.353 prog1[1367:303]  25           325
    2014-09-27 15:14:33.353 prog1[1367:303]  30           465
    2014-09-27 15:14:33.353 prog1[1367:303]  35           630
    2014-09-27 15:14:33.354 prog1[1367:303]  40           820
    2014-09-27 15:14:33.354 prog1[1367:303]  45           1035
    2014-09-27 15:14:33.354 prog1[1367:303]  50           1275
    Program ended with exit code: 0

    3.

       //前十个整数是包括零的,就是这个破零搞的我头大了。    
    
            int n, f, factorial = 1;
            
            for (n = 0;  n < 10;  n++) {
                for (f = 1;  f <= n;  f++) {
                    factorial *= f;
                }
                NSLog(@"  %d 的阶乘是 %d", n, factorial);
                factorial = 1;
            }
    
       //结果如下
    
    2014-09-27 15:59:35.513 prog1[1731:303]   0 的阶乘是 1
    2014-09-27 15:59:35.515 prog1[1731:303]   1 的阶乘是 1
    2014-09-27 15:59:35.515 prog1[1731:303]   2 的阶乘是 2
    2014-09-27 15:59:35.516 prog1[1731:303]   3 的阶乘是 6
    2014-09-27 15:59:35.516 prog1[1731:303]   4 的阶乘是 24
    2014-09-27 15:59:35.517 prog1[1731:303]   5 的阶乘是 120
    2014-09-27 15:59:35.517 prog1[1731:303]   6 的阶乘是 720
    2014-09-27 15:59:35.517 prog1[1731:303]   7 的阶乘是 5040
    2014-09-27 15:59:35.518 prog1[1731:303]   8 的阶乘是 40320
    2014-09-27 15:59:35.518 prog1[1731:303]   9 的阶乘是 362880
    Program ended with exit code: 0

     4.略

     5.

            int n, number, triangularNumber, counter, times;
        
            NSLog(@"请输入你想要计算三角数的次数:");
            scanf("%d", &times);
            //以上照搬书本
            for (counter = 1;  counter <= times;  counter++) {
                NSLog(@"what triangular number do you want?");
                scanf("%d",&number);
                
                triangularNumber = 0 ;
                
                for ( n = 0;  n <= number;  ++n) {
                    triangularNumber += n;
                }
                NSLog(@"Triangular number %d is %d", number, triangularNumber);
            }
            

    6.

    //代码清单5-2
            
            int n = 1;
            int triangularNumber = 0;
            
            while ( n <= 200 ) {
                triangularNumber += n;
                n++;
            }
            NSLog(@"The 200th triangular number is %d", triangularNumber);
            
    //代码清单5-3
            
            int n, triangularNumber;
            
            NSLog(@"TABLE OF TRIANGULAR NUMBERS");
            NSLog(@"   n      Sum form 1 to n ");
            NSLog(@"-----     --------------");
            
            triangularNumber = 0;
            n = 1;
            
            while ( n <= 10 ) {
                triangularNumber += n;
                NSLog(@"  %2i          %i", n, triangularNumber);
                ++n;
            }
            
    //代码清单5-4
            
            int n, number, triangularNumber;
            
            NSLog(@"What triangular number do you want?");
            scanf("%i",&number);
            
            triangularNumber = 0;
            n = 1;
            
            while (n <= number) {
                triangularNumber += n;
                ++n;
            }
            NSLog(@"Triangular number %i is %i
    ", number, triangularNumber);
    
    //代码清单5-5
            
            int n, number, triangularNumber;
            int counter = 1;
            
            while (counter <= 5) {
                NSLog(@"What triangular number do you want?");
                scanf("%i", &number);
                
                triangularNumber = 0;
                n = 1;
                while (n <= number) {
                    triangularNumber += n;
                    ++n;
                }
                NSLog(@"Triangular number %i is %i", number, triangularNumber);
                ++counter;
            }

    7.输入负数得到的每个各数也是负数!

    8.

            int number, right_digit, result;
            
            NSLog(@"Enter your number:");
            scanf("%i", &number);
            
            while ( number != 0 ) {
                right_digit = number % 10;
                result += right_digit;
                number /= 10;
            }
            
            NSLog(@"%d",result);
  • 相关阅读:
    python 全栈开发,Day34(基于UDP协议的socket)
    python 全栈开发,Day33(tcp协议和udp协议,互联网协议与osi模型,socket概念,套接字(socket)初使用)
    python 全栈开发,Day32(知识回顾,网络编程基础)
    python 全栈开发,Day30(第一次面向对象考试)
    python 全栈开发,Day30(纸牌游戏,异常和错误,异常处理)
    python 全栈开发,Day29(昨日作业讲解,模块搜索路径,编译python文件,包以及包的import和from,软件开发规范)
    python 全栈开发,Day28(复习,os模块,导入模块import和from)
    python 全栈开发,Day27(复习, defaultdict,Counter,时间模块,random模块,sys模块)
    python 全栈开发,Day26(hashlib文件一致性,configparser,logging,collections模块,deque,OrderedDict)
    css关系选择符
  • 原文地址:https://www.cnblogs.com/MingMing-King/p/3997519.html
Copyright © 2011-2022 走看看