Compare commits

..

96 Commits

Author SHA1 Message Date
020015474f Easy problems solved on 2024-11-12 2024-11-12 22:53:08 +01:00
799f2283c7 GlitchBot 2023-11-15 22:47:23 +01:00
b58f0998db EpigDanceOff 2023-11-15 22:20:01 +01:00
ae55249b47 NOP 2023-11-15 22:10:55 +01:00
38610bdd11 Luhn's Checksum Algorithm 2023-10-17 22:46:33 +02:00
de8643b5f2 Loo Rolls 2023-10-17 22:34:39 +02:00
786cf4dc88 Joint Jog Jam 2023-10-17 22:10:00 +02:00
a3320343ef School Spirit 2023-10-17 21:50:25 +02:00
a309dad256 Triple Texting 2023-10-17 21:34:52 +02:00
f5925dedeb Birthday Memorization 2023-10-17 21:26:11 +02:00
2ebdbbc5b5 Goomba Stacks 2023-10-17 21:15:09 +02:00
986dc102d7 Arithmetic Functions 2023-10-17 21:08:16 +02:00
26347645b6 Basketball One-on-One 2023-10-17 20:59:27 +02:00
49a86bff16 Conformity 2023-10-17 20:42:54 +02:00
d661b76d6c Veður - Lokaðar heiðar 2023-10-16 22:46:40 +02:00
1fa5411107 Sóttkví 2023-10-16 22:27:28 +02:00
08da2c1c73 Sith 2023-10-16 22:19:02 +02:00
97bbb9503b Vefþjónatjón 2023-10-16 22:09:07 +02:00
03302ded7c Ekki dauði opna inni 2023-10-16 21:50:43 +02:00
6e1ab93478 Spritt 2023-10-16 21:36:35 +02:00
0dc3d6f827 Amerískur vinnustaður 2023-10-16 21:28:29 +02:00
6fa60c5f30 Hraðgreining 2023-10-16 21:25:01 +02:00
bdefb17596 Framtíðar FIFA 2023-10-16 21:20:51 +02:00
b21298e68c Viðsnúningur 2023-10-16 21:11:17 +02:00
8343b44c8d Óvissa 2023-10-16 21:07:55 +02:00
7977d3e82c Leggja saman 2023-10-16 21:04:54 +02:00
9d1e862202 Velkomin! 2023-10-16 21:01:41 +02:00
c5728fa19e Heir's Dilemma 2023-07-25 15:54:01 +02:00
61b575d34f 1-D Frogger (Easy) 2023-07-25 12:40:12 +02:00
30941abe2d Help a PhD candidate out! 2023-07-25 10:09:41 +02:00
3963a3498a Herman 2023-07-25 10:05:59 +02:00
adb3cc79d4 Hitting the Targets 2023-07-25 09:52:50 +02:00
09cc6efe46 Riječi 2023-07-25 09:31:45 +02:00
52ed4d25f8 Zoom 2023-07-25 09:14:22 +02:00
7f4f85f804 Identifying Map Tiles 2023-07-19 21:21:47 +02:00
7b7c85d278 Judging Moose 2023-07-19 20:56:22 +02:00
9be61644a4 Karte 2023-07-19 20:51:49 +02:00
4481e9cc18 Kleptography 2023-07-19 20:40:14 +02:00
022eaf7a60 License to Launch 2023-07-18 22:57:18 +02:00
220d30556d Lost Lineup 2023-07-18 22:54:03 +02:00
947a85d630 Mixed Fractions 2023-07-18 22:40:18 +02:00
17d266942c Parking 2023-07-18 22:34:23 +02:00
8a8cfa5c43 Prsteni 2023-07-18 22:13:48 +02:00
db736b30b3 Ptice 2023-07-18 21:51:43 +02:00
0d0ebece77 Quick Estimates 2023-07-18 21:41:12 +02:00
ef9eb28323 Racing Around the Alphabet 2023-07-18 21:38:10 +02:00
7bbb5bcb4f Rectangle Area 2023-07-18 14:03:57 +00:00
4cd0be10d4 Secure Doors 2023-07-18 13:57:24 +00:00
271421a989 Server 2023-07-18 13:37:03 +00:00
18e5789449 Skener 2023-07-18 13:29:10 +00:00
824bc3ee7c Sort of Sorting 2023-07-17 22:58:55 +02:00
d5eca55da3 Spelling Bee 2023-07-17 22:40:25 +02:00
ff54ec63ec Bluetooth 2023-07-17 22:19:12 +02:00
6d748103e0 Skocimis 2023-07-16 23:21:22 +02:00
50b147dec7 Speeding 2023-07-16 23:12:47 +02:00
fb8cf978a0 Stacking Cups 2023-07-16 23:01:00 +02:00
3dd1f0a732 Symmetric Order 2023-07-16 22:35:47 +02:00
eccd02fbbc Tai's formula 2023-07-16 22:20:32 +02:00
4bc8d64e38 Tetration 2023-07-16 22:08:14 +02:00
910504b0d7 The Easiest Problem Is This One 2023-07-16 21:51:59 +02:00
95979cdcf0 The Last Problem 2023-07-16 21:39:42 +02:00
11de2df636 Kornislav 2023-07-16 21:36:14 +02:00
1c2396075e Moderate Pace 2023-07-16 21:31:41 +02:00
1182218885 Seven Wonders 2023-07-16 21:23:41 +02:00
2d740cf8d3 The Amazing Human Cannonball 2023-07-16 21:09:36 +02:00
95aa076e8f Rice judge (12/96) 2023-07-03 23:02:48 +02:00
9ee48aa678 Simon Says 2023-07-03 22:46:33 +02:00
4a4158fa23 Temperature Confusion 2023-07-03 22:38:21 +02:00
85b9ad927d Arrangement 2023-07-03 22:05:47 +02:00
51e42c20bb Canadians, eh? 2023-07-03 21:56:27 +02:00
e6d2456808 Code to Save Lives 2023-07-03 21:53:07 +02:00
14a73c3463 Datum 2023-07-03 21:32:28 +02:00
8eeea7ade2 Death Knight Hero 2023-07-03 21:24:26 +02:00
34a5590ed1 DRM Messages 2023-07-03 21:19:52 +02:00
38c3a864ef Encoded Message 2023-07-03 20:59:24 +02:00
369ecff5e3 Fifty Shades of Pink 2023-07-03 20:33:03 +02:00
fed7a05832 Forced Choice 2023-07-03 20:28:07 +02:00
09861a2f4f Grading 2023-07-03 20:20:25 +02:00
abea187f67 ICPC Awards 2023-07-03 20:14:35 +02:00
df0345596a Janitor Troubles 2023-07-03 19:54:00 +02:00
9471cd2034 International Dates 2023-07-03 13:26:26 +02:00
fee7f6a8e1 Job Expenses 2023-07-03 13:18:54 +02:00
7973279c5e Knot Knowledge 2023-07-02 23:43:54 +02:00
575278be6e Ladder 2023-07-02 23:37:22 +02:00
793a47e1c2 Laptop Sticker 2023-07-02 23:13:05 +02:00
5b739eda96 Logic Functions 2023-07-02 23:08:46 +02:00
75d203cfd5 Modulo 2023-07-02 22:49:18 +02:00
b3565c8ef9 Number Fun 2023-07-02 22:43:43 +02:00
9fe04d95fe Odd Man Out 2023-07-02 22:37:14 +02:00
683c8bf233 Poker Hand 2023-07-02 22:29:37 +02:00
a6aaee5504 Provinces and Gold 2023-07-02 22:22:24 +02:00
a729a282f1 Railroad 2023-07-02 21:37:57 +02:00
229d6a72d5 Relocation 2023-07-02 21:29:49 +02:00
8dac52bae6 Reversed Binary Numbers 2023-07-02 21:17:40 +02:00
b8df7029f7 Sibice 2023-07-02 21:13:21 +02:00
19cb7f377d Speed Limit 2023-07-02 21:04:53 +02:00
117 changed files with 1185 additions and 0 deletions

