I_love_Chris_Evans's blog

By I_love_Chris_Evans, history, 5 months ago, In English,

There's an array A of N elements. You don't know the element values, but you do know that each of them is a power of 2. You are given xor of some segments of this array, and your task is to determine one valid array, which satisfies all the segment xor.

eg: N = 6, segments = 3
xor: [1, 2] = 3, [2, 3] = 0, [3, 6] = 12
one valid value of A is [1, 2, 2, 8, 2, 4].

Read more »

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

By I_love_Chris_Evans, history, 5 months ago, In English,

Hello everyone!

Can anyone please help me with this problem : Given a graph with positive weighted edges, how to choose a subset of edges with maximum sum such that no two edges share a common vertex?

This wasn't taken from any judge, I'm just interested in knowing how it can be solved. As it's not from any judge, there are no constraints except what I already mentioned above.

Thanks!

Read more »

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

By I_love_Chris_Evans, history, 5 months ago, In English,

If anyone's looking for a teammate, please let me know. Female participants preferred(as then we have all girls team). No restriction on ratings :)

Thanks!

PS: Requesting to not spam in comments.

Read more »

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