Hi there: I might be doing a coding competition soon, I was wondering if anyone made one and what where the guidelines/ process. I'd like to make the competition appealing to all devs, and I m trying to come up with ideas as to how. the scenario is: There is an event running and we(of the coding competition) will have a room that we can...
In a sequence of length n, where n=2k+3, that is there are k unique numbers appeared twice and three numbers appeared only once. The question is: how to find the three unique numbers that appeared only once? for example, in sequence 1 1 2 6 3 6 5 7 7 the three unique numbers are 2 3 5. Note: 3<=n<1e6 and the number will range from 1 ...
Err....I guess this aint correct place to ask this question... But i couldn't find any place where i could get the desired coding problems, that i should put up in a Coding contest, which we are organizing as a part of our college function & I really want the Problems to be Advanced! ...
Yes I want to start programming competitions so I dont know how to submit in Java? Answers very apreciated bye ...
Hello I dont understand what I supposed to do in this exercise, I am begining programming constest, if you can help me is very appreciated, I have seen formulas, but I dont understand what to do, I feel very stupid , and for everyone is easy :( http://www.codeforces.com/contest/1/problem/A ...
This problem is a subproblem of a problem posed in the ACM ICPC Kanpur Regionals Elimination Round: Given 2 line segments bounded by the 2D points (Pa, Pb) and (Pc, Pd) respectively, find p and q (in the range [0,1]) that minimizes the function f(p, q) = D(Px, Pa) + D(Py, Pd) + k D(Px, Py) where 2 <= k...