Can someone provide a few problems solvable with Lagrange Multiplier ? I have solved just one problem UVa 12407 and want to try some more.
# | User | Rating |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 160 |
3 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
Name |
---|
622F - The Sum of the k-th Powers
That's not an optimization problem. Is it really solvable using Lagrange multipliers?
oh sorry I miss read the title as lagrange "polynomial"
http://wcipeg.com/problem/noi12p2
Try this
Ad Infinitum 14 — Random Number Generator
thanks all :)
http://codeforces.me/gym/100210 B
I remember this was related to lagrange (one of my teammates solved it and he said that)
I am not really sure