fork download
copy 
  1. int primosBajos[] =
  2.   { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
  3. 	73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
  4. 	179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
  5. 	283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
  6. 	419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541,
  7. 	547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
  8. 	661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 0 };
  9.  
  10. bool TrialDivision( long int a, long int b  )
  11. {
  12. 	bool noDivisible = true;
  13. 	int i = 0;
  14.  
  15. 	do 
  16. 	{
  17. 		if ( a % primosBajos[i] == 0 ) 
  18. 		{
  19. 			noDivisible = false;
  20. 		}
  21.  
  22. 		i++;
  23. 	} while ( ( primosBajos[i] != 0 ) && ( primosBajos[i] <= b ) && ( noDivisible == true ) );
  24.  
  25. 	return a;
  26. }
  27.  
  28. int main() {
  29. 	// your code goes here
  30. 	return 0;
  31. }
  32.  
  33.  
Success #stdin #stdout 0s 3292KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/wHzYq1
language:
C++ (gcc 8.3)
created:
9 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!