BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//American Young Coder - ECPv6.10.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:American Young Coder
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:20251016T180000
DTEND;TZID=America/Los_Angeles:20251016T190000
DTSTAMP:20260515T005329
CREATED:20251017T020100Z
LAST-MODIFIED:20251017T020125Z
UID:31333-1760637600-1760641200@www.ayclogic.com
SUMMARY:6:00PM - Python OOP -Joshua
DESCRIPTION:Today We Did \nReviewed Practice Final \nHomework: Fix your practice final\nInheritance Practice/IN the book \n\nPage 168 to 170: Copy Codes\nPage 173\, 9-6 and 9-7\n\n  \nJacob \n\nDriver Class\n\nfix your get_trip_time\n\nMake sure it doubles if it is in rush hour\nactually return how long the trip takes\n\n\n\n\nNew York\n\nDue that inheritance thing ( look at the 168-170 for examples)\n\nimport driver\nadd the (driver) to end of the class\nfix your __init__\nget trip time is fine (you don’t need to make it an int())\n\n\n\n\nDriver System\n\n__init__\n\nput the dictionary and menu in there (don’t forget self)\n\n\napplication_loop\n\nwhile true\nask for what option what from the menu\nif/elif statement for each option\n\nunder each if/elif\, make sure it looks like the example\n\n\n\n\n\n\n\nJustin \n\nPut everything into a while loop for application loo\n\nTry to use functions to make look neater\n\n\nclean up your __init__\n\nself.menu not menu\nselection goes in the application loop\n\n\nDriver Class:\n\nfix how you calculate your trip time (find out how many hours it takes to do a tribe\n\nmake sure to actually return your trip time\n\n\nMake type a “defined variable” meaning not in the () (also needs to change your main to reflect)\n\n\nNew York Driver Clas\n\nUse inheritance to fix your new your driver class\nalso \, calcuate your trip time correctly\nMake type a “defined variable” meaning not in the () (also needs to change your main to reflect)\n\n\nQuick warning\, when you make changes to your driver\, such as adding the return\, its going to change your main\nint() <—— distance is a number not a string (hint hint inputs)\n\n 
URL:https://www.ayclogic.com/event/600pm-python-oop-joshua-3/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251016T180000
DTEND;TZID=America/Los_Angeles:20251016T190000
DTSTAMP:20260515T005329
CREATED:20251017T022839Z
LAST-MODIFIED:20251017T022839Z
UID:31336-1760637600-1760641200@www.ayclogic.com
SUMMARY:6 PM - USACO - Bronze - Gamas
DESCRIPTION:Today We Did\n\nWe did College Cow problem brute force 1 and 2 – https://usaco.org/index.php?page=viewproblem2&cpid=1251\n\nHomework\n\nFind the optimal solution for College Cow. You have to sort the “keys” ascending way.\nAlso try to do this Feeding The Cows problem – https://usaco.org/index.php?page=viewproblem2&cpid=1252
URL:https://www.ayclogic.com/event/6-pm-usaco-bronze-gamas-38/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251016T190000
DTEND;TZID=America/Los_Angeles:20251016T200000
DTSTAMP:20260515T005329
CREATED:20251017T030658Z
LAST-MODIFIED:20251017T030658Z
UID:31338-1760641200-1760644800@www.ayclogic.com
SUMMARY:7:00 PM- Intro To Python - Joshua
DESCRIPTION:Today We Did \n– string methods\n– f’strings \nstring commands \n\nHomework\nCreate october_16_StringHomework2.py page 25. TRY IT YOURSELF: 2-3\, 2-4\, 2-5 and 2-6
URL:https://www.ayclogic.com/event/700-pm-intro-to-python-joshua/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251016T190000
DTEND;TZID=America/Los_Angeles:20251016T200000
DTSTAMP:20260515T005329
CREATED:20251017T080355Z
LAST-MODIFIED:20251017T080355Z
UID:31334-1760641200-1760644800@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nWent through the Farmer John Actually Farms problem for the brute force\n\nHomework:\nImplement the brute force code for the problem: https://usaco.org/index.php?page=viewproblem2&cpid=1349 \nBrute-Force Approach\nWhen we want to check impossibility\, the discussed method in class of comparing pairwise growths only works for whether or not it can stay in the desired positioning forever. \nInstead\, we can only check impossibility by checking each “point” that is a candidate for a successful ordering. \n\n\nEnumerate “interesting” daysCollect a finite set of days to test: \n\n\nDay 0 (ordering could be right from the start) \n\n\nFor every integer day d≥0 where two plants would be equal height\, take the day after it as d+1 (a correct ordering only happens when a switch happens)\nHint: You can think of each plant’s growth as a line that grows in the xy plane\, so what is a formula used to find the point of intersection between two lines (in other words\, find the day the plants have the same height) ? \n\n\n\n\nSimulate heights on each candidate dayFor each candidate day d\, compute the heights of every plant (think what formula works for this) \n\n\nCount “strictly taller” and compare to targetFor each plant i\, count how many plants have height strictly greater than Hi(d).If all counts match the given target array t\, record the day d. \n\n\nAnswerOutput the smallest candidate day that works\, or −1 if none do. \n\n\nEdge cases: \n\nSanity check pairsFor each pair of plants (i\,j)\, note whether their relative order could ever change: if they grow at the same rate and start equal\, they’ll be tied forever (makes a strict ranking impossible).\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here.
URL:https://www.ayclogic.com/event/7-pm-usaco-bronze-darin/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
END:VCALENDAR