30
1dfroggereasy.py Normal file
View File

@@ -0,0 +1,30 @@
n, s, m = map(int, input().split())
s -= 1
board = list(map(int, input().split()))
shadow_board = [0] * n
def print_ending(ending, hops):
print(ending)
print(hops)
exit()
hops = 0
while True:
if shadow_board[s] == 1:
print_ending("cycle", hops)
shadow_board[s] = 1
if board[s] == m:
print_ending("magic", hops)
if s + board[s] < 0:
print_ending("left", hops + 1)
if n <= s + board[s]:
print_ending("right", hops + 1)
s += board[s]
hops += 1

4
aleidibio.py Normal file
View File

@@ -0,0 +1,4 @@
a = int(input())
b = int(input())
c = int(input())
print(c - a - b)

2
ameriskur.py Normal file
View File

@@ -0,0 +1,2 @@
length = float(input())
print(length * 0.09144)

21
arithmeticfunctions.cpp Normal file
View File

@@ -0,0 +1,21 @@
#include "arithmeticfunctions.h"
#include <cmath>
// Compute x^3
int cube(int x){
return pow(x, 3);
}
// Compute the maximum of x and y
int max(int x, int y){
if (x>y) {
return x;
} else {
return y;
}
}
// Compute x - y
int difference(int x, int y){
return x - y;
}

20
arithmeticfunctions.h Normal file
View File

@@ -0,0 +1,20 @@
#include <iostream>
int cube(int x);
int max(int x, int y);
int difference(int x, int y);
int main() {
int cube2 = cube(2);
if (cube2 != 8) {
std::cout << "ERROR: cube(2) = " << cube2 << ", expected 8" << std::endl;
}
int max85 = max(8, 5);
if (max85 != 8) {
std::cout << "ERROR: max(8, 5) = " << max85 << ", expected 8" << std::endl;
}
int diff102 = difference(10, 2);
if (diff102 != 8) {
std::cout << "ERROR: difference(10, 2) = " << diff102 << ", expected 8" << std::endl;
}
}

3
astackofgold.py Normal file
View File

@@ -0,0 +1,3 @@
w, s = map(int, input().split())
c = s * (s + 1) / 2
print(int((w - (c * 29260)) / 110))

9
barcelona.py Normal file
View File

