Advertisement
Guest User

Untitled

a guest
Jan 21st, 2020
89
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.89 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <malloc.h>
  4. #include <string.h>
  5. typedef struct
  6. {
  7. char nume[10];
  8. char prenume [10];
  9. int varsta;
  10. float salariu;
  11. }Angajat;
  12. typedef struct
  13. {
  14. char nume_dept[10];
  15. Angajat a[10];
  16. }Departament;
  17. void citire(int *n,Departament **d,int *nr[])
  18. {
  19. char v='d';
  20. char c;
  21. printf("Introduceti numarul de departamente:\n");
  22. scanf ("%d",n);
  23. *d=(Departament*)malloc((*n)*sizeof(Departament));
  24. for (int i=0;i<*n;i++)
  25. {
  26. printf("Numele departamentului %d este:\n",i+1);
  27. //printf("eroare1");
  28. scanf("%s",(*d)[i].nume_dept);
  29. int j=0;
  30. while(v=='d')
  31. {
  32. printf("Numele angajatului %d este:\n",j+1);
  33. scanf("%s",(*d)[i].a[j].nume);
  34. printf("Prenumele angajatului %d este:\n",j+1);
  35. scanf("%s",(*d)[i].a[j].prenume);
  36. printf("Varsta angajatului %d este:\n",j+1);
  37. scanf("%d",&(*d)[i].a[j].varsta);
  38. printf("Salariul angajatului %d este:\n",j+1);
  39. scanf("%f",&(*d)[i].a[j].salariu);
  40. printf("Mai adaugati un angajat?\n");
  41. scanf(" %c",&v);
  42. // (*nr)[i]=j-1;
  43. j++;
  44. printf("eroaare 2");
  45. }
  46.  
  47. }
  48. }
  49. void maxim (int n,Departament *d,int nr[])
  50. {
  51. float s[n];
  52. int p=0,i;
  53. for (int i=0;i<n;i++)
  54. {
  55. s[i]=s[i]+d[i].a[nr[i]].salariu;
  56. }
  57. int max=s[0];
  58. for (i=0;i<n;i++)
  59. {
  60. if (max < s[i])
  61. {
  62. max=s[i];
  63. p=i;
  64. }
  65. }
  66. printf("Departamentul care are cele mai mari costuri este %s",d[p].nume_dept);
  67. }
  68. int main ()
  69. {
  70. int n;
  71. int j[10];
  72. int *nr;
  73. Departament *d;
  74. citire(&n,&d,&nr);
  75. maxim (n,d,nr);
  76. return 0;
  77. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement