# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | atcoder_official | 162 |
3 | maomao90 | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
Name |
---|
It seems like a very constrained version of the "count integer points inside a polytope" problem. For fixed dimension there are polynomial solutions for it. See: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension Is Fixed [AI Barvinok · 1994].
I don't know for sure, but possibly you can maybe simplify this paper a bit and just implement that. Still that seems really hard. I don't know if there's any easier ideas.
Thx, I’ll give the paper a read. appreciate your help here!