Hi,
I'm glad we agree on the benefits of black box testing. As I said before,
we completely agree with the sentiment that there's lots of important
reasons to make practice available. It's high on our list of priorities and
we are working to make that happen ASAP.
Best,
Pablo
On Fri, Apr 13,
Hello Pablo
>>The reason to hide the test cases is because testing is an important part of
>>programming. Providing people with real test data, even without the expected
>>answer, would be doing a lot of the work for them.
I completely agree. We shouldn't get test cases, even for small during
I'm talking about opening the visible dataset for those who have passed the
tests already. Not a big deal if the participant could compare his solution for
the hidden dataset with the results on tests for the visible dataset.
As an alternative there could be an option to allow to submit the
Hi,
The reason to hide the test cases is because testing is an important part
of programming. Providing people with real test data, even without the
expected answer, would be doing a lot of the work for them. In the previous
system with I/O downloads, there was no alternative, but this is much
There could be a reasonable solution of the problem with testing Hidden after
you have solved the Visible. What if the platform would allow the participant
to download the whole visible dataset as soon as he has solved it? He has
earned the points for his submission of Visible, why not to open
Yeah for these large datasets I find it best to write your own test cases
and see how your algorithm run against them. Even
np.random.randint(0,1e9,1e5) or something of the sort works well to see how
fast (or slow) your algorithm runs.
On Sun, Apr 8, 2018, 16:41 Felix Voituret
That's a good point about not being able to test your new solution on the
same input that you know you got right, Dmitriy. A few other thoughts:
- I don't know whether the UI makes this clear -- note to team, hopefully
there's a really clear indication that you still have points from previous
Bartholomew: there is another concern. Let's imagine that I've solved the
Visible dataset, and I know for sure that this doesn't solve the Hidden one. I
submit the solution, I get the positive verdict, and I start the better
implementation. In the old platform I can always compare the results
For me the issue is whether we're looking at something closer to 1e7 or 1e9
operations per second, which has a pretty significant impact on what
algorithms can work to solve a problem.
On Tue, Apr 10, 2018 at 1:13 PM wrote:
> Actually you can figure out for yourself
Actually you can figure out for yourself without running the code if a idea
will got TLE or not. It is normally if you know the complexity of your solution
and compare it to problem restriction. For example, it is obviously that O(T *
n^2) will got TLE in Trouble sort problem, because the size
You can know by the icon they disply,if it ? And displying NOT this
message"testing skiped"
On Mon, Apr 9, 2018, 01:13 Felix Voituret wrote:
> Well the real difference here is that you do not know if the time limit
> was respected for the hidden dataset (previously
Yes! Time Limit Exceeded. It's an acronym from the UVA online judge, and/or
TopCoder. I admit that I was curious to see if it would be recognized. :-)
Felix: That's a really good point. I had half of that realization during
the round about D, and I'm glad that you expressed it so clearly.
I
Time Limit Exceed i think ?
Envoyé de mon iPhone
> Le 8 avr. 2018 à 22:38, Leandro Coutinho a écrit :
>
> Thank you Bartholomew !
>
> What is TLE?
> Temporal lobe epilepsy? :D
>
> Em Dom, 8 de abr de 2018 17:27, Bartholomew Furrow
> escreveu:
>>
Thank you Bartholomew !
What is TLE?
*Temporal lobe epilepsy? :D*
Em Dom, 8 de abr de 2018 17:27, Bartholomew Furrow
escreveu:
> I have a few thoughts, and I want to emphasize once again that although I
> used to be on the Code Jam team, I no longer am.
>
> First: I don't
« You can find lots of problems where there's a simple algorithm that would be
correct on the Small, and incorrect (not just slow) on the Large. »
The first problem of this round is typical as input structures are differents
for visible / hidden datasets.
Well the only thing that doesn’t
I have a few thoughts, and I want to emphasize once again that although I
used to be on the Code Jam team, I no longer am.
First: I don't think Hidden sets are really run after the contest. At the
end of the Qualification Round, all scores were visible immediately. We
used to judge Large inputs
Previously you also had to estimate the runtime for your large submission.
If you started downloading the input file for large submission, and
couldn’t finish before running out of time, you still lose points.
The new system however, allows you to submit again if you later find a
better solution
It isn’t « worst » at all. It is different, bringing new feature at the same
time. I got tricked by the large dataset in B too, and doesn’t have time this
week end to check other problems, that alright, I will be aware of that next
year so this is not a problem. We just have to change old
Hmm good point.
So CodeJam is worst now.
Worst is not the best word. The previous system was really good.
Em Dom, 8 de abr de 2018 17:04, Xiongqi ZHANG
escreveu:
> The hidden test is run after the contents ends. How is it possible to tell
> you that your program will
The hidden test is run after the contents ends. How is it possible to tell
you that your program will finish or not if it was not actually run?
On Sun, Apr 8, 2018 at 12:56 PM Leandro Coutinho
wrote:
> Good point.
>
> They should let us know if the program finished on
Hello,
Is there possible to download solutions solved by contestants.
Regards,
Sujit
On Sun, Apr 8, 2018 at 7:49 AM, 'Ian Tullis' via Google Code Jam <
google-code@googlegroups.com> wrote:
> Hi, everyone,
>
> The 2018 Code Jam Qualification Round has officially ended. Thank you to
> everyone
21 matches
Mail list logo