@@ -0,0 +1,9 @@
n, k = map(int, input().split())
pos = list(map(int, input().split()))
if pos[0] == k:
print("fyrst")
elif pos[1] == k:
print("naestfyrst")
else:
print(f"{pos.index(k)+1} fyrst")

19
basketballoneonone.py Normal file
View File

@@ -0,0 +1,19 @@
def end_game(winner):
print(winner)
exit()
game_records = input()
a_score = 0
b_score = 0
for i in range(0, len(game_records), 2):
if game_records[i] == "A":
a_score += int(game_records[i + 1])
else:
b_score += int(game_records[i + 1])
if a_score >= 11 and (b_score < 10 or a_score - b_score >= 2):
end_game("A")
if b_score >= 11 and (a_score < 10 or b_score - a_score >= 2):
end_game("B")

1
bergmal.py Normal file
View File

@@ -0,0 +1 @@
print(input())

36
bluetooth.py Normal file
View File

@@ -0,0 +1,36 @@
n = int(input())
uleft = set(range(1, 9))
uright = set(range(1, 9))
lleft = set(range(1, 9))
lright = set(range(1, 9))
for _ in range(n):
dental_problem = input().split()
try:
if dental_problem[1] == "m":
if dental_problem[0][0] == "-":
lleft.remove(int(dental_problem[0][1]))
elif dental_problem[0][0] == "+":
uleft.remove(int(dental_problem[0][1]))
elif dental_problem[0][1] == "-":
lright.remove(int(dental_problem[0][0]))
elif dental_problem[0][1] == "+":
uright.remove(int(dental_problem[0][0]))
else:
if dental_problem[0][0] == "+" or dental_problem[0][0] == "-":
lleft = set()
uleft = set()
else:
lright = set()
uright = set()
except KeyError:
pass
if len(lleft) > 0 and len(uleft) > 0:
print(0)
elif len(lright) > 0 and len(uright) > 0:
print(1)
else:
print(2)

1
canadianseh.py Normal file
View File

@@ -0,0 +1 @@
print("Canadian!" if input()[-3:] == "eh?" else "Imposter!")

5
codetosavelives.py Normal file
View File

@@ -0,0 +1,5 @@
n = int(input())
for _ in range(n):
a = int(input().replace(" ", ""))
b = int(input().replace(" ", ""))
print(" ".join(str(a + b)))

21
conformity.py Normal file
View File

@@ -0,0 +1,21 @@
n = int(input())
combinations = {}
maxcombi = 0
combinations[maxcombi] = 0
for _ in range(n):
combi = "".join(sorted(input().strip().split()))
if combi in combinations.keys():
combinations[combi] += 1
if combinations[maxcombi] < combinations[combi]:
maxcombi = combi
else:
combinations[combi] = 1
max_value = combinations[maxcombi]
most_popular = sum(
[max_value for key in combinations if combinations[key] == max_value]
)
print(most_popular if most_popular > 0 else len(combinations.keys()) - 1)

16
cups.py Normal file
View File

@@ -0,0 +1,16 @@
n = int(input())
cups = {}
for _ in range(n):
tokens = input().split()
try:
value = int(tokens[0]) / 2
color = tokens[1]
except ValueError:
value = int(tokens[1])
color = tokens[0]
cups[color] = value
vals = sorted(cups.values())
for val in vals:
print(list(cups.keys())[list(cups.values()).index(val)])

9
datum.py Normal file
View File

@@ -0,0 +1,9 @@
from datetime import datetime
d, m = map(int, input().split())
date = datetime(year=2009, month=m, day=d)
print(
["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"][
date.weekday()
]
)

7
deathknight.py Normal file
View File

@@ -0,0 +1,7 @@
n = int(input())
wins = 0
for _ in range(n):
k = input()
if "CD" not in k:
wins += 1
print(wins)

11
dfyrirdreki.py Normal file
View File

@@ -0,0 +1,11 @@
a = int(input())
b = int(input())
c = int(input())
d = b**2 - 4 * a * c
if d > 0:
print(2)
elif d < 0:
print(0)
else:
print(1)

1
dragafra.py Normal file
View File

@@ -0,0 +1 @@
print(int(input()) - int(input()))

23
drmmessages.py Normal file
View File

@@ -0,0 +1,23 @@
def sumOfValuesOfCharacters(s: str) -> int:
return sum([ord(c) - 65 for c in s])
def rotateString(s: str, r: int) -> str:
return "".join([chr(((ord(c) - 65 + r) % 26) + 65) for c in s])
def mergeStrings(a: str, b: str) -> str:
return "".join(
[rotateString(ca, sumOfValuesOfCharacters(cb)) for ca, cb in zip(a, b)]
)
def decrypt(drmmessage):
half = len(drmmessage) // 2
a, b = drmmessage[:half], drmmessage[half:]
rota = rotateString(a, sumOfValuesOfCharacters(a))
rotb = rotateString(b, sumOfValuesOfCharacters(b))
return mergeStrings(rota, rotb)
print(decrypt(input()))

19
easiest.py Normal file
View File

