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. Ubuntu + CUDA9 + CUDNN7 + OpenCV3.4 + contrib +CAFFE-master

    安装ubuntu时赞美Rufus(建议ubuntu16.04.04),过程参考 https://www.cnblogs.com/willnote/p/6725594.html 安 装 前 一 定 要 ...

  2. Testng测试报告

    执行完测试用例之后,会在项目的test-output(默认目录)下生成测试报告

  3. Web开发中B/S架构和C/S架构的区别

    在web开发中有两种基本架构,即C/S架构和B/S架构那么这两种架构有什么区别呢?那么就一起来看看吧. C/S架构图: B/S架构图: C/S架构是 浏览/服务器端的交互,是早期的一种分布式架构,在该 ...

  4. thinkphp留言板开发笔记 1 - 新的

    关于php数组的排序函数的总结: 有很多种排序方式和排序规则: 正常排序和反向排序, 使用 -r来表示 排序时是否考虑索引/下标, 如果考虑则加上-a, a=associate. sort是按值来排序 ...

  5. A^B mod C (快速幂+快速乘+取模)题解

    A^B mod C Given A,B,C, You should quickly calculate the result of A^B mod C. (1<=A,B,C<2^63). ...

  6. AngularJS 笔记2

    2017-03-23 本文更新链接: http://www.cnblogs.com/daysme/p/6613071.html $http angularjs中的ajax 向服务器请求数据 1/2 后 ...

  7. Lintcode415-Valid Palindrome-Medium

    Given a string, determine if it is a palindrome, considering only alphanumeric(字母和数字) characters and ...

  8. HDU 3848 CC On The Tree(树形dp)

    http://acm.hdu.edu.cn/showproblem.php?pid=3848 题意: 求一棵树上两个叶子结点之间的最短距离. 思路: 两个叶子节点之间一定会经过非叶子节点,除非只有两个 ...

  9. Python open 对应的参数

  10. burp suite 的intruder 四种攻击方式

    一:sniper[狙击手] 这种攻击基于原始的请求内容,需要一个字典,每次用字典里的一个值去代替一个待攻击的原始值. 攻击次数=参数个数X字典内元素个数 例如:原始请求中 name=aa , pass ...