| # | User | Rating |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 154 |
| 5 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
A number never have a odd divisor which can be represent as the power of two. A famous way to find out the number can be represent as the power of two or not is:]
n & (n — 1) by this operation we will get a number which is an even number also the number can be represent by the power of two.So if by doing this operation we get any number which is represent by the power of two.That means 'n' has no odd divisor.watch the problem 1475A
A number can be represent as the sum of k odd number when the n%2 == k%2
and obviously k*K should less then n.
The statement of 1327A is also saying that.