@@ -0,0 +1,19 @@
def sumOfDigits(n: int) -> int:
sod = 0
while True:
sod += n % 10
n = n // 10
if n == 0:
return sod
n = int(input())
while n:
sodn = sumOfDigits(n)
p = 11
while True:
if sodn == sumOfDigits(n * p):
print(p)
break
p += 1
n = int(input())

3
ekkidaudi.py Normal file
View File

@@ -0,0 +1,3 @@
row1 = input().strip().split("|")
row2 = input().strip().split("|")
print(" ".join(["".join(part) for part in zip(row1, row2)]))

8
encodedmessage.py Normal file
View File

@@ -0,0 +1,8 @@
def decode(s: str) -> str:
w = int(len(s) ** 0.5)
return "".join([s[v * w + h] for h in range(w) for v in range(w - 1, -1, -1)][::-1])
n = int(input())
for _ in range(n):
print(decode(input()))

17
epigdanceoff.py Normal file
View File

@@ -0,0 +1,17 @@
n, m = map(int, input().split())
lines = []
for _ in range(n):
lines.append(input())
t = 1
for col in range(m):
new_frame = True
for row in lines:
if row[col] != "_":
new_frame = False
break
if new_frame:
t += 1
print(t)

14
fallingsnow2.py Normal file
View File

@@ -0,0 +1,14 @@
n, m = map(int, input().split())
snows = [
0,
] * m
for _ in range(n):
for i, x in enumerate(input()):
snows[i] += 1 if x == "S" else 0
for r in range(n):
for c in range(m):
print("S" if snows[c] >= n - r else ".", end="")
print()

3
fifa.py Normal file
View File

