Chapter Review

1
An entry-condition loop evaluates a test expression before entering the body of the loop. If the condition is initially false, the loop never executes its body. An exit-condition loop evaluates a test expression after processing the body of the loop. Thus, the loop body is executed once, even if the test expression is initially false. The for and while loops are entry-condition loops, and the do while loop is an exit-condition loop.
2
It would print the following:

01234
    

Not that cout << endl; is not part of the loop body (because there are no braces).

3
It would print the following:

0369

12
    

4
It would print the following:

6

8
    

5
It would print the following:

k = 8;

6
It's simplest to use the *= operator:

for (int num = 1; num <= 64; num *= 2)
    cout << num << " ";

7
You enclose the statements within paired braces to form a single compound statement, or block.
8
Yes, the first statement is valid. The expression 1,024 consists of two expressions — 1 and 024 — joined by a comma operator. The value of the right-hand expression. This is 024, which is octal for 20, so the declaration assigns the value 20 to x. The second statement is also valid. However, operator precedence causes it to be evaluated as follows:
(y = 1), 024;
That is, the left expression sets y to 1, and the value of the entire expression, which isn't used, is 024, or 20.
9
The cin >> ch form skips over spaces, newlines, and tabs when it encounters them. The other two forms read those characters.

Programming Exercises

1

#include <iostream>

int main()
{
    using namespace std;

    int n1, n2;
    int sum = 0;

    cout << "Input two integer numbers (example: 2 9): ";
    cin >> n1;
    cin >> n2;

    for (int i = n1; i <= n2; ++i)
    {
        sum += i;
    }
    cout << "sum = " << sum << endl;

    return 0;
}

2

#include <iostream>
#include <array>
const int ArSize = 101;

int main()
{
    using namespace std;

    array<long double, ArSize> factorials;
    factorials[1] = factorials[0] = 1.0L;

    for (int i = 2; i < ArSize; ++i)
    {
        factorials[i] = i * factorials[i - 1];
    }

    for (int i = 0; i < ArSize; ++i)
    {
        cout << i << "! = " << factorials[i] << endl;
    }

    return 0;
}

3

#include <iostream>

int main()
{
    using namespace std;

    double x;
    double sum = 0.0;

    cin >> x;
    while (x != 0.0)
    {
        sum += x;
        cin >> x;
    }
    cout << "sum = " << sum << endl;

    return 0;
}

4

#include <iostream>

int main()
{
    using namespace std;

    double d, c;
    d = c = 100.0;

    int i;
    for (i = 0; d >= c; ++i)
    {
        d += 0.1 * 100.0;
        c *= 1.05;
    }

    cout << i << " year(s)\n";
    cout << "Daphne: " << d << endl;
    cout << "Cleo: " << c << endl;

    return 0;
}

5

#include <iostream>

const char * const Months[12] =
{
    "January",
    "February",
    "March",
    "April",
    "May",
    "June",
    "July",
    "August",
    "September",
    "October",
    "November",
    "December"
};

int main()
{
    using namespace std;

    int volumes[12];
    int sum = 0;

    for (int i = 0; i < 12; ++i)
    {
        cout << "Enter the sales volume of " << Months[i] << ": ";
        cin >> volumes[i];
    }

    for (int i = 0; i < 12; ++i)
        sum += volumes[i];

    cout << "Sum = " << sum << endl;

    return 0;
}

6

#include <iostream>

const char * const Months[12] =
{
    "January",
    "February",
    "March",
    "April",
    "May",
    "June",
    "July",
    "August",
    "September",
    "October",
    "November",
    "December"
};

int main()
{
    using namespace std;

    int volumes[3][12];
    int sum = 0;
    int total = 0;

    for (int i = 0; i < 3; ++i)
    {
        cout << "Enter the sales volumes of year: " << i + 1 << endl << endl;
        for (int j = 0; j < 12; ++j)
        {
            cout << "Enter the sales volumes of " << Months[j] << ": ";
            cin >> volumes[i][j];
        }

    }

    for (int i = 0; i < 3; ++i)
    {
        for (int j = 0; j < 12; ++j)
        {
            sum += volumes[i][j];
        }
        cout << "Sales volume of year " << i + 1 << " is " << sum << endl;
        total += sum;
        sum = 0;
    }
    cout << "Sales volumes of 3 years are: " << total << endl;

    return 0;
}

7

#include <iostream>

struct car
{
    char make[40];
    int year;
};

int main()
{
    using namespace std;

    int num;
    car * cars;

    cout << "How many cars do you wish to catalog: ";
    cin >> num;
    cars = new car[num];

    for (int i = 0; i < num; i++)
    {
        cout << "Car #" << i + 1 << ":\n";
        cout << "Please enter the make: ";
        //cin >> cars[i].make;
        cin.getline(cars[i].make, 40);
        cin.get();
        cout << "Please enter the year made: ";
        cin >> cars[i].year;
    }

    cout << "Here is your collection:\n";
    for (int i = 0; i < num; ++i)
        cout << cars[i].year << " " << cars[i].make << endl;

    delete [] cars;

    return 0;
}

8

#include <iostream>
#include <cstring>

int main()
{
    using namespace std;

    char word[20];
    int count = 0;

    cout << "Enter word (to stop, type the word done):\n";
    cin >> word;
    while (strcmp(word, "done"))
    {
        ++count;
        cin >> word;
    }
    cout << "You entered a total of " << count << " words.\n";

    return 0;
}

9

