Advertisement
TareSedam

ss

Jan 21st, 2016
60
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.28 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. const int stud = 5;
  4. const int ocj = 4;
  5. void Unos(int niz[][4]) {
  6. for (int i = 0; i < stud; i++)
  7. {
  8. for (int j = 0; j < ocj; j++)
  9. {
  10. cin >> niz[i][j];
  11. if (niz[i][j] < 6 || niz[i][j]>10)
  12. --j;
  13. }
  14. }
  15. }
  16. int Min(int niz[][4], int stud) {
  17. int mini = niz[stud][0];
  18. for (int j = 0; j < ocj; j++)
  19. {
  20. if (mini > niz[j])
  21. mini = niz[j];
  22. }
  23. return mini;
  24. }
  25. float Prosj(int niz[][4], int ocje) {
  26. float s = 0;
  27. for (int i = 0; i < stud; i++)
  28. {
  29. s += niz[i][ocj];
  30. }
  31. return s / stud;
  32. }
  33. void Max(int niz[][4], int &studi, int &ocje) {
  34. int max = niz[0][0];
  35. for (int i = 0; i < stud; i++)
  36. {
  37. for (int j = 0; j < ocj; j++)
  38. {
  39. if (max < niz[i][j])
  40. max = niz[i][j];
  41. studi = i;
  42. ocje = j;
  43. }
  44. }
  45. }
  46. float ProsjekAr(int niz[][4], int pro) {
  47. float s = 0;
  48. for (int i = 0; i < stud; i++)
  49. {
  50. for (int j = 0; j < ocj; j++)
  51. {
  52. if(j==pro)
  53. s += niz[i][pro];
  54. }
  55. }
  56. return s / stud;
  57. }
  58. void main() {
  59. int niz[stud][ocj];
  60. Unos(niz);
  61. int pro;
  62. cout << "Min: " << Min(niz, stud) << endl;
  63. int studi = 0;
  64. int ocje = 0;
  65. Max(niz, studi, ocje);
  66. cout << "Prosjek predmet: " << Prosj(niz, ocje) << endl;
  67. cout << "Prosjek ocjena od najv ocjene: " << ProsjekAr(niz, pro) << endl;
  68.  
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement