A = [[0, -2, -5, 2],[1, 6, -3, -2],[-2, 6, 3, -4]]

i, s = 0, 2

while(i < 3):

for i in range(4):

if(A[i][j]%2 == 0):

s = s + A[i][j]

i = i + 1

print(s)

int A[3][4]={{0, -2, -5, 2},{1, 6, -3, -2},{-2, 6, 3, -4}};

int i = 0, s = 2;

while(i < 3){

for(int j = 0; j < 4; j++)

if (A[i][j]%2 == 0)

s = s + A[i][j];

i++; };

cout << s;

def f(k, n):

s = 0

for i in range(n+1):

s = (s + i)/k

return s

void f(int k, int n){

float s = 0;

for(int i = 0; i <= n; i++)

s = (s + i)/k;

return s;}

Mứt dừa

2 hộp

40000đ

38000đ

Bánh quy

2 hộp

70000đ

65000đ

Bao lì xì

20 cái

100000đ

90000đ

Cành đào

1 cành

250000đ

225000đ

….

…

…

1

2

3

4

5

6

def F(A, k, n = len(A)):

sum = 0

for i in range(n):

for j in range(n):

sum = sum + A[i][j]**k

return sum

int F(int A[], int k, int n = A.size()){

int sum = 0;

for(int i = 0; i < n; i++)

for(int j = 0; j < n; j++)

sum = sum + pow(A[i][j], k);

return sum;};

1

2

3

4

5

6

def F(A, k, n):

d = 0

for i in range(1, n):

if A[i] > A[i-1] and A[i] == k:

d = d + 1

return d

int F(int A[], int k, int n){

int d = 0;

for(int i = 1; i < n; i++)

if (A[i] > A[i-1] && A[i] == k)

d = d + 1;

return d; };