CodeR_SaaD's blog

By CodeR_SaaD, history, 2 years ago, In English

I received this message from the system.

Attention!

Your solution 170294427 for the problem 1722G significantly coincides with solutions kshitijsabale/170235981, pravin_as/170236185, sksusha8853/170244580, coomlhamdle/170268986, no-one/170270439, pritish_001/170280715, vamshikrishna7697/170283391, CodeR_SaaD/170294427, blablablacksheep/170295836, abhirai24/170297702, xorhero_02/170299463. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://mirror.codeforces.com/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.

This question had a similar logic as https://www.geeksforgeeks.org/find-n-distinct-numbers-whose-bitwise-xor-is-equal-to-k/, which means the code was published (code available before the contest) before the round, so I thought to use it as I had seen this post previously. Also, I think it is permissible to use the code from a book/article that was published before the contest. I think that the coincidence has occurred due to the use of a common source published before the competition. I don't even know any of the person's mentioned above. I didn't communicate with anyone during the round. Here is the link to my submission, https://mirror.codeforces.com/contest/1722/submission/170294427. Is it a violation of rules, if it isn't then I request you to please look into this and resolve this and make the round rated for me.

Thank You!

Full text and comments »

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

By CodeR_SaaD, history, 4 years ago, In English

Please help me solve AtCoder Contest 155 Problem D (Pairs).I can't think of any other solution except brute force approach.

We have N integers A1,A2,...,AN

.

There are N(N−1)/2 ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?

Full text and comments »

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