Hello we have a polyhedron with the linear inequalities of its boundaries in n dimensions. a) how to find the number of integer points in this polyhedron (exact or approximation). b) how to find the coordinates of the integer points in this polyhedron. thank you.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 162 |
| 4 | nor | 153 |
| 5 | maroonrk | 152 |
| 6 | -is-this-fft- | 151 |
| 7 | TheScrasse | 150 |
| 8 | Petr | 145 |
| 9 | atcoder_official | 144 |
| 9 | pajenegod | 144 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/23/2024 06:37:46 (f1).
Desktop version, switch to mobile version.
Supported by
Probably they are NP-hard, otherwise you could solve integer programming.