« 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 appear intuitive when you are used to the old 
system is when you are writing fast and dirty solution for small and then think 
about the large to be more efficient. You can totally do that here since you 
can submit as much as you want but then will it count as penalty if you fail 
hidden at first ? Then succeed at the second attempt ? 

Envoyé de mon iPhone

> Le 8 avr. 2018 à 22:26, Bartholomew Furrow <fur...@gmail.com> a écrit :
> 
> 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.

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/844CFB2B-B067-4118-A259-AC1B3A6F04E6%40gmail.com.
For more options, visit https://groups.google.com/d/optout.

Reply via email to