Advertisement
Guest User

Untitled

a guest
Mar 29th, 2017
42
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.75 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <string.h>
  3. #define NEDELI 4
  4. #define DENOVI 5
  5.  
  6. // ovde strukturata RabotnaNedela
  7.  
  8. typedef struct RabotnaNedela{
  9. int r_casovi[5];
  10. int br_nedela;
  11. }RN;
  12.  
  13. // ovde strukturata Rabotnik
  14.  
  15. typedef struct Rabotnik{
  16. char ime[50];
  17. RN niza[4];
  18. }R;
  19.  
  20. // ovde funkciite
  21. //moja kreirana za rabotnite sati vo edna nedela
  22. int r_casovi(RN rn){
  23. int i,sum;
  24. for(i=0;i<5;i++){
  25. sum+=rn.r_casovi[i];
  26. }
  27. return sum;
  28. }
  29. //max nedela
  30. int maxNedela(R *r){
  31.  
  32. int i, max, max_ind, tmp;
  33. max=0;
  34. max_ind=0;
  35. for(i=0;i<4;i++){
  36. tmp=r->niza[i].r_casovi(rc);
  37. if(tmp>max){
  38. max=tmp;
  39. max_ind=i;
  40. }
  41.  
  42. }
  43. return r->niza[max_ind].br_nedela;
  44. }
  45.  
  46. void table(R *r, int n){
  47. int i,j;
  48.  
  49. printf("Rab\t 1\t 2\t 3\t 4\t Vkupno");
  50. for(j=0;j<n;j++){
  51.  
  52. int vk=0;
  53. //tmp=r[i].r_casovi();
  54. printf("%s\t %d\t %d\t %d\t %d\t Vkupno",r->ime, r.niza[0].r_casovi(), r->niza[1].r_casovi(), r->niza[2].r_casovi(), r->niza[3].r_casovi(),
  55. vk=r->niza[0].r_casovi(), r->niza[1].r_casovi(), r->niza[2].r_casovi(), r->niza[3].r_casovi());
  56. }
  57. }
  58.  
  59.  
  60. int main() {
  61. int n;
  62. scanf("%d", &n);
  63. R rabotnici[n];
  64. int i;
  65. for (i = 0; i < n; ++i) {
  66. scanf("%s", rabotnici[i].ime);
  67. int j;
  68. for (j = 0; j < NEDELI; ++j) {
  69. int k;
  70. for (k = 0; k < DENOVI; ++k) {
  71. scanf("%d", &rabotnici[i].nedeli[j].casovi[k]);
  72. }
  73.  
  74. }
  75. }
  76. printf("TABLE\n");
  77. table(rabotnici, n);
  78. printf("MAX NEDELA NA RABOTNIK: %s\n", rabotnici[n / 2].ime);
  79. printf("%d\n", maxNedela(&rabotnici[n / 2]));
  80. return 0;
  81. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement