USACO discussion here. What algorithms did you guys make?

Thread guidelines:

Respond to the [level] #[number] (like Bronze #1) post with your code

If your level and number are not posted yet, post your code as [level] #[number]: [code]

No vote yet

9 votes

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestCan somebody please post these problems? I

Log in to reply

Here

Log in to reply

Thanks! :)

Log in to reply

Another question: Which language did you use? Let's keep a tally in our posts (reply only to this one!)

Python: 1

C:

C++:

Pascal:

Java:

Log in to reply

Python: 2

C:

C++:

Pascal:

Java:

I'm learning C++ now.

Log in to reply

Python: 2

C:

C++:

Pascal:

Java: 1

Log in to reply

C:

C++:

Pascal:

Java: 2

Log in to reply

C++++, but they post linguistic stats after each competition

Log in to reply

Yay results!

I got 667 in Bronze (yay promotion).

1: I hoped I would get it perfect, but failed tests 2 and 3 darn.

2: I thought I might get it perfect, but timed out tests 9 and 10.

3: I knew I would timeout later cases and get earlier ones, but I wonder why I failed test 4.

Also, I used java.

Log in to reply

Congrats! I got 800 in bronze because 6 of the 30 programs timed out. I should've been more efficient on my #3, I had all the time in the world! >:O

Log in to reply

Good job! You probably did the same thing on #2 as me.

Yeah, I was sitting around eating dinner in the last hour. I should have fixed those cases in #1 where \(N<5\) (2 and 3) and I might have been able to improve #3.

If I missed one more case, I would not have gotten promoted, whew!

Log in to reply

I did silver. 1. I use DP (not actual DP) but it is more likely a binary search. 2. I use priority

queue structure data, 2 looping (beginning->end, end->beginning) 3. I use 2 states DP (positionnow,position_last). Again, 2 times (beginning->end, end->beginning)Anyone did the silver?

Log in to reply

i did bronze. #1 (combo) was trivial, #2 (milktemp) i brute forced, #3 i didn't really try. as you can see I'm really bad at programming.

Log in to reply

I also did bronze. #1 was easy, like you said; #2 I also brute forced but later I was shown a better sol; #3 I found a good solution to.

Log in to reply

Ah shoot, I messed up on #1 because I assumed things that made the problem too easy. 400 is okay; maybe next time!

Log in to reply

I'm sorta surprised you guys didn't try #3; what did you find hard about it? Organizing the adjective strings? Efficiency?

Log in to reply

Log in to reply

eh maybe there is i kind of forgot the problem

Log in to reply

http://www.expert5th.in/packers-and-movers-bangalore/

Log in to reply

http://www.expert5th.in/packers-and-movers-pune/

Log in to reply

http://www.expert5th.in/packers-and-movers-bangalore/

Log in to reply

http://www.expert5th.in/packers-and-movers-pune/

Log in to reply

Bronze #3 (observation: the optimal temperature would be at least one cow's lower temperature):

Log in to reply

I think your observation was for #2.

Log in to reply

Bronze #2:

Log in to reply

Bronze #1 (derp, I thought about PIE but I thought it would be too complex) (OOP FTW):

Log in to reply

Bronze. 1 was trivial. 2 was easy if I didn't spend 1 hour doodling. I didn't have time to attempt 3. Overall, a disappointing performance.

Log in to reply

I only solved #1. :'(

Log in to reply