On the contrary, it would be inappropriate to decide not to
investigate possible cheating just because of someone's past track
record. That said, I agree with the decision to let this pass, as it
is clear enough that the common code is mainly due to the use of a
common team reference.
On Oct 6,
By the way, Dmitry and Natalia are gold medalists of last year ACM
ICPC world finals. It was wierd to think that they need to cheat :o)
Thanks,
Skidanov Alexander
On Oct 6, 12:11 am, dmitrymatov wrote:
> I'm in complete shock. We have been working hard for years to build
> the unified team c
Congratulations for you and Natalia, you both didn't deserve to be
disqualified.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this group, send email to google-code@googlegroups.co
Finally, I was granted to participate.
Thank all of you for your replies. Who knows, may be they played
important role in the fact that the jury made the right decision.
On Oct 6, 1:52 am, Davi Costa wrote:
> I'm in ACM-ICPC contests too, and I agree in this:
> - implementation of max bipartite
I'm in ACM-ICPC contests too, and I agree in this:
- implementation of max bipartite matching algorithm (the same for
both of you)
The implementation will determine the name of the matrix or adjacency list
too and consequently the reading data, and construct a graph is a so common
task in programm
I was thinking recently about such possibility. What if an ACM team
members are practicing a lot together, have same code template, have
same coding conventions, have same usual names of variables and
functions, and have same library of prewritten code. It may happen
that they write very similar (
To add to this: Dmitry and Natalia have appealed this decision, so it has
not been finalized, and has not been examined by a jury of any kind. We'll
make a final decision and contact the appellants, at which point they're
free to share with you what we decide.
Thanks Roman for adding your voice t
Overall, you don't have a lot of flexibility in writing a solution for
C - both easy & hard. The code consists of:
- template (the same for both of you)
- implementation of max bipartite matching algorithm (the same for
both of you)
- reading the data, constructing the graph, and writing the data
