int mums 8 1 10, 20, 30, 40, 50, 60, 70 )1 int squarer 3 J 3 1 2, 4, 6 3, 5, 7),

Question

int mums 8 1 10, 20, 30, 40, 50, 60, 70 )1 int squarer 3 J 3 1 2, 4, 6 3, 5, 7), 0, 1, 2 )I for( int i on i 101 i switch (i). case case 5: i V2 if i 2 nuns 3 +1 break case 4: 3 i 1 1 numst i nums i 1 nums t i 2 j 69 t i 50 t 60 I break case 6 Case 7: square t 2 i 6 1 i 4 i 4) break Case 8: Square i 8 2 i 4 i nums 7 nums t square i 3 20 i 1: break case 93 squarel i 10 10 8 i 1 square 1 1 1 square 0 1 2 1 break case 10: squarel i 4 1 i 8 3 nums i 8 1 2 li square numa i 2.] 3 601.3 break; default: int n 01 while n i nums i +m n++ break;

Explanation / Answer

Here is the code explained for you:

#include <iostream>
using namespace std;
int main()
{
int nums[8] = {10, 20, 30, 40, 50, 60, 70};
int square[3][3] = {{2, 4, 6}, {3, 5, 7}, {0, 1, 2}};
for(int i = 0; i < 10; i++)   // For values from 0 to 9.
switch(i)   //Based on i value.
{
case 1:
case 3:
case 5:
        if(i % 2 == i || i % 2 == 1 || (i > 2 && i >= i * i % i))
        nums[3]++;
        break;
case 4:
        nums[i % 3 ? i + 2 : i + 1] =
            nums[i] + nums[i+1] - nums[i + 2] % 69;
        break;
case 6:
case 7:
        square[2][i-6] = (i - 4) * (i - 4);
        break;
case 8:
        square[i % 2][i % 4] = i
            + nums[7] * nums[square[i / 3][20 / i]];
        break;  
case 9:
        square[i / 10][10 % i] =
            square[0][2] - square[1][1];
        break;  
case 10:           //Nothing to worry. This step will not be executed.
        square[i/4][i%3] =
            square[nums[i/2] % 3][nums[i % 8] % 2];
        break;  
default:
        int n = 0;       //For the first value of i, i.e., when i = 0, this step will be executed.
        while(n < i)   //0 < 0 fails.
            nums[i] += n++ * 5;
        break;           //So, no updates, no modifications.
}
for(int i = 0; i < 8; i++)
cout<<nums[i]<<" ";
cout<<endl;
for(int i = 0; i < 3; i++)
{
for(int j = 0; j < 3; j++)
cout<<square[i][j]<<" ";
cout<<endl;
}   
}
/*
When i = 0, default block is executed and no updates, and therefore,
nums[] = {10, 20, 30, 40, 50, 60, 70, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {0, 1, 2}};
When i = 1, nums[3] is incremented. So,
nums[8] = {10, 20, 30, 41, 50, 60, 70, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {0, 1, 2}};
When i = 2, default block is executed,
nums[2] will be updated twice.
First time, nums[2] = 30 + 0 = 30, second time nums[2] = 30 + 5 = 35. So,
nums[8] = {10, 20, 35, 41, 50, 60, 70, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {0, 1, 2}};
When i = 3, nums[3] is incremented. So,
nums[8] = {10, 20, 35, 42, 50, 60, 70, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {0, 1, 2}};
When i = 4, nums[6] is updated, nums[6] = 50 + 60 - 1 = 109. So,
nums[8] = {10, 20, 35, 42, 50, 60, 109, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {0, 1, 2}};
When i = 5, nums[3] is incremented. So,
nums[8] = {10, 20, 35, 43, 50, 60, 109, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {0, 1, 2}};
When i = 6, square[2][0] = 4. So,
nums[8] = {10, 20, 35, 43, 50, 60, 109, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {4, 1, 2}};
When i = 7, square[2][1] = 9. So,
nums[8] = {10, 20, 35, 43, 50, 60, 109, 0};
square[3][3] = {{2, 4, 6}, {3, 5, 7}, {4, 9, 2}};
When i = 8, square[0][0] = 8. So,
nums[8] = {10, 20, 35, 43, 50, 60, 109, 0};
square[3][3] = {{8, 4, 6}, {3, 5, 7}, {4, 9, 2}};
Finally, when i = 9, square[0][1] = 6 - 5 = 1.
nums[8] = {10, 20, 35, 43, 50, 60, 109, 0};
square[3][3] = {{8, 1, 6}, {3, 5, 7}, {4, 9, 2}};
*/

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.