小编Eva*_*rom的帖子

这里的目标是创建一个程序,找到并输出1到100之间的所有素数.我注意到我倾向于复杂化并创建低效的代码,我很确定我也在这里做过.初始代码是我的,我在注释标记之间放置的所有内容都是本书中给出的代码作为解决方案.

// Find all prime numbers between 1 and 100

#include <iostream>
#include <cmath>
using namespace std;

    int main()
    {
        int counter; // loop counter
        int count_two; // counter for second loop
        int val; // equals the number of count, used in division to check for primes
        bool check;

        check = true;

        for(counter = 1; counter <= 100; counter++){
            val = counter;
                for(count_two = 2; count_two <= 9; count_two++){
                    if((val % count_two) == !(check)){
                        cout << val << " is …