The problem is 1207D number of permutations. https://codeforces.com/contest/1207/problem/D Here is my code https://codeforces.com/contest/1207/submission/62746660 Its showing runtime error.
# | User | Rating |
---|---|---|
1 | tourist | 3544 |
2 | wxhtxdy | 3411 |
3 | Radewoosh | 3386 |
4 | Benq | 3368 |
5 | mnbvmar | 3280 |
6 | ecnerwala | 3278 |
7 | LHiC | 3276 |
8 | sunset | 3264 |
9 | yutaka1999 | 3190 |
10 | maroonrk | 3183 |
# | User | Contrib. |
---|---|---|
1 | Errichto | 190 |
2 | Radewoosh | 177 |
3 | tourist | 173 |
4 | antontrygubO_o | 171 |
5 | Vovuh | 166 |
5 | PikMike | 166 |
7 | rng_58 | 159 |
8 | majk | 156 |
9 | farmersrice | 153 |
9 | Um_nik | 153 |
The problem is 1207D number of permutations. https://codeforces.com/contest/1207/problem/D Here is my code https://codeforces.com/contest/1207/submission/62746660 Its showing runtime error.
Name |
---|
This thing has been said many times already on codeforces. Just replace all $$$\le$$$ with $$$<$$$ in your comparators (func and func2). (It's called strict weak ordering which STL algorithms expect, you may google more about it)
BTW, you have a really bizzare coding style. You almost never need to use unsigned data types to solve a problem as almost all problems have constraints in such a way that the values fit in a signed data types. Also, thinking whether to use unsigned or signed data type might also take a lot of time and is also prone to errors. So, please avoid using unsigned data types especially for solving CF problems.