OJ Board

I'm unable to solve this problem correctly. Please help me:

You have chess board of size N x M and a lot of bricks of size K x 1.
How many bricks can you place on this board (brick edges must be
pallarel to board edges)

Sample data:
N = 10, M = 10, K = 4
RESULT = 24

N = 8, M = 5, K = 5
RESULT = 8

Thanks, but I'm still looking for O(n^3) solution .

Could anybody tell me, how should I modify Floyd-Warshall algo O(n^3), to receive correct answer? I know how to solve same problem (using F-W) but without limit to number of exchanges and this great 1% ;]. What I already know: 1) I change the d [j] = min(d [j], d [k] + d[k][j]) to d [j] = max(d [j],...

Thanks a lot ( I got accepted ).

Hello. If I have understood problem number 594 I should only reverse all the bytes in the data. So, I convert the data into binary ( in the string of course ), then reverse each 8-bits blocks and for half of examples I receive good answer. What's wrong in my thinking? Exaple: input: x output: y x ( ...

Hello.

Can anyone tell me some about backtracking.
There's a lot of such problems. For ex. 524 - "Prime Ring Problem".
There are very interesting, so I want to learn some about
this algorimic method. Please help.

Thanks.

Yo

1) Could you move your code into "C++" statements ? It will be readable.

2) Remove comments from your code.

3) Possibly, the error occurs, because you are using classes in some uncompatible
style. This problem is realy easy, so you musn't use classes. One array should be enought.

Yo

1) I think you should better use "long long" ( 64bit integer ) than double.
It will make less problems.

2) Use precalculation ( first count everything into to table, later read
input and show answer ).

3) Your algo is good.

Yo

Ok

I repaired that and I accepted.

Thx.

Ok

I repaired that and I accepted.

Thx.

It's working now. There was an error in line

[cpp]
max = 0xffffffffff;
[/cpp]

There was too small

Thx everyone.

I sent it as cpp code, so it should work.

Hello. My program seems to work good, but the judge gives WA. Could you look at that and tell me, what wrong?! [cpp] #include <stdio.h> int lenghtof(int); int main() { int count, // ilosc studentow max, // maksymalna kwota w automacie amount, // aktualna kwota w automacie amount2, // tymczasowa kwot...

What's wrong? Please help. [cpp] #include <stdio.h> int main() { int tab[1001], c, n, n2, count, count2, c1, c2; while(scanf("%d %d", &n, &c) == 2) { count = 0; for(int tmp = 1; tmp <= n; tmp += 2) tab[tmp] = 1; tab[2] = 1; for(int tmp = 2; tmp <= n; tmp++) for(int tmp2 = tmp*2; tmp2 <= n; tmp2 += t...

Hello. I wrote program nr. 102 but I received Compile Error Could anyone help me? There's a source code: [cpp] #include <stdio.h> #define B 0 // Brown bottles #define G 1 // Green bottles #define C 2 // Clear bottles int main() { char *done; int pass; long long bins[3][3], oldbins, count, max; while...