How Can I solve this problem ! https://cses.fi/problemset/task/1712 Will be grateful if anyone can help. Thank You.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
How Can I solve this problem ! https://cses.fi/problemset/task/1712 Will be grateful if anyone can help. Thank You.
https://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 |
---|