fork download
  1. #include <iostream>
  2. #include <cmath>
  3. using namespace std;
  4.  
  5. void findRoot(double val, double &res1, double &res2, double &res3) {
  6. if (val < 0) {
  7. res1 = res2 = res3 = -1;
  8. return;
  9. }
  10. res1 = pow(val, 1.0/2);
  11. res2 = pow(val, 1.0/3);
  12. res3 = pow(val, 1.0/4);
  13. }
  14.  
  15. void task1()
  16. {
  17. double val;
  18. double res1, res2, res3;
  19. cout << "Input val:" << endl;
  20. cin >> val;
  21.  
  22. findRoot(val, res1, res2, res3);
  23. cout << val << " " << res1 << " " << res2 << " " << res3 << endl;
  24. }
  25.  
  26. int main() {
  27.  
  28. //task choose here
  29. int i;
  30. do
  31. {
  32. cout << "Input task number (1-5):" << endl;
  33. cin >> i;
  34. switch(i)
  35. {
  36. case 1:
  37. task1();
  38. break;
  39. case 2:
  40. //task2();
  41. break;
  42. case 3:
  43. //task3();
  44. break;
  45. case 0:
  46. cout << "Program is done" << endl;
  47. break;
  48. //etc
  49. default:
  50. cout << "Invalid option" << endl;
  51. }
  52. }
  53. while(i != 0);
  54.  
  55. return 0;
  56. }
Success #stdin #stdout 0s 3476KB
stdin
1 16 0
stdout
Input task number (1-5):
Input val:
16 4 2.51984 2
Input task number (1-5):
Program is done