Is C++ hard?
All the negative massive elements need to be changed to the columns that the element is in sum.
ehrm could you repeat this with other words :O
Comment has been collapsed.
ho intuito che fosse una matrice, ma non l'ho mai sentita chiamare massive onestamente xD
Comment has been collapsed.
the entitity of gloomy colossal particles demand transformation directed toward the cavalcada such piece befalls amount
there, I used a thesaurus on every word :D
Comment has been collapsed.
Lord GabeN could have done that faster than asking the question upon you thou ;)
Comment has been collapsed.
for (i = 0; i < 4; i++) { for (j = 0; j < 3; j++) { if (arr[i][j] < 0) { arr[i][j] = (i+1) + (j+1); } } }
I give up on this markup.
Comment has been collapsed.
Indexes of array start from 0 as I remember, so column 1 will have 0 index. (haven't seen any C++ code for 2 years)
UPD: +I think EndLau need column and row sum, not colunm and column.
Comment has been collapsed.
Got it, not index (number), but values of column.)
Comment has been collapsed.
replace arr[i][j] = (i+1) + (j+1);
with sth like
arr[i][j] = 0; for (n = 0; n < 3; n++) { arr[i][j] += arr[i][n] }
Comment has been collapsed.
not sure, maybe my english s bad or OP chose bad wording, but we don't even know which of this 2D array is the row and which the column.
you're suggesting to sum up all elements of the array, while I'm suggesting that the second array represents the column, and only add up the column, because:
All the negative massive elements need to be changed to the columns that the element is in
but, like I said, I'm not a native english speaker, I don't understand OP's problem very well and the task generally leaves some questions unanswered
oh, and you're only overwriting the same position, not summing it up, but changing
E[i][j] = E[x][y];
to
E[i][j] += E[x][y];
would probably fix it.
again, we don't even know if we're supposed to reset E[i][j] before accessing it again to be a part of the sum or if we should leave it as is to sum it up. if E[i][j] is a huge negative number, we'll just end up with a negative number again. if all values are negative, the numbers will just get smaller and smaller ...
Comment has been collapsed.
That's what I'm up to right now:
const int m = 4;
const int n = 3;
int main()
{
ofstream fr("asd.txt");
int E[m][n];
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
if (E[m][n] < 0)
{
E[m][n] = (i + j);
}
}
cout << E[m][n] <<endl;
fr << E[m][n] <<endl;
}
fr.close();
_getch();
}
Comment has been collapsed.
you're never assigning values to your array in the first place, so how would you know what originial values you're starting with and what result you're expecting?
Comment has been collapsed.
419 Comments - Last post 36 seconds ago by CalamityUP
2 Comments - Last post 4 minutes ago by lostsoul67
169 Comments - Last post 41 minutes ago by fackia777
152 Comments - Last post 1 hour ago by steamgiftski
47,166 Comments - Last post 5 hours ago by Axelflox
56 Comments - Last post 5 hours ago by Axelflox
41 Comments - Last post 6 hours ago by bttr
78 Comments - Last post 14 seconds ago by grissenko
71 Comments - Last post 1 minute ago by PonBaron
5 Comments - Last post 10 minutes ago by Carenard
760 Comments - Last post 20 minutes ago by mikagee
249 Comments - Last post 38 minutes ago by crusader5
116 Comments - Last post 1 hour ago by Fluffster
12 Comments - Last post 1 hour ago by vlbastos
Hello, I've got a C++ task that I need to do but I wasn't learning C++ before and it's kinda hard for me, so I decided to ask you guys for help. Here's the task: You have a two dimensional massive E[m][n]. m = 4, n = 3. All the negative massive elements need to be changed to the columns that the element is in sum. The answers need to be put in a .txt file.
Would there be a person who could help me with this? The only thing I know how to do is the second part where I need to write the answers in the .txt file.
A bump from time to time would be nice :)
Comment has been collapsed.