XX86's blog

By XX86, history, 7 weeks ago, In English

How Can I solve this problem ! https://cses.fi/problemset/task/1712 Will be grateful if anyone can help. Thank You.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By XX86, history, 2 months ago, In English

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*/

Read more »

 
 
 
 
  • Vote: I like it
  • -10
  • Vote: I do not like it

By XX86, history, 3 months ago, In English

How Can I solve this problem!https://www.codechef.com/problems/COZIE Can anyone explain,please?

Read more »

 
 
 
 
  • Vote: I like it
  • -3
  • Vote: I do not like it

By XX86, history, 3 months ago, In English

How Can I solve this problem ! https://vjudge.net/problem/UVA-11904 Will be grateful if anyone can help. Thank You.

Read more »

 
 
 
 
  • Vote: I like it
  • +9
  • Vote: I do not like it