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 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
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.