Not logged in. Log in with GitHub. About Websheets.

List of all available Websheets


Viewing cpp/control/primes by daveagp@gmail.com. You have unsaved changes. Log in above to create, edit, preview and publish Websheets.
PropertyValue
Description
html markup
shown to student
 
Write a program that takes an integer input <tt>n</tt>, and prints 
out all of the prime numbers less than or equal to <tt>n</tt>. 
<p>
A number is prime if it has no divisors other than itself and one. 
The first few primes are 2, 3, 5, 7, 11, &hellip;
Public permissions remove
Engine
Template / Reference solution
 
#include <iostream>
using namespace std;
int main() {
\[
   int n;
   cin >> n;
   
   for (int i=2; i<=n; i++) {
      bool i_is_prime = true;
      for (int j=2; j<i; j++)
         if (i%j == 0) // does j divide i? 
            i_is_prime = false;
      if (i_is_prime)
         cout << i << endl;
   }
]\
   return 0;
}
C++ test suite
json list of stdin/args tests
e.g. [{"stdin":"hi", "args":["4", "5"]},
{"stdin":"noargs"}]

to just run once with no input use [{}]
 
[
   {"stdin": "100"},
   {"stdin": "17"}
]
Solution visibility remove


Optional properties:

Note: problems are open-source by default (see 'Public permissions'). Assumed license for open problems is Creative Commons 4.0 Attribution-ShareAlike unless specified in 'Remarks'.