Advertisement
aluin

Untitled

Mar 28th, 2014
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.98 KB | None | 0 0
  1. using System;
  2.  
  3. /*08. Write an expression that checks if given positive integer number n (n ≤ 100) is prime (i.e. it is divisible without remainder only to itself and 1). Examples:
  4. n Prime?
  5. 1 false
  6. 2 true
  7. 3 true
  8. 4 false
  9. 9 false
  10. 97 true
  11. 51 false
  12. -3 false
  13. 0 false
  14.  
  15. */
  16.  
  17. class PrimeNumberCheck
  18. {
  19. static void Main()
  20. {
  21. Console.Write("Enter a positive integer n (n <= 100) = ");
  22. int number = int.Parse(Console.ReadLine());
  23.  
  24. bool check = true;
  25. int divider = 2;
  26. int maxDivider = (int)Math.Sqrt(number);
  27.  
  28. // въртим един цикъл докато divider-a не стане колкото максималния възможен делител
  29.  
  30. while (check && (divider <= maxDivider))
  31. {
  32. if (number % divider == 0)
  33. {
  34. check = false;
  35. }
  36. divider++;
  37. }
  38. Console.WriteLine("Prime? --> "+check);
  39. }
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement