fork download
copy 
  1. #include <stdio.h>
  2. #include <iostream>
  3. #include <math.h>
  4.  
  5. int main()
  6. {
  7. 	int k,i;
  8. 	bool factorfound;
  9. 	for (int n=2; n<=20; n++) {
  10. 		k = floor(sqrt(n));
  11. 		i = 2;
  12. 		factorfound = false;
  13. 		while (!factorfound && i<=k) {
  14. 			if (n%i==0) factorfound=true;
  15. 			i++;
  16. 		}
  17. 		if (factorfound) std::cout << n << " is composite\n"; else std::cout << n << " is prime\n";
  18. 	}
  19. }
Success #stdin #stdout 0s 3456KB
comments ()
stdin
copy 
Standard input is empty
stdout
copy 
2 is prime
3 is prime
4 is composite
5 is prime
6 is composite
7 is prime
8 is composite
9 is composite
10 is composite
11 is prime
12 is composite
13 is prime
14 is composite
15 is composite
16 is composite
17 is prime
18 is composite
19 is prime
20 is composite
https://ideone.com/UcCOp7
language:
C++14 (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!