forum.virtualchallengemeets.com

All im going to say right now is that these are basically impossible. any tips on doing them.

They are not impossible. Most of them follow a pattern. If you cannot find the shortcut, you need to practice more. If you give specific examples, I will help with those.
Qualifications: 3rd 4A State Computer Science in 2011.

what about the ones on the district tests

The one on district 1, my teammate got it right. we discussed it and here's how he did it. He logiced it out that the second one would return it. i don't have the actual test right now but here's what it was in pseudo

int m1 = 1 + recursive call
int m2 = 2 + recursive call
int m3 = 1 + recurseive call

return max of m1 m2 and m 3

he logiced it out that m2 had to be the highest with 2+ 2 + 2 + 2+ 2...

i'll have more details when i get my test later, but that's what he told me.

I don't think you can post anything about district questions until like this Saturday night, just saying, cause it makes it to a certain level unfair to those competing for wildcard.

i personally don't think it'd matter, being that this is district week 1, and the timeframe for that test is over, but i don't want to risk disqualification. i have the problem and everything, but i'll post how we did it saturday night when district week 2 is over.

ok, how would you write a mouse clicker program? You know, just have the mouse keep clicking on something?

Dont you implement the mouseListener interface or whatnot

yes. mouselistener.

anyways. i have the explanation of the problem in my drafts, and i'll post it on sunday/tomorrow night.

it seems UIL is using more logic on cs tests though. gotta keep that in mind for regions :)