Number

SUBMITTED BY: Guest

DATE: Feb. 7, 2014, 1:39 p.m.

FORMAT: C++

SIZE: 996 Bytes

Raw Download

HITS: 681

Report
  1. #include <iostream>
  2. using namespace std;
  3. class number
  4. {
  5. private:
  6. int value;
  7. public:
  8. number(int x){value=x;}
  9. bool isPrime();
  10. bool isOdd();
  11. long long factorial();
  12. };
  15. bool number::isPrime()
  16. {
  17. int a;
  18. int n=value;
  19. if(n<=1)
  20. return false;
  21. for(a=2;a<n;a++)
  22. if(n%a==0)
  23. return false;
  24. return true;
  25. }
  27. bool number::isOdd()
  28. {
  29. if(value%2==0)
  30. return false;
  31. else
  32. return true;
  33. }
  35. long long number::factorial()
  36. {
  37. int i;
  38. long long factValue=1;
  39. for(i=1;i<=value;i++)
  40. {
  41. factValue=factValue*i;
  42. }
  43. return factValue;
  44. }
  46. int main()
  47. {
  48. int x;
  49. cout<< "Enter an interger(Must be greater than 0): ";
  50. cin>>x;
  51. number a(x);
  52. if(a.isPrime()==true)
  53. cout <<"Prime"<< endl;
  54. else
  55. cout <<"Not Prime"<< endl;
  56. if(a.isOdd()==true)
  57. cout <<"Odd"<< endl;
  58. else
  59. cout <<"Even"<< endl;
  60. cout<< "Factorial: "<<a.factorial()<<endl;
  62. return 0;
  63. }
comments powered by Disqus