Can someone solve this programs?

[Djordjevic]

1! Little Tom was bad, and for the punishment he was given the duty to paint the wall. The wall can be presented as a 2D array with N rows and M columns. Tom has a very strange brush with which he can in either row give the paint or the first Ai columns or the last
M-Ai columns. To Tom, each column is boring as much as the product of the number of painted and unpainted fields in that column. The total wall boredom is equal to the sum total of the boredom of all columns. Help Tom and calculate the least possible wall boredom after staining.


Input 1:
2 3
1
2
Output 1: 1
Input 2:
4 4
2
1
4
1
Output 2: 6
~~~~~~~~~~~~~~~~~~~~~~~~
Problem 2:

The notorious master of all rodents, Black, intends to subjugate the whole world. However, a good part of Perine Farm will serve for now.

Perin's farm can be presented as a matrix M of dimension N × N where Mij field contains one number - the sort of apples that Pera breeds in that field. It is known that Pera marks the varieties with some numbers between 1 and K.

Strange roads are rocks, and Cirlet's regular army can subjugate only the best territories. We say that the territory is suitable if it is rectangular in shape, it contains only one variety of apples and this variety is located only within that territory.
Hiring elite rats costs too much, and Çrleta is interested in the extent to which Perina Farm has a suitable territory (he himself does not know why). Since Ćrle is too busy eating cheese, he asked you to designate it instead

Input:
5 10
3 2 2 1 4
3 2 2 7 4
8 2 2 1 3
8 8 9 9 9
8 8 1 5 1
Output: 5
explain output: good parts of farm are those who contains numbers 2, 4, 5, 7 and 9

CAN SOMEONE DO THIS IN C?

[rstanley]

Please read the "Forum Rules FAQ's"! YOU need to try to create the program yourself, then we can give comments and advice.

[Djordjevic]

I was trying for 3-4 hours with my friend and we cant do it

[rstanley]

You need to post the code you have so far so we can compile, and test, then give advice.

NO ONE here is going to write the program for you!

[Djordjevic]

Problem is that i cant find solution for both programs, can someone give me hint or tell me way of thinking

[rstanley]

Aparently we cannot since you will not cooperate with us. Please read my first reply and the link I put in the message.

[stahta01]

Step 1 solve the problem with pencil and paper before you try to code the solution.

I have no idea how to solve the first problem because I fail to understand it.

The second I can solve using pencil and paper; but, I see no simple solution just a brute force type of solution.

Tim S.

[john.c]

Problem 1 reworded (I think) :

You are given a grid of bools of N rows by M columns, initially false.
For each row you are given a number A and you can either set the first A columns or the last M-A columns to true.
After that, multiply the number of false positions by the number of true positions in each column and sum them.
What is the minimum possible sum?

Input:
N M
A1
A2
...
AN

Example 1:
2 3
1
2

F T T
F F T

0 * 1 + 1 * 1 + 1 * 0 = 1

Example 2:
4 4
2
1
4
1

T T F F
T F F F
F F F F
T F F F

1 * 3 + 3 * 1 + 4 * 0 + 4 * 0 = 6

There's only 2 posibilities to try for each row, so the brute force solution needs to test 2 pow N possibilities.