| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | nor | 152 |
| 5 | maroonrk | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
Unbounded knapsack with condition that number of items taken be has to be a fibonacci number
How to solve the following question
You are given two arrays of size N, W(weight) and V(values), an infinite quantity of an item is available, You have to maximize the sum of values such that total weight is less than capacity C and the total number of items taken is Fibonacci number
1 <= N <= 1000 1 <= C <= 1000 1 <= W(i) <= 1000 1 <= V(i) <= 1000
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en5 |
|
vib_1 | 2020-05-12 13:37:17 | 92 | Tiny change: 'tity of an item is a' -> 'tity of any item is a' (published) | |
| en4 |
|
vib_1 | 2020-05-12 13:14:53 | 411 | (saved to drafts) | |
| en3 |
|
vib_1 | 2018-08-15 07:12:35 | 107 | ||
| en2 |
|
vib_1 | 2018-08-14 20:58:40 | 39 | Tiny change: 'Given an a' -> 'How to solve the following question\n\nGiven an a' | |
| en1 |
|
vib_1 | 2018-08-14 20:58:03 | 358 | Initial revision (published) |
