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:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260108T060000
DTEND;TZID=America/Los_Angeles:20260108T190000
DTSTAMP:20260515T024240
CREATED:20260109T030915Z
LAST-MODIFIED:20260109T030915Z
UID:32101-1767852000-1767898800@www.ayclogic.com
SUMMARY:6 PM - Python OOP - Joel
DESCRIPTION:Today we did:\n\nWe did a new project called ZooSystem to practice with inheritance and overriding.\n\nHomework:\n\nIn the ZooSystem\, make a new function called initialize_animals\, and inside\, make one of each: a Reptile\, Bird\, and Mammal. Add them all to the dictionary\, and then make sure to call this function right before the while True loop in the application_loop.\nMake sure to complete the other two selections\, which is “Show daily activities” and “Calculate total cost”.\nShow daily activities is the showing the get info\, what the animal eats\, what sound it makes\, and its daily care cost for each animal in the dictionary.\nCalculate total cost is getting the total cost of how much it costs to take care of all the animals combined. Hint: you should go through each animal\, have a cost variable = 0\, and then add one by one each animal’s cost to the cost variable to get the total.\nIf you have any questions\, feel free to email me at joel@ayclogic.com.
URL:https://www.ayclogic.com/event/6-pm-python-oop-joel-5/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260108T180000
DTEND;TZID=America/Los_Angeles:20260108T190000
DTSTAMP:20260515T024240
CREATED:20260109T025757Z
LAST-MODIFIED:20260109T025757Z
UID:32099-1767895200-1767898800@www.ayclogic.com
SUMMARY:6:00 PM- Python OOP- Daniel
DESCRIPTION:What We Did\n\nWe went over how to use a for loop to go through a dictionary.\nWe used a dictionary on the grocery system.\n\nHomework\n\nUsing the Robux System \, instead of only using the elif statements\, use a dictionary like we did in the grocery system. https://drive.google.com/drive/u/0/folders/1B2LrwyGFPIwCQT_Sw8j56v744V0GHPKW\nIf you have any questions\, email me at dmeng@ayclogic.com.\n\n 
URL:https://www.ayclogic.com/event/600-pm-python-oop-daniel/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260108T190000
DTEND;TZID=America/Los_Angeles:20260108T200000
DTSTAMP:20260515T024240
CREATED:20260109T001005Z
LAST-MODIFIED:20260109T055028Z
UID:32097-1767898800-1767902400@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nWent over the Balancing Bacteria optimal solution over greedy search\n\nHomework:\n\nCode up the second optimal solution using difference arrays for Balancing Bacteria\, and submit your answer to the webpage and google drive when you are finished\nproblem: https://usaco.org/index.php?page=viewproblem2&cpid=1372 \nNote on the optimal solution(s) presented in class\nOptimal Solution 1 (Optimized naive solution): \nIn class we talked about how to derive the accumulation by analyzing the solution\, and estimating the remainder needed. \nThis resulted in the formula net_accumulation[i] = net_accumulation[i-1] + cur_sprays + net_sprays. \nThe purpose of the net_accumulation is to iteratively adjust the target patch without adjusting every patch that comes after it. This value can be thought of as individual accumulations from every patch before it\, but every patch before it also has a position multiplier. \nI recommend re-deriving the formula above\, seeing how to go from an understanding of the problem to the solution mentioned above. \nThe easiest way to derive the formula above is through analyzing the operations done and how those operations increment/decrement the values of the next target patches. \nOptimized Solution 2 (Difference Arrays):\nWe derived this solution by realizing we can transform the problem space S and the operation O on the space into another form that is meaningful. \nDiff(A) means you transform the array A by subtracting each position in the array with the previous position value. \nSo Diff(A): [    A[0]\,    A[1] – A[0]\,   A[2] – A[1]\, …\, A[last_index] – A[last_index – 1]]\nWe start with the original space S\, with an example as shown:\n–1  0 –1 0 \nwhere the operation to balance patch 1 causes an accumulation shown as:\n+1\, +2\, +3\, +4 \nTransforming the original operation O with Diff(O) changes the operations to:\n+1\, +1\, +1\, +1 \nTransforming it one more time to Diff(Diff((O)) leads the operation to become:\n+1\, 0\, 0\, 0 \nWhich means that the operation Diff(Diff(O)) on a patch does not affect the other patches. \nHowever this Diff(Diff(O)) operation has to be done on the Diff(Diff(S)) space instead of the original. \nSo in implementing the second optimal solution\, define a Diff() function which transforms an array\, and then equalize the Diff(Diff(S)) space instead to figure out the number of operations needed to set everything to 0.\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-10/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260108T190000
DTEND;TZID=America/Los_Angeles:20260108T200000
DTSTAMP:20260515T024240
CREATED:20260109T041735Z
LAST-MODIFIED:20260109T041753Z
UID:32103-1767898800-1767902400@www.ayclogic.com
SUMMARY:7:00 PM- Intro to Python - Joshua
DESCRIPTION:Today We Did \n\nreviewed the practice exercises\n\n  \n  \nHomework \n\ndo the stuff on this link \nhttps://www.ayclogic.com/intro-to-python-exercises/
URL:https://www.ayclogic.com/event/700-pm-intro-to-python-joshua-5/
END:VEVENT
END:VCALENDAR