Advertisement
Guest User

zadatakglupi

a guest
Apr 27th, 2015
185
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.84 KB | None | 0 0
  1. #include<stdio.h>
  2. #define MAX 1000
  3. #define MAXX 10
  4.  
  5. void ispisi_rezultat(char *kupac, char *prodavac, int broj_kupovina) {
  6. FILE *f;
  7. f = fopen("max.txt", "w");
  8. if (f==NULL) printf("Greska pri otvaranju filea!");
  9. fprintf(f, "%s\n%s\n%d", kupac, prodavac, broj_kupovina);
  10. }
  11.  
  12. int main(void) {
  13.  
  14. int brojac[10][10];
  15. int n1,n2,n3;
  16. float max=0;
  17. float polje[10][10];
  18. int i,j,n;
  19. int x1,x2;
  20.  
  21. for(i=0;i<10;i++){
  22. for(j=0;j<10;j++){
  23. polje[i][j]=0;}}
  24.  
  25. for(i=0;i<10;i++){
  26. for(j=0;j<10;j++){
  27. brojac[i][j]=0;}
  28. }
  29. struct prodavac{
  30. int idP;
  31. char ime[30];
  32. };
  33.  
  34. struct kupac{
  35. int idK;
  36. char ime[30];
  37. };
  38.  
  39. struct kupovina{
  40. int idK;
  41. int idP;
  42. int dat;
  43. float uk;
  44. char ime[30];
  45. };
  46. struct prodavac P[MAXX];
  47. struct kupac K[MAXX];
  48. struct kupovina KU[MAX];
  49.  
  50. scanf("%d\n", &n1);
  51. for(i=0;i<n;i++){
  52. scanf("%d %s", &P[i].idP, P[i].ime);
  53. }
  54.  
  55. scanf("%d", &n2);
  56. for(i=0;i<n2;i++){
  57. scanf("%d %s", &K[i].idK, P[i].ime);
  58. }
  59.  
  60.  
  61. scanf("%d", &n3);
  62. for(i=0;i<n3;i++){
  63. scanf("%d %d %d %f %s", &KU[i].idK, &KU[i].idP, &KU[i].dat, &KU[i].uk, KU[i].ime);
  64. }
  65.  
  66.  
  67. for(i=0;i<1000;i++){
  68. for(j=0;j<10;j++){
  69. if(P[i].idP==KU[i].idP && K[i].idK==KU[i].idK){
  70. polje[KU[i].idP][KU[j].idK]+=KU[i].uk;
  71. brojac[KU[i].idP][KU[j].idK]++;
  72. }
  73. }
  74. }
  75. for(i=0;i<1000;i++){
  76. for(j=0;j<10;j++){
  77. if(max<polje[KU[i].idP][KU[j].idK])
  78. {
  79. max=polje[KU[i].idP][KU[j].idK];
  80. x1=KU[i].idP;
  81. x2=KU[j].idK;
  82. }
  83. }
  84. }
  85.  
  86. ispisi_rezult(K[x1].ime,P[x2].ime ,brojac[x1][x2]);
  87.  
  88.  
  89.  
  90.  
  91.  
  92. return 0;
  93.  
  94. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement