Forums

#Morgan Su, BayviewSS
N=int(input())
hcX=-1
hcY=-1
lX=101
lY=101
#Variables for points extrema

for i in range(N):
    coord=input()
    length=len(coord)
   ...

#Morgan Su, BayviewSS
N=int(input())

array=[]         #Store all input lines
posCount=0       #character index tracker for current line
mul=1            #Cou...

#Morgan Su, BayviewSS
L=int(input())
array=[]

for i in range(L):
    array+=[input()]

for i in range(L):
    string=array[i]
   
#Check if second char is sp...

#Morgan Su, BayviewSS
P=int(input())
N=int(input())
R=int(input())

total=N
amt=N
counter=0

#keep simulating days until total of infected exceeds P
while tot...

#Morgan Su, BayviewSS
#If statements, operators and variables
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
f=int(input())

m=int...

#Morgan Su, BayviewSS
#Operations and if statements
s=int(input())
m=int(input())
l=int(input())

w=int(2*m)
a=int(3*l)

x=int(s)+int(w)+int(a)

if x>10:
 ...

#Morgan Su, Bayview SS
#Arrays
num=int(input())
name=[]
bid=[]
for i in range(num):
    name+=[input()]
    bid+=[int(input())]

s=sorted(bid)
length=len(s)
m...

#Morgan Su, BayviewSS
#Calculations and comparing integers
T=int(input())
P=5*T-400

if T<100:
    print(P)
    print(1)
if T==100:
    print(P)
    print(...

#Morgan Su, BayviewSS
#Calculations and arrays
pn=int(input())
s=[]
f=[]
total=[]
for i in range(pn):
    s+=[int(input())]
    f+=[int(input())]

counter=0
t...

#Morgan Su, BayviewSS
#Using calculations to solve for remaining cupcakes
r=int(input())
s=int(input())

numr=r*8
nums=s*3
total=numr+nums
new=total-28

print...

#Morgan Su, BayviewSS
#Comparing parking spot occupation with positions of C in either string
N=int(input())
dayOne=input()
dayTwo=input()

counter=0

for i i...

#Morgan Su, BayviewSS
#Check whether input matches telemarketer criteria, and if so: print ignore

a=int(input())
b=int(input())
c=int(input())
d=int(input())...

/*
CCC '18 S5 - Maximum Strategic Savings
Author: Dan Shan
Date: 2025-05-25
Observation: Only need one portal per planet and one plane per city
2d grid with p...

/*

CCC '16 S4 - Combining Riceballs

Dan Shan, Oakville Trafalgar High School

Date: 2025-06-13

Recursive Dynamic Programming

Observation: order of merging doesn't effec...

# Advay Chandorkar, Glenforest SS (advayc)
# py3 solution for 17' j1
x = int(input())
y = int(input())

if y > 0 and x > 0:
    print('1')
elif x < 0...

# Advay Chandorkar, Glenforest SS (advayc)
# py3 solution for 16' j3
n=(input())
k=int(input())
sum=0
for i in range(k+1):
    sum += int(n)
    n += '0'

pri...

# Advay Chandorkar, Glenforest SS (advayc)
# py3 solution for 16' j3
square = []
sums_row = []
sums_col = []
for i in range(4):
    currentrow = [0,0,0,0]
   ...

# Advay Chandorkar, Glenforest SS (advayc)
# py3 solution for 16' j2
games = [input()for i in range(6)]
win = games.count('W')

if win == 6 or win == 5:
    p...

# Advay Chandorkar, Glenforest SS (advayc)
# py3 solution for 16' j3
t = input()
n=len(t)
c=[]
for i in range(n):
    for j in range(n):
        x=t[i:j+1]
  ...

# Advay Chandorkar, Glenforest SS (advayc)
# py3 solution for 25' s4

import heapq

# read number of levels (N) and number of tunnels (M)
N, M = map(int, inpu...

D=int(input())
E=int(input())


for _ in range(E):
    e=input()
    Q=int(input())


    if e=="+":
       ...

//By Timothy Shnayder, Newmarket Highschool

//To solve this problem, we first do a rough filter, then remove the bad ones with a precise filter

#include <...

//By Timothy Shnayder, Newmarket High School

/*
The idea of this problem is to first interate through each index and build it based of 
the LCM of all t...

Hey everyone! If anyone is interested in helping, here are some things that we are still hoping to implement. We will continue to update this post with any new...

Please use this thread to share suggestions you would like to see be implemented by the devs for this repository.

When posting a suggestion in the comments below,...

//By Timothy Shnayder, Newmarket High School

#include 
#define pii pair
#define vpii vector>
#define vi vector