How to sort the problems in order of number of tries or number of fails?
I just know sort the problems in order of solved:
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
How to sort the problems in order of number of tries or number of fails?
I just know sort the problems in order of solved:
Happy Programmer's day every body :)
wish the best for all
anyone can give me useful link which contains recursive best first search algorithm pseudo code?
like this (for IDDFS)
thanks for your help
can someone explain more for this problem (510C - Fox And Names)?
I read editorial but I didn't get that
Thanks for your help
int limit = 1 << n;
for (int i = 0; i < limit; i++) {
if (Integer.bitCount(i) >= 3) {
System.out.println(i);
}
}
can some one help to solve the problem with good time complexity?
why I got Time Limit in this problem?
Hi every one
my code runs in my computer and every thing is OK, but I got runtime error in judge. what's wrong?
Name |
---|