#include <iostream>
#include <string>

int main()
{
    using namespace std;

    string word;
    int count = 0;

    cout << "Enter word (to stop, type the word done):\n";
    cin >> word;
    while (word != "done")
    {
        ++count;
        cin >> word;
    }
    cout << "You entered a total of " << count << " words.\n";

    return 0;
}

10

#include <iostream>

int main()
{
    using namespace std;

    cout << "Enter number of rows: ";
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) // row
    {
        for (int j = 0; j < n; ++j) // column
            if (j < (n - (i + 1)))
                cout << ".";
            else
                cout << "*";

        cout << endl;
    }

    return 0;
}

c++-pimer-plus-6th-chapter05的更多相关文章

  1. The 6th tip of DB Query Analyzer

      The 6th tip of DB Query Analyzer MA Gen feng (Guangdong Unitoll Services incorporated, Guangzhou ...

  2. [转载]ECMA-262 6th Edition / Draft August 24, 2014 Draft ECMAScript Language Specification

    http://people.mozilla.org/~jorendorff/es6-draft.html#sec-23.4 Draft Report Errors and Issues at: htt ...

  3. chapter05

    /** * Created by EX-CHENZECHAO001 on 2018-03-29. */class Chapter05 { } // 类// 类中的字段自动带有getter方法和sett ...

  4. Chapter05 流程控制(Process Control)

    目录 Chapter05 流程控制 5.1 顺序控制 5.2 分支控制 if-else 单分支基本语法: 双分支基础语法: 多分支基础语法 5.3 嵌套分支 5.4 switch分支结构 5.5 Fo ...

  5. ​Si2151/41 6th Generation Silicon TV Tuner ICs

    ​ The Si2151/41 are the industry's most advanced silicon TV tuner ICs supporting all worldwide terre ...

  6. Codeforces Round #361 Jul.6th B题 ☺译

    最近迈克忙着考前复习,他希望通过出门浮躁来冷静一下.迈克所在的城市包含N个可以浮躁的地方,分别编号为1..N.通常迈克在家也很浮躁,所以说他家属于可以浮躁的地方并且编号为1.迈克从家出发,去一些可以浮 ...

  7. Codeforces Round #361 Jul.6th A题 ☺译

    A.迈克和手机 当迈克在沙滩上游泳的时候,他意外的把他的手机扔进了水里.不过你甭担心因为他立马买了个便宜些的代替品,这个代替品是老款九键键盘,这个键盘只有十个等大的数字按键,按以下方式排列: 1 2 ...

  8. October 6th 2016 Week 41st Thursday

    The outer world you see is a reflection of your inner self. 你拥有什么样的内心,你就会看到什么样的世界. And we eventually ...

  9. September 6th 2016 Week 37th Tuesday

    I only wish to face the sea, with spring flowers blossoming. 我只愿面朝大海,春暖花开. That scenery is beautiful ...

  10. July 6th, Week 28th Wednesday, 2016

    Diligence is the mother of good fortune. 勤勉是好运之母. The mother of good fortune can be diligence, conti ...

随机推荐

  1. QT笔记之内存管理

    转载:https://blog.csdn.net/myjqc/article/details/8569196 (链接错误解决办法) 我们都知道在C++中,new和delete是成对出现的,那么在QT中 ...

  2. MongoDB NoSQL 常用指令

    查询 日期区间 db.<collections>.find({"service_name":"xxx"}).sort({ update_time:- ...

  3. Docker 入门指南——常用命令

    前面已经介绍了 Docker 的安装方式,本文总结一下使用 Docker 的基本概念和常用命令. 基本概念 镜像 Image 镜像是一些打包好的已有的环境,可以被用来启动和创建容器 容器 Contai ...

  4. Linux 搭建 Jenkins

    环境准备 安装JDK 安装 JDK 之前写过一篇文章,本文就不具体讲了: Linux 安装 JDK 注意:Java版本不能是gcj,会导致Jenkins有问题,centos7搭建jenkins小记文章 ...

  5. bsgs整理

    目录 bsgs问题 或 poj2417: 概述 代码 exbsgs 鸣谢 \(gzy gzy gzy\) bsgs问题 或 poj2417: 给定质数\(p\),给定\(a\),\(b\),\((a, ...

  6. 【Spring Security】四、自定义页面

    在前面例子中,登陆页面都是用的Spring Security自己提供的,这明显不符合实际开发场景,同时也没有退出和注销按钮,因此在每次测试的时候都要通过关闭浏览器来注销达到清除session的效果. ...

  7. 【第四十章】Spring Boot 自定义拦截器

    1.首先编写拦截器代码 package com.sarnath.interceptor; import javax.servlet.http.HttpServletRequest; import ja ...

  8. P1948 [USACO08JAN]电话线Telephone Lines(二分答案+最短路)

    思路 考虑题目要求求出最小的第k+1大的边权,想到二分答案 然后二分第k+1大的边权wx 把所有边权<=wx的边权变为0,边权>wx的边权变为0,找出最短路之后,如果dis[T]<= ...

  9. 【ASP.NET】 MVC下拉框联动

    这个case主要是我在做项目的时候遇到一个需要根据input控件输入的内容,动态填充dropdown list中的内容, 实现二者联动的需求.在搜索了一些资源后,这篇博客解决了我的问题,所以记录并转载 ...

  10. website for .Net Core

    5 Ways to Build Routing in ASP.NET Core Bundling in .NET Core MVC Applications with BundlerMinifier. ...