@@ -0,0 +1,3 @@
n = int(input())
k = int(input())
print(2022 + n // k)

11
fiftyshades.py Normal file
View File

@@ -0,0 +1,11 @@
n = int(input())
training_sessions = 0
for _ in range(n):
color_name = input().lower()
if "pink" in color_name or "rose" in color_name:
training_sessions += 1
print(
training_sessions
if training_sessions > 0
else "I must watch Star Wars with my daughter"
)

1
flatbokuveisla.py Normal file
View File

@@ -0,0 +1 @@
print(int(input()) % int(input()))

View File

@@ -0,0 +1,21 @@
n = int(input())
memory = {}
names = []
for _ in range(n):
name, likes, birthday = input().split()
likes = int(likes)
if birthday in memory.keys():
if memory[birthday][1] < likes:
names.remove(memory[birthday][0])
memory[birthday] = (name, likes)
names.append(name)
else:
memory[birthday] = (name, likes)
names.append(name)
print(len(memory.keys()))
names.sort()
for name in names:
print(name)

4
forcedchoice.py Normal file
View File

@@ -0,0 +1,4 @@
n, p, s = map(int, input().split())
for _ in range(s):
cards = list(map(int, input().split()))[1:]
print("KEEP" if p in cards else "REMOVE")

56
glitchbot.py Normal file
View File

@@ -0,0 +1,56 @@
NORTH = 0
EAST = 1
SOUTH = 2
WEST = 3
LEFT = 0
RIGHT = 1
FORWARD = 2
def run_program(program: list) -> tuple:
x, y = 0, 0
facing = NORTH
for instruction in program:
if instruction == LEFT:
facing = (facing - 1) % 4
elif instruction == RIGHT:
facing = (facing + 1) % 4
elif instruction == FORWARD:
if facing == NORTH:
y += 1
elif facing == SOUTH:
y -= 1
elif facing == EAST:
x += 1
elif facing == WEST:
x -= 1
return x, y
x, y = map(int, input().split())
instruction_count = int(input())
program = []
for _ in range(instruction_count):
instruction = input()
if instruction == "Left":
program.append(LEFT)
elif instruction == "Right":
program.append(RIGHT)
elif instruction == "Forward":
program.append(FORWARD)
for i in range(len(program)):
for _ in range(3):
program[i] = (program[i] + 1) % 3
result = run_program(program)
if result == (x, y):
print(
f"{i+1} {'Left' if program[i] == LEFT else 'Right' if program[i] == RIGHT else 'Forward'}"
)
exit()

9
goombastacks.py Normal file
View File

@@ -0,0 +1,9 @@
n = int(input())
g_total = 0
for _ in range(n):
g, b = map(int, input().split())
g_total += g
if b > g_total:
print("impossible")
exit()
print("possible")

14
grading.py Normal file
View File

@@ -0,0 +1,14 @@
a, b, c, d, e = map(int, input().split())
score = int(input())
if score >= a:
print("A")
elif score >= b:
print("B")
elif score >= c:
print("C")
elif score >= d:
print("D")
elif score >= e:
print("E")
else:
print("F")

28
heirsdilemma.py Normal file
View File

@@ -0,0 +1,28 @@
def div_by_all(nr: int) -> bool:
digits = nr
for i in range(1, 7):
digit = digits % (10**i)
if nr % (digit // (10 ** (i - 1))) != 0:
return False
digits -= digit
return True
low, high = map(int, input().split())
if low % 2 == 1:
low += 1
total = 0
for i in range(low, high + 1, 2):
u = set(str(i))
if len(u) != len(str(i)):
continue
if "0" in u:
continue
if div_by_all(i):
total += 1
print(total)

6
helpaphd.py Normal file
View File

@@ -0,0 +1,6 @@
for _ in range(int(input())):
testcase = input()
if testcase == "P=NP":
print("skipped")
else:
print(sum(map(int, testcase.split("+"))))

5
herman.py Normal file
View File

@@ -0,0 +1,5 @@
import math
r = int(input())
print(r**2 * math.pi)
print(r**2 * 2)

1
hipphipp.py Normal file
View File

@@ -0,0 +1 @@
print("Hipp hipp hurra!\n" * 20)

3
hipphipphurra.py Normal file
View File

@@ -0,0 +1,3 @@
name = input()
age = int(input())
print(f"Hipp hipp hurra, {name}!\n" * age)

10
hiptobesquare.py Normal file
View File

@@ -0,0 +1,10 @@
t = int(input())
for _ in range(t):
n = int(input()) + 1
max_size = int(n**0.5)
if max_size % 2 == 0:
max_size -= 2
else:
max_size -= 1
print(max_size // 2)

32
hittingtargets.py Normal file
View File

@@ -0,0 +1,32 @@
def isInsideCircle(cx, cy, r, x, y):
dist = (x - cx) ** 2 + (y - cy) ** 2
return dist <= r**2
def isInsideRectangle(rx1, ry1, rx2, ry2, x, y):
return (rx1 <= x <= rx2) and (ry1 <= y <= ry2)
targets = []
for _ in range(int(input())):
t = input().split()
if t[0] == "rectangle":
targets.append(["R", int(t[1]), int(t[2]), int(t[3]), int(t[4])])
else:
targets.append(["C", int(t[1]), int(t[2]), int(t[3])])
for _ in range(int(input())):
x, y = map(int, input().split())
hits = 0
for target in targets:
if target[0] == "R":
hits += (
1
if isInsideRectangle(target[1], target[2], target[3], target[4], x, y)
else 0
)
else:
hits += 1 if isInsideCircle(target[1], target[2], target[3], x, y) else 0
print(hits)

2
hradgreining.py Normal file
View File

@@ -0,0 +1,2 @@
DNA = input()
print("Veikur!" if "COV" in DNA else "Ekki veikur!")

12
humancannonball2.py Normal file
View File

@@ -0,0 +1,12 @@
from math import cos, sin, radians
n = int(input())
for _ in range(n):
v0, angle, x1, h1, h2 = map(float, input().split())
t = x1 / v0 / cos(radians(angle))
yt = v0 * t * sin(radians(angle)) - 0.5 * 9.81 * t**2
if h1 + 1 < yt < h2 - 1:
print("Safe")
else:
print("Not Safe")

12
icpcawards.py Normal file
View File

@@ -0,0 +1,12 @@
n = int(input())
unis = []
teams = []
for i in range(n):
uni, team = input().split()
if uni not in unis:
unis.append(uni)
teams.append(team)
for i in range(12):
print(f"{unis[i]} {teams[i]}")

7
internationaldates.py Normal file
View File

@@ -0,0 +1,7 @@
a, b, c = map(int, input().split("/"))
if a <= 12 and b <= 12:
print("either")
elif a <= 12:
print("US")
else:
print("EU")

4
janitortroubles.py Normal file
View File

@@ -0,0 +1,4 @@
a, b, c, d = map(int, input().split())
s = (a + b + c + d) / 2
k = ((s - a) * (s - b) * (s - c) * (s - d)) ** 0.5
print(k)

4
jobexpenses.py Normal file
View File

@@ -0,0 +1,4 @@
n = int(input())
k = map(int, input().split())
k = [abs(i) for i in k if i < 0]
print(sum(k))

5
jointjogjam.py Normal file
View File

@@ -0,0 +1,5 @@
ksx, ksy, osx, osy, kex, key, oex, oey = map(int, input().split())
d1 = ((ksx - osx) ** 2 + (ksy - osy) ** 2) ** (0.5)
d2 = ((kex - oex) ** 2 + (key - oey) ** 2) ** (0.5)
print(max((d1, d2)))

7
judgingmoose.py Normal file
View File

@@ -0,0 +1,7 @@
l, r = map(int, input().split())
if l == r == 0:
print("Not a moose")
elif l == r:
print(f"Even {l+r}")
else:
print(f"Odd {max((l, r)) * 2}")

9
karte.py Normal file
View File

@@ -0,0 +1,9 @@
cards = input()
cards = [cards[i : i + 3] for i in range(0, len(cards), 3)]
unique_cards = set(cards)
if len(cards) > len(unique_cards):
print("GRESKA")
else:
for suit in ('P', 'K', 'H', 'T'):
print(13-len([card for card in cards if card[0] == suit]), end=' ')

13
kleptography.py Normal file
View File

@@ -0,0 +1,13 @@
n, m = map(int, input().split())
knowntext = input()
ciphertext = input()
plaintext = [""] * m
for i in range(n):
plaintext[-n + i] = knowntext[i]
for i in range(m - 1, -1, -1):
char = chr((ord(ciphertext[i]) - ord(plaintext[i])) % 26 + 97)
if i - n >= 0:
plaintext[i - n] = char
print("".join(plaintext))

4
knotknowledge.py Normal file
View File

@@ -0,0 +1,4 @@
_ = input()
knots = set(map(int, input().split()))
learnedknots = set(map(int, input().split()))
print(list(knots.difference(learnedknots))[0])

2
kornislav.py Normal file
View File

@@ -0,0 +1,2 @@
ints = sorted(list(map(int, input().split())))
print(ints[0] * ints[2])

1
kvedja.py Normal file
View File

@@ -0,0 +1 @@
print(f"Kvedja,\n{input()}")

4
ladder.py Normal file
View File

@@ -0,0 +1,4 @@
from math import radians, sin, ceil
h, v = map(int, input().split())
print(ceil(h / sin(radians(v))))

2
laptopsticker.py Normal file
View File

@@ -0,0 +1,2 @@
wc, hc, ws, hs = map(int, input().split())
print(0 if ws + 2 > wc or hs + 2 > hc else 1)

1
leggjasaman.py Normal file
View File

@@ -0,0 +1 @@
print(int(input()) + int(input()))

3
licensetolaunch.py Normal file
View File

@@ -0,0 +1,3 @@
_ = input()
junk = list(map(int, input().split()))
print(junk.index(min(junk)))

20
logicfunctions.cpp Normal file
View File

@@ -0,0 +1,20 @@
#include "logicfunctions.h"
// Compute xor
void exclusive(bool x, bool y, bool& ans){
ans = x ^ y;
}
// Compute implication
void implies(bool x, bool y, bool& ans){
if (!(x || y)) {
ans = true;
} else {
ans = y;
}
}
// Compute equivalence
void equivalence(bool x, bool y, bool& ans){
ans = x == y;
}

11
loorolls.py Normal file
View File

@@ -0,0 +1,11 @@
L, N = map(int, input().split())
rollen = 0
prev_taken = 0
while True:
rollen += 1
restant = L % (N - prev_taken)
if restant == 0:
print(rollen)
exit()
prev_taken += restant

4
lostlineup.py Normal file
View File

@@ -0,0 +1,4 @@
n = int(input())
d = list(map(int, input().split()))
pos = [1] + [d.index(i) + 2 for i in range(n - 1)]
print(" ".join(map(str, pos)))

1
lubbilaerir.py Normal file
View File

@@ -0,0 +1 @@
print(input()[0])

21
luhnchecksum.py Normal file
View File

@@ -0,0 +1,21 @@
def luhn_checksum(card_number):
def digits_of(n):
return [int(d) for d in str(n)]
digits = digits_of(card_number)
odd_digits = digits[-1::-2]
even_digits = digits[-2::-2]
checksum = 0
checksum += sum(odd_digits)
for d in even_digits:
checksum += sum(digits_of(d * 2))
return checksum % 10
def is_luhn_valid(card_number):
return luhn_checksum(card_number) == 0
n = int(input())
for _ in range(n):
print("PASS" if is_luhn_valid(input()) else "FAIL")

6
maptiles2.py Normal file
View File

@@ -0,0 +1,6 @@
quadkey = input()
zoomlevel = len(quadkey)
interleaved_coordinates = format(int(quadkey, 4), f"0{zoomlevel*2}b")
y = "".join([interleaved_coordinates[i] for i in range(0, zoomlevel * 2, 2)])
x = "".join([interleaved_coordinates[i] for i in range(1, zoomlevel * 2, 2)])
print(zoomlevel, int(x, 2), int(y, 2))

5
mergjadmal.py Normal file
View File

@@ -0,0 +1,5 @@
s = input()
if "69" in s or "420" in s:
print("Mergjad!")
else:
print("Leim!")

5
mixedfractions.py Normal file
View File

@@ -0,0 +1,5 @@
n, d = map(int, input().split())
while not (n == d == 0):
print(f"{n // d} {n % d} / {d}")
n, d = map(int, input().split())

7
moderatepace.py Normal file
View File

@@ -0,0 +1,7 @@
n = int(input())
k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
for i in range(n):
print(f"{sorted([k[i], a[i], b[i]])[1]} ", end="")

1
modulo.py Normal file
View File

@@ -0,0 +1 @@
print(len(set([int(input()) % 42 for _ in range(10)])))

23
nop.py Normal file
View File

@@ -0,0 +1,23 @@
UPPERS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
instructions = input().strip()
i = 0
nop_count = 0
while True:
try:
if instructions[i + 1] in UPPERS:
nop_count += 3
i += 1
elif instructions[i + 2] in UPPERS:
nop_count += 2
i += 2
elif instructions[i + 3] in UPPERS:
nop_count += 1
i += 3
else:
i += 4
except IndexError:
print(nop_count)
exit()

20
numberfun.py Normal file
View File

@@ -0,0 +1,20 @@
def test_case(a: int, b: int, c: int) -> bool:
if a + b == c:
return True
elif a - b == c:
return True
elif b - a == c:
return True
elif a * b == c:
return True
elif c * a == b:
return True
elif c * b == a:
return True
return False
n = int(input())
for _ in range(n):
a, b, c = map(int, input().split())
print("Possible" if test_case(a, b, c) else "Impossible")

11
oddmanout.py Normal file
View File

@@ -0,0 +1,11 @@
def test_case(i):
_ = int(input())
cs = list(map(int, input().split()))
for c in cs:
if cs.count(c) == 1:
print(f"Case #{i+1}: {c}")
return
n = int(input())
for i in range(n):
test_case(i)

2
ovissa.py Normal file
View File

@@ -0,0 +1,2 @@
s = input().strip()
print(len(s))

5
parking2.py Normal file
View File

@@ -0,0 +1,5 @@
t = int(input())
for _ in range(t):
n = int(input())
x = list(map(int, input().split()))
print((max(x) - min(x)) * 2)

10
pokerhand.py Normal file
View File

@@ -0,0 +1,10 @@
cards = input().split()
ranks = [c[0] for c in cards]
sranks = set(ranks)
strength = [0, None]
for sr in sranks:
s = ranks.count(sr)
if s > strength[0]:
strength[0] = s
strength[1] = sr
print(strength[0])

21
provincesandgold.py Normal file
View File

@@ -0,0 +1,21 @@
g, s, c = map(int, input().split())
bp = (3 * g) + (2 * s) + c
victory = None
if bp >= 8:
victory = "Province"
elif bp >= 5:
victory = "Duchy"
elif bp >= 2:
victory = "Estate"
treasure = "Copper"
if bp >= 6:
treasure = "Gold"
elif bp >= 3:
treasure = "Silver"
if victory is not None:
print(f"{victory} or {treasure}")
else:
print(treasure)

22
prsteni.py Normal file
View File

@@ -0,0 +1,22 @@
import math
n = int(input())
radii = list(map(int, input().split()))
prev_r = None
prev_n = 1
prev_d = 1
for r in radii:
if prev_r is None:
prev_r = r
continue
n = prev_r * prev_n
d = r * prev_d
gcd = math.gcd(n, d)
n = n // gcd
d = d // gcd
print(f"{n}/{d}")
prev_n = n
prev_d = d
prev_r = r

23
ptice.py Normal file
View File

@@ -0,0 +1,23 @@
ADRIAN = "ABC" * 34
BRUNO = "BABC" * 25
GORAN = "CCAABB" * 17
n = int(input())
answers = input()
adrian_score = bruno_score = goran_score = 0
for i in range(n):
if answers[i] == ADRIAN[i]:
adrian_score += 1
if answers[i] == BRUNO[i]:
bruno_score += 1
if answers[i] == GORAN[i]:
goran_score += 1
max_score = max((adrian_score, bruno_score, goran_score))
print(max_score)
if adrian_score == max_score:
print("Adrian")
if bruno_score == max_score:
print("Bruno")
if goran_score == max_score:
print("Goran")

3
quickestimate.py Normal file
View File

@@ -0,0 +1,3 @@
n = int(input())
for _ in range(n):
print(len(input()))

20
racingalphabet.py Normal file
View File

@@ -0,0 +1,20 @@
import math
def calculate_distance(aphorism: str) -> int:
tokens = "ABCDEFGHIJKLMNOPQRSTUVWXYZ '"
prev_s = aphorism[0]
total_distance = 0
for s in aphorism:
current_distance = (tokens.index(prev_s) - tokens.index(s)) % 28
if current_distance > 14:
current_distance = 28 - current_distance
prev_s = s
total_distance += current_distance
return 60 * math.pi / 28 * total_distance
n = int(input())
for _ in range(n):
aphorism = input()
print(calculate_distance(aphorism) / 15 + len(aphorism))

2
railroad2.py Normal file
View File

@@ -0,0 +1,2 @@
x, y = map(int, input().split())
print("possible" if y % 2 == 0 else "impossible")

2
rectanglearea.py Normal file
View File

@@ -0,0 +1,2 @@
x1, y1, x2, y2 = map(float, input().split())
print(abs((x1 - x2) * (y1 - y2)))

3
reduplikation.py Normal file
View File

@@ -0,0 +1,3 @@
s = input()
r = int(input())
print(s * r)

8
relocation.py Normal file
View File

@@ -0,0 +1,8 @@
n, q = map(int, input().split())
c = {x: y for x, y in enumerate(list(map(int, input().split())), start=1)}
for _ in range(q):
t, a, b = map(int, input().split())
if t == 1:
c[a] = b
elif t == 2:
print(abs(c[a] - c[b]))

1
reversebinary.py Normal file
View File

@@ -0,0 +1 @@
print(int(f"{int(input()):b}"[::-1], 2))

12
rijeci.py Normal file
View File

@@ -0,0 +1,12 @@
k = int(input())
def get_sequence(n):
seq = [1, 0]
for _ in range(1, n + 1):
seq.append(seq[-1] + seq[-2])
return seq
seq = get_sequence(k)
print(f"{seq[-2]} {seq[-1]}")

27
risdomare.py Normal file
View File

@@ -0,0 +1,27 @@
n = int(input())
prefer = input()
bi = 0
bt = 0
ba = 0
bs = 0
for i in range(n):
a, s = map(int, input().split())
if bt > a + s:
continue
elif bt == a + s and prefer == "antal" and a > ba:
bi = i + 1
ba = a
bs = s
elif bt == a + s and s > bs:
bi = i + 1
ba = a
bs = s
elif bt < a + s:
bi = i + 1
bt = a + s
ba = a
bs = s
print(bi)

17
schoolspirit.py Normal file
View File

@@ -0,0 +1,17 @@
n = int(input())
scores = [int(input()) for _ in range(n)]
def calculate_score(scores: list) -> float:
return (1 / 5) * sum([score * ((4 / 5) ** i) for i, score in enumerate(scores)])
print(calculate_score(scores))
new_scores = []
for score in scores:
cpy_scores = scores.copy()
cpy_scores.remove(score)
new_scores.append(calculate_score(cpy_scores))
print(sum(new_scores) / len(new_scores))

25
securedoors.py Normal file
View File

@@ -0,0 +1,25 @@
state = {}
def detect_anomaly(name: str, action: str) -> str:
global state
try:
if state[name] == action:
return " (ANOMALY)"
except KeyError:
if action == "exit":
return " (ANOMALY)"
return ""
def print_log(name: str, action: str) -> None:
paction = "entered" if action == "entry" else "exited"
print(f"{name} {paction}{detect_anomaly(name, action)}")
n = int(input())
for _ in range(n):
action, name = input().split()
print_log(name, action)
state[name] = action

10
server.py Normal file
View File

@@ -0,0 +1,10 @@
n, t = map(int, input().split())
tasks = list(map(int, input().split()))
total_t = 0
for i, task in enumerate(tasks):
total_t += task
if total_t > t:
print(i)
exit()
print(i + 1)

7
sevenwonders.py Normal file
View File

@@ -0,0 +1,7 @@
s = input().strip()
t = s.count("T")
c = s.count("C")
g = s.count("G")
print(t**2 + c**2 + g**2 + (min((t, c, g)) * 7))

4
sibice.py Normal file
View File

@@ -0,0 +1,4 @@
n, w, h = map(int, input().split())
s = (w**2 + h**2) ** 0.5
for _ in range(n):
print("DA" if s >= int(input()) else "NE")

7
simon.py Normal file
View File

@@ -0,0 +1,7 @@
t = int(input())
for _ in range(t):
s = input()
if s[:10] == 'simon says':
print(s[11:])
else:
print()

11
sith.py Normal file
View File

@@ -0,0 +1,11 @@
_ = input()
a = int(input())
b = int(input())
res = int(input())
if a - b >= 0:
print("VEIT EKKI")
elif res > 0:
print("SITH")
else:
print("JEDI")

3
skak.py Normal file
View File

@@ -0,0 +1,3 @@
x1, y1 = map(int, input().split())
x2, y2 = map(int, input().split())
print(1 if x1 == x2 or y1 == y2 else 2)

16
skener.py Normal file
View File

@@ -0,0 +1,16 @@
r, c, zr, zc = map(int, input().split())
rows = []
for _ in range(r):
row = input()
new_row = []
for c in row:
new_row += [
c,
] * zc
rows += [
new_row,
] * zr
for row in rows:
print("".join(row))

2
skocimis.py Normal file
View File

@@ -0,0 +1,2 @@
ints = list(map(int, input().split()))
print(max((ints[1] - ints[0], ints[2] - ints[1]))-1)

23
sortofsorting.py Normal file
View File

@@ -0,0 +1,23 @@
from functools import cmp_to_key
n = int(input())
def sorting_method(a, b):
if ord(a[0]) > ord(b[0]):
return 1
elif ord(a[0]) < ord(b[0]):
return -1
elif ord(a[1]) > ord(b[1]):
return 1
elif ord(a[1]) < ord(b[1]):
return -1
return 0
while n:
names = sorted([input() for _ in range(n)], key=cmp_to_key(sorting_method))
for name in names:
print(name)
print()
n = int(input())

3
sottkvi.py Normal file
View File

@@ -0,0 +1,3 @@
n, k, d = map(int, input().strip().split())
birthday = d + k
print(sum([1 if int(input()) + 14 <= birthday else 0 for _ in range(n)]))

18
speeding.py Normal file
View File

@@ -0,0 +1,18 @@
n = int(input())
prev_t = prev_d = None
max_speed = 0
for _ in range(n):
t, d = map(int, input().split())
if prev_t is None:
prev_t = t
prev_d = d
continue
speed = (d - prev_d) / (t - prev_t)
max_speed = max((speed, max_speed))
prev_t = t
prev_d = d
print(int(max_speed))

10
speedlimit.py Normal file
View File

@@ -0,0 +1,10 @@
n = int(input())
while n > 0:
time = 0
dist = 0
for _ in range(n):
s, t = list(map(int, input().split()))
dist += s * (t - time)
time = t
print(f"{dist} miles")
n = int(input())

19
spellingbee.py Normal file
View File

@@ -0,0 +1,19 @@
letters = input()
n = int(input())
def check_word(word: str, letters: str) -> bool:
for letter in word:
if letter not in letters:
return False
return True
for _ in range(n):
word = input()
if 4 > len(word):
continue
if letters[0] not in word:
continue
if check_word(word, letters):
print(word)

2
spritt.py Normal file
View File

@@ -0,0 +1,2 @@
n, x = map(int, input().strip().split())
print("Jebb" if sum([int(input()) for _ in range(n)]) <= x else "Neibb")

Some files were not shown because too many files have changed in this diff Show More