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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
8 | SecondThread | 146 |
10 | pajenegod | 145 |
Название |
---|
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.