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.
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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.