mission-improbable/project.cpp at master · jeevanmali1994/mission-improbable · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
#include<iostream>
using namespace std;
int main()
{
   int warehouse[100][100],newwarehouse[100][100],row,column,i,j,maxrow[100],maxcolumn[100],compare=0,totalBox=0,totalCells=0,zeroCount=0,boxedCells=0,value=0,totalBoxfinal=0;
   //taking rows and column
   cin>>row>>column;

   //calculating total number of box
   totalCells=row*column;

   //taking box numbers
    for(i=0;i<row;i++)
   {
       for(j=0;j<column;j++)
       {
           cin>>warehouse[i][j];
       }
   }
   //calculating total number of boxes

   for(i=0;i<row;i++)
   {
       for(j=0;j<column;j++)
       {
           totalBox=totalBox+warehouse[i][j];

       }
   }
    //storing total box in another variable

    totalBoxfinal=totalBox;

   //calculating number of zeros
   for(i=0;i<row;i++)
   {
       for(j=0;j<column;j++)
       {
           if(warehouse[i][j]==0)
           {
                zeroCount++;
           }
       }
   }


   //finding the max value in row
   for(i=0;i<row;i++)
   {
       compare=0;
       for(j=0;j<column;j++)
       {
           if(warehouse[i][j]>=compare)
           {
               compare=warehouse[i][j];
           }
       }
       maxrow[i]=compare;
   }

   //finding max value in column
   for(j=0;j<column;j++)
   {
       compare=0;
       for(i=0;i<row;i++)
       {
           if(warehouse[i][j]>=compare)
           {
               compare=warehouse[i][j];
           }
       }
       maxcolumn[j]=compare;
   }

   //temporary printing max values

 /*  for(i=0;i<row;i++)
   {
       printf("\nMax value at %dth row=%d",i,maxrow[i]);
   }

   for(j=0;j<column;j++)
   {
       printf("\nMax value at %dth column=%d",j,maxcolumn[j]);
   }
*/
   //sorting and deleting double max values of same row n column index

   for(i=0;i<row;i++)
   {
       for(j=0;j<column;j++)
       {
           if(maxrow[i]==maxcolumn[j] && warehouse[i][j]!=0)
           {
               totalCells=totalCells-1;
               value=value+maxrow[i];

               maxrow[i]=0;
               maxcolumn[j]=0;
               j=column;
           }

       }
   }

   //calculating number of 1 box cell
   totalCells=totalCells-zeroCount;

   //calculating box values
   for(i=0;i<row;i++)
   {
       value=value+maxrow[i];
   }

   for(j=0;j<column;j++)
   {
       value=value+maxcolumn[j];
   }


    //number of 1 box cells
    for(i=0;i<row;i++)
   {
       if(maxrow[i]!=0)
       {
           totalCells=totalCells-1;
       }
   }

   for(j=0;j<column;j++)
   {
        if(maxcolumn[j]!=0)
       {
           totalCells=totalCells-1;
       }
   }


   //stolen boxes
   totalBoxfinal=totalBoxfinal-totalCells-value;

   //printing stolen boxes
   cout<<totalBoxfinal;

}