BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//American Young Coder - ECPv6.10.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ayclogic.com
X-WR-CALDESC:Events for American Young Coder
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251106T190000
DTEND;TZID=America/Los_Angeles:20251106T200000
DTSTAMP:20260429T172123
CREATED:20251107T042300Z
LAST-MODIFIED:20251107T042843Z
UID:31571-1762455600-1762459200@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nWent through the Cow College brute force implementation and optimal solution walkthrough\nIntroduced the feeding cows problem\n\nHomework:\n\nCode up the optimal solution for Cow College\, and submit your answer to the webpage and google drive when you are finished\nproblem: https://usaco.org/index.php?page=viewproblem2&cpid=1251 \nNote I mis-spoke during the meeting because you need to sort the hash-map keys in order to figure out how many cows are able to pay. \nKey idea for implementation: Group your input with a hashmap\, where keys are the max amount a cow is willing to pay\, and the values are the number of cows with that pay key. \nThen loop over each key the same way you did with the brute force.\nWork on a brute force solution for Feeding Cows\, and submit your answer to the webpage and google drive when you are finished\nproblem: https://usaco.org/index.php?page=viewproblem2&cpid=1252\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here (Tues7PM_IntroToCompProgramming is our excel sheet for visuals).
URL:https://www.ayclogic.com/event/7-pm-usaco-bronze-darin-4/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251113T190000
DTEND;TZID=America/Los_Angeles:20251113T200000
DTSTAMP:20260429T172123
CREATED:20251114T041235Z
LAST-MODIFIED:20251114T041235Z
UID:31657-1763060400-1763064000@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nImplemented the Cow College optimal solution.\nWent through the feeding cows problem.\n\nHomework:\n\nCode up the optimal solution for Feeding The Cows\, and submit your answer to the webpage and google drive when you are finished\nproblem: https://usaco.org/index.php?page=viewproblem2&cpid=1252  \nKey idea for implementation: Run a greedy algorithm where you place the food source as far away as possible to the right. \nThink about how to handle edge cases at the very end of the cow list.\nRead through this problem for next week: https://usaco.org/index.php?page=viewproblem2&cpid=1371\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here (Tues7PM_IntroToCompProgramming is our excel sheet for visuals).
URL:https://www.ayclogic.com/event/7-pm-usaco-bronze-darin-5/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251120T190000
DTEND;TZID=America/Los_Angeles:20251120T200000
DTSTAMP:20260429T172123
CREATED:20251120T221100Z
LAST-MODIFIED:20251121T040612Z
UID:31712-1763665200-1763668800@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nWent over implementation details for Feeding The Cows.\nWent over the Majority Opinion problem (medium difficulty)\n\nHomework:\n\nCode up the optimal solution for Majority Opinion\, and submit your answer to the webpage and google drive when you are finished\nproblem: https://usaco.org/index.php?page=viewproblem2&cpid=1371Key idea for implementation:A hay type can only be a possible final answer if it can grow and overtake all the other preferences. The rule states that a hay type overtake happens when >half of the cows in a focus group like the same hay type. \nHint: DON’T think about how to select the size of a focus group or which grouping to make\, but rather think about what conditions must be true for any hay type to overtake the rest.\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here (Tues7PM_IntroToCompProgramming is our excel sheet for visuals).
URL:https://www.ayclogic.com/event/7-pm-usaco-bronze-darin-6/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
END:VCALENDAR