| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
I am trying to generate all possible unique permutation by using bitmask , code:(http://ideone.com/2SZyGh) .but how can i handle the repeated value.
EX. for the input 112 output should be(112,121,211).But my code give 6 permutation with 3 same value.
you may want to consider using next_permutation. (it's inside algorithm.h)
code
what this function actually do?
I am sure it is for debug purposes only.
it's ASSERT. If condition is not true program fails by Runtime Error. If my program recieves Runtime Error, i can replace body of this function by while(!bb) ;;;; Now if program recieves TLE it's assertion failure, otherwise it is real RE.