Forums

# 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