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:20251113T180000
DTEND;TZID=America/Los_Angeles:20251113T190000
DTSTAMP:20260515T013739
CREATED:20251114T030603Z
LAST-MODIFIED:20251116T011712Z
UID:31654-1763056800-1763060400@www.ayclogic.com
SUMMARY:6PM – Python OOP – Daniel
DESCRIPTION:What We Did\n\nWe learned how to loop through a dictionary.\nWe did the dictionary benchmark.\n\nHomework\n\nCreate a file Nov_13_review_hw.py and do\n\nhttps://docs.google.com/forms/d/1ekG1S85vKHyyJeZ0T5RUZTBn6Dw4Vimz3ruW1Y1A11o\n\n\nthis homework is 10% of your PythonOOP grade.\nPlease submit by WED Nov 19 at midnight. If you submit after that\, you will get late submission penalty.\nYou can look at your old class python files\, but you cannot copy codes from the Internet or any AI Agent\, otherwise you will get 0.\nIf you have any questions\, email me at dmeng@ayclogic.com
URL:https://www.ayclogic.com/event/6pm-python-oop-daniel-3/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251113T180000
DTEND;TZID=America/Los_Angeles:20251113T190000
DTSTAMP:20260515T013739
CREATED:20251114T040805Z
LAST-MODIFIED:20251114T040805Z
UID:31659-1763056800-1763060400@www.ayclogic.com
SUMMARY:Thursday 6:00 PM - Python OOP- Joshua
DESCRIPTION:To Do \n\nI should have shared the link through your email of the answers to the project. Go ahead and try to fix your code with it as a reference to see if you can get your code working
URL:https://www.ayclogic.com/event/thursday-600-pm-python-oop-joshua/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251113T180000
DTEND;TZID=America/Los_Angeles:20251113T190000
DTSTAMP:20260515T013739
CREATED:20251117T223341Z
LAST-MODIFIED:20251117T225259Z
UID:31687-1763056800-1763060400@www.ayclogic.com
SUMMARY:6 PM  - USACO - Bronze - Gamas
DESCRIPTION:Today We Did\n\nWe finished Milk Pails problem\nWe started with Roundabout Rounding problem.\n\nHomework\n\nAlso try to implement two problems with difficulties of 800 from codeforces.com\n\nhttps://codeforces.com/problemset/problem/2172/A\nhttps://codeforces.com/problemset/problem/2167/C\n\n\nContinue working on Roundabout Rounding problem https://usaco.org/index.php?page=viewproblem2&cpid=1443\n\nJust to clarify\, the meaning of this problem statement “She tasks you to count how many integers x at least 2 and at most N (1≤N≤109) exist such that rounding x to the nearest 10P is different than chain rounding to the nearest 10P” this means\, you need to compare the discrepancy between Bessie and Elsie for the number provided rounded to 10\, 100\, 1000\, 10\,000\, 100\,000…. 10^9. If the number provided is 4567\, we are counting the discrepancy for number from 0 to 4449 which means \n\n44\, 45\, 46\, 47\, 48\, 49 – 5 discrepancies when rounding to either 0 or 100.\n444 to 499 – 55 discrepancies when rounding to either 0 or 1000.\n4444 to 4567 – 123 discrepancies (4567 – 4444) when rounding to either 0 or 10000.\nTotal discrepancy is 5 + 55 + 123 = 183\n\n\nSee if you can figure out the pattern and the formula for the number of discrepancies for rounding to 100\,000\, 1\,000\,0000 until 10 ^ 9.and try to implement a solution.
URL:https://www.ayclogic.com/event/6-pm-usaco-bronze-gamas-41/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251113T190000
DTEND;TZID=America/Los_Angeles:20251113T200000
DTSTAMP:20260515T013739
CREATED:20251114T040510Z
LAST-MODIFIED:20251114T041545Z
UID:31656-1763060400-1763064000@www.ayclogic.com
SUMMARY:Thursday 7:00 PM - Intro to python - Joshua
DESCRIPTION:Today We Did\n\nlists\n.append()\ndel\nhow to index\n\n  \nHomework\n\nPage 117 . TRY IT YOURSELF: 7-1\, 7-2  # these are questions you need to do\n3rd edition: Page 37 to 41 (do not do the “Try It Yourself”) Copy the code in these pages\n\nTell Me Your Age homework ONLY number 1: 6th week    DO only question 1 \n  \nIN a file called input_list_hw.py
URL:https://www.ayclogic.com/event/thursday-700-pm-intro-to-python-joshua/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251113T190000
DTEND;TZID=America/Los_Angeles:20251113T200000
DTSTAMP:20260515T013739
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
END:VCALENDAR