Teamscode is tomorrow! make sure to sign up!

As a problemwriter, I prepared a nonpositive amount of problems and touched a nonnegative amount of grass.

yayyy enjoy the contest!

Auto comment: topic has been updated by jay_jayjay (previous revision, new revision, compare).

Auto comment: topic has been updated by jay_jayjay (previous revision, new revision, compare).

chat i don't think tc will have edis next contest at this rate :sob:

TeamsCode is in 2.5 hours!

As an organizer, I claim that TeamsForces >> CodeCode

Auto comment: topic has been updated by jay_jayjay (previous revision, new revision, compare).

RIP Baekjoon OJ

awesomeguy856 orz

High school being <=18 doesn't really make sense, (at least in the US) there are a lot of HSers who are older than 18. Perhaps copy the IOI criteria of <20 and in high school?

How to not disbelieve in something that is correct?

Seriously though, I have the exact opposite problem as yours. Sometimes, I incorrectly dismiss an idea or approach because I think it's wrong, or because I can't prove it......

Auto comment: topic has been updated by jay_jayjay (previous revision, new revision, compare).

Auto comment: topic has been updated by jay_jayjay (previous revision, new revision, compare).

gmbl orz

As a problemsetter, C0DET1GER orz.

yeah we have to use bigints to store point values

20! = 2,432,902,008,176,640,000

shsh orz

what are the bounds on the weights? this is rather important i think..... as tinca_matei said, it is definitely np-hard for large weights (even assuming you can multiply in O(1))

also, is there a bound on the answer? otherwise, it can get rather large .....

Great problems! dantheman orz

oops i wrote if(n==1) print(1), rip 1 submission and 10 minutes of contest time

hungry arachnid is a good problem yayy

Five hours on three problems? Pretend each subtask is a problem, then it really becomes 5 hours on 10~15 problems. Subtasks are like hints, they are there to help you and to guide you to the solution. Please don't ignore them... For example, on USACO contests, I usually get a large portion of my points from subtasks entirely.

If you're solving hard USACO Plat problems in 1.5~2 hours, you probably are good enough to do well on almost any olympiad. Just don't panic and enjoy the problems (panicking won't help you, anyway). Good luck!

As a setter, waymo orz.

also java rounds towards 0 too so thats why you see it in java as well D:

see https://en.algorithmica.org/hpc/compilation/contracts/#arithmetic

tl;dr: bit shifting doesnt work directly for signed integers cuz of rounding reasons (stupid c++ rounding toward 0 as always)

299814561 still doesn't pass D:

iframe orz

You can also solve in O(Q log N) with PST walking

D is a nice problem, really enjoyed it in contest.

Also, L is nicer to do if you count count the number of 2 squares divided by a vertical line and horizontal line, and subtract overcounts.

rutgers orz

As a tester who has not tested yet, the problems are very good and you should take the contest!

cry orz

As a problemsetter, we are non-trivially on schedule this time :D.

This trick is so cool!

tibinyte orz

For each of the statements above, either they are true or they are false.

sto bnxe orz

Has information been sent out yet? I signed up a few weeks ago (I'm a usaco camper), but haven't received any information yet. Thanks!

As a problem setter, I set a nonnegative amount of problems.

Esomer danx orz, I know they set good problems from personal experience :)

RIP I love vim

Actually, you can do this even faster, b/c you don't need to check primes $$$p*p \gt x$$$. This is ~3-5 times faster than your solution. (using recursive templates)

template<int L = 0, int R = P, int M = (L + R) / 2>
constexpr void fact_p(vector<u32>& vec, u32 &x) {
        if constexpr (L + 1 < R) {
                fact_p<L, M>(vec, x);
                if (L+20<R && x < primes[M]*primes[M]) return;
                fact_p<M, R>(vec, x);
        } else if(x % primes[L] == 0) {
                factor_helper(vec, x, primes[L]);
        }
}