I was solving TCO 2015 and saw this code, someone knows it for?
public static int getMask(int n){
return n != 0 ? 1 << n % 10 | getMask(n / 10) : 0;
}
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
I was solving TCO 2015 and saw this code, someone knows it for?
public static int getMask(int n){
return n != 0 ? 1 << n % 10 | getMask(n / 10) : 0;
}
Название |
---|
the method build a set where the k-th bit is 1 if the the digit k appears in N, 0 <= k <= 9.
Example, N = 42594 getMask(N) = 1000110100 in binary, notice that the rightmost bit represents the status of the digit 0.