I have problem and i think it's about Dynamic programming but i'm not sure. By the way, i can't find out how can i solve this. Dynamic programming just an instintic.

Problem:

We've got a standard chessboard (8x8) and we got infinite knights. We gonna put these knights onto chessboard. There is only one condition: Number of knights in all rows and columns must be odd. How many possible solutions there?

I've tried to find answers for 2x2, 3x3, 4x4 chessboard using brute force and tried to understand pattern or find a formula but i cant find it. Please help me how can i find the solution.

Today my friend ask me a question and i need help

This is the question:

he randomly wrote numbers 1 to 100 on a paper. But somehow he missed a one number. How many ways you find the missing number.

But please don't write very similar answers like

let define tzv=sum all of the numbers he wrote

and missing number is (100*101)/2-tzv

that is a solution but you do it multiply all numbers it will be count same because this two solution is almost the same.

So how many ways i find the missing number?

a

a

a

a