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:20250916T160000
DTEND;TZID=America/Los_Angeles:20250916T170000
DTSTAMP:20260514T223236
CREATED:20250917T013028Z
LAST-MODIFIED:20250917T013028Z
UID:30947-1758038400-1758042000@www.ayclogic.com
SUMMARY:Scratch 1 - TUE 4:00 PM - Julian
DESCRIPTION:Today We Did:\n\nWe took our final test!\n\nIf you have any questions feel free to email me at jsaroufim@ayclogic.com
URL:https://www.ayclogic.com/event/scratch-1-tue-400-pm-julian-8/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250916T173000
DTEND;TZID=America/Los_Angeles:20250916T183000
DTSTAMP:20260514T223236
CREATED:20250917T012850Z
LAST-MODIFIED:20250917T012850Z
UID:30943-1758043800-1758047400@www.ayclogic.com
SUMMARY:Scratch 1 - Tue 5:30 PM - Julian
DESCRIPTION:Today We Did:\n\nStarted our Animal Crossing project.\n\nHomework:\n\nHave Mouse2 start at an x and y position that is at the bottom left of the screen.\nHave Mouse2 glide to x position 200 and y position -100.\n\nIf you have any questions feel free to email me at jsaroufim@ayclogic.com
URL:https://www.ayclogic.com/event/scratch-1-tue-530-pm-julian-7/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250916T173000
DTEND;TZID=America/Los_Angeles:20250916T183000
DTSTAMP:20260514T223236
CREATED:20250917T013046Z
LAST-MODIFIED:20250917T013055Z
UID:30946-1758043800-1758047400@www.ayclogic.com
SUMMARY:5:30 PM – Python Game Development – Daniel
DESCRIPTION:What We Did\n\nWe added collision detection for the fireball and bird.\nWe added the score and increased it every time a fireball hits a bird.\n\nHomework\n\nMake a new function called create_fireball_skill so that when the e key is pressed\, create 4 fireballs that are stacked vertically\, and add them to the fireball group. Call this function in game in session. The player should only be able to use this skill after 3 seconds have passed. \nIf you have any questions\, email me at dmeng@ayclogic.com
URL:https://www.ayclogic.com/event/530-pm-python-game-development-daniel/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250916T190000
DTEND;TZID=America/Los_Angeles:20250916T200000
DTSTAMP:20260514T223236
CREATED:20250917T030951Z
LAST-MODIFIED:20250917T030951Z
UID:30952-1758049200-1758052800@www.ayclogic.com
SUMMARY:7:00 PM : Python OOP - Joshua
DESCRIPTION:Today we did \n\nreviewed how to use dictionary and classes together\ndemo a python game\nexplain the structure of a basic application in a OOP way\n\nHomework \nComplete the following functions\, and test it to make sure it works \n\ndef add_student(self):\n    # Step1 gather info\n    # basically\, for each class variable (i.e NAme age and grade of your student)\n    # use input to gather that information\n\n    # Step 2\, create a student with that information\n\n    #Step 3\, add it to the list we created in our __init__\n    pass\ndef list_students_1(self):\n    # use for a loop\, to print every students name\, age \,and grade\n\n    pass
URL:https://www.ayclogic.com/event/700-pm-python-oop-joshua-7/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250916T190000
DTEND;TZID=America/Los_Angeles:20250916T200000
DTSTAMP:20260514T223236
CREATED:20250918T144124Z
LAST-MODIFIED:20250921T185509Z
UID:30951-1758049200-1758052800@www.ayclogic.com
SUMMARY:7 PM – Intro to Competitive Programming – Darin
DESCRIPTION:What We Did Today:\n\nSolved the Cowntract Tracing problem theoretically\n\nHomework:\nImplement the code for https://usaco.org/index.php?page=viewproblem2&cpid=1348! \nTheory: \nGroup final cows into sick and non sick\nThink of each cows as having a window (net effect of sickness spread) \nIf we know each cows window\, we can compute the initial cow count \nI = number of cows in one sick group\, W = cow window \nI/W = initial cow count per group \nIdea: Sum up all the I/W over the list of cows \nHow to compute W? \nCases (note that each I below is variable\, so its per group basis):\nTake the smallest odd group and compute:\nW = I \nTake edge groups and compute:\nW = 2*I – 1 \nTake (if there exists) the smallest even group and compute:\nW = I – 1 \nBetween these candidate W’s\, choose the min over all of them. \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-intro-to-competitive-programming-darin-22/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
END:VCALENDAR