How Can I solve this problem ! https://cses.fi/problemset/task/1712 Will be grateful if anyone can help. Thank You.
| # | 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 |
How Can I solve this problem ! https://cses.fi/problemset/task/1712 Will be grateful if anyone can help. Thank You.
https://mirror.codeforces.com/problemset/problem/1110/C IN this problem,when a=2x−1. This implies gcd(a⊕b,a&b)=gcd(2x−1−b,b)=gcd(2x−1,b), since gcd(x,x+y)=gcd(x,y) (for all x and y), hence it's sufficient to find the largest non trivial divisor of a — it will be the desired answer.(From editorial) But,why this work? Can someone please explain the solution in more detail? Will be grateful if anyone can help. /*sorry for poor English*/
How Can I solve this problem!https://www.codechef.com/problems/COZIE Can anyone explain,please?
How Can I solve this problem ! https://vjudge.net/problem/UVA-11904 Will be grateful if anyone can help. Thank You.
| Name |
|---|


