Hello Everyone,
I was solving problem 1503B - 3-раскраска and my submission is 144772587 getting desired answer on my IDE but getting different answer on CodeForces.
Any solution to fix this?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Hello Everyone,
I was solving problem 1503B - 3-раскраска and my submission is 144772587 getting desired answer on my IDE but getting different answer on CodeForces.
Any solution to fix this?
Please help me solving this problem I am not getting any idea for this.
Problem ->
Given a number N , consider all whole numbers ≤ N , ie, (0,1,…,N) . Find the sum of the bitwise AND of all consecutive numbers.
For example, the bitwise AND of 5= 101 and 7= 111
(5&7)=( 101 & 111 )=101 =5
Since this sum can very large, print the final answer modulo 109+7
(Note: Be careful of overflows while dealing with large numbers.)
| Name |
|---|


