dead_lock's blog

By dead_lock, history, 3 years ago, In English,

Why has gkSeni been removed from the list of top contributors?

Read more »

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

By dead_lock, history, 3 years ago, In English,

Hello Codeforces community,

I don't know why people have so much craze for contribution that they resort to cheap techniques like creating fake accounts and upvoting themselves. Check

One thing how this could be solved is by increasing the time taken to register the account. CF can add fields like "Organization" and other things mandatory and increase the size of the form. I am not into system design, so not sure if I am speaking wrong.

Second the captcha checking system is not functioning full correct. If captcha needs "1042 revenge", then "0000 revenge" also gets accepted. The captcha fails to match the digits (0 - 9). I tried and successfully generated accounts by wrong captcha.

Finally, I have seen useful comments getting downvotes for no reason. Check. Unnecessary downvotes of figures like -111.
It would be better if some trustable users can be added as "Blog Moderators" who could examine and maintain the decorum. :)

Cheers!

Read more »

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

By dead_lock, history, 3 years ago, In English,

Nowadays, I find that the submission queues go upto 3rd and 4th page. This has become a bit of problem now as I need to wait for really long time, and I just can't concentrate on other problem. I read one two words again switch my tab to see if I got an AC. Please MikeMirzayanov, solve this issue. I really like practising here.

Read more »

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

By dead_lock, history, 3 years ago, In English,

We are given a set V of distinct binary vectors {v1, v2, ...vn} each of size k.
Now you are free to chose a subset of V, SV = {vi1, vi2, vi3, ..., vim} such that

  • 1 ≤ i1 < i2.... < im ≤ n.
  • No two rows should be same in the kXm matrix M = [vi1vi2...vim]

We need to minimize m (the size of subset SV). (ie the columns of M)
For eg: a vector v of size 3 can be [0, 0, 1]T or [1, 0, 1]T and 6 more are possible.

Read more »

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

By dead_lock, history, 4 years ago, In English,

Given a Treen with n nodes and n - 1 edges, I have to answer Q queries. In every query, I get a list of nodes of size k,
n1, n2, ..., nk. I need to answer the minimum number of paths that are required that cover all of these nodes.See the example for better insight

Read more »

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