| skipped 32 lines |
| 33 | 33 | | for(i = 0; i < l_size; i++){ |
| 34 | 34 | | store += output[i]; |
| 35 | 35 | | } |
| 36 | | - | storage[gr_id] = store; |
| | 36 | + | storage[gr_id] += store; |
| 37 | 37 | | } |
| 38 | 38 | | } |
| 39 | 39 | | |
| skipped 9 lines |
| 49 | 49 | | for(i = 0; i < l_size; i++){ |
| 50 | 50 | | store += output[i]; |
| 51 | 51 | | } |
| 52 | | - | storage[gr_id] = store; |
| | 52 | + | storage[gr_id] += store; |
| 53 | 53 | | } |
| 54 | 54 | | } |
| 55 | 55 | | |
| skipped 9 lines |
| 65 | 65 | | for(i = 0; i < l_size; i++){ |
| 66 | 66 | | store += output[i]; |
| 67 | 67 | | } |
| 68 | | - | storage[gr_id] = store; |
| | 68 | + | storage[gr_id] += store; |
| 69 | 69 | | } |
| 70 | 70 | | } |
| 71 | 71 | | |
| skipped 9 lines |
| 81 | 81 | | for(i = 0; i < l_size; i++){ |
| 82 | 82 | | store += output[i]; |
| 83 | 83 | | } |
| 84 | | - | storage[gr_id] = store; |
| | 84 | + | storage[gr_id] += store; |
| 85 | 85 | | } |
| 86 | 86 | | } |
| 87 | 87 | | |
| skipped 9 lines |
| 97 | 97 | | for(i = 0; i < l_size; i++){ |
| 98 | 98 | | store += output[i]; |
| 99 | 99 | | } |
| 100 | | - | storage[gr_id] = store; |
| | 100 | + | storage[gr_id] += store; |
| 101 | 101 | | } |
| 102 | 102 | | } |
| 103 | 103 | | |
| skipped 9 lines |
| 113 | 113 | | for(i = 0; i < l_size; i++){ |
| 114 | 114 | | store += output[i]; |
| 115 | 115 | | } |
| 116 | | - | storage[gr_id] = store; |
| | 116 | + | storage[gr_id] += store; |
| 117 | 117 | | } |
| 118 | 118 | | } |
| 119 | 119 | | |
| skipped 9 lines |
| 129 | 129 | | for(i = 0; i < l_size; i++){ |
| 130 | 130 | | store += output[i]; |
| 131 | 131 | | } |
| 132 | | - | storage[gr_id] = store; |
| | 132 | + | storage[gr_id] += store; |
| 133 | 133 | | } |
| 134 | 134 | | } |
| 135 | 135 | | |
