From 396165366bf62e51b1fe704b450c8cd52b18876b Mon Sep 17 00:00:00 2001 From: <> Date: Wed, 4 Oct 2023 21:38:21 +0000 Subject: [PATCH] Deployed e859020 with MkDocs version: 1.5.3 --- index.html | 2 +- search/search_index.json | 2 +- sitemap.xml.gz | Bin 127 -> 127 bytes solutions/index.html | 18010 +++++++++++++++++++------------------ summary-by-initial.png | Bin 11409 -> 11421 bytes summary-by-language.png | Bin 16107 -> 16110 bytes 6 files changed, 9031 insertions(+), 8983 deletions(-) diff --git a/index.html b/index.html index 83aa28d..a0027cf 100644 --- a/index.html +++ b/index.html @@ -9,4 +9,4 @@ body[data-md-color-scheme="slate"] .gdesc-inner { background: var(--md-default-bg-color);} body[data-md-color-scheme="slate"] .gslide-title { color: var(--md-default-fg-color);} body[data-md-color-scheme="slate"] .gslide-desc { color: var(--md-default-fg-color);} -
Skip to content

Logo

Kattis

Summary by Difficulty

  • Easy 418

  • Medium 26

  • Hard 1

Summary by Initial

summary-by-initial

Summary by Language

summary-by-language

Thanks to all 5 contributors.

Last update: 2023-10-03
Created: 2022-12-05
\ No newline at end of file +
Skip to content

Logo

Kattis

Summary by Difficulty

  • Easy 420

  • Medium 26

  • Hard 1

Summary by Initial

summary-by-initial

Summary by Language

summary-by-language

Thanks to all 5 contributors.

Last update: 2023-10-04
Created: 2022-12-05
\ No newline at end of file diff --git a/search/search_index.json b/search/search_index.json index 11bd087..7db96c8 100644 --- a/search/search_index.json +++ b/search/search_index.json @@ -1 +1 @@ -{"config":{"lang":["en"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"Home","text":""},{"location":"#kattis","title":"Kattis","text":""},{"location":"#summary-by-difficulty","title":"Summary by Difficulty","text":""},{"location":"#summary-by-initial","title":"Summary by Initial","text":""},{"location":"#summary-by-language","title":"Summary by Language","text":"

Thanks to all 5 contributors.

"},{"location":"solutions/","title":"Solutions","text":""},{"location":"solutions/#10-kinds-of-people","title":"10 Kinds of People","text":"Solution in Python Python 
# 22/25\n\n\nfrom copy import deepcopy\n\n\nrow, col = [int(d) for d in input().split()]\nm = []\nfor _ in range(row):\n    m.append([int(d) for d in input()])\n\ndirections = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n\n\ndef reachable(m, r1, c1, r2, c2):\n    _m = deepcopy(m)\n\n    q = []\n    q.append((r1, c1))\n    kind = _m[r1][c1]\n\n    while len(q):\n        r, c = q.pop()\n        _m[r][c] = -1\n\n        if (r, c) == (r2, c2):\n            return True\n\n        for x, y in directions:\n            a = r + x\n            b = c + y\n            if a >= 0 and b >= 0 and a < row and b < col and _m[a][b] == kind:\n                q.append((a, b))\n\n    return False\n\n\nn = int(input())\nfor _ in range(n):\n    r1, c1, r2, c2 = [int(d) - 1 for d in input().split()]\n    if reachable(m, r1, c1, r2, c2):\n        print(\"decimal\" if m[r1][c1] else \"binary\")\n    else:\n        print(\"neither\")\n
"},{"location":"solutions/#1-d-frogger-easy","title":"1-D Frogger (Easy)","text":"Solutions in 2 languages C++Python 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n, s, m, curspace, cnt = 0;\n    cin >> n >> s >> m;\n    int board[n];\n\n    for (int i = 0; i < n; i++)\n    {\n        int tmp;\n        cin >> tmp;\n        board[i] = tmp;\n    }\n    curspace = s - 1;\n\n    while (true)\n    {\n        if (curspace < 0)\n        {\n            cout << \"left\" << endl;\n            break;\n        }\n        else if (curspace > n - 1)\n        {\n            cout << \"right\" << endl;\n            break;\n        }\n        int temp = board[curspace];\n        if (temp == 999)\n        {\n            cout << \"cycle\" << endl;\n            break;\n        }\n        else if (temp == m)\n        {\n            cout << \"magic\" << endl;\n            break;\n        }\n        else\n        {\n            cnt += 1;\n            board[curspace] = 999;\n            curspace += temp;\n        }\n    }\n    cout << cnt << endl;\n}\n
n, s, m = [int(d) for d in input().split()]\nb = [int(d) for d in input().split()]\nvisited, hops = set(), 0\nwhile True:\n    if s in visited:\n        print(\"cycle\")\n        break\n    elif s < 1:\n        print(\"left\")\n        break\n    elif s > n:\n        print(\"right\")\n        break\n    elif b[s - 1] == m:\n        print(\"magic\")\n        break\n    else:\n        visited.add(s)\n        s += b[s - 1]\n        hops += 1\nprint(hops)\n
"},{"location":"solutions/#3d-printed-statues","title":"3D Printed Statues","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport (\n    \"fmt\"\n    \"math\"\n)\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    d := 1.0\n    for math.Pow(2, d-1) < float64(n) {\n        d += 1\n    }\n    fmt.Println(d)\n}\n
import java.util.Scanner;\n\nclass ThreeDPrintedStatues {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int d = 1;\n        while (Math.pow(2, d - 1) < n) {\n            d += 1;\n        }\n        System.out.println(d);\n    }\n}\n
n = int(input())\nd = 1\nwhile 2 ** (d - 1) < n:\n    d += 1\nprint(d)\n
"},{"location":"solutions/#4-thought","title":"4 thought","text":"Solution in Python Python 
from itertools import product\n\nops = [\"+\", \"-\", \"*\", \"//\"]\n\nfor _ in range(int(input())):\n    s = int(input())\n    solved = False\n    for op1, op2, op3 in product(ops, ops, ops):\n        e = f\"4 {op1} 4 {op2} 4 {op3} 4\"\n        try:\n            ans = eval(e) == s\n        except:\n            ans = False\n        if ans:\n            print(f\"{e.replace('//','/')} = {s}\")\n            solved = True\n            break\n    if not solved:\n        print(\"no solution\")\n
"},{"location":"solutions/#99-problems","title":"99 Problems","text":"Solution in Python Python 
import math\n\nn = int(input())\nceil = math.ceil(n / 100) * 100 - 1\nfloor = math.floor(n / 100) * 100 - 1\nif ceil == floor:\n    print(ceil)\nelse:\n    if abs(ceil - n) <= abs(n - floor) or floor < 0:\n        print(ceil)\n    else:\n        print(floor)\n
"},{"location":"solutions/#aaah","title":"Aaah!","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var a, b string\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    if strings.Count(a, \"a\") >= strings.Count(b, \"a\") {\n        fmt.Println(\"go\")\n    } else {\n        fmt.Println(\"no\")\n    }\n}\n
a, b = input(), input()\nif a.count(\"a\") >= b.count(\"a\"):\n    print(\"go\")\nelse:\n    print(\"no\")\n
"},{"location":"solutions/#abc","title":"ABC","text":"Solution in Python Python 
numbers = sorted([int(d) for d in input().split()])\norders = list(input())\norder_map = {\n    \"A\": 0,\n    \"B\": 1,\n    \"C\": 2,\n}\n\nprint(\" \".join([str(numbers[order_map[o]]) for o in orders]))\n
"},{"location":"solutions/#above-average","title":"Above Average","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    numbers = [int(d) for d in input().split()[1:]]\n    ave = sum(numbers) / len(numbers)\n    above_ave = [d > ave for d in numbers]\n    print(f\"{sum(above_ave)/len(numbers):.3%}\")\n
"},{"location":"solutions/#acm-contest-scoring","title":"ACM Contest Scoring","text":"Solution in Python Python 
problems = {}\nsolved = set()\nwhile True:\n    line = input()\n    if line == \"-1\":\n        break\n    t, p, ans = line.split()\n    t = int(t)\n    if p in solved:\n        continue\n    if p not in problems:\n        problems[p] = [(t, ans)]\n    else:\n        problems[p].append((t, ans))\n    if ans == \"right\":\n        solved.add(p)\n\nscore = 0\nfor p in problems:\n    t, ans = problems[p][-1]\n    if ans == \"right\":\n        score += t + 20 * len(problems[p][:-1])\n\nprint(len(solved), score)\n
"},{"location":"solutions/#adding-trouble","title":"Adding Trouble","text":"Solution in Python Python 
a, b, c = [int(v) for v in input().split()]\nif a + b == c:\n    print(\"correct!\")\nelse:\n    print(\"wrong!\")\n
"},{"location":"solutions/#adding-words","title":"Adding Words","text":"Solution in Python Python 
name = {}\nvalue = {}\nop = [\"-\", \"+\"]\nwhile True:\n    try:\n        s = input().split()\n    except:\n        break\n\n    if s[0] == \"clear\":\n        name.clear()\n        value.clear()\n    elif s[0] == \"def\":\n        n, v = s[1:]\n        v = int(v)\n        if n in name:\n            value.pop(name[n])\n        name[n] = v\n        value[v] = n\n    elif s[0] == \"calc\":\n        try:\n            ans = eval(\"\".join([str(name[p]) if p not in op else p for p in s[1:-1]]))\n        except:\n            ans = \"unknown\"\n\n        ans = value.get(ans, \"unknown\")\n        print(\" \".join(s[1:] + [ans]))\n
"},{"location":"solutions/#add-two-numbers","title":"Add Two Numbers","text":"Solutions in 4 languages GoJavaJavaScriptPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Println(a + b)\n}\n
import java.util.Scanner;\n\nclass AddTwoNumbers {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a = s.nextInt(), b = s.nextInt();\n        System.out.println(a + b);\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  [a, b] = line\n    .trim()\n    .split(\" \")\n    .map((e) => parseInt(e));\n  console.log(a + b);\n});\n
line = input()\na, b = line.split()\na = int(a)\nb = int(b)\nprint(a + b)\n
"},{"location":"solutions/#akcija","title":"Akcija","text":"Solution in Python Python 
n = int(input())\nc = [int(input()) for _ in range(n)]\n\nc = sorted(c, reverse=True)\ngroups = [c[i : i + 3] if i + 3 < n else c[i:] for i in range(0, n, 3)]\n\nprint(sum(sum(g if len(g) < 3 else g[:2]) for g in groups))\n
"},{"location":"solutions/#alex-and-barb","title":"Alex and Barb","text":"Solution in Python Python 
k, m, n = [int(d) for d in input().split()]\n\nprint(\"Barb\" if k % (m + n) < m else \"Alex\")\n
"},{"location":"solutions/#alphabet-spam","title":"Alphabet Spam","text":"Solution in Python Python 
s = input()\ntotal = len(s)\nwhites = s.count(\"_\")\nlowers = len([c for c in s if ord(c) >= ord(\"a\") and ord(c) <= ord(\"z\")])\nuppers = len([c for c in s if ord(c) >= ord(\"A\") and ord(c) <= ord(\"Z\")])\nsymbols = total - whites - lowers - uppers\nprint(f\"{whites/total:.15f}\")\nprint(f\"{lowers/total:.15f}\")\nprint(f\"{uppers/total:.15f}\")\nprint(f\"{symbols/total:.15f}\")\n
"},{"location":"solutions/#ameriskur-vinnustaur","title":"Amer\u00edskur vinnusta\u00f0ur","text":"Solution in Python Python 
print(int(input()) * 0.09144)\n
"},{"location":"solutions/#amsterdam-distance","title":"Amsterdam Distance","text":"Solution in Python Python 
import math\n\nm, n, r = input().split()\nm = int(m)\nn = int(n)\nr = float(r)\ncoords = [int(d) for d in input().split()]\np = r / n\n\ndist1 = 0\ndist1 += p * abs(coords[1] - coords[3])\ndist1 += (\n    math.pi\n    * r\n    * ((min(coords[3], coords[1]) if coords[3] != coords[1] else coords[1]) / n)\n    * (abs(coords[0] - coords[2]) / m)\n)\n\ndist2 = p * abs(coords[1] + coords[3])\n\nprint(min(dist1, dist2))\n
"},{"location":"solutions/#a-new-alphabet","title":"A New Alphabet","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"os\"\n    \"strings\"\n)\n\nfunc main() {\n    mapping := map[string]string{\n        \"a\": \"@\",\n        \"b\": \"8\",\n        \"c\": \"(\",\n        \"d\": \"|)\",\n        \"e\": \"3\",\n        \"f\": \"#\",\n        \"g\": \"6\",\n        \"h\": \"[-]\",\n        \"i\": \"|\",\n        \"j\": \"_|\",\n        \"k\": \"|<\",\n        \"l\": \"1\",\n        \"m\": \"[]\\\\/[]\",\n        \"n\": \"[]\\\\[]\",\n        \"o\": \"0\",\n        \"p\": \"|D\",\n        \"q\": \"(,)\",\n        \"r\": \"|Z\",\n        \"s\": \"$\",\n        \"t\": \"']['\",\n        \"u\": \"|_|\",\n        \"v\": \"\\\\/\",\n        \"w\": \"\\\\/\\\\/\",\n        \"x\": \"}{\",\n        \"y\": \"`/\",\n        \"z\": \"2\",\n    }\n    scanner := bufio.NewScanner(os.Stdin)\n    scanner.Scan()\n    line := scanner.Text()\n    runes := []rune(strings.ToLower(line))\n    for i := 0; i < len(runes); i++ {\n        v, ok := mapping[string(runes[i])]\n        if ok {\n            fmt.Printf(v)\n        } else {\n            fmt.Printf(string(runes[i]))\n        }\n    }\n}\n
mapping = {\n    \"a\": \"@\",\n    \"b\": \"8\",\n    \"c\": \"(\",\n    \"d\": \"|)\",\n    \"e\": \"3\",\n    \"f\": \"#\",\n    \"g\": \"6\",\n    \"h\": \"[-]\",\n    \"i\": \"|\",\n    \"j\": \"_|\",\n    \"k\": \"|<\",\n    \"l\": \"1\",\n    \"m\": \"[]\\\\/[]\",\n    \"n\": \"[]\\\\[]\",\n    \"o\": \"0\",\n    \"p\": \"|D\",\n    \"q\": \"(,)\",\n    \"r\": \"|Z\",\n    \"s\": \"$\",\n    \"t\": \"']['\",\n    \"u\": \"|_|\",\n    \"v\": \"\\\\/\",\n    \"w\": \"\\\\/\\\\/\",\n    \"x\": \"}{\",\n    \"y\": \"`/\",\n    \"z\": \"2\",\n}\nprint(\"\".join([mapping.get(c, c) for c in input().lower()]))\n
"},{"location":"solutions/#another-brick-in-the-wall","title":"Another Brick in the Wall","text":"Solution in Python Python 
h, w, n = [int(d) for d in input().split()]\nb = [int(d) for d in input().split()]\n\ni, tw, th, done = 0, 0, 0, False\nwhile i < n:\n    if tw + b[i] <= w:\n        tw += b[i]\n        if tw == w:\n            tw = 0\n            th += 1\n        if th == h and tw == 0:\n            done = True\n            break\n    else:\n        break\n    i += 1\n\nprint(\"YES\" if done else \"NO\")\n
"},{"location":"solutions/#another-candies","title":"Another Candies","text":"Solution in Python Python 
for _ in range(int(input())):\n    _ = input()\n    n = int(input())\n    s = 0\n    for _ in range(n):\n        s += int(input())\n        if s > n:\n            s %= n\n    print(\"NO\" if s % n else \"YES\")\n
"},{"location":"solutions/#apaxiaaaaaaaaaaaans","title":"Apaxiaaaaaaaaaaaans!","text":"Solution in Python Python 
name = input()\ncompact = \"\"\nfor s in name:\n    if not compact or s != compact[-1]:\n        compact += s\nprint(compact)\n
"},{"location":"solutions/#honour-thy-apaxian-parent","title":"Honour Thy (Apaxian) Parent","text":"Solution in Python Python 
y, p = input().split()\nif y.endswith(\"e\"):\n    name = y + \"x\" + p\nelif y[-1] in \"aiou\":\n    name = y[:-1] + \"ex\" + p\nelif y.endswith(\"ex\"):\n    name = y + p\nelse:\n    name = y + \"ex\" + p\n\nprint(name)\n
"},{"location":"solutions/#a-real-challenge","title":"A Real Challenge","text":"Solutions in 3 languages GoJavaScriptPython 
package main\n\nimport (\n    \"fmt\"\n    \"math\"\n)\n\nfunc main() {\n    var a int\n    fmt.Scan(&a)\n    fmt.Println(4 * math.Sqrt(float64(a)))\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (a) => {\n  console.log(4 * Math.sqrt(parseInt(a)));\n});\n
import math\n\ns = int(input())\nprint(4 * math.sqrt(s))\n
"},{"location":"solutions/#are-you-listening","title":"Are You Listening?","text":"Solution in Python Python 
import math\n\ncx, cy, n = [int(d) for d in input().split()]\n\nd = []\nfor _ in range(n):\n    x, y, r = [int(d) for d in input().split()]\n    d.append(((x - cx) ** 2 + (y - cy) ** 2) ** 0.5 - r)\nv = sorted(d)[2]\nprint(math.floor(v) if v > 0 else 0)\n
"},{"location":"solutions/#arithmetic","title":"Arithmetic","text":"Solution in Python Python 
import math\n\nmapping8 = {\n    \"0\": \"000\",\n    \"1\": \"001\",\n    \"2\": \"010\",\n    \"3\": \"011\",\n    \"4\": \"100\",\n    \"5\": \"101\",\n    \"6\": \"110\",\n    \"7\": \"111\",\n}\nmapping16 = {\n    \"0000\": \"0\",\n    \"0001\": \"1\",\n    \"0010\": \"2\",\n    \"0011\": \"3\",\n    \"0100\": \"4\",\n    \"0101\": \"5\",\n    \"0110\": \"6\",\n    \"0111\": \"7\",\n    \"1000\": \"8\",\n    \"1001\": \"9\",\n    \"1010\": \"A\",\n    \"1011\": \"B\",\n    \"1100\": \"C\",\n    \"1101\": \"D\",\n    \"1110\": \"E\",\n    \"1111\": \"F\",\n}\n\nb = \"\".join([mapping8[c] for c in input()])\nb = b.zfill(math.ceil(len(b) / 4) * 4)\nans = \"\".join([mapping16[b[i : i + 4]] for i in range(0, len(b), 4)])\nif ans != \"0\":\n    ans = ans.lstrip(\"0\")\nprint(ans)\n
"},{"location":"solutions/#arithmetic-functions","title":"Arithmetic Functions","text":"Solution in C++ C++ 
#include \"arithmeticfunctions.h\"\n\n// Compute x^3\nint cube(int x)\n{\n    return x * x * x;\n}\n\n// Compute the maximum of x and y\nint max(int x, int y)\n{\n    if (x > y)\n    {\n        return x;\n    }\n    else\n    {\n        return y;\n    }\n}\n\n// Compute x - y\nint difference(int x, int y)\n{\n    return x - y;\n}\n
"},{"location":"solutions/#army-strength-easy","title":"Army Strength (Easy)","text":"Solution in Python Python 
t = int(input())\nfor _ in range(t):\n    input()\n    ng, nm = [int(d) for d in input().split()]\n    g = [int(d) for d in input().split()]\n    m = [int(d) for d in input().split()]\n    if max(m) > max(g):\n        print(\"MechaGodzilla\")\n    else:\n        print(\"Godzilla\")\n
"},{"location":"solutions/#army-strength-hard","title":"Army Strength (Hard)","text":"Solution in Python Python 
t = int(input())\nfor _ in range(t):\n    input()\n    ng, nm = [int(d) for d in input().split()]\n    g = [int(d) for d in input().split()]\n    m = [int(d) for d in input().split()]\n    if max(m) > max(g):\n        print(\"MechaGodzilla\")\n    else:\n        print(\"Godzilla\")\n
"},{"location":"solutions/#astrological-sign","title":"Astrological Sign","text":"Solution in Python Python 
for _ in range(int(input())):\n    d, m = input().split()\n    d = int(d)\n    if (m == \"Mar\" and d >= 21) or (m == \"Apr\" and d <= 20):\n        print(\"Aries\")\n    elif (m == \"Apr\" and d >= 21) or (m == \"May\" and d <= 20):\n        print(\"Taurus\")\n    elif (m == \"May\" and d >= 21) or (m == \"Jun\" and d <= 21):\n        print(\"Gemini\")\n    elif (m == \"Jun\" and d >= 22) or (m == \"Jul\" and d <= 22):\n        print(\"Cancer\")\n    elif (m == \"Jul\" and d >= 23) or (m == \"Aug\" and d <= 22):\n        print(\"Leo\")\n    elif (m == \"Aug\" and d >= 23) or (m == \"Sep\" and d <= 21):\n        print(\"Virgo\")\n    elif (m == \"Sep\" and d >= 22) or (m == \"Oct\" and d <= 22):\n        print(\"Libra\")\n    elif (m == \"Oct\" and d >= 23) or (m == \"Nov\" and d <= 22):\n        print(\"Scorpio\")\n    elif (m == \"Nov\" and d >= 23) or (m == \"Dec\" and d <= 21):\n        print(\"Sagittarius\")\n    elif (m == \"Dec\" and d >= 22) or (m == \"Jan\" and d <= 20):\n        print(\"Capricorn\")\n    elif (m == \"Jan\" and d >= 21) or (m == \"Feb\" and d <= 19):\n        print(\"Aquarius\")\n    elif (m == \"Feb\" and d >= 20) or (m == \"Mar\" and d <= 20):\n        print(\"Pisces\")\n
"},{"location":"solutions/#autori","title":"Autori","text":"Solution in Python Python 
print(\"\".join([part[0] for part in input().split(\"-\")]))\n
"},{"location":"solutions/#average-character","title":"Average Character","text":"Solution in Python Python 
s = input()\ns = [ord(c) for c in s]\ns = sum(s) // len(s)\nprint(chr(s))\n
"},{"location":"solutions/#avion","title":"Avion","text":"Solution in Python Python 
ans = []\nfor i in range(5):\n    row = input()\n    if \"FBI\" in row:\n        ans.append(str(i + 1))\nif not ans:\n    print(\"HE GOT AWAY!\")\nelse:\n    print(\" \".join(ans))\n
"},{"location":"solutions/#babelfish","title":"Babelfish","text":"Solution in Python Python 
d = []\nwhile True:\n    line = input()\n    if not line:\n        break\n    w, f = line.split()\n    d.append((f, w))\n\nd = dict(d)\nwhile True:\n    try:\n        line = input()\n    except:\n        break\n    print(d.get(line, \"eh\"))\n
"},{"location":"solutions/#baby-bites","title":"Baby Bites","text":"Solution in Python Python 
n = int(input())\na = input().split()\nc = [str(d) for d in range(1, n + 1)]\ninplace = [i == j if i.isnumeric() and j.isnumeric() else None for i, j in zip(a, c)]\ninplace = [v for v in inplace if v is not None]\nprint(\"makes sense\" if all(inplace) else \"something is fishy\")\n
"},{"location":"solutions/#baby-panda","title":"Baby Panda","text":"Solution in Python Python 
import math\n\nn, m = [int(d) for d in input().split()]\nd = 0\nwhile m:\n    c = math.floor(math.log(m, 2))\n    d += 1\n    m -= 2**c\nprint(d)\n
"},{"location":"solutions/#backspace","title":"Backspace","text":"Solution in Python Python 
ans = []\nfor c in input():\n    if c != \"<\":\n        ans.append(c)\n    else:\n        ans.pop()\nprint(\"\".join(ans))\n
"},{"location":"solutions/#bacon-eggs-and-spam","title":"Bacon, Eggs, and Spam","text":"Solution in Python Python 
while True:\n    n = int(input())\n    if not n:\n        break\n    record = {}\n    for _ in range(n):\n        order = input().split()\n        name = order[0]\n        items = order[1:]\n        for item in items:\n            if item not in record:\n                record[item] = [name]\n            else:\n                record[item].append(name)\n    for name in sorted(record):\n        print(name, \" \".join(sorted(record[name])))\n    print()\n
"},{"location":"solutions/#bannor","title":"Bannor\u00f0","text":"Solution in Python Python 
s = set(input())\nm = input().split()\nprint(\" \".join([\"*\" * len(p) if s & set(p) else p for p in m]))\n
"},{"location":"solutions/#basketball-one-on-one","title":"Basketball One-on-One","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass BasketballOneOnOne {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String scores = s.nextLine();\n        System.out.println(scores.charAt(scores.length() - 2));\n    }\n}\n
scores = input()\nsize = len(scores)\na = sum([int(scores[i + 1]) for i in range(size) if scores[i] == \"A\"])\nb = sum([int(scores[i + 1]) for i in range(size) if scores[i] == \"B\"])\nif a > b:\n    print(\"A\")\nelse:\n    print(\"B\")\n
"},{"location":"solutions/#batter-up","title":"Batter Up","text":"Solution in Python Python 
_ = input()\nat_bats = [int(d) for d in input().split()]\nans = [d for d in at_bats if d >= 0]\nprint(sum(ans) / len(ans))\n
"},{"location":"solutions/#beat-the-spread","title":"Beat the Spread!","text":"Solution in Python Python 
for _ in range(int(input())):\n    a, b = [int(d) for d in input().split()]\n    if a < b or (a + b) % 2:\n        print(\"impossible\")\n    else:\n        print((a + b) // 2, (a - b) // 2)\n
"},{"location":"solutions/#beavergnaw","title":"Beavergnaw","text":"Solution in Python Python 
import math\n\nwhile True:\n    D, V = [int(d) for d in input().split()]\n    if not D and not V:\n        break\n    # R = D / 2\n    # r = d / 2\n    # V + \u03c0 * (r**2) * (2*r) + 2 * (1/3) * \u03c0 * (R-r) * (r**2 + r*R + R**2) == \u03c0 * (R**2) * (2*R)\n    print(math.pow(D**3 - 6 * V / math.pi, 1 / 3))\n
"},{"location":"solutions/#beekeeper","title":"Beekeeper","text":"Solution in Python Python 
def count(word):\n    return sum(word.count(c * 2) for c in \"aeiouy\")\n\n\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    words = []\n    for _ in range(n):\n        words.append(input())\n    print(max(words, key=count))\n
"},{"location":"solutions/#bela","title":"Bela","text":"Solution in Python Python 
table = {\n    \"A\": {True: 11, False: 11},\n    \"K\": {True: 4, False: 4},\n    \"Q\": {True: 3, False: 3},\n    \"J\": {True: 20, False: 2},\n    \"T\": {True: 10, False: 10},\n    \"9\": {True: 14, False: 0},\n    \"8\": {True: 0, False: 0},\n    \"7\": {True: 0, False: 0},\n}\n\nn, b = input().split()\nn = int(n)\ntotal = 0\n\nfor _ in range(4 * n):\n    card = input()\n    f, s = card[0], card[1]\n    total += table[f][s == b]\n\nprint(total)\n
"},{"location":"solutions/#betting","title":"Betting","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a float32\n    fmt.Scan(&a)\n    fmt.Printf(\"%.10f\", 100/a)\n    fmt.Println()\n    fmt.Printf(\"%.10f\", 100/(100-a))\n}\n
a = int(input())\nprint(f\"{100/a:.10f}\")\nprint(f\"{100/(100-a):.10f}\")\n
"},{"location":"solutions/#bijele","title":"Bijele","text":"Solution in Python Python 
should_contain = (1, 1, 2, 2, 2, 8)\nfound = [int(d) for d in input().split()]\nprint(\" \".join([str(a - b) for a, b in zip(should_contain, found)]))\n
"},{"location":"solutions/#black-friday","title":"Black Friday","text":"Solution in Python Python 
from collections import Counter\n\nn = input()\na = [int(d) for d in input().split()]\nc = Counter(a)\nkeys = [k for k in c if c[k] == 1]\nif not keys:\n    print(\"none\")\nelse:\n    print(a.index(max(keys)) + 1)\n
"},{"location":"solutions/#blueberry-waffle","title":"Blueberry Waffle","text":"Solution in Python Python 
r, f = [int(d) for d in input().split()]\n\na = f // r\nb = (f - a * r) / r >= 0.5\n\nprint(\"up\" if (a + b) % 2 == 0 else \"down\")\n
"},{"location":"solutions/#bluetooth","title":"Bluetooth","text":"Solution in Python Python 
n = int(input())\ncond = {}\n\n\ndef f(t):\n    if t[0].isdigit():\n        return (f'R{\"u\" if t[1]==\"+\" else \"l\"}', t[0])\n    else:\n        return (f'L{\"u\" if t[0]==\"+\" else \"l\"}', t[1])\n\n\nfor _ in range(n):\n    t, p = input().split()\n    q, d = f(t)\n    if p == \"b\":\n        if p not in cond:\n            cond[p] = [q]\n        else:\n            cond[p].append(q)\n    elif p == \"m\":\n        if p not in cond:\n            cond[p] = [(q, d)]\n        else:\n            cond[p].append((q, d))\n\nl, r = True, True\n\nif \"R\" in [c[0] for c in cond.get(\"b\", [])]:\n    r = False\nif \"L\" in [c[0] for c in cond.get(\"b\", [])]:\n    l = False\n\nru = len([d for q, d in cond.get(\"m\", []) if q == \"Ru\"])\nrl = len([d for q, d in cond.get(\"m\", []) if q == \"Rl\"])\nlu = len([d for q, d in cond.get(\"m\", []) if q == \"Lu\"])\nll = len([d for q, d in cond.get(\"m\", []) if q == \"Ll\"])\n\nif ru == 8 or rl == 8:\n    r = False\nif lu == 8 or ll == 8:\n    l = False\n\nif not l and not r:\n    print(2)\nelif l and not r:\n    print(0)\nelif r and not l:\n    print(1)\nelse:\n    print(\"?\")\n
"},{"location":"solutions/#boat-parts","title":"Boat Parts","text":"Solution in Python Python 
p, n = [int(d) for d in input().split()]\nboat = set()\nd = -1\nfor i in range(n):\n    w = input()\n    boat.add(w)\n    if len(boat) == p:\n        d = i + 1\n        break\nif d == -1:\n    print(\"paradox avoided\")\nelse:\n    print(d)\n
"},{"location":"solutions/#booking-a-room","title":"Booking a Room","text":"Solution in Python Python 
r, n = [int(d) for d in input().split()]\nbooked = [int(input()) for _ in range(n)]\navailable = set(range(1, 1 + r)) - set(booked)\nprint(\"too late\" if r == n else available.pop())\n
"},{"location":"solutions/#boss-battle","title":"Boss Battle","text":"Solution in Python Python 
n = int(input())\nprint(n - 2 if n // 4 else 1)\n
"},{"location":"solutions/#bounding-robots","title":"Bounding Robots","text":"Solution in Python Python 
while True:\n    room_x, room_y = [int(d) for d in input().split()]\n    if not room_x and not room_y:\n        break\n\n    robot_x, robot_y = 0, 0\n    actual_x, actual_y = 0, 0\n\n    n = int(input())\n    for _ in range(n):\n        direction, step = input().split()\n        step = int(step)\n\n        if direction == \"u\":\n            robot_y += step\n            actual_y = min(room_y - 1, actual_y + step)\n        elif direction == \"d\":\n            robot_y -= step\n            actual_y = max(0, actual_y - step)\n        elif direction == \"r\":\n            robot_x += step\n            actual_x = min(room_x - 1, actual_x + step)\n        elif direction == \"l\":\n            robot_x -= step\n            actual_x = max(0, actual_x - step)\n\n    print(f\"Robot thinks {robot_x} {robot_y}\")\n    print(f\"Actually at {actual_x} {actual_y}\")\n    print()\n
"},{"location":"solutions/#bracket-matching","title":"Bracket Matching","text":"Solution in Python Python 
n = int(input())\ns = input()\nstack = []\nis_valid = True\nfor i in range(n):\n    c = s[i]\n    if c in (\"(\", \"[\", \"{\"):\n        stack.append(c)\n    else:\n        if len(stack) == 0:\n            is_valid = False\n            break\n        last = stack.pop()\n        if c == \")\" and last != \"(\":\n            is_valid = False\n            break\n        if c == \"]\" and last != \"[\":\n            is_valid = False\n            break\n        if c == \"}\" and last != \"{\":\n            is_valid = False\n            break\n\nprint(\"Valid\" if is_valid and not len(stack) else \"Invalid\")\n
"},{"location":"solutions/#breaking-branches","title":"Breaking Branches","text":"Solutions in 5 languages GoHaskellJavaJavaScriptPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    if n%2 == 0 {\n        fmt.Println(\"Alice\")\n        fmt.Println(1)\n    } else {\n        fmt.Println(\"Bob\")\n    }\n}\n
main = do\n    input <- getLine\n    let n = (read input :: Int)\n    if  n `mod` 2  ==  0\n    then do putStrLn \"Alice\"\n            putStrLn \"1\"\n        else putStrLn \"Bob\"\n
import java.util.Scanner;\n\nclass BreakingBranches {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        if (n % 2 == 0) {\n            System.out.println(\"Alice\");\n            System.out.println(1);\n        } else {\n            System.out.println(\"Bob\");\n        }\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (n) => {\n  if (parseInt(n) % 2) {\n    console.log(\"Bob\");\n  } else {\n    console.log(\"Alice\");\n    console.log(1);\n  }\n});\n
n = int(input())\nif n % 2:\n    print(\"Bob\")\nelse:\n    print(\"Alice\")\n    print(1)\n
"},{"location":"solutions/#broken-calculator","title":"Broken Calculator","text":"Solution in Python Python 
prev = 1\nfor _ in range(int(input())):\n    a, op, b = input().split()\n    a, b = int(a), int(b)\n    if op == \"+\":\n        ans = a + b - prev\n    elif op == \"-\":\n        ans = (a - b) * prev\n    elif op == \"*\":\n        ans = (a * b) ** 2\n    elif op == \"/\":\n        ans = (a + 1) // 2 if a % 2 else a // 2\n\n    print(ans)\n    prev = ans\n
"},{"location":"solutions/#broken-swords","title":"Broken Swords","text":"Solution in Python Python 
tb, lr = 0, 0\nfor _ in range(int(input())):\n    s = input()\n    tb += s[:2].count(\"0\")\n    lr += s[2:].count(\"0\")\n\nswords = min(tb, lr) // 2\ntb -= swords * 2\nlr -= swords * 2\n\nprint(f\"{swords} {tb} {lr}\")\n
"},{"location":"solutions/#buka","title":"Buka","text":"Solution in Python Python 
a, op, b = input(), input(), input()\npa, pb = a.count(\"0\"), b.count(\"0\")\nif op == \"*\":\n    print(f\"1{'0'*(pa+pb)}\")\nelif op == \"+\":\n    if pa == pb:\n        ans = f\"2{'0'*pa}\"\n    else:\n        ans = f\"1{'0'*(abs(pa-pb)-1)}1{'0'*min(pa,pb)}\"\n    print(ans)\n
"},{"location":"solutions/#bus","title":"Bus","text":"Solution in Python Python 
def f(n):\n    if n == 1:\n        return 1\n    else:\n        return int(2 * (f(n - 1) + 0.5))\n\n\nfor _ in range(int(input())):\n    print(f(int(input())))\n
"},{"location":"solutions/#bus-numbers","title":"Bus Numbers","text":"Solution in Python Python 
n = int(input())\nnumbers = sorted([int(d) for d in input().split()])\n\nprev = numbers[0]\nans = {prev: 1}\nfor i in range(1, n):\n    if numbers[i] == prev + ans[prev]:\n        ans[prev] += 1\n    else:\n        prev = numbers[i]\n        ans[prev] = 1\n\nprint(\n    \" \".join(\n        [\n            f\"{key}-{key+value-1}\"\n            if value > 2\n            else \" \".join([str(d) for d in range(key, key + value)])\n            for key, value in ans.items()\n        ]\n    )\n)\n
"},{"location":"solutions/#calories-from-fat","title":"Calories From Fat","text":"Solution in Python Python 
mapping = {\"fat\": 9, \"protein\": 4, \"sugar\": 4, \"starch\": 4, \"alcohol\": 7}\n\n\ndef c(x, category):\n    if \"g\" in x:\n        return (int(x[:-1]) * mapping[category], \"C\")\n    elif \"C\" in x:\n        return (int(x[:-1]), \"C\")\n    elif \"%\" in x:\n        return (int(x[:-1]) / 100, \"%\")\n\n\ndef solve(items):\n    fat_c, total_c = 0, 0\n    for fat, protein, sugar, starch, alcohol in items:\n        fat_c += fat\n        total_c += fat + protein + sugar + starch + alcohol\n\n    return f\"{fat_c/total_c:.0%}\"\n\n\nitems = []\nwhile True:\n    s = input()\n    if s == \"-\":\n        if not items:\n            break\n        print(solve(items))\n\n        items = []\n        continue\n\n    fat, protein, sugar, starch, alcohol = s.split()\n    mapping.keys()\n\n    total_c, total_p = 0, 0\n\n    reading = []\n    for v, k in zip(s.split(), mapping.keys()):\n        n, t = c(v, k)\n        if t == \"C\":\n            total_c += n\n        elif t == \"%\":\n            total_p += n\n        reading.append((n, t))\n\n    total_c = total_c / (1 - total_p)\n\n    item = []\n    for n, t in reading:\n        if t == \"%\":\n            item.append(n * total_c)\n        else:\n            item.append(n)\n\n    items.append(item)\n
"},{"location":"solutions/#canadians-eh","title":"Canadians, eh?","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"os\"\n    \"strings\"\n)\n\nfunc main() {\n    scanner := bufio.NewScanner(os.Stdin)\n    scanner.Scan()\n    line := scanner.Text()\n    if strings.HasSuffix(line, \"eh?\") {\n        fmt.Println(\"Canadian!\")\n    } else {\n        fmt.Println(\"Imposter!\")\n    }\n}\n
import java.util.Scanner;\n\nclass CanadiansEh {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String line = s.nextLine();\n        if (line.endsWith(\"eh?\")) {\n            System.out.println(\"Canadian!\");\n        } else {\n            System.out.println(\"Imposter!\");\n        }\n    }\n}\n
line = input()\nif line.endswith(\"eh?\"):\n    print(\"Canadian!\")\nelse:\n    print(\"Imposter!\")\n
"},{"location":"solutions/#careful-ascent","title":"Careful Ascent","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\nn = int(input())\nshields = []\nfor _ in range(n):\n    l, u, f = input().split()\n    l = int(l)\n    u = int(u)\n    f = float(f)\n    shields.append((l, u, f))\n\nshields.append((b,))\ns = shields[0][0]\nfor i in range(n):\n    s += (shields[i][1] - shields[i][0]) * shields[i][2]\n    s += shields[i + 1][0] - shields[i][1]\nprint(f\"{a/s:.6f}\")\n
"},{"location":"solutions/#solving-for-carrots","title":"Solving for Carrots","text":"Solution in Python Python 
n, ans = [int(d) for d in input().split()]\nfor _ in range(n):\n    input()\nprint(ans)\n
"},{"location":"solutions/#catalan-numbers","title":"Catalan Numbers","text":"Solution in Python Python 
# https://en.wikipedia.org/wiki/Catalan_number\np = [1]\nfor i in range(10000):\n    p.append(p[-1] * (i + 1))\n\nfor _ in range(int(input())):\n    n = int(input())\n    print(p[2 * n] // (p[n + 1] * p[n]))\n
"},{"location":"solutions/#cd","title":"CD","text":"Solution in Python Python 
while True:\n    n, m = [int(d) for d in input().split()]\n    if not n and not m:\n        break\n    a = [int(input()) for _ in range(n)]\n    b = [int(input()) for _ in range(m)]\n    total, i, j = 0, 0, 0\n    while i < n and j < m:\n        if a[i] == b[j]:\n            total += 1\n            i += 1\n            j += 1\n        elif a[i] < b[j]:\n            i += 1\n        else:\n            j += 1\n    while i < n:\n        if a[i] == b[-1]:\n            total += 1\n            break\n        i += 1\n    while j < n:\n        if a[-1] == b[j]:\n            total += 1\n            break\n        j += 1\n    print(total)\n
"},{"location":"solutions/#cetiri","title":"Cetiri","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"sort\"\n)\n\nfunc main() {\n    var a, b, c int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Scan(&c)\n    s := []int{a, b, c}\n    sort.Ints(s)\n    a, b, c = s[0], s[1], s[2]\n    if c-b == b-a {\n        fmt.Println(c + c - b)\n    } else if c-b > b-a {\n        fmt.Println(c - b + a)\n    } else {\n        fmt.Println(a + c - b)\n    }\n}\n
a, b, c = sorted([int(d) for d in input().split()])\nif c - b == b - a:\n    print(c + c - b)\nelif c - b > b - a:\n    print(c - b + a)\nelse:\n    print(a + c - b)\n
"},{"location":"solutions/#cetvrta","title":"Cetvrta","text":"Solution in Python Python 
from collections import Counter\n\nx, y = Counter(), Counter()\n\nfor _ in range(3):\n    _x, _y = [int(d) for d in input().split()]\n    x[_x] += 1\n    y[_y] += 1\n\n\nfor key in x:\n    if x[key] == 1:\n        print(key, \" \")\n        break\n\nfor key in y:\n    if y[key] == 1:\n        print(key)\n        break\n
"},{"location":"solutions/#chanukah-challenge","title":"Chanukah Challenge","text":"Solution in Python Python 
for _ in range(int(input())):\n    k, n = [int(d) for d in input().split()]\n    print(k, int((1 + n) * n / 2 + n))\n
"},{"location":"solutions/#character-development","title":"Character Development","text":"Solution in Python Python 
def f(m):\n    ans = 0\n    for n in range(2, m + 1):\n        a, b = 1, 1\n        for i in range(m - n + 1, m + 1):\n            a *= i\n        for i in range(1, n + 1):\n            b *= i\n        ans += a // b\n    return ans\n\n\nprint(f(int(input())))\n
"},{"location":"solutions/#chocolate-division","title":"Chocolate Division","text":"Solution in Python Python 
r, c = [int(v) for v in input().split()]\n\nchocolate_bar_cuts = (r * c) - 1\n\nif chocolate_bar_cuts % 2 == 1:\n    print(\"Alf\")\nelse:\n    print(\"Beata\")\n
"},{"location":"solutions/#preludes","title":"Preludes","text":"Solution in Python Python 
alternatives = [(\"A#\", \"Bb\"), (\"C#\", \"Db\"), (\"D#\", \"Eb\"), (\"F#\", \"Gb\"), (\"G#\", \"Ab\")]\n\n\nm = dict(alternatives + [(b, a) for a, b in alternatives])\n\ni = 1\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    key, tone = s.split()\n    if key in m:\n        print(f\"Case {i}: {m[key]} {tone}\")\n    else:\n        print(f\"Case {i}: UNIQUE\")\n\n    i += 1\n
"},{"location":"solutions/#cinema-crowds","title":"Cinema Crowds","text":"Solution in Python Python 
n, m = [int(v) for v in input().split()]\n\nsize = [int(v) for v in input().split()]\n\ngroups_admitted = 0\n\nfor i in range(m):\n    if size[i] <= n:\n        n -= size[i]\n        groups_admitted += 1\n\nprint(m - groups_admitted)\n
"},{"location":"solutions/#cinema-crowds-2","title":"Cinema Crowds 2","text":"Solution in Python Python 
n, m = [int(t) for t in input().split()]\np = [int(t) for t in input().split()]\n\nd = 0\nl = 0\nfor i in range(m):\n    if p[i] > n - d:\n        break\n    else:\n        k = p[i]\n        d += k\n        l += 1\n\nprint(m - l)\n
"},{"location":"solutions/#class-field-trip","title":"Class Field Trip","text":"Solution in Python Python 
a = input()\nb = input()\n\ni, j = 0, 0\nans = []\nwhile i < len(a) and j < len(b):\n    if a[i] < b[j]:\n        ans.append(a[i])\n        i += 1\n    else:\n        ans.append(b[j])\n        j += 1\n\n\nans += a[i:] if i < len(a) else b[j:]\n\nprint(\"\".join(ans))\n
"},{"location":"solutions/#a-furious-cocktail","title":"A Furious Cocktail","text":"Solution in Python Python 
n, t = [int(d) for d in input().split()]\np = [int(input()) for _ in range(n)]\np = sorted(p, reverse=True)\nending = p[0]\nable = True\nfor i in range(1, n):\n    if t * i >= ending:\n        print(\"NO\")\n        able = False\n        break\n    if t * i + p[i] < ending:\n        ending = t * i + p[i]\nif able:\n    print(\"YES\")\n
"},{"location":"solutions/#code-cleanups","title":"Code Cleanups","text":"Solution in Python Python 
n = int(input())\np = [int(d) for d in input().split()]\nprev = []\nt = 0\nfor v in p:\n    if not prev:\n        prev.append(v)\n        continue\n    d = (19 + sum(prev)) // len(prev)\n    if v <= d:\n        prev.append(v)\n    else:\n        prev = [v]\n        t += 1\nif prev:\n    t += 1\nprint(t)\n
"},{"location":"solutions/#code-to-save-lives","title":"Code to Save Lives","text":"Solution in Python Python 
t = int(input())\nfor _ in range(t):\n    a = int(input().replace(\" \", \"\"))\n    b = int(input().replace(\" \", \"\"))\n    print(\" \".join(str(a + b)))\n
"},{"location":"solutions/#coffee-cup-combo","title":"Coffee Cup Combo","text":"Solution in Python Python 
n = int(input())\nawake = [0] * n\ns = list(input())\nfor i in range(n):\n    if s[i] == \"1\":\n        awake[i] = 1\n        if i + 1 < n:\n            awake[i + 1] = 1\n        if i + 2 < n:\n            awake[i + 2] = 1\nprint(sum(awake))\n
"},{"location":"solutions/#cold-puter-science","title":"Cold-puter Science","text":"Solution in Python Python 
_ = input()\nprint(len([t for t in input().split() if \"-\" in t]))\n
"},{"location":"solutions/#competitive-arcade-basketball","title":"Competitive Arcade Basketball","text":"Solution in Python Python 
from collections import Counter\n\nn, p, m = [int(d) for d in input().split()]\n\nrecords = Counter()\nwinners = []\nnames = [input() for _ in range(n)]\nfor r in range(m):\n    name, point = input().split()\n    point = int(point)\n    records[name] += point\n    if records[name] >= p and name not in winners:\n        winners.append(name)\nif not winners:\n    print(\"No winner!\")\nelse:\n    print(\"\\n\".join([f\"{n} wins!\" for n in winners]))\n
"},{"location":"solutions/#completing-the-square","title":"Completing the Square","text":"Solution in Python Python 
x1, y1 = [int(d) for d in input().split()]\nx2, y2 = [int(d) for d in input().split()]\nx3, y3 = [int(d) for d in input().split()]\n\nd12 = (x1 - x2) ** 2 + (y1 - y2) ** 2\nd13 = (x1 - x3) ** 2 + (y1 - y3) ** 2\nd23 = (x2 - x3) ** 2 + (y2 - y3) ** 2\n\nif d12 == d13:\n    x, y = x2 + x3 - x1, y2 + y3 - y1\nelif d12 == d23:\n    x, y = x1 + x3 - x2, y1 + y3 - y2\nelse:\n    x, y = x1 + x2 - x3, y1 + y2 - y3\n\nprint(x, y)\n
"},{"location":"solutions/#compound-words","title":"Compound Words","text":"Solution in Python Python 
from itertools import permutations\n\nl = []\nwhile True:\n    try:\n        l.extend(input().split())\n    except:\n        break\n\nw = set()\nfor i, j in permutations(l, 2):\n    w.add(f\"{i}{j}\")\n\n\nprint(\"\\n\".join(sorted(w)))\n
"},{"location":"solutions/#conformity","title":"Conformity","text":"Solution in Python Python 
from collections import Counter\n\nn = int(input())\nentries = []\nfor _ in range(n):\n    entries.append(\" \".join(sorted(input().split())))\n\nsummary = Counter(entries)\npopular = max(summary.values())\n\nprint(sum([summary[e] for e in summary if summary[e] == popular]))\n
"},{"location":"solutions/#contingency-planning","title":"Contingency Planning","text":"Solution in Python Python 
def permutations(n, c):\n    value = 1\n    for i in range(n - c + 1, n + 1):\n        value *= i\n    return value\n\n\nn = int(input())\nans = 0\nfor i in range(1, n + 1):\n    ans += permutations(n, i)\nif ans > 1_000_000_000:\n    print(\"JUST RUN!!\")\nelse:\n    print(ans)\n
"},{"location":"solutions/#cryptographers-conundrum","title":"Cryptographer's Conundrum","text":"Solution in Python Python 
text = input()\ntotal = 0\nfor i in range(0, len(text), 3):\n    if text[i] != \"P\":\n        total += 1\n    if text[i + 1] != \"E\":\n        total += 1\n    if text[i + 2] != \"R\":\n        total += 1\nprint(total)\n
"},{"location":"solutions/#convex-polygon-area","title":"Convex Polygon Area","text":"Solution in Python Python 
for _ in range(int(input())):\n    values = [int(d) for d in input().split()]\n    coords = values[1:]\n    n = values[0]\n\n    coords.append(coords[0])\n    coords.append(coords[1])\n\n    area = 0\n    for i in range(0, 2 * n, 2):\n        x1, y1 = coords[i], coords[i + 1]\n        x2, y2 = coords[i + 2], coords[i + 3]\n        area += x1 * y2 - x2 * y1\n\n    print(0.5 * abs(area))\n
"},{"location":"solutions/#cooking-water","title":"Cooking Water","text":"Solution in Python Python 
n = int(input())\nlb, ub = 0, 1000\nfor _ in range(n):\n    a, b = [int(d) for d in input().split()]\n    lb = max(lb, a)\n    ub = min(ub, b)\n\nif lb > ub:\n    print(\"edward is right\")\nelse:\n    print(\"gunilla has a point\")\n
"},{"location":"solutions/#cosmic-path-optimization","title":"Cosmic Path Optimization","text":"Solution in Python Python 
import math\n\nm = int(input())\nt = [int(d) for d in input().split()]\nprint(f\"{math.floor(sum(t)/m)}\")\n
"},{"location":"solutions/#costume-contest","title":"Costume Contest","text":"Solution in Python Python 
from collections import Counter\n\nn = int(input())\nc = Counter()\nfor _ in range(n):\n    c[input()] += 1\nprint(\"\\n\".join(sorted([k for k, v in c.items() if v == min(c.values())])))\n
"},{"location":"solutions/#count-doubles","title":"Count Doubles","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\nvalues = [int(d) for d in input().split()]\nans = 0\nfor i in range(n - m + 1):\n    if len([v for v in values[i : i + m] if not v % 2]) >= 2:\n        ans += 1\nprint(ans)\n
"},{"location":"solutions/#counting-clauses","title":"Counting Clauses","text":"Solution in Python Python 
m, _ = [int(d) for d in input().split()]\nfor _ in range(m):\n    input()\nif m >= 8:\n    print(\"satisfactory\")\nelse:\n    print(\"unsatisfactory\")\n
"},{"location":"solutions/#count-the-vowels","title":"Count the Vowels","text":"Solution in Python Python 
print(len([c for c in input().lower() if c in \"aeiou\"]))\n
"},{"location":"solutions/#course-scheduling","title":"Course Scheduling","text":"Solution in Python Python 
from collections import Counter\n\nc = Counter()\nn = {}\n\nfor _ in range(int(input())):\n    r = input().split()\n    name, course = \" \".join(r[:2]), r[-1]\n    if course not in n:\n        n[course] = set()\n\n    if name not in n[course]:\n        c[course] += 1\n        n[course].add(name)\n\nfor k in sorted(c.keys()):\n    print(f\"{k} {c[k]}\")\n
"},{"location":"solutions/#cpr-number","title":"CPR Number","text":"Solution in Python Python 
cpr = input().replace(\"-\", \"\")\nvalues = [4, 3, 2, 7, 6, 5, 4, 3, 2, 1]\ntotal = 0\nfor d, v in zip(cpr, values):\n    total += int(d) * v\nif not total % 11:\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#crne","title":"Crne","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n)\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    a := n / 2\n    b := n - a\n    fmt.Println((a + 1) * (b + 1))\n}\n
n = int(input())\na = n // 2\nb = n - a\nprint((a + 1) * (b + 1))\n
"},{"location":"solutions/#cudoviste","title":"Cudoviste","text":"Solution in Python Python 
r, c = [int(d) for d in input().split()]\nparking = []\nfor _ in range(r):\n    parking.append(input())\n\n\ndef count_spaces(parking, squash):\n    total = 0\n    for i in range(r - 1):\n        for j in range(c - 1):\n            spaces = [\n                parking[i][j],\n                parking[i + 1][j],\n                parking[i][j + 1],\n                parking[i + 1][j + 1],\n            ]\n            if (\n                all(s in \".X\" for s in spaces)\n                and sum([s == \"X\" for s in spaces]) == squash\n            ):\n                total += 1\n    return total\n\n\nfor num in range(0, 5):\n    print(count_spaces(parking, num))\n
"},{"location":"solutions/#stacking-cups","title":"Stacking Cups","text":"Solution in Python Python 
size = {}\nfor _ in range(int(input())):\n    parts = input().split()\n    if parts[0].isdigit():\n        size[parts[1]] = int(parts[0]) / 2\n    else:\n        size[parts[0]] = int(parts[1])\nfor color in sorted(size, key=lambda x: size[x]):\n    print(color)\n
"},{"location":"solutions/#cut-in-line","title":"Cut in Line","text":"Solution in Python Python 
n = int(input())\nqueue = []\nfor _ in range(n):\n    queue.append(input())\n\nc = int(input())\nfor _ in range(c):\n    event = input().split()\n    if event[0] == \"leave\":\n        queue.remove(event[1])\n    elif event[0] == \"cut\":\n        queue.insert(queue.index(event[2]), event[1])\n\nfor name in queue:\n    print(name)\n
"},{"location":"solutions/#cut-the-negativity","title":"Cut the Negativity","text":"Solution in Python Python 
n = int(input())\n\npositives = []\nfor i in range(n):\n    numbers = [int(d) for d in input().split()]\n    for j in range(n):\n        if numbers[j] > 0:\n            positives.append((str(i + 1), str(j + 1), str(numbers[j])))\n\nprint(len(positives))\nfor p in positives:\n    print(\" \".join(p))\n
"},{"location":"solutions/#cyanide-rivers","title":"Cyanide Rivers","text":"Solution in Python Python 
import math\n\ns = input()\nt = s.split(\"1\")\nprint(max([math.ceil(len(z) / 2) for z in t]))\n
"},{"location":"solutions/#cypher-decypher","title":"Cypher Decypher","text":"Solution in Python Python 
from string import ascii_uppercase\n\n\ndef f(n, m):\n    return ascii_uppercase[(n * m) % 26]\n\n\nm = input()\nfor _ in range(int(input())):\n    s = input()\n    print(\"\".join([f(ascii_uppercase.index(c), int(d)) for c, d in zip(s, m)]))\n
"},{"location":"solutions/#damaged-equation","title":"Damaged Equation","text":"Solution in Python Python 
from itertools import product\n\na, b, c, d = [int(d) for d in input().split()]\nops = [\"*\", \"+\", \"-\", \"//\"]\nvalid = False\nfor op1, op2 in product(ops, ops):\n    e = f\"{a} {op1} {b} == {c} {op2} {d}\"\n    try:\n        if eval(e):\n            print(e.replace(\"==\", \"=\").replace(\"//\", \"/\"))\n            valid = True\n    except:\n        pass\nif not valid:\n    print(\"problems ahead\")\n
"},{"location":"solutions/#datum","title":"Datum","text":"Solution in Python Python 
from datetime import datetime\n\nd, m = [int(d) for d in input().split()]\nprint(datetime(year=2009, month=m, day=d).strftime(\"%A\"))\n
"},{"location":"solutions/#death-knight-hero","title":"Death Knight Hero","text":"Solution in Python Python 
total = 0\nfor _ in range(int(input())):\n    if \"CD\" not in input():\n        total += 1\nprint(total)\n
"},{"location":"solutions/#delimiter-soup","title":"Delimiter Soup","text":"Solution in Python Python 
n = int(input())\ns = input()\n\nstack = []\n\nvalid = True\n\nfor i in range(n):\n    c = s[i]\n    if c in [\"(\", \"[\", \"{\"]:\n        stack.append(c)\n    if c in [\")\", \"]\", \"}\"]:\n        if len(stack) == 0:\n            valid = False\n            break\n\n        v = stack.pop()\n        if c == \")\" and v != \"(\":\n            valid = False\n            break\n        elif c == \"]\" and v != \"[\":\n            valid = False\n            break\n        elif c == \"}\" and v != \"{\":\n            valid = False\n            break\n\nif valid:\n    print(\"ok so far\")\nelse:\n    print(c, i)\n
"},{"location":"solutions/#detailed-differences","title":"Detailed Differences","text":"Solution in Python Python 
for _ in range(int(input())):\n    s1, s2 = input(), input()\n    result = [\".\" if c1 == c2 else \"*\" for c1, c2 in zip(s1, s2)]\n    print(s1)\n    print(s2)\n    print(\"\".join(result))\n
"},{"location":"solutions/#dice-cup","title":"Dice Cup","text":"Solution in Python Python 
d1, d2 = [int(d) for d in input().split()]\n\nsums = []\nfor i in range(1, d1 + 1):\n    for j in range(1, d2 + 1):\n        sums.append(i + j)\n\nfrom collections import Counter\n\nc = Counter(sums)\nmost_likely = max(c.values())\nfor key in sorted(c.keys()):\n    if c[key] == most_likely:\n        print(key)\n
"},{"location":"solutions/#dice-game","title":"Dice Game","text":"Solution in Python Python 
g = [int(d) for d in input().split()]\ne = [int(d) for d in input().split()]\n\n\ndef ev(d):\n    total, count = 0, 0\n    for i in range(d[0], d[1] + 1):\n        for j in range(d[2], d[3] + 1):\n            total += i + j\n            count += 1\n    return total / count\n\n\nratio = ev(g) / ev(e)\nif ratio > 1:\n    print(\"Gunnar\")\nelif ratio < 1:\n    print(\"Emma\")\nelse:\n    print(\"Tie\")\n
"},{"location":"solutions/#a-different-problem","title":"A Different Problem","text":"Solution in Python Python 
while True:\n    try:\n        line = input()\n    except:\n        break\n    a, b = [int(d) for d in line.split()]\n    print(abs(a - b))\n
"},{"location":"solutions/#different-distances","title":"Different Distances","text":"Solution in Python Python 
while True:\n    line = input()\n    if line == \"0\":\n        break\n    x1, y1, x2, y2, p = [float(d) for d in line.split()]\n    print((abs(x1 - x2) ** p + abs(y1 - y2) ** p) ** (1 / p))\n
"},{"location":"solutions/#digit-swap","title":"Digit Swap","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport (\n    \"fmt\"\n)\n\nfunc reverse(str string) (ans string) {\n    for _, v := range str {\n        ans = string(v) + ans\n    }\n    return\n}\nfunc main() {\n    var str string\n    fmt.Scan(&str)\n    fmt.Println(reverse(str))\n}\n
import java.util.*;\n\nclass DigitSwap {\n    public static void main(String[] argv){\n        Scanner s = new Scanner(System.in);\n        StringBuilder ans = new StringBuilder();\n        ans.append(s.nextLine());\n        ans.reverse();\n        System.out.println(ans);\n    }\n}\n
print(input()[::-1])\n
"},{"location":"solutions/#disc-district","title":"Disc District","text":"Solution in Python Python 
print(1, input())\n
"},{"location":"solutions/#divvying-up","title":"Divvying Up","text":"Solution in Python Python 
_ = input()\np = [int(d) for d in input().split()]\nif sum(p) % 3:\n    print(\"no\")\nelse:\n    print(\"yes\")\n
"},{"location":"solutions/#dont-fall-down-stairs","title":"Don't Fall Down Stairs","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()] + [0]\nprint(sum(max(a[i] - a[i + 1] - 1, 0) for i in range(n)))\n
"},{"location":"solutions/#double-password","title":"Double Password","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass DoublePassword {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String a = s.nextLine();\n        String b = s.nextLine();\n        int number = 1;\n        for (int i = 0; i < a.length(); i++) {\n            if (a.charAt(i) == b.charAt(i)) {\n                number *= 1;\n            } else {\n                number *= 2;\n            }\n        }\n        System.out.println(number);\n\n    }\n}\n
a, b = input(), input()\nnumber = 1\nfor c1, c2 in zip(a, b):\n    if c1 == c2:\n        number *= 1\n    else:\n        number *= 2\nprint(number)\n
"},{"location":"solutions/#drinking-song","title":"Drinking Song","text":"Solution in Python Python 
n = int(input())\nw = input()\n\nfor i in range(n):\n    a = f\"{n-i} bottle{'s' if n-i >1 else ''}\"\n    b = f\"{'no more' if n-i-1==0 else n-i-1 } bottle{'' if n-i-1==1 else 's'}\"\n    c = f\"{'one' if n-i>1 else 'it' }\"\n    d = f\"{' on the wall' if n-i-1 else ''}\"\n    print(f\"{a} of {w} on the wall, {a} of {w}.\")\n    print(f\"Take {c} down, pass it around, {b} of {w}{d}.\")\n    if n - i - 1:\n        print()\n
"},{"location":"solutions/#drivers-dilemma","title":"Driver's Dilemma","text":"Solution in Python Python 
c, x, m = [float(d) for d in input().split()]\ntop = 0\nfor _ in range(6):\n    mph, mpg = [float(d) for d in input().split()]\n\n    if m / mph * x + m / mpg <= c / 2:\n        top = mph\nif top:\n    print(f\"YES {top:.0f}\")\nelse:\n    print(\"NO\")\n
"},{"location":"solutions/#drm-messages","title":"DRM Messages","text":"Solution in Python Python 
l = ord(\"A\")\nr = ord(\"Z\")\n\n\ndef divide(message):\n    half = len(message) // 2\n    return message[:half], message[half:]\n\n\ndef to_ord(c, rotation):\n    new_chr = ord(c) + rotation\n    return new_chr if new_chr <= r else l + (new_chr - r - 1)\n\n\ndef rotate(half):\n    rotation = sum([ord(c) - l for c in half])\n    rotation %= 26\n    result = [to_ord(c, rotation) for c in half]\n    return \"\".join([chr(c) for c in result])\n\n\ndef merge(first, second):\n    rotations = [ord(c) - l for c in second]\n    result = [to_ord(c, rotation) for c, rotation in zip(first, rotations)]\n    return \"\".join([chr(c) for c in result])\n\n\nmessage = input()\nfirst, second = divide(message)\nprint(merge(rotate(first), rotate(second)))\n
"},{"location":"solutions/#drunk-vigenere","title":"Drunk Vigen\u00e8re","text":"Solution in Python Python 
import string\n\nuppers = string.ascii_uppercase\n\n\ndef unshift(c, k, f):\n    index = uppers.index(k)\n    if f:\n        new_index = uppers.index(c) + index\n    else:\n        new_index = uppers.index(c) - index\n    return uppers[new_index % 26]\n\n\nmessage, key = input(), input()\nprint(\"\".join([unshift(c, k, i % 2) for i, (c, k) in enumerate(zip(message, key))]))\n
"},{"location":"solutions/#early-winter","title":"Early Winter","text":"Solution in Python Python 
n, m = [int(_) for _ in input().split()]\nd = [int(_) for _ in input().split()]\nd = [v > m for v in d]\n\n\nfor k in range(n):\n    if not d[k]:\n        break\n\nif all(d):\n    print(\"It had never snowed this early!\")\nelse:\n    print(f\"It hadn't snowed this early in {k} years!\")\n
"},{"location":"solutions/#the-easiest-problem-is-this-one","title":"The Easiest Problem Is This One","text":"Solution in Python Python 
while True:\n    n = input()\n    if n == \"0\":\n        break\n    s1 = sum([int(d) for d in n])\n\n    n = int(n)\n    p = 11\n    while True:\n        s2 = sum([int(d) for d in str(n * p)])\n        if s2 == s1:\n            break\n        p += 1\n\n    print(p)\n
"},{"location":"solutions/#echo-echo-echo","title":"Echo Echo Echo","text":"Solution in Python Python 
word = input().strip()\nprint(\" \".join([word] * 3))\n
"},{"location":"solutions/#egypt","title":"Egypt","text":"Solution in Python Python 
while True:\n    sides = sorted([int(d) for d in input().split()])\n    if not all(sides):\n        break\n    if sides[0] ** 2 + sides[1] ** 2 == sides[2] ** 2:\n        print(\"right\")\n    else:\n        print(\"wrong\")\n
"},{"location":"solutions/#ekki-daui-opna-inni","title":"Ekki dau\u00f0i opna inni","text":"Solution in Python Python 
l = []\nwhile True:\n    try:\n        l.append(input().split(\"|\"))\n    except:\n        break\n\nl = [l[i][0] for i in range(len(l))] + [\" \"] + [l[i][1] for i in range(len(l))]\nprint(\"\".join(l))\n
"},{"location":"solutions/#election-paradox","title":"Election Paradox","text":"Solution in Python Python 
n = int(input())\np = [int(d) for d in input().split()]\np = sorted(p)\nt = 0\nfor i in range(0, n // 2 + 1):\n    t += p[i] // 2\nfor i in range(n // 2 + 1, n):\n    t += p[i]\nprint(t)\n
"},{"location":"solutions/#electrical-outlets","title":"Electrical Outlets","text":"Solution in Python Python 
for _ in range(int(input())):\n    print(sum([int(d) - 1 for d in input().split()[1:]]) + 1)\n
"},{"location":"solutions/#eligibility","title":"Eligibility","text":"Solution in Python Python 
for _ in range(int(input())):\n    name, pss, dob, courses = input().split()\n    courses = int(courses)\n    pss = [int(d) for d in pss.split(\"/\")]\n    dob = [int(d) for d in dob.split(\"/\")]\n    if pss[0] >= 2010 or dob[0] >= 1991:\n        print(name, \"eligible\")\n    elif courses > 40:\n        print(name, \"ineligible\")\n    else:\n        print(name, \"coach petitions\")\n
"},{"location":"solutions/#encoded-message","title":"Encoded Message","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    message = input()\n    size = int(math.sqrt(len(message)))\n    m = []\n    for i in range(size):\n        m.append(message[i * size : (i + 1) * size])\n\n    ans = []\n    for i in range(size - 1, -1, -1):\n        for j in range(size):\n            ans.append(m[j][i])\n    print(\"\".join(ans))\n
"},{"location":"solutions/#endurvinnsla","title":"Endurvinnsla","text":"Solution in Python Python 
_ = input()\np = float(input())\nn = int(input())\nitems = [input() == \"ekki plast\" for _ in range(n)]\nprint(\"Jebb\" if sum(items) <= p * n else \"Neibb\")\n
"},{"location":"solutions/#engineering-english","title":"Engineering English","text":"Solution in Python Python 
seen = set()\n\nwhile True:\n    try:\n        s = input().split()\n    except:\n        break\n    d = []\n    for t in s:\n        if t.lower() not in seen:\n            seen.add(t.lower())\n        else:\n            t = \".\"\n        d.append(t)\n    print(\" \".join(d))\n
"},{"location":"solutions/#erase-securely","title":"Erase Securely","text":"Solution in Python Python 
n = int(input())\na, b = input(), input()\nif n % 2:\n    print(\n        \"Deletion\", \"failed\" if not all([i != j for i, j in zip(a, b)]) else \"succeeded\"\n    )\nelse:\n    print(\n        \"Deletion\", \"failed\" if not all([i == j for i, j in zip(a, b)]) else \"succeeded\"\n    )\n
"},{"location":"solutions/#espresso","title":"Espresso!","text":"Solution in Python Python 
n, s = [int(d) for d in input().split()]\nrefill = 0\ntank = s\nfor _ in range(n):\n    o = input()\n    if \"L\" in o:\n        w = int(o[:-1]) + 1\n    else:\n        w = int(o)\n    if tank - w < 0:\n        refill += 1\n        tank = s\n\n    tank -= w\nprint(refill)\n
"},{"location":"solutions/#estimating-the-area-of-a-circle","title":"Estimating the Area of a Circle","text":"Solution in Python Python 
import math\n\nwhile True:\n    r, m, c = input().split()\n    if r == \"0\" and m == \"0\" and c == \"0\":\n        break\n    r = float(r)\n    m, c = int(m), int(c)\n    print(math.pi * r * r, 4 * r * r * c / m)\n
"},{"location":"solutions/#evening-out-1","title":"Evening Out 1","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\nc = a % b\nprint(min(c, b - c))\n
"},{"location":"solutions/#event-planning","title":"Event Planning","text":"Solution in Python Python 
n, b, h, w = [int(d) for d in input().split()]\n\ncosts = []\nfor _ in range(h):\n    p = int(input())\n    a = [int(d) for d in input().split()]\n    if not any([_a >= n for _a in a]):\n        costs.append(None)\n        continue\n    c = p * n\n    if c > b:\n        c = None\n    costs.append(c)\n\ncosts = [c for c in costs if c]\nif not costs:\n    print(\"stay home\")\nelse:\n    print(min(costs))\n
"},{"location":"solutions/#ive-been-everywhere-man","title":"I've Been Everywhere, Man","text":"Solution in Python Python 
cities = {}\nfor i in range(int(input())):\n    cities[i] = set()\n    for _ in range(int(input())):\n        cities[i].add(input())\n\nprint(\"\\n\".join([str(len(s)) for s in cities.values()]))\n
"},{"location":"solutions/#exactly-electrical","title":"Exactly Electrical","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\nc, d = [int(d) for d in input().split()]\nt = int(input())\nm = abs(a - c) + abs(b - d)\nprint(\"Y\" if m <= t and (m - t) % 2 == 0 else \"N\")\n
"},{"location":"solutions/#exam","title":"Exam","text":"Solution in Python Python 
k = int(input())\ny = input()\nf = input()\nsame, different = 0, 0\nfor a, b in zip(y, f):\n    if a == b:\n        same += 1\n    else:\n        different += 1\nprint(min(same, k) + min(different, (len(y) - k)))\n
"},{"location":"solutions/#expected-earnings","title":"Expected Earnings","text":"Solution in Python Python 
n, k, p = input().split()\nn = int(n)\nk = int(k)\np = float(p)\nev = n * p - k\nif ev < 0:\n    print(\"spela\")\nelse:\n    print(\"spela inte!\")\n
"},{"location":"solutions/#eye-of-sauron","title":"Eye of Sauron","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var drawing string\n    fmt.Scan(&drawing)\n    parts := strings.Split(drawing, \"()\")\n    left, right := parts[0], parts[1]\n    if left == right {\n        fmt.Println(\"correct\")\n    } else {\n        fmt.Println(\"fix\")\n    }\n}\n
drawing = input()\nleft, right = drawing.split(\"()\")\nif left == right:\n    print(\"correct\")\nelse:\n    print(\"fix\")\n
"},{"location":"solutions/#fading-wind","title":"Fading Wind","text":"Solution in Python Python 
h, k, v, s = [int(d) for d in input().split()]\nt = 0\nwhile h > 0:\n    v += s\n    v -= max(1, v // 10)\n    if v >= k:\n        h += 1\n    elif v > 0:\n        h -= 1\n        if not h:\n            v = 0\n    else:\n        h = 0\n        v = 0\n    t += v\n    if s > 0:\n        s -= 1\nprint(t)\n
"},{"location":"solutions/#faktor","title":"Faktor","text":"Solution in Python Python 
a, i = [int(d) for d in input().split()]\nprint(a * (i - 1) + 1)\n
"},{"location":"solutions/#falling-apart","title":"Falling Apart","text":"Solution in Python Python 
n = int(input())\na = sorted([int(d) for d in input().split()], reverse=True)\nprint(\n    sum([a[i] for i in range(0, n, 2)]),\n    sum([a[i] for i in range(1, n, 2)]),\n)\n
"},{"location":"solutions/#false-sense-of-security","title":"False Sense of Security","text":"Solution in Python Python 
encoding = {\n    \"A\": \".-\",\n    \"B\": \"-...\",\n    \"C\": \"-.-.\",\n    \"D\": \"-..\",\n    \"E\": \".\",\n    \"F\": \"..-.\",\n    \"G\": \"--.\",\n    \"H\": \"....\",\n    \"I\": \"..\",\n    \"J\": \".---\",\n    \"K\": \"-.-\",\n    \"L\": \".-..\",\n    \"M\": \"--\",\n    \"N\": \"-.\",\n    \"O\": \"---\",\n    \"P\": \".--.\",\n    \"Q\": \"--.-\",\n    \"R\": \".-.\",\n    \"S\": \"...\",\n    \"T\": \"-\",\n    \"U\": \"..-\",\n    \"V\": \"...-\",\n    \"W\": \".--\",\n    \"X\": \"-..-\",\n    \"Y\": \"-.--\",\n    \"Z\": \"--..\",\n    \"_\": \"..--\",\n    \",\": \".-.-\",\n    \".\": \"---.\",\n    \"?\": \"----\",\n}\n\ndecoding = dict([(v, k) for k, v in encoding.items()])\n\nwhile True:\n    try:\n        encoded = input()\n    except:\n        break\n    length = [len(encoding[c]) for c in encoded]\n    morse = \"\".join([encoding[c] for c in encoded])\n\n    ans, s = \"\", 0\n    for i in reversed(length):\n        ans += decoding[morse[s : s + i]]\n        s += i\n    print(ans)\n
"},{"location":"solutions/#fast-food-prizes","title":"Fast Food Prizes","text":"Solution in Python Python 
for _ in range(int(input())):\n    n, m = [int(d) for d in input().split()]\n    r = []\n    for _ in range(n):\n        s = input().split()\n        p = int(s[-1])\n        k = [int(d) for d in s[1:-1]]\n        r.append((k, p))\n    s = [int(d) for d in input().split()]\n\n    ans = 0\n    for t, p in r:\n        c = min([s[d - 1] for d in t])\n        ans += p * c\n\n    print(ans)\n
"},{"location":"solutions/#fbi-universal-control-numbers","title":"FBI Universal Control Numbers","text":"Solution in Python Python 
m = {\n    \"0\": 0,\n    \"1\": 1,\n    \"2\": 2,\n    \"3\": 3,\n    \"4\": 4,\n    \"5\": 5,\n    \"6\": 6,\n    \"7\": 7,\n    \"8\": 8,\n    \"9\": 9,\n    \"A\": 10,\n    \"B\": 8,\n    \"C\": 11,\n    \"D\": 12,\n    \"E\": 13,\n    \"F\": 14,\n    \"G\": 11,\n    \"H\": 15,\n    \"I\": 1,\n    \"J\": 16,\n    \"K\": 17,\n    \"L\": 18,\n    \"M\": 19,\n    \"N\": 20,\n    \"O\": 0,\n    \"P\": 21,\n    \"Q\": 0,\n    \"R\": 22,\n    \"S\": 5,\n    \"T\": 23,\n    \"U\": 24,\n    \"V\": 24,\n    \"W\": 25,\n    \"X\": 26,\n    \"Y\": 24,\n    \"Z\": 2,\n}\nw = [2, 4, 5, 7, 8, 10, 11, 13]\n\nfor _ in range(int(input())):\n    i, d = input().split()\n    t = sum([m[b] * a for a, b in zip(w, d)])\n    if t % 27 == m[d[-1]]:\n        s = sum([m[b] * 27**a for a, b in zip(range(8), d[:8][::-1])])\n        print(f\"{i} {s}\")\n    else:\n        print(f\"{i} Invalid\")\n
"},{"location":"solutions/#framtiar-fifa","title":"Framt\u00ed\u00f0ar FIFA","text":"Solution in Python Python 
n = int(input())\nm = int(input())\nprint(2022 + n // m)\n
"},{"location":"solutions/#fifty-shades-of-pink","title":"Fifty Shades of Pink","text":"Solution in Python Python 
total = 0\nfor _ in range(int(input())):\n    button = input().lower()\n    if \"pink\" in button or \"rose\" in button:\n        total += 1\nif not total:\n    print(\"I must watch Star Wars with my daughter\")\nelse:\n    print(total)\n
"},{"location":"solutions/#filip","title":"Filip","text":"Solution in Python Python 
a, b = input().split()\na, b = a[::-1], b[::-1]\nif a > b:\n    print(a)\nelse:\n    print(b)\n
"},{"location":"solutions/#final-exam","title":"Final Exam","text":"Solution in Python Python 
n = int(input())\nans, score = [], 0\nfor i in range(n):\n    ans.append(input())\n    if i == 0:\n        continue\n    if ans[i] == ans[i - 1]:\n        score += 1\nprint(score)\n
"},{"location":"solutions/#finding-an-a","title":"Finding An A","text":"Solutions in 3 languages C++GoPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    string a;\n    cin >> a;\n\n    int found = a.find_first_of(\"a\");\n\n    cout << a.substr(found);\n\n    return 0;\n}\n
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scan(&s)\n    index := strings.Index(s, \"a\")\n    fmt.Println(s[index:])\n}\n
word = input()\nprint(word[word.find(\"a\") :])\n
"},{"location":"solutions/#fizzbuzz","title":"FizzBuzz","text":"Solution in Python Python 
x, y, n = [int(d) for d in input().split()]\nfor i in range(1, n + 1):\n    ans = \"\"\n    if not i % x:\n        ans += \"Fizz\"\n    if not i % y:\n        ans += \"Buzz\"\n    if not ans:\n        ans = i\n    print(ans)\n
"},{"location":"solutions/#flexible-spaces","title":"Flexible Spaces","text":"Solution in Python Python 
w, p = [int(d) for d in input().split()]\nl = [int(d) for d in input().split()]\nl = [0] + l + [w]\nc = set()\nfor i in range(p + 1):\n    for j in range(i + 1, p + 2):\n        c.add(l[j] - l[i])\nprint(\" \".join([str(d) for d in sorted(c)]))\n
"},{"location":"solutions/#birthday-memorization","title":"Birthday Memorization","text":"Solution in Python Python 
n = int(input())\nrecords = {}\nfor _ in range(n):\n    s, c, date = input().split()\n    c = int(c)\n    date = \"\".join(date.split(\"/\")[::-1])\n    if date not in records:\n        records[date] = (s, c)\n    else:\n        _, _c = records[date]\n        if c > _c:\n            records[date] = (s, c)\nprint(len(records.keys()))\nordered_keys = sorted(records, key=lambda k: records[k][0])\nfor key in ordered_keys:\n    print(records[key][0])\n
"},{"location":"solutions/#forced-choice","title":"Forced Choice","text":"Solution in Python Python 
_, p, s = input().split()\nfor _ in range(int(s)):\n    if p in input().split()[1:]:\n        print(\"KEEP\")\n    else:\n        print(\"REMOVE\")\n
"},{"location":"solutions/#free-food","title":"Free Food","text":"Solution in Python Python 
n = int(input())\ndays = set()\nfor _ in range(n):\n    start, end = [int(d) for d in input().split()]\n    days.update(range(start, end + 1))\nprint(len(days))\n
"},{"location":"solutions/#from-a-to-b","title":"From A to B","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\n\nif a <= b:\n    print(b - a)\nelse:\n    total = 0\n    while a > b:\n        if a % 2:\n            a += 1\n            total += 1\n        a /= 2\n        total += 1\n    total += b - a\n    print(int(total))\n
"},{"location":"solutions/#fyi","title":"FYI","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scan(&s)\n    if strings.HasPrefix(s, \"555\") {\n        fmt.Println(1)\n    } else {\n        fmt.Println(0)\n    }\n}\n
if input().startswith(\"555\"):\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#gandalfs-spell","title":"Gandalf's Spell","text":"Solution in Python Python 
c = list(input())\ns = input().split()\nif len(c) != len(s):\n    print(\"False\")\nelse:\n    d, valid = {}, True\n    for a, b in zip(c, s):\n        if a not in d:\n            d[a] = b\n        else:\n            if d[a] != b:\n                print(\"False\")\n                valid = False\n                break\n    if valid:\n        if len(set(d.keys())) == len(set(d.values())):\n            print(\"True\")\n        else:\n            print(\"False\")\n
"},{"location":"solutions/#gcd","title":"GCD","text":"Solution in Python Python 
import math\n\na, b = [int(d) for d in input().split()]\n\nprint(math.gcd(a, b))\n
"},{"location":"solutions/#gcvwr","title":"GCVWR","text":"Solution in Python Python 
g, t, n = [int(d) for d in input().split()]\ncapacity = (g - t) * 0.9\nitems = sum([int(d) for d in input().split()])\nprint(int(capacity - items))\n
"},{"location":"solutions/#gene-block","title":"Gene Block","text":"Solution in Python Python 
mapping = {\n    1: 3,\n    2: 6,\n    3: 9,\n    4: 2,\n    5: 5,\n    6: 8,\n    7: 1,\n    8: 4,\n    9: 7,\n    0: 10,\n}\n\nfor _ in range(int(input())):\n    n = int(input())\n    d = n % 10\n\n    if n >= 7 * mapping[d]:\n        print(mapping[d])\n    else:\n        print(-1)\n
"},{"location":"solutions/#gerrymandering","title":"Gerrymandering","text":"Solution in Python Python 
p, _ = [int(d) for d in input().split()]\nvotes = {}\nfor _ in range(p):\n    d, a, b = [int(d) for d in input().split()]\n    if d not in votes:\n        votes[d] = {\"A\": a, \"B\": b}\n    else:\n        votes[d][\"A\"] += a\n        votes[d][\"B\"] += b\n\ntotal_wa, total_wb = 0, 0\nfor d in sorted(votes):\n    total = votes[d][\"A\"] + votes[d][\"B\"]\n    t = total // 2 + 1\n    winner = \"A\" if votes[d][\"A\"] > votes[d][\"B\"] else \"B\"\n    wa = votes[d][\"A\"] - t if votes[d][\"A\"] > votes[d][\"B\"] else votes[d][\"A\"]\n    wb = votes[d][\"B\"] - t if votes[d][\"B\"] > votes[d][\"A\"] else votes[d][\"B\"]\n    print(winner, wa, wb)\n    total_wa += wa\n    total_wb += wb\nv = sum([sum(ab.values()) for ab in votes.values()])\nprint(abs(total_wa - total_wb) / v)\n
"},{"location":"solutions/#glasses-foggy-moms-spaghetti","title":"Glasses Foggy, Mom's Spaghetti","text":"Solution in Python Python 
import math\n\nd, x, y, h = input().split()\nd = int(d)\nx = int(x)\ny = int(y)\nh = int(h)\n\nangle1 = (math.atan(y / x)) - (math.atan((y - h / 2) / x))\nangle2 = (math.atan((y + h / 2) / x)) - (math.atan(y / x))\n\nd1 = math.tan(angle1) * d\nd2 = math.tan(angle2) * d\n\nprint(d1 + d2)\n
"},{"location":"solutions/#goat-rope","title":"Goat Rope","text":"Solution in Python Python 
x, y, x1, y1, x2, y2 = [int(d) for d in input().split()]\n\nif x >= x1 and x <= x2:\n    print(min(abs(y - y1), abs(y - y2)))\nelif y >= y1 and y <= y2:\n    print(min(abs(x - x1), abs(x - x2)))\nelse:\n    x3, y3 = x1, y2\n    x4, y4 = x2, y1\n    l = [\n        ((x - a) ** 2 + (y - b) ** 2) ** 0.5\n        for a, b in [(x1, y1), (x2, y2), (x1, y2), (x2, y1)]\n    ]\n    print(min(l))\n
"},{"location":"solutions/#goomba-stacks","title":"Goomba Stacks","text":"Solution in Python Python 
n = int(input())\ntotal = 0\nresult = True\nfor _ in range(n):\n    g, b = [int(d) for d in input().split()]\n    total += g\n    if total < b:\n        result = False\nprint(\"possible\" if result else \"impossible\")\n
"},{"location":"solutions/#grading","title":"Grading","text":"Solution in Python Python 
line = input()\nscore = int(input())\na, b, c, d, e = [int(d) for d in line.split()]\nif score >= a:\n    print(\"A\")\nelif score >= b:\n    print(\"B\")\nelif score >= c:\n    print(\"C\")\nelif score >= d:\n    print(\"D\")\nelif score >= e:\n    print(\"E\")\nelse:\n    print(\"F\")\n
"},{"location":"solutions/#grass-seed-inc","title":"Grass Seed Inc.","text":"Solution in Python Python 
c = float(input())\ntotal = 0\nfor _ in range(int(input())):\n    w, l = [float(d) for d in input().split()]\n    total += c * w * l\nprint(f\"{total:.7f}\")\n
"},{"location":"solutions/#greedily-increasing-subsequence","title":"Greedily Increasing Subsequence","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()]\n\ng = [a[0]]\nfor i in range(1, n):\n    v = a[i]\n    if v > g[-1]:\n        g.append(v)\nprint(len(g))\nprint(\" \".join([str(d) for d in g]))\n
"},{"location":"solutions/#greedy-polygons","title":"Greedy Polygons","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    n, l, d, g = [int(d) for d in input().split()]\n    a = n * l * l / (4 * math.tan(math.pi / n))\n    a += n * l * d * g\n    a += math.pi * ((d * g) ** 2)\n    print(a)\n
"},{"location":"solutions/#greetings","title":"Greetings!","text":"Solution in Python Python 
print(input().replace(\"e\", \"ee\"))\n
"},{"location":"solutions/#guess-the-number","title":"Guess the Number","text":"Solution in Python Python 
start, end = 1, 1000\nwhile True:\n    guess = (start + end) // 2\n    print(guess)\n    resp = input()\n    if resp == \"correct\":\n        break\n    elif resp == \"higher\":\n        start = guess + 1\n    else:\n        end = guess\n
"},{"location":"solutions/#watch-out-for-those-hailstones","title":"Watch Out For Those Hailstones!","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n)\n\nfunc h(n int) int {\n    if n == 1 {\n        return 1\n    } else if n%2 == 0 {\n        return n + h(n/2)\n    } else {\n        return n + h(3*n+1)\n    }\n}\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    fmt.Println(h(n))\n}\n
def h(n):\n    if n == 1:\n        return 1\n    else:\n        return n + (h(n // 2) if n % 2 == 0 else h(3 * n + 1))\n\n\nn = int(input())\nprint(h(n))\n
"},{"location":"solutions/#hailstone-sequences","title":"Hailstone Sequences","text":"Solution in Python Python 
n = int(input())\ns = [n]\nwhile True:\n    v = s[-1]\n    if v == 1:\n        break\n    elif v % 2 == 0:\n        s.append(v // 2)\n    else:\n        s.append(3 * v + 1)\nprint(len(s))\n
"},{"location":"solutions/#half-a-cookie","title":"Half a Cookie","text":"Solution in Python Python 
import math\n\nwhile True:\n    try:\n        r, x, y = [float(d) for d in input().split()]\n    except:\n        break\n    if x**2 + y**2 >= r**2:\n        print(\"miss\")\n    else:\n        # https://mathworld.wolfram.com/CircularSegment.html\n        d = math.sqrt(x**2 + y**2)\n        h = r - d\n        a = math.acos((r - h) / r)\n        t = (r - h) * math.sqrt(2 * r * h - h * h)\n        p = (r**2) * a\n        s = p - t\n        print(math.pi * (r**2) - s, s)\n
"},{"location":"solutions/#hangman","title":"Hangman","text":"Solution in Python Python 
word = set(list(input()))\nguess = input()\ntries = 0\ncorrect = 0\nfor c in guess:\n    if c in word:\n        correct += 1\n    else:\n        tries += 1\n\n    if correct == len(word):\n        break\n\nif tries >= 10:\n    print(\"LOSE\")\nelse:\n    print(\"WIN\")\n
"},{"location":"solutions/#harshad-numbers","title":"Harshad Numbers","text":"Solution in Python Python 
n = int(input())\nwhile True:\n    sd = sum([int(d) for d in str(n)])\n    if not n % sd:\n        break\n    n += 1\nprint(n)\n
"},{"location":"solutions/#haughty-cuisine","title":"Haughty Cuisine","text":"Solution in Python Python 
from random import randint\n\nn = int(input())\nmenu = []\nfor _ in range(n):\n    menu.append(input().split())\n\nprint(\"\\n\".join(menu[randint(0, n - 1)]))\n
"},{"location":"solutions/#head-guard","title":"Head Guard","text":"Solution in Python Python 
while True:\n    try:\n        s = input()\n    except:\n        break\n    parts = []\n    prev, t = s[0], 1\n    for c in s[1:]:\n        if c != prev:\n            parts.append((prev, t))\n            t = 1\n            prev = c\n        else:\n            t += 1\n    parts.append((prev, t))\n    print(\"\".join([f\"{v}{k}\" for k, v in parts]))\n
"},{"location":"solutions/#heart-rate","title":"Heart Rate","text":"Solution in Python Python 
for _ in range(int(input())):\n    b, p = [float(d) for d in input().split()]\n    min_abpm = 60 / p * (b - 1)\n    bpm = 60 * b / p\n    max_abpm = 60 / p * (b + 1)\n    print(f\"{min_abpm:.4f} {bpm:.4f} {max_abpm:.4f}\")\n
"},{"location":"solutions/#homework","title":"Homework","text":"Solution in Python Python 
total = 0\nparts = input().split(\";\")\nfor part in parts:\n    ranges = part.split(\"-\")\n    if len(ranges) == 1:\n        total += 1\n    else:\n        total += len(range(int(ranges[0]), int(ranges[1]))) + 1\nprint(total)\n
"},{"location":"solutions/#heirs-dilemma","title":"Heir's Dilemma","text":"Solution in Python Python 
l, h = [int(d) for d in input().split()]\ntotal = 0\nfor i in range(l, h + 1):\n    digits = set(str(i))\n    if len(digits) != 6 or \"0\" in digits:\n        continue\n    if not all([i % int(d) == 0 for d in digits]):\n        continue\n    total += 1\nprint(total)\n
"},{"location":"solutions/#heliocentric","title":"Heliocentric","text":"Solution in Python Python 
def offset(d, b):\n    return (b - d % b) % b\n\n\ncc = 1\nwhile True:\n    try:\n        a, b = [int(d) for d in input().split()]\n    except:\n        break\n\n    offset_a, offset_b = offset(a, 365), offset(b, 687)\n\n    if offset_a == offset_b:\n        print(f\"Case {cc}:\", offset_a)\n    else:\n        t = offset_a\n        while True:\n            t += 365\n            if (offset(t, 687) + offset_b) % 687 == 0:\n                break\n        print(f\"Case {cc}:\", t)\n\n    cc += 1\n
"},{"location":"solutions/#hello-world","title":"Hello World!","text":"Solutions in 8 languages C++GoHaskellJavaJavaScriptKotlinPythonRust 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    cout << \"Hello World!\" << endl;\n\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    fmt.Println(\"Hello World!\")\n}\n
main = putStrLn \"Hello World!\"\n
class HelloWorld {\n    public static void main(String[] args) {\n        System.out.println(\"Hello World!\");\n    }\n}\n
console.log(\"Hello World!\");\n
fun main() {\n    println(\"Hello World!\")\n}\n
print(\"Hello World!\")\n
fn main() {\n    println!(\"Hello World!\");\n}\n
"},{"location":"solutions/#help-a-phd-candidate-out","title":"Help a PhD candidate out!","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    line = input()\n    parts = line.split(\"+\")\n    if len(parts) == 1:\n        print(\"skipped\")\n    else:\n        print(int(parts[0]) + int(parts[1]))\n
"},{"location":"solutions/#herman","title":"Herman","text":"Solution in Python Python 
import math\n\nr = int(input())\nprint(f\"{math.pi*r*r:.6f}\")\nprint(2 * r * r)\n
"},{"location":"solutions/#hissing-microphone","title":"Hissing Microphone","text":"Solutions in 3 languages C++JavaScriptPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    string a;\n    cin >> a;\n\n    if (a.find(\"ss\") == -1)\n    {\n        cout << \"no hiss\" << endl;\n    }\n    else\n    {\n        cout << \"hiss\" << endl;\n    }\n\n    return 0;\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  if (line.includes(\"ss\")) {\n    console.log(\"hiss\");\n  } else {\n    console.log(\"no hiss\");\n  }\n});\n
a = input()\nif \"ss\" in a:\n    print(\"hiss\")\nelse:\n    print(\"no hiss\")\n
"},{"location":"solutions/#hitting-the-targets","title":"Hitting the Targets","text":"Solution in Python Python 
def in_rectangle(x1, y1, x2, y2, x, y):\n    x1, x2 = min(x1, x2), max(x1, x2)\n    y1, y2 = min(y1, y2), max(y1, y2)\n    if x in range(x1, x2 + 1) and y in range(y1, y2 + 1):\n        return True\n    else:\n        return False\n\n\ndef in_circle(x0, y0, r, x, y):\n    return (x0 - x) ** 2 + (y0 - y) ** 2 <= r**2\n\n\nm = int(input())\nshapes = []\nfor _ in range(m):\n    values = input().split()\n    shapes.append((values[0], *[int(d) for d in values[1:]]))\n\nn = int(input())\nfor _ in range(n):\n    total = 0\n    x, y = [int(d) for d in input().split()]\n    for shape in shapes:\n        if shape[0] == \"rectangle\":\n            total += in_rectangle(*shape[1:], x, y)\n        elif shape[0] == \"circle\":\n            total += in_circle(*shape[1:], x, y)\n    print(total)\n
"},{"location":"solutions/#hot-hike","title":"Hot Hike","text":"Solution in Python Python 
n = int(input())\nt = [int(d) for d in input().split()]\norder = sorted(range(n - 2), key=lambda k: max(t[k], t[k + 2]))\nd = order[0]\nv = max(t[d], t[d + 2])\nprint(d + 1, v)\n
"},{"location":"solutions/#hragreining","title":"Hra\u00f0greining","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scan(&s)\n    if strings.Contains(s, \"COV\") {\n        fmt.Println(\"Veikur!\")\n    } else {\n        fmt.Println(\"Ekki veikur!\")\n    }\n}\n
print(\"Veikur!\" if \"COV\" in input() else \"Ekki veikur!\")\n
"},{"location":"solutions/#the-amazing-human-cannonball","title":"The Amazing Human Cannonball","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    v0, a, x1, h1, h2 = [float(d) for d in input().split()]\n    a = math.radians(a)\n    t = x1 / (v0 * math.cos(a))\n    y = v0 * t * math.sin(a) - 0.5 * 9.81 * (t**2)\n    if y < h1 + 1 or y > h2 - 1:\n        print(\"Not Safe\")\n    else:\n        print(\"Safe\")\n
"},{"location":"solutions/#hvert-skal-mta","title":"Hvert Skal M\u00e6ta?","text":"Solution in Python Python 
mapping = {\n    \"Reykjavik\": \"Reykjavik\",\n    \"Kopavogur\": \"Reykjavik\",\n    \"Hafnarfjordur\": \"Reykjavik\",\n    \"Reykjanesbaer\": \"Reykjavik\",\n    \"Akureyri\": \"Akureyri\",\n    \"Gardabaer\": \"Reykjavik\",\n    \"Mosfellsbaer\": \"Reykjavik\",\n    \"Arborg\": \"Reykjavik\",\n    \"Akranes\": \"Reykjavik\",\n    \"Fjardabyggd\": \"Akureyri\",\n    \"Mulathing\": \"Akureyri\",\n    \"Seltjarnarnes\": \"Reykjavik\",\n}\nprint(mapping[input()])\n
"},{"location":"solutions/#icpc-awards","title":"ICPC Awards","text":"Solution in Python Python 
n = int(input())\nshown = {}\nfor _ in range(n):\n    u, t = input().split()\n    if u not in shown and len(shown.keys()) < 12:\n        print(u, t)\n        shown[u] = True\n
"},{"location":"solutions/#illuminati-spotti","title":"Illuminati Spotti","text":"Solution in Python Python 
n = int(input())\nm = []\nfor _ in range(n):\n    m.append(input().split())\ntotal = 0\nfor i in range(1, n - 1):\n    for j in range(i):\n        for k in range(i + 1, n):\n            if m[i][j] == m[k][j] == m[k][i] == \"1\":\n                total += 1\nprint(total)\n
"},{"location":"solutions/#inheritance","title":"Inheritance","text":"Solution in Python Python 
from itertools import product\n\np = input()\nans = []\nfor i in range(len(p)):\n    for t in product(\"24\", repeat=i + 1):\n        if int(p) % int(\"\".join(t)) == 0:\n            ans.append(int(\"\".join(t)))\nprint(\"\\n\".join([str(d) for d in sorted(ans)]))\n
"},{"location":"solutions/#international-dates","title":"International Dates","text":"Solution in Python Python 
aa, bb, _ = [int(d) for d in input().split(\"/\")]\n\nif aa > 12 and bb <= 12:\n    print(\"EU\")\nelif aa <= 12 and bb > 12:\n    print(\"US\")\nelse:\n    print(\"either\")\n
"},{"location":"solutions/#isithalloweencom","title":"IsItHalloween.com","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var m, d string\n    fmt.Scan(&m)\n    fmt.Scan(&d)\n    if (m == \"OCT\" && d == \"31\") || (m == \"DEC\" && d == \"25\") {\n        fmt.Println(\"yup\")\n    } else {\n        fmt.Println(\"nope\")\n    }\n}\n
m, d = input().split()\nif (m == \"OCT\" and d == \"31\") or (m == \"DEC\" and d == \"25\"):\n    print(\"yup\")\nelse:\n    print(\"nope\")\n
"},{"location":"solutions/#jabuke","title":"Jabuke","text":"Solution in Python Python 
xa, ya = [int(d) for d in input().split()]\nxb, yb = [int(d) for d in input().split()]\nxc, yc = [int(d) for d in input().split()]\nn = int(input())\narea = abs(xa * (yb - yc) + xb * (yc - ya) + xc * (ya - yb)) / 2\nprint(f\"{area:.1f}\")\n\n\ndef sign(x1, y1, x2, y2, x3, y3):\n    return (x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3)\n\n\ndef in_triangle(x, y, x1, y1, x2, y2, x3, y3):\n    d1 = sign(x, y, x1, y1, x2, y2)\n    d2 = sign(x, y, x2, y2, x3, y3)\n    d3 = sign(x, y, x3, y3, x1, y1)\n\n    has_neg = d1 < 0 or d2 < 0 or d3 < 0\n    has_pos = d1 > 0 or d2 > 0 or d3 > 0\n\n    return not (has_neg and has_pos)\n\n\ntotal = 0\nfor _ in range(n):\n    x, y = [int(d) for d in input().split()]\n    if in_triangle(x, y, xa, ya, xb, yb, xc, yc):\n        total += 1\nprint(total)\n
"},{"location":"solutions/#jack-o-lantern-juxtaposition","title":"Jack-O'-Lantern Juxtaposition","text":"Solution in Python Python 
numbers = [int(n) for n in input().split()]\nresult = 1\nfor n in numbers:\n    result *= n\nprint(result)\n
"},{"location":"solutions/#janitor-troubles","title":"Janitor Troubles","text":"Solution in Python Python 
import math\n\na, b, c, d = [int(d) for d in input().split()]\ns = (a + b + c + d) / 2\nprint(math.sqrt((s - a) * (s - b) * (s - c) * (s - d)))\n
"},{"location":"solutions/#jewelry-box","title":"Jewelry Box","text":"Solution in Python Python 
def f(h):\n    a = x - 2 * h\n    b = y - 2 * h\n    return a * b * h\n\n\nfor _ in range(int(input())):\n    x, y = [int(d) for d in input().split()]\n    h = (x + y - ((x + y) ** 2 - 3 * x * y) ** 0.5) / 6\n    print(f\"{f(h):.11f}\")\n
"},{"location":"solutions/#job-expenses","title":"Job Expenses","text":"Solution in Python Python 
_ = input()\nprint(-sum([int(d) for d in input().split() if \"-\" in d]))\n
"},{"location":"solutions/#joint-jog-jam","title":"Joint Jog Jam","text":"Solution in Python Python 
import math\n\n\ndef dist(x1, y1, x2, y2):\n    return math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\n\n\ncoords = [int(d) for d in input().split()]\nprint(max(dist(*coords[:4]), dist(*coords[4:])))\n
"},{"location":"solutions/#judging-moose","title":"Judging Moose","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var l, r int\n    fmt.Scan(&l)\n    fmt.Scan(&r)\n    if l == 0 && r == 0 {\n        fmt.Println(\"Not a moose\")\n    } else {\n        p := 2 * l\n        if r > l {\n            p = 2 * r\n        }\n        t := \"Odd\"\n        if l == r {\n            t = \"Even\"\n        }\n        fmt.Println(t, p)\n    }\n}\n
l, r = [int(d) for d in input().split()]\nif not l and not r:\n    print(\"Not a moose\")\nelse:\n    p = 2 * max(l, r)\n    print(\"Odd\" if l != r else \"Even\", p)\n
"},{"location":"solutions/#jumbo-javelin","title":"Jumbo Javelin","text":"Solution in Python Python 
n = int(input())\nlength = 0\nfor _ in range(n):\n    length += int(input())\nlength -= n - 1\nprint(length)\n
"},{"location":"solutions/#just-a-minute","title":"Just a Minute","text":"Solution in Python Python 
a, b = [], []\nfor _ in range(int(input())):\n    x, y = [int(d) for d in input().split()]\n    a.append(x * 60)\n    b.append(y)\nans = sum(b) / sum(a)\nif ans <= 1:\n    ans = \"measurement error\"\nprint(ans)\n
"},{"location":"solutions/#running-race","title":"Running Race","text":"Solution in Python Python 
l, k, _ = [int(d) for d in input().split()]\n\nrecord = {}\nfor _ in range(l):\n    i, t = input().split()\n    mm, ss = [int(d) for d in t.split(\".\")]\n    s = mm * 60 + ss\n    if i in record:\n        record[i].append(s)\n    else:\n        record[i] = [s]\n\ndelete = [i for i in record if len(record[i]) != k]\nfor i in delete:\n    record.pop(i)\n\nsorted_i = sorted(record, key=lambda i: (sum(record[i]), int(i)))\nprint(\"\\n\".join(sorted_i))\n
"},{"location":"solutions/#karte","title":"Karte","text":"Solution in Python Python 
from collections import Counter\n\ns = input()\ncards = {\n    \"P\": Counter(),\n    \"K\": Counter(),\n    \"H\": Counter(),\n    \"T\": Counter(),\n}\nduplicated = False\nfor i in range(0, len(s), 3):\n    suit = s[i]\n    card = s[i + 1 : i + 3]\n    if cards[suit][card]:\n        duplicated = True\n        break\n    cards[suit][card] += 1\n\nif not duplicated:\n    print(\" \".join([str(13 - len(c)) for c in cards.values()]))\nelse:\n    print(\"GRESKA\")\n
"},{"location":"solutions/#kemija","title":"Kemija","text":"Solutions in 2 languages JavaScriptPython 
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  for (let c of \"aeiou\") {\n    const regex = new RegExp(`${c}p${c}`, \"g\");\n    line = line.replace(regex, c);\n  }\n  console.log(line);\n});\n
s = input()\n\nfor c in \"aeiou\":\n    s = s.replace(f\"{c}p{c}\", c)\n\nprint(s)\n
"},{"location":"solutions/#the-key-to-cryptography","title":"The Key to Cryptography","text":"Solution in Python Python 
import string\n\nuppers = string.ascii_uppercase\n\n\ndef decrypt(c, k):\n    index = (uppers.index(c) - uppers.index(k)) % 26\n    return uppers[index]\n\n\nm, w = input(), input()\n\nsize_w = len(w)\nsize_m = len(m)\no = []\nfor i in range(0, size_m, size_w):\n    if i + size_w < size_m:\n        l = zip(m[i : i + size_w], w)\n    else:\n        l = zip(m[i:], w)\n    t = \"\".join([decrypt(c, k) for c, k in l])\n    o.append(t)\n    w = t\nprint(\"\".join(o))\n
"},{"location":"solutions/#keywords","title":"Keywords","text":"Solution in Python Python 
keywords = set()\nfor _ in range(int(input())):\n    keywords.add(input().lower().replace(\"-\", \" \"))\nprint(len(keywords))\n
"},{"location":"solutions/#kitten-on-a-tree","title":"Kitten on a Tree","text":"Solution in Python Python 
k = input()\nb = []\nwhile True:\n    line = input()\n    if line == \"-1\":\n        break\n    b.append(line.split())\n\np = [k]\nt = k\nwhile True:\n    found = False\n    for row in b:\n        if t in row[1:]:\n            p.append(row[0])\n            found = True\n            t = row[0]\n            break\n    if not found:\n        break\n\nprint(\" \".join(p))\n
"},{"location":"solutions/#kleptography","title":"Kleptography","text":"Solution in Python Python 
from string import ascii_lowercase as l\n\n\nn, m = [int(d) for d in input().split()]\np = input()\nc = input()\np = p[::-1]\nc = c[::-1]\n\nans = \"\"\nfor i in range(0, m, n):\n    if i + n < m:\n        part = c[i : i + n]\n    else:\n        part = c[i:]\n\n    ans += p\n    p = \"\".join([l[(l.index(a) - l.index(b)) % 26] for a, b in zip(part, p)])\n\nans += p\nprint(ans[::-1][n:])\n
"},{"location":"solutions/#knight-packing","title":"Knight Packing","text":"Solution in Python Python 
if int(input()) % 2:\n    print(\"first\")\nelse:\n    print(\"second\")\n
"},{"location":"solutions/#knot-knowledge","title":"Knot Knowledge","text":"Solution in Python Python 
input()\ntotal = set(input().split())\nknown = set(input().split())\nprint((total - known).pop())\n
"},{"location":"solutions/#kornislav","title":"Kornislav","text":"Solution in Python Python 
numbers = sorted([int(d) for d in input().split()])\nprint(numbers[0] * numbers[2])\n
"},{"location":"solutions/#krizaljka","title":"Kri\u017ealjka","text":"Solution in Python Python 
a, b = input().split()\nfor i in range(len(a)):\n    if a[i] in b:\n        j = b.index(a[i])\n        break\n\nrows = []\n\nfor k in range(j):\n    rows.append(\".\" * i + b[k] + \".\" * (len(a) - i - 1))\n\nrows.append(a)\n\nfor k in range(j + 1, len(b)):\n    rows.append(\".\" * i + b[k] + \".\" * (len(a) - i - 1))\n\nprint(\"\\n\".join(rows))\n
"},{"location":"solutions/#ladder","title":"Ladder","text":"Solution in Python Python 
import math\n\nh, v = [int(d) for d in input().split()]\nprint(math.ceil(h / math.sin(math.radians(v))))\n
"},{"location":"solutions/#lamps","title":"Lamps","text":"Solution in Python Python 
h, p = [int(d) for d in input().split()]\n\ndays = 0\ncost_bulb, cost_lamp = 5, 60\nused_bulb, used_lamp = 0, 0\n\nwhile True:\n    days += 1\n    cost_bulb += 60 * h * p / 100000\n    cost_lamp += 11 * h * p / 100000\n    used_bulb += h\n    used_lamp += h\n\n    if used_bulb > 1000:\n        cost_bulb += 5\n        used_bulb -= 1000\n\n    if used_lamp > 8000:\n        cost_lamp += 60\n        used_lamp -= 8000\n\n    if cost_bulb > cost_lamp:\n        break\n\nprint(days)\n
"},{"location":"solutions/#laptop-sticker","title":"Laptop Sticker","text":"Solutions in 3 languages C++GoPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int wc, hc, ws, hs;\n    cin >> wc >> hc >> ws >> hs;\n    if (wc - 2 >= ws && hc - 2 >= hs)\n    {\n        cout << 1 << endl;\n    }\n    else\n    {\n        cout << 0 << endl;\n    }\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var wc, hc, ws, hs int\n    fmt.Scan(&wc)\n    fmt.Scan(&hc)\n    fmt.Scan(&ws)\n    fmt.Scan(&hs)\n    if wc-2 >= ws && hc-2 >= hs {\n\n        fmt.Println(1)\n\n    } else {\n\n        fmt.Println(0)\n\n    }\n}\n
wc, hc, ws, hs = [int(d) for d in input().split()]\nif wc - 2 >= ws and hc - 2 >= hs:\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#last-factorial-digit","title":"Last Factorial Digit","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = int(input())\n    number = 1\n    for i in range(1, n + 1):\n        number *= i\n    print(number % 10)\n
"},{"location":"solutions/#left-beehind","title":"Left Beehind","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x, y int\n    for true {\n        fmt.Scan(&x)\n        fmt.Scan(&y)\n        if x == 0 && y == 0 {\n            break\n        }\n        if x+y == 13 {\n            fmt.Println(\"Never speak again.\")\n        } else if x > y {\n            fmt.Println(\"To the convention.\")\n        } else if x == y {\n            fmt.Println(\"Undecided.\")\n        } else {\n            fmt.Println(\"Left beehind.\")\n        }\n    }\n}\n
import java.util.Scanner;\n\nclass LeftBeehind {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        while (true) {\n            int x = s.nextInt();\n            int y = s.nextInt();\n            if (x == 0 && y == 0) {\n                break;\n            }\n            if (x + y == 13) {\n                System.out.println(\"Never speak again.\");\n            } else if (x > y) {\n                System.out.println(\"To the convention.\");\n            } else if (x == y) {\n                System.out.println(\"Undecided.\");\n            } else {\n                System.out.println(\"Left beehind.\");\n            }\n        }\n    }\n}\n
while True:\n    x, y = [int(d) for d in input().split()]\n    if not x and not y:\n        break\n    if x + y == 13:\n        print(\"Never speak again.\")\n    elif x > y:\n        print(\"To the convention.\")\n    elif x == y:\n        print(\"Undecided.\")\n    else:\n        print(\"Left beehind.\")\n
"},{"location":"solutions/#leggja-saman","title":"Leggja saman","text":"Solution in Python Python 
m = int(input())\nn = int(input())\nprint(m + n)\n
"},{"location":"solutions/#license-to-launch","title":"License to Launch","text":"Solution in Python Python 
_ = input()\njunks = [int(d) for d in input().split()]\nprint(junks.index(min(junks)))\n
"},{"location":"solutions/#line-them-up","title":"Line Them Up","text":"Solution in Python Python 
n = int(input())\nnames = []\nfor _ in range(n):\n    names.append(input())\norder = []\nfor i in range(1, n):\n    order.append(names[i] > names[i - 1])\nif all(order):\n    print(\"INCREASING\")\nelif not any(order):\n    print(\"DECREASING\")\nelse:\n    print(\"NEITHER\")\n
"},{"location":"solutions/#a-list-game","title":"A List Game","text":"Solution in Python Python 
import math\n\nx = int(input())\n\np = 1\ntotal = 0\n\nwhile x % 2 == 0:\n    p = 2\n    x /= 2\n    total += 1\n\n\nfor i in range(3, math.ceil(math.sqrt(x)) + 1, 2):\n    while x % i == 0:\n        p = i\n        x /= i\n        total += 1\nif x > 1:\n    total += 1\n\n\nif p == 1:\n    total = 1\n\n\nprint(total)\n
"},{"location":"solutions/#locust-locus","title":"Locust Locus","text":"Solution in Python Python 
from math import gcd\n\nn = int(input())\nl = []\nfor _ in range(n):\n    y, c1, c2 = [int(d) for d in input().split()]\n    g = gcd(c1, c2)\n    l.append(y + g * (c1 // g) * (c2 // g))\nprint(min(l))\n
"},{"location":"solutions/#logic-functions","title":"Logic Functions","text":"Solution in C++ C++ 
#include \"logicfunctions.h\"\n\n// Compute xor\nvoid exclusive(bool x, bool y, bool &ans)\n{\n    ans = x != y;\n}\n\n// Compute implication\nvoid implies(bool x, bool y, bool &ans)\n{\n    if (x && !y)\n    {\n        ans = false;\n    }\n    else\n    {\n        ans = true;\n    }\n}\n\n// Compute equivalence\nvoid equivalence(bool x, bool y, bool &ans)\n{\n    ans = x == y;\n}\n
"},{"location":"solutions/#lost-lineup","title":"Lost Lineup","text":"Solution in Python Python 
n = int(input())\norder = [int(d) for d in input().split()]\nd = range(1, n)\norder = dict(zip(d, order))\nranges = range(1, n + 1)\nresult = [\"1\"]\nfor k in sorted(order, key=lambda x: order[x]):\n    result.append(str(ranges[k]))\nprint(\" \".join(result))\n
"},{"location":"solutions/#luhns-checksum-algorithm","title":"Luhn's Checksum Algorithm","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = input()[::-1]\n    checksum = 0\n    for i in range(len(n)):\n        s = int(n[i]) * (i % 2 + 1)\n        if s > 9:\n            s = sum([int(d) for d in str(s)])\n        checksum += s\n\n    print(\"FAIL\" if checksum % 10 else \"PASS\")\n
"},{"location":"solutions/#magic-trick","title":"Magic Trick","text":"Solution in Python Python 
s = input()\ncounter = {}\nguess = 1\nfor c in s:\n    if c in counter:\n        guess = 0\n        break\n    else:\n        counter[c] = None\nprint(guess)\n
"},{"location":"solutions/#making-a-meowth","title":"Making A Meowth","text":"Solution in Python Python 
n, p, x, y = [int(d) for d in input().split()]\nprint(p * x + p // (n - 1) * y)\n
"},{"location":"solutions/#identifying-map-tiles","title":"Identifying Map Tiles","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"math\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scanln(&s)\n    zoom := len(s)\n    var x, y float64\n    for i := 0; i < zoom; i++ {\n        d := math.Pow(2, float64(zoom)-float64(i)-1)\n        if s[i] == '1' {\n            x += d\n        } else if s[i] == '2' {\n            y += d\n        } else if s[i] == '3' {\n            x += d\n            y += d\n        }\n    }\n    fmt.Printf(\"%d %d %d\", zoom, int64(x), int64(y))\n}\n
s = input()\nx, y = 0, 0\nzoom = len(s)\nfor i in range(len(s)):\n    d = 2 ** (zoom - i - 1)\n    if s[i] == \"1\":\n        x += d\n    elif s[i] == \"2\":\n        y += d\n    elif s[i] == \"3\":\n        x += d\n        y += d\nprint(f\"{zoom} {x} {y}\")\n
"},{"location":"solutions/#marko","title":"Marko","text":"Solution in Python Python 
mapping = {\n    \"2\": \"abc\",\n    \"3\": \"def\",\n    \"4\": \"ghi\",\n    \"5\": \"jkl\",\n    \"6\": \"mno\",\n    \"7\": \"pqrs\",\n    \"8\": \"tuv\",\n    \"9\": \"wxyz\",\n}\nn = []\nfor _ in range(int(input())):\n    w = input()\n    t = \"\"\n    for c in w:\n        for d, r in mapping.items():\n            if c in r:\n                t += d\n                break\n    n.append(t)\n\nd = input()\nprint(sum([d == t for t in n]))\n
"},{"location":"solutions/#mars-window","title":"Mars Window","text":"Solution in Python Python 
y = int(input())\nprint(\"YES\" if 26 - ((y - 2018) * 12 - 4) % 26 <= 12 else \"NO\")\n
"},{"location":"solutions/#math-homework","title":"Math Homework","text":"Solution in Python Python 
b, d, c, l = [int(d) for d in input().split()]\nsolved = False\nfor i in range(l // b + 1):\n    for j in range((l - b * i) // d + 1):\n        for k in range((l - b * i - d * j) // c + 1):\n            if b * i + d * j + c * k == l:\n                print(i, j, k)\n                solved = True\nif not solved:\n    print(\"impossible\")\n
"},{"location":"solutions/#mean-words","title":"Mean Words","text":"Solution in Python Python 
n = int(input())\nwords = []\nfor _ in range(n):\n    words.append(input())\nm = max([len(w) for w in words])\nans = []\nfor i in range(m):\n    values = [ord(w[i]) for w in words if len(w) > i]\n    ans.append(sum(values) // len(values))\nprint(\"\".join(chr(d) for d in ans))\n
"},{"location":"solutions/#imperial-measurement","title":"Imperial Measurement","text":"Solution in Python Python 
mapping = {\n    \"th\": \"thou\",\n    \"in\": \"inch\",\n    \"ft\": \"foot\",\n    \"yd\": \"yard\",\n    \"ch\": \"chain\",\n    \"fur\": \"furlong\",\n    \"mi\": \"mile\",\n    \"lea\": \"league\",\n}\nnames = list(mapping.values())\nscale = [1, 1000, 12, 3, 22, 10, 8, 3]\n\nv, a, _, b = input().split()\nv = int(v)\nna, nb = mapping.get(a, a), mapping.get(b, b)\nia, ib = names.index(na), names.index(nb)\n\nrate = 1\nfor s in scale[min(ia, ib) + 1 : max(ia, ib) + 1]:\n    rate *= s\n\nprint(v * rate if ia > ib else v / rate)\n
"},{"location":"solutions/#metaprogramming","title":"Metaprogramming","text":"Solution in Python Python 
c = {}\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    parts = s.split()\n    if parts[0] == \"define\":\n        v, n = parts[1:]\n        c[n] = int(v)\n    elif parts[0] == \"eval\":\n        x, y, z = parts[1:]\n        if x not in c or z not in c:\n            print(\"undefined\")\n        elif y == \"=\":\n            print(\"true\" if c[x] == c[z] else \"false\")\n        elif y == \">\":\n            print(\"true\" if c[x] > c[z] else \"false\")\n        elif y == \"<\":\n            print(\"true\" if c[x] < c[z] else \"false\")\n
"},{"location":"solutions/#methodic-multiplication","title":"Methodic Multiplication","text":"Solution in Python Python 
a, b = input(), input()\nt = a.count(\"S\") * b.count(\"S\")\nprint(\"S(\" * t + \"0\" + \")\" * t)\n
"},{"location":"solutions/#metronome","title":"Metronome","text":"Solution in Python Python 
n = int(input())\nprint(f\"{n/4:.2f}\")\n
"},{"location":"solutions/#mia","title":"Mia","text":"Solution in Python Python 
def score(a, b):\n    roll = set([a, b])\n    if roll == {1, 2}:\n        return (3, None)\n    elif len(roll) == 1:\n        return (2, a)\n    else:\n        a, b = min(a, b), max(b, a)\n        return (1, 10 * b + a)\n\n\nwhile True:\n    rolls = [int(d) for d in input().split()]\n    if not any(rolls):\n        break\n    score1 = score(*rolls[:2])\n    score2 = score(*rolls[2:])\n    if score1 == score2:\n        print(\"Tie.\")\n    elif score1[0] == score2[0]:\n        print(f\"Player {1 if score1[1] > score2[1] else 2} wins.\")\n    else:\n        print(f\"Player {1 if score1[0] > score2[0] else 2} wins.\")\n
"},{"location":"solutions/#missing-numbers","title":"Missing Numbers","text":"Solution in Python Python 
numbers = []\nfor _ in range(int(input())):\n    numbers.append(int(input()))\n\nis_good_job = True\nfor i in range(1, max(numbers) + 1):\n    if i not in numbers:\n        is_good_job = False\n        print(i)\n\nif is_good_job:\n    print(\"good job\")\n
"},{"location":"solutions/#mixed-fractions","title":"Mixed Fractions","text":"Solution in Python Python 
while True:\n    m, n = [int(d) for d in input().split()]\n    if not m and not n:\n        break\n    a = m // n\n    b = m % n\n    print(f\"{a} {b} / {n}\")\n
"},{"location":"solutions/#mjehuric","title":"Mjehuric","text":"Solution in Python Python 
f = input().split()\nwhile f != [str(d) for d in range(1, 6)]:\n    for i in range(4):\n        if f[i] > f[i + 1]:\n            f[i], f[i + 1] = f[i + 1], f[i]\n            print(\" \".join(f))\n
"},{"location":"solutions/#moderate-pace","title":"Moderate Pace","text":"Solution in Python Python 
n = int(input())\ndistances = [[int(d) for d in input().split()] for _ in range(3)]\nplan = [sorted([d[i] for d in distances])[1] for i in range(n)]\nprint(\" \".join([str(d) for d in plan]))\n
"},{"location":"solutions/#modulo","title":"Modulo","text":"Solution in Python Python 
n = set()\nfor _ in range(10):\n    n.add(int(input()) % 42)\nprint(len(n))\n
"},{"location":"solutions/#monopoly","title":"Monopoly","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()]\nt = 0\nm = 0\nfor i in range(1, 7):\n    for j in range(1, 7):\n        t += 1\n        if i + j in a:\n            m += 1\nprint(m / t)\n
"},{"location":"solutions/#moscow-dream","title":"Moscow Dream","text":"Solution in Python Python 
a, b, c, n = [int(d) for d in input().split()]\n\nif not all(d > 0 for d in [a, b, c]):\n    print(\"NO\")\nelse:\n    print(\"YES\" if a + b + c >= n and n >= 3 else \"NO\")\n
"},{"location":"solutions/#mosquito-multiplication","title":"Mosquito Multiplication","text":"Solution in Python Python 
while True:\n    try:\n        m, p, l, e, r, s, n = [int(d) for d in input().split()]\n    except:\n        break\n    for _ in range(n):\n        pp = p\n        p = l // r\n        l = e * m\n        m = pp // s\n    print(m)\n
"},{"location":"solutions/#mrcodeformatgrader","title":"MrCodeFormatGrader","text":"Solution in Python Python 
def f(numbers):\n    prev = numbers[0]\n    ans = {prev: 1}\n    for i in range(1, len(numbers)):\n        if numbers[i] == prev + ans[prev]:\n            ans[prev] += 1\n        else:\n            prev = numbers[i]\n            ans[prev] = 1\n\n    parts = [\n        f\"{key}-{key+value-1}\"\n        if value > 1\n        else \" \".join([str(d) for d in range(key, key + value)])\n        for key, value in ans.items()\n    ]\n\n    return \", \".join(parts[:-1]) + \" and \" + parts[-1]\n\n\nc, n = [int(d) for d in input().split()]\nerrors = [int(d) for d in input().split()]\ncorrect = [i for i in range(1, 1 + c) if i not in errors]\n\nprint(\"Errors:\", f(errors))\nprint(\"Correct:\", f(correct))\n
"},{"location":"solutions/#mult","title":"Mult!","text":"Solution in Python Python 
n = int(input())\nb = None\nfor _ in range(n):\n    d = int(input())\n    if not b:\n        b = d\n        continue\n\n    if d % b == 0:\n        print(d)\n        b = None\n
"},{"location":"solutions/#mumble-rap","title":"Mumble Rap","text":"Solution in Python Python 
n = int(input())\ns = input()\na = []\nd = \"\"\nimport string\n\nfor i in range(n):\n    if s[i] in string.digits:\n        d += s[i]\n\n    else:\n        if d:\n            a.append(int(d))\n            d = \"\"\nif d:\n    a.append(int(d))\n\nprint(max(a))\n
"},{"location":"solutions/#musical-scales","title":"Musical Scales","text":"Solution in Python Python 
notes = [\"A\", \"A#\", \"B\", \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\"]\noffset = [2, 2, 1, 2, 2, 2]\nmajors = {}\nfor i in range(len(notes)):\n    name = notes[i]\n    progression = [name]\n    for i in offset:\n        index = (notes.index(progression[-1]) + i) % len(notes)\n        progression.append(notes[index])\n    majors[name] = progression\n\n_ = input()\nscales = set(input().split())\nprint(\" \".join([n for n in majors if scales < set(majors[n])]) or \"none\")\n
"},{"location":"solutions/#music-your-way","title":"Music Your Way","text":"Solution in Python Python 
cols = input().split()\nm = int(input())\nsongs = [input().split() for _ in range(m)]\nn = int(input())\n\nfor i in range(n):\n    col = input()\n    index = cols.index(col)\n    songs = sorted(songs, key=lambda k: k[index])\n    print(\" \".join(cols))\n    for song in songs:\n        print(\" \".join(song))\n    if i < n - 1:\n        print()\n
"},{"location":"solutions/#mylla","title":"Mylla","text":"Solution in Python Python 
board = []\nfor _ in range(3):\n    board.append(list(input()))\n\nwinner = \"\"\nfor i in range(3):\n    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != \"_\":\n        winner = board[i][0]\n        break\n    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != \"_\":\n        winner = board[0][i]\n        break\n\nif board[0][0] == board[1][1] == board[2][2] and board[1][1] != \"_\":\n    winner = board[1][1]\nelif board[0][2] == board[1][1] == board[2][0] and board[1][1] != \"_\":\n    winner = board[1][1]\n\nif winner == \"O\":\n    winner = \"Jebb\"\nelse:\n    winner = \"Neibb\"\n\nprint(winner)\n
"},{"location":"solutions/#nasty-hacks","title":"Nasty Hacks","text":"Solutions in 2 languages C++Python 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n, r, e, c;\n    cin >> n;\n\n    for (int i = 0; i < n; i++)\n    {\n        cin >> r >> e >> c;\n        if ((e - c) > r)\n        {\n            cout << \"advertise\";\n        }\n        else if ((e - c) < r)\n        {\n            cout << \"do not advertise\";\n        }\n        else\n        {\n            cout << \"does not matter\";\n        }\n    }\n}\n
for _ in range(int(input())):\n    r, e, c = [int(d) for d in input().split()]\n    if e > r + c:\n        print(\"advertise\")\n    elif e < r + c:\n        print(\"do not advertise\")\n    else:\n        print(\"does not matter\")\n
"},{"location":"solutions/#no-duplicates","title":"No Duplicates","text":"Solution in Python Python 
words = input().split()\n\ncounter = {}\nrepeated = False\nfor w in words:\n    if w in counter:\n        repeated = True\n        break\n    else:\n        counter[w] = None\nif repeated:\n    print(\"no\")\nelse:\n    print(\"yes\")\n
"},{"location":"solutions/#no-thanks","title":"No Thanks!","text":"Solution in Python Python 
n = int(input())\nv = sorted([int(d) for d in input().split()])\n\nprev = v[0]\nans = {prev: 1}\nfor i in range(1, n):\n    if v[i] == prev + ans[prev]:\n        ans[prev] += 1\n    else:\n        prev = v[i]\n        ans[prev] = 1\n\nprint(sum(ans.keys()))\n
"},{"location":"solutions/#n-sum","title":"N-sum","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass NSum {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int ans = 0;\n        for (int i = 0; i < n; i++) {\n            ans += s.nextInt();\n        }\n        System.out.println(ans);\n    }\n}\n
_ = int(input())\nnumbers = []\nfor d in input().split():\n    numbers.append(int(d))\nprint(sum(numbers))\n
"},{"location":"solutions/#number-fun","title":"Number Fun","text":"Solution in Python Python 
for _ in range(int(input())):\n    a, b, c = [int(d) for d in input().split()]\n    if a + b == c or a * b == c or a - b == c or b - a == c or a / b == c or b / a == c:\n        print(\"Possible\")\n    else:\n        print(\"Impossible\")\n
"},{"location":"solutions/#odd-echo","title":"Odd Echo","text":"Solution in Python Python 
n = int(input())\nwords = []\nfor _ in range(n):\n    words.append(input())\nfor i in range(0, n, 2):\n    print(words[i])\n
"},{"location":"solutions/#odd-gnome","title":"Odd Gnome","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    g = [int(d) for d in input().split()][1:]\n    prev = g[0]\n    for i in range(1, len(g)):\n        if g[i] != prev + 1:\n            break\n        prev = g[i]\n    print(i + 1)\n
"},{"location":"solutions/#oddities","title":"Oddities","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    x = int(input())\n    if x % 2:\n        res = \"odd\"\n    else:\n        res = \"even\"\n    print(f\"{x} is {res}\")\n
"},{"location":"solutions/#odd-man-out","title":"Odd Man Out","text":"Solution in Python Python 
from collections import Counter\n\nn = int(input())\nfor i in range(n):\n    _ = input()\n    c = Counter(input().split())\n    print(f\"Case #{i+1}: {' '.join(v for v in c if c[v]==1)}\")\n
"},{"location":"solutions/#off-world-records","title":"Off-World Records","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass OffWorldRecords {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int c = s.nextInt();\n        int p = s.nextInt();\n        int ans = 0;\n\n        for (int i = 0; i < n; i++) {\n            int h = s.nextInt();\n            if (h > c + p) {\n                ans += 1;\n                p = c;\n                c = h;\n            }\n        }\n        System.out.println(ans);\n    }\n}\n
n, c, p = [int(d) for d in input().split()]\nans = 0\nfor _ in range(n):\n    h = int(input())\n    if h > c + p:\n        ans += 1\n        c, p = h, c\nprint(ans)\n
"},{"location":"solutions/#reverse","title":"Reverse","text":"Solution in Python Python 
n = int(input())\nnumbers = []\nfor _ in range(n):\n    numbers.append(int(input()))\nfor d in numbers[::-1]:\n    print(d)\n
"},{"location":"solutions/#oktalni","title":"Oktalni","text":"Solution in Python Python 
import math\n\nmapping = {\n    \"000\": \"0\",\n    \"001\": \"1\",\n    \"010\": \"2\",\n    \"011\": \"3\",\n    \"100\": \"4\",\n    \"101\": \"5\",\n    \"110\": \"6\",\n    \"111\": \"7\",\n}\nb = input()\nlength = 3 * math.ceil(len(b) / 3)\nb = b.zfill(length)\n\nprint(\"\".join([mapping[b[i : i + 3]] for i in range(0, length, 3)]))\n
"},{"location":"solutions/#one-chicken-per-person","title":"One Chicken Per Person!","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\n\ndiff = n - m\nif diff > 0:\n    print(f\"Dr. Chaz needs {diff} more piece{'s' if diff >1 else ''} of chicken!\")\nelse:\n    diff = abs(diff)\n    print(\n        f\"Dr. Chaz will have {diff} piece{'s' if diff >1 else ''} of chicken left over!\"\n    )\n
"},{"location":"solutions/#ordinals","title":"Ordinals","text":"Solution in Python Python 
def f(n):\n    if n == 0:\n        return \"{}\"\n    else:\n        ans = \",\".join([f(i) for i in range(n)])\n        return \"{\" + ans + \"}\"\n\n\nprint(f(int(input())))\n
"},{"location":"solutions/#ornaments","title":"Ornaments","text":"Solution in Python Python 
import math\n\nwhile True:\n    r, h, s = [int(d) for d in input().split()]\n    if not r and not h and not s:\n        break\n    l = math.sqrt(h**2 - r**2) * 2\n    a = math.pi - math.acos(r / h)\n    l += 2 * math.pi * r * (a / math.pi)\n    l *= 1 + s / 100\n    print(f\"{l:.2f}\")\n
"},{"location":"solutions/#ostgotska","title":"\u00d6stg\u00f6tska","text":"Solution in Python Python 
sentence = input()\nwords = sentence.split()\nif len([w for w in words if \"ae\" in w]) / len(words) >= 0.4:\n    print(\"dae ae ju traeligt va\")\nelse:\n    print(\"haer talar vi rikssvenska\")\n
"},{"location":"solutions/#overdraft","title":"Overdraft","text":"Solution in Python Python 
n = int(input())\ns = 0\nb = 0\nfor _ in range(n):\n    t = int(input())\n    if t > 0:\n        b += t\n    elif b + t < 0:\n        s -= b + t\n        b = 0\n    else:\n        b += t\nprint(s)\n
"},{"location":"solutions/#ovissa","title":"\u00d3vissa","text":"Solution in Python Python 
print(input().count(\"u\"))\n
"},{"location":"solutions/#the-owl-and-the-fox","title":"The Owl and the Fox","text":"Solution in Python Python 
def sd(n):\n    return sum([int(d) for d in str(n)])\n\n\nfor _ in range(int(input())):\n    n = int(input())\n    s = sd(n) - 1\n    d = n - 1\n    while True:\n        if sd(d) == s:\n            break\n        d -= 1\n    print(d)\n
"},{"location":"solutions/#pachyderm-peanut-packing","title":"Pachyderm Peanut Packing","text":"Solution in Python Python 
def inbox(coords, x, y):\n    if x >= coords[0] and x <= coords[2] and y >= coords[1] and y <= coords[3]:\n        return True\n    return False\n\n\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    box = {}\n    for i in range(n):\n        desc = input().split()\n        size = desc[-1]\n        coords = [float(d) for d in desc[:-1]]\n        box[i] = (coords, size)\n    m = int(input())\n    for _ in range(m):\n        desc = input().split()\n        size = desc[-1]\n        x, y = [float(d) for d in desc[:-1]]\n        floor = True\n        for i in range(n):\n            coords, box_size = box[i]\n            if inbox(coords, x, y):\n                floor = False\n                break\n        if floor:\n            status = \"floor\"\n        else:\n            status = \"correct\" if box_size == size else box_size\n        print(size, status)\n    print()\n
"},{"location":"solutions/#parent-gap","title":"Parent Gap","text":"Solution in Python Python 
from datetime import datetime\n\nyear = int(input())\n\nmother = datetime(year, 5, 1).isoweekday()\nfather = datetime(year, 6, 1).isoweekday()\n\nx = 7 - mother\ny = 7 - father\ndaymother = 1 + x + 7\ndayfather = 1 + y + 14\n\ndaymother = datetime(year, 5, daymother)\ndayfather = datetime(year, 6, dayfather)\n\nprint(((dayfather - daymother).days) // 7, \"weeks\")\n
"},{"location":"solutions/#parket","title":"Parket","text":"Solution in Python Python 
import math\n\nr, b = [int(d) for d in input().split()]\nw = math.floor((r + b) ** 0.5)\nwhile w:\n    if (r + b) / w == (r + 4) / 2 - w:\n        print((r + 4) // 2 - w, w)\n        break\n    w -= 1\n
"},{"location":"solutions/#parking","title":"Parking","text":"Solution in Python Python 
a, b, c = [int(d) for d in input().split()]\nt = [0] * 100\nfor _ in range(3):\n    start, end = [int(d) - 1 for d in input().split()]\n    for i in range(start, end):\n        t[i] += 1\n\ntotal = 0\nmapping = {\n    3: c,\n    2: b,\n    1: a,\n}\nfor s in t:\n    total += mapping.get(s, 0) * s\nprint(total)\n
"},{"location":"solutions/#parking_1","title":"Parking","text":"Solution in Python Python 
for _ in range(int(input())):\n    _ = input()\n    positions = [int(d) for d in input().split()]\n    print(2 * (max(positions) - min(positions)))\n
"},{"location":"solutions/#patuljci","title":"Patuljci","text":"Solution in Python Python 
d = [int(input()) for _ in range(9)]\ndiff = sum(d) - 100\nend = False\nfor i in range(8):\n    for j in range(i + 1, 9):\n        if d[i] + d[j] == diff:\n            end = True\n            break\n    if end:\n        break\nprint(\"\\n\".join([str(d[k]) for k in range(9) if k not in [i, j]]))\n
"},{"location":"solutions/#paul-eigon","title":"Paul Eigon","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n, p, q int\n    fmt.Scan(&n)\n    fmt.Scan(&p)\n    fmt.Scan(&q)\n    if ((p+q)/n)%2 == 0 {\n        fmt.Println(\"paul\")\n    } else {\n        fmt.Println(\"opponent\")\n    }\n}\n
n, p, q = [int(d) for d in input().split()]\n\nif ((p + q) // n) % 2 == 0:\n    print(\"paul\")\nelse:\n    print(\"opponent\")\n
"},{"location":"solutions/#peach-powder-polygon","title":"Peach Powder Polygon","text":"Solution in Python Python 
n = int(input())\nprint(\"Yes\" if n % 4 else \"No\")\n
"},{"location":"solutions/#pea-soup-and-pancakes","title":"Pea Soup and Pancakes","text":"Solution in Python Python 
found = False\nfor _ in range(int(input())):\n    k = int(input())\n\n    name = input()\n    items = [input() for _ in range(k)]\n    if \"pea soup\" in items and \"pancakes\" in items:\n        found = True\n        print(name)\n        break\n\nif not found:\n    print(\"Anywhere is fine I guess\")\n
"},{"location":"solutions/#peragrams","title":"Peragrams","text":"Solution in Python Python 
from collections import Counter\n\ns = Counter(input())\nv = [d for d in s.values() if d % 2]\nv = sorted(v)[:-1]\n\nprint(len(v))\n
"},{"location":"solutions/#perket","title":"Perket","text":"Solution in Python Python 
from itertools import combinations\n\nn = int(input())\nl = [[int(d) for d in input().split()] for _ in range(n)]\n\nc = []\nfor i in range(1, n + 1):\n    c.extend(list(combinations(l, i)))\n\nd = []\nfor i in c:\n    s, b = 1, 0\n    for x, y in i:\n        s *= x\n        b += y\n    d.append(abs(s - b))\n\nprint(min(d))\n
"},{"location":"solutions/#permuted-arithmetic-sequence","title":"Permuted Arithmetic Sequence","text":"Solution in Python Python 
def arithmetic(n):\n    d = [n[i] - n[i + 1] for i in range(len(n) - 1)]\n    return True if len(set(d)) == 1 else False\n\n\nfor _ in range(int(input())):\n    s = input().split()\n    n = [int(d) for d in s[1:]]\n    if arithmetic(n):\n        print(\"arithmetic\")\n    elif arithmetic(sorted(n)):\n        print(\"permuted arithmetic\")\n    else:\n        print(\"non-arithmetic\")\n
"},{"location":"solutions/#pervasive-heart-monitor","title":"Pervasive Heart Monitor","text":"Solution in Python Python 
while True:\n    try:\n        line = input().split()\n    except:\n        break\n\n    name, rate = [], []\n    for p in line:\n        if p.isalpha():\n            name.append(p)\n        else:\n            rate.append(float(p))\n    name = \" \".join(name)\n    rate = sum(rate) / len(rate)\n    print(f\"{rate:.6f} {name}\")\n
"},{"location":"solutions/#pet","title":"Pet","text":"Solution in Python Python 
winner, max_score = 0, 0\nfor i in range(5):\n    score = sum([int(d) for d in input().split()])\n    if score > max_score:\n        max_score = score\n        winner = i + 1\n\nprint(winner, max_score)\n
"},{"location":"solutions/#piece-of-cake","title":"Piece of Cake!","text":"Solution in Python Python 
n, h, v = [int(d) for d in input().split()]\nprint(4 * max(h * v, (n - h) * (n - v), h * (n - v), v * (n - h)))\n
"},{"location":"solutions/#pig-latin","title":"Pig Latin","text":"Solution in Python Python 
def translate(w):\n    if w[0] in \"aeiouy\":\n        return w + \"yay\"\n    else:\n        i = 1\n        while i < len(w):\n            if w[i] in \"aeiouy\":\n                break\n            i += 1\n        return w[i:] + w[:i] + \"ay\"\n\n\nwhile True:\n    try:\n        text = input()\n        print(\" \".join([translate(w) for w in text.split()]))\n    except:\n        break\n
"},{"location":"solutions/#a-vicious-pikeman-easy","title":"A Vicious Pikeman (Easy)","text":"Solution in Python Python 
def f(n, time, l):\n    total_time, penalty = 0, 0\n    for i, t in enumerate(sorted(l)):\n        if total_time + t > time:\n            return i, penalty\n        total_time += t\n        penalty = (penalty + total_time) % 1_000_000_007\n    return n, penalty\n\n\nn, t = [int(d) for d in input().split()]\na, b, c, t0 = [int(d) for d in input().split()]\nl = [t0]\nfor _ in range(n - 1):\n    l.append(((a * l[-1] + b) % c) + 1)\n\n\nn, penalty = f(n, t, l)\nprint(n, penalty)\n
"},{"location":"solutions/#pizza-crust","title":"Pizza Crust","text":"Solution in Python Python 
r, c = [int(d) for d in input().split()]\nprint(f\"{(r-c)**2 / r**2 * 100:.6f}\")\n
"},{"location":"solutions/#pizzubestun","title":"Pizzubestun","text":"Solution in Python Python 
n = int(input())\nprices = [int(input().split()[-1]) for _ in range(n)]\nif n % 2:\n    prices.append(0)\nprices = sorted(prices, reverse=True)\nprint(sum(prices[i] for i in range(0, len(prices), 2)))\n
"},{"location":"solutions/#planetaris","title":"Planetaris","text":"Solution in Python Python 
_, a = [int(d) for d in input().split()]\ne = sorted([int(d) + 1 for d in input().split()])\n\nt = 0\nfor s in e:\n    if a >= s:\n        t += 1\n        a -= s\n    else:\n        break\nprint(t)\n
"},{"location":"solutions/#planina","title":"Planina","text":"Solution in Python Python 
def p(n):\n    if n == 1:\n        return 3\n    else:\n        return p(n - 1) * 2 - 1\n\n\nn = int(input())\nprint(p(n) ** 2)\n
"},{"location":"solutions/#planting-trees","title":"Planting Trees","text":"Solution in Python Python 
n = int(input())\nt = [int(d) for d in input().split()]\n\ndays = [v + d for v, d in zip(sorted(t, reverse=True), range(1, n + 1))]\nprint(max(days) + 1)\n
"},{"location":"solutions/#pokechat","title":"Pokechat","text":"Solution in Python Python 
chars = input()\nids = input()\nids = [int(ids[i : i + 3]) - 1 for i in range(0, len(ids), 3)]\nprint(\"\".join([chars[i] for i in ids]))\n
"},{"location":"solutions/#poker-hand","title":"Poker Hand","text":"Solution in Python Python 
from collections import Counter\n\nhands = [h[0] for h in input().split()]\nprint(max(Counter(hands).values()))\n
"},{"location":"solutions/#polynomial-multiplication-1","title":"Polynomial Multiplication 1","text":"Solution in Python Python 
from collections import Counter\n\nfor _ in range(int(input())):\n    n = int(input())\n    a = [int(d) for d in input().split()]\n    m = int(input())\n    b = [int(d) for d in input().split()]\n    p = Counter()\n    for i in range(n + 1):\n        for j in range(m + 1):\n            p[i + j] += a[i] * b[j]\n    keys = max([k for k in p.keys() if p[k] != 0])\n    print(keys)\n    print(\" \".join([str(p[k]) for k in range(keys + 1)]))\n
"},{"location":"solutions/#popularity-contest","title":"Popularity Contest","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\np = [0] * n\nfor _ in range(m):\n    a, b = [int(d) - 1 for d in input().split()]\n    p[a] += 1\n    p[b] += 1\nprint(\" \".join([str(a - b) for a, b in zip(p, range(1, 1 + n))]))\n
"},{"location":"solutions/#pot","title":"Pot","text":"Solution in Python Python 
n = int(input())\ntotal = 0\nfor _ in range(n):\n    line = input()\n    n, p = int(line[:-1]), int(line[-1])\n    total += n**p\nprint(total)\n
"},{"location":"solutions/#printing-costs","title":"Printing Costs","text":"Solution in Python Python 
t = \"\"\"\n    0        !   9        \"   6        #  24        $  29        %  22\n&  24        '   3        (  12        )  12        *  17        +  13\n,   7        -   7        .   4        /  10        0  22        1  19\n2  22        3  23        4  21        5  27        6  26        7  16\n8  23        9  26        :   8        ;  11        <  10        =  14\n>  10        ?  15        @  32        A  24        B  29        C  20\nD  26        E  26        F  20        G  25        H  25        I  18\nJ  18        K  21        L  16        M  28        N  25        O  26\nP  23        Q  31        R  28        S  25        T  16        U  23\nV  19        W  26        X  18        Y  14        Z  22        [  18\n\\  10        ]  18        ^   7        _   8        `   3        a  23\nb  25        c  17        d  25        e  23        f  18        g  30\nh  21        i  15        j  20        k  21        l  16        m  22\nn  18        o  20        p  25        q  25        r  13        s  21\nt  17        u  17        v  13        w  19        x  13        y  24\nz  19        {  18        |  12        }  18        ~   9\n\"\"\"\n\nm = []\nfor row in t.splitlines():\n    if not row:\n        continue\n    values = row.split()\n    if len(values) % 2:\n        values.insert(0, \" \")\n\n    for i in range(0, len(values), 2):\n        m.append((values[i], int(values[i + 1])))\nm = dict(m)\n\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    print(sum([m[c] for c in s]))\n
"},{"location":"solutions/#provinces-and-gold","title":"Provinces and Gold","text":"Solution in Python Python 
g, s, c = [int(d) for d in input().split()]\n\nbuying = 3 * g + 2 * s + 1 * c\nresult = []\n\nif buying >= 8:\n    result.append(\"Province\")\nelif buying >= 5:\n    result.append(\"Duchy\")\nelif buying >= 2:\n    result.append(\"Estate\")\n\nif buying >= 6:\n    result.append(\"Gold\")\nelif buying >= 3:\n    result.append(\"Silver\")\nelse:\n    result.append(\"Copper\")\n\nprint(\" or \".join(result))\n
"},{"location":"solutions/#prsteni","title":"Prsteni","text":"Solution in Python Python 
import math\n\n_ = input()\nnumbers = [int(d) for d in input().split()]\n\nbase = numbers.pop(0)\n\ngcd = [math.gcd(base, n) for n in numbers]\n\nfor g, n in zip(gcd, numbers):\n    print(f\"{int(base/g)}/{int(n/g)}\")\n
"},{"location":"solutions/#prva","title":"Prva","text":"Solution in Python Python 
r, c = [int(d) for d in input().split()]\npuzzle = []\nfor _ in range(r):\n    puzzle.append(input())\n\nwords = set()\nfor row in puzzle:\n    words.update([w for w in row.split(\"#\") if len(w) > 1])\nfor i in range(c):\n    col = \"\".join([row[i] for row in puzzle])\n    words.update([w for w in col.split(\"#\") if len(w) > 1])\n\nprint(sorted(words)[0])\n
"},{"location":"solutions/#ptice","title":"Ptice","text":"Solution in Python Python 
def adrian(n):\n    if n == 0:\n        return \"\"\n    elif n == 1:\n        return \"A\"\n    elif n == 2:\n        return \"AB\"\n    elif n == 3:\n        return \"ABC\"\n    else:\n        duplicate = n // 3\n        return adrian(3) * duplicate + adrian(n % 3)\n\n\ndef bruno(n):\n    if n == 0:\n        return \"\"\n    elif n == 1:\n        return \"B\"\n    elif n == 2:\n        return \"BA\"\n    elif n == 3:\n        return \"BAB\"\n    elif n == 4:\n        return \"BABC\"\n    else:\n        duplicate = n // 4\n        return bruno(4) * duplicate + bruno(n % 4)\n\n\ndef goran(n):\n    if n == 0:\n        return \"\"\n    elif n in [1, 2]:\n        return \"C\" * n\n    elif n in [3, 4]:\n        return \"CC\" + \"A\" * (n - 2)\n    elif n in [5, 6]:\n        return \"CCAA\" + \"B\" * (n - 4)\n    else:\n        duplicate = n // 6\n        return goran(6) * duplicate + goran(n % 6)\n\n\ndef get_score(ans, guess):\n    return sum([a == g for a, g in zip(ans, guess)])\n\n\nn = int(input())\nans = input()\n\nresult = {}\nresult[\"Adrian\"] = get_score(ans, adrian(n))\nresult[\"Bruno\"] = get_score(ans, bruno(n))\nresult[\"Goran\"] = get_score(ans, goran(n))\n\nbest = max(result.values())\nprint(best)\n\nfor name, score in result.items():\n    if score == best:\n        print(name)\n
"},{"location":"solutions/#building-pyramids","title":"Building Pyramids","text":"Solution in Python Python 
n = int(input())\n\nheight = 0\nwhile True:\n    height += 1\n    blocks = (2 * height - 1) ** 2\n    if blocks > n:\n        height -= 1\n        break\n    n -= blocks\n\nprint(height)\n
"},{"location":"solutions/#quality-adjusted-life-year","title":"Quality-Adjusted Life-Year","text":"Solution in Python Python 
qaly = 0\nfor _ in range(int(input())):\n    q, y = input().split()\n    q, y = float(q), float(y)\n    qaly += q * y\nprint(qaly)\n
"},{"location":"solutions/#quadrant-selection","title":"Quadrant Selection","text":"Solutions in 4 languages GoJavaPythonRust 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x, y int\n    fmt.Scan(&x)\n    fmt.Scan(&y)\n    if x > 0 {\n        if y > 0 {\n            fmt.Println(1)\n        } else {\n            fmt.Println(4)\n        }\n    } else {\n        if y > 0 {\n            fmt.Println(2)\n        } else {\n            fmt.Println(3)\n        }\n    }\n}\n
import java.util.Scanner;\n\nclass QuadrantSelection {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int x = s.nextInt();\n        int y = s.nextInt();\n\n        if (x > 0) {\n            if (y > 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(4);\n            }\n        } else {\n            if (y > 0) {\n                System.out.println(2);\n            } else {\n                System.out.println(3);\n            }\n        }\n\n    }\n}\n
x = int(input())\ny = int(input())\nif x > 0:\n    if y > 0:\n        print(1)\n    else:\n        print(4)\nelse:\n    if y > 0:\n        print(2)\n    else:\n        print(3)\n
fn main() {\n    let mut line1 = String::new();\n    std::io::stdin().read_line(&mut line1).unwrap();\n    let x: i32 = line1.trim().parse().unwrap();\n\n    let mut line2 = String::new();\n    std::io::stdin().read_line(&mut line2).unwrap();\n    let y: i32 = line2.trim().parse().unwrap();\n\n    if x > 0 {\n        if y > 0 {\n            println!(\"1\");\n        } else {\n            println!(\"4\");\n        }\n    } else {\n        if y > 0 {\n            println!(\"2\");\n        } else {\n            println!(\"3\");\n        }\n    }\n}\n
"},{"location":"solutions/#quick-brown-fox","title":"Quick Brown Fox","text":"Solution in Python Python 
import string\n\nfor _ in range(int(input())):\n    p = set([c for c in input().lower() if c.isalpha()])\n    if len(p) == 26:\n        print(\"pangram\")\n    else:\n        print(\n            f\"missing {''.join([c for c in string.ascii_lowercase[:26] if c not in p])}\"\n        )\n
"},{"location":"solutions/#quick-estimates","title":"Quick Estimates","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass QuickEstimates {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        for (int i = 0; i < n; i++) {\n            String cost = s.next();\n            System.out.println(cost.length());\n        }\n    }\n}\n
for _ in range(int(input())):\n    print(len(input()))\n
"},{"location":"solutions/#quite-a-problem","title":"Quite a Problem","text":"Solution in Python Python 
while True:\n    try:\n        line = input()\n    except:\n        break\n\n    if \"problem\" in line.lower():\n        print(\"yes\")\n    else:\n        print(\"no\")\n
"},{"location":"solutions/#r2","title":"R2","text":"Solutions in 4 languages C++GoJavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int r1, s;\n    cin >> r1 >> s;\n    cout << 2 * s - r1 << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var r1, s int\n    fmt.Scan(&r1)\n    fmt.Scan(&s)\n    fmt.Println(2*s - r1)\n}\n
import java.util.Scanner;\n\nclass R2 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int r1 = scanner.nextInt();\n        int s = scanner.nextInt();\n        System.out.println(2 * s - r1);\n    }\n}\n
r1, s = [int(d) for d in input().split()]\nr2 = 2 * s - r1\nprint(r2)\n
"},{"location":"solutions/#racing-around-the-alphabet","title":"Racing Around the Alphabet","text":"Solution in Python Python 
import math\n\ntokens = dict([(chr(c), c - ord(\"A\") + 1) for c in range(ord(\"A\"), ord(\"Z\") + 1)])\ntokens[\" \"] = 27\ntokens[\"'\"] = 28\nt = math.pi * 60 / (28 * 15)\nfor _ in range(int(input())):\n    m = input()\n    total = 1\n    prev = m[0]\n    for c in m[1:]:\n        dist = abs(tokens[prev] - tokens[c])\n        total += 1 + t * min(dist, 28 - dist)\n        prev = c\n    print(total)\n
"},{"location":"solutions/#ragged-right","title":"Ragged Right","text":"Solution in Python Python 
l = []\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    l.append(len(s))\nm = max(l)\nprint(sum([(n - m) ** 2 for n in l[:-1]]))\n
"},{"location":"solutions/#railroad","title":"Railroad","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x, y int\n    fmt.Scan(&x)\n    fmt.Scan(&y)\n    if y%2 == 1 {\n        fmt.Println(\"impossible\")\n    } else {\n        fmt.Println(\"possible\")\n    }\n}\n
import java.util.Scanner;\n\nclass Railroad {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int x = s.nextInt();\n        int y = s.nextInt();\n        if (y % 2 == 1) {\n            System.out.println(\"impossible\");\n        } else {\n            System.out.println(\"possible\");\n        }\n    }\n}\n
_, y = [int(d) for d in input().split()]\nif y % 2:\n    print(\"impossible\")\nelse:\n    print(\"possible\")\n
"},{"location":"solutions/#a-rank-problem","title":"A Rank Problem","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\nranking = [f\"T{i}\" for i in range(1, 1 + n)]\nfor _ in range(m):\n    i, j = input().split()\n    if ranking.index(i) < ranking.index(j):\n        continue\n    ranking.remove(j)\n    ranking.insert(ranking.index(i) + 1, j)\nprint(\" \".join(ranking))\n
"},{"location":"solutions/#rating-problems","title":"Rating Problems","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass RatingProblems {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int k = s.nextInt();\n        int score = 0;\n        for (int i = 0; i < k; i++) {\n            score += s.nextInt();\n        }\n        float min = (score - 3 * (n - k)) / (float) n;\n        float max = (score + 3 * (n - k)) / (float) n;\n        System.out.println(min + \" \" + max);\n    }\n}\n
n, k = [int(d) for d in input().split()]\nscore = 0\nfor _ in range(k):\n    score += int(input())\n\nprint((score - 3 * (n - k)) / n, (score + 3 * (n - k)) / n)\n
"},{"location":"solutions/#a-rational-sequence-2","title":"A Rational Sequence 2","text":"Solution in Python Python 
def f(l, r):\n    if l == r:\n        return 1\n    elif l > r:\n        return 2 * f(l - r, r) + 1\n    else:\n        return 2 * f(l, r - l)\n\n\nfor _ in range(int(input())):\n    k, v = input().split()\n    l, r = [int(d) for d in v.split(\"/\")]\n    print(f\"{k} {f(l,r)}\")\n
"},{"location":"solutions/#scaling-recipes","title":"Scaling Recipes","text":"Solution in Python Python 
for i in range(int(input())):\n    r, p, d = [int(d) for d in input().split()]\n    recipe = {}\n    main = None\n    for _ in range(r):\n        name, weight, percent = input().split()\n        weight = float(weight)\n        percent = float(percent)\n        if percent == 100.0:\n            main = name\n        recipe[name] = (weight, percent)\n    scale = d / p\n    print(f\"Recipe # {i+1}\")\n    dw = recipe[main][0] * scale\n    for k in recipe:\n        print(k, f\"{recipe[k][1] * dw / 100:.1f}\")\n    print(\"-\" * 40)\n
"},{"location":"solutions/#recount","title":"Recount","text":"Solution in Python Python 
from collections import Counter\n\nc = Counter()\nwhile True:\n    try:\n        name = input()\n    except:\n        break\n    c[name] += 1\n\nhighest = max(c.values())\nnames = [k for k in c if c[k] == highest]\nprint(\"Runoff!\" if len(names) > 1 else names.pop())\n
"},{"location":"solutions/#rectangle-area","title":"Rectangle Area","text":"Solution in Python Python 
x1, y1, x2, y2 = [float(d) for d in input().split()]\n\nprint(abs((x1 - x2) * (y1 - y2)))\n
"},{"location":"solutions/#reduced-id-numbers","title":"Reduced ID Numbers","text":"Solution in Python Python 
g = int(input())\nids = []\nfor _ in range(g):\n    ids.append(int(input()))\n\nm = 1\nwhile True:\n    v = [d % m for d in ids]\n    if g == len(set(v)):\n        break\n    m += 1\n\nprint(m)\n
"},{"location":"solutions/#relocation","title":"Relocation","text":"Solution in Python Python 
n, q = [int(d) for d in input().split()]\nx = [int(d) for d in input().split()]\nfor _ in range(q):\n    req = [int(d) for d in input().split()]\n    if req[0] == 1:\n        x[req[1] - 1] = req[2]\n    elif req[0] == 2:\n        print(abs(x[req[1] - 1] - x[req[2] - 1]))\n
"},{"location":"solutions/#restaurant-opening","title":"Restaurant Opening","text":"Solution in Python Python 
from itertools import product\n\nn, m = [int(d) for d in input().split()]\n\ng = []\nfor _ in range(n):\n    g.append([int(d) for d in input().split()])\n\nl = list(product(range(n), range(m)))\n\nc = []\nfor i, j in l:\n    s = 0\n    for a, b in l:\n        s += g[a][b] * (abs(i - a) + abs(j - b))\n    c.append(s)\n\nprint(min(c))\n
"},{"location":"solutions/#reversed-binary-numbers","title":"Reversed Binary Numbers","text":"Solution in Python Python 
n = int(input())\n\nb = []\nwhile n:\n    b.append(n % 2)\n    n //= 2\n\nprint(sum([d * (2**p) for d, p in zip(b, reversed(range(len(b))))]))\n
"},{"location":"solutions/#reverse-rot","title":"Reverse Rot","text":"Solution in Python Python 
import string\n\nrotations = string.ascii_uppercase + \"_.\"\n\n\ndef rotate(c, n):\n    index = (rotations.index(c) + n) % 28\n    return rotations[index]\n\n\nwhile True:\n    line = input()\n    if line == \"0\":\n        break\n    n, m = line.split()\n    n = int(n)\n    print(\"\".join([rotate(c, n) for c in m[::-1]]))\n
"},{"location":"solutions/#rijeci","title":"Rije\u010di","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    a := 1\n    b := 0\n    for i := 0; i < n; i++ {\n        a, b = b, b+a\n    }\n    fmt.Println(a, b)\n}\n
import java.util.Scanner;\n\nclass Rijeci {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int k = s.nextInt();\n        int a = 1;\n        int b = 0;\n        for (int i = 0; i < k; i++) {\n            int t = b;\n            b = a + b;\n            a = t;\n\n        }\n\n        System.out.println(a + \" \" + b);\n    }\n}\n
k = int(input())\na, b = 1, 0\nfor _ in range(k):\n    a, b = b, b + a\n\nprint(a, b)\n
"},{"location":"solutions/#roaming-romans","title":"Roaming Romans","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x float64\n    fmt.Scan(&x)\n    fmt.Println(int(x*1000*5280/4854 + 0.5))\n}\n
x = float(input())\nprint(int(x * 1000 * 5280 / 4854 + 0.5))\n
"},{"location":"solutions/#run-length-encoding-run","title":"Run-Length Encoding, Run!","text":"Solution in Python Python 
action, s = input().split()\nif action == \"D\":\n    print(\"\".join([s[i] * int(s[i + 1]) for i in range(0, len(s), 2)]))\nelif action == \"E\":\n    parts = []\n    prev, t = s[0], 1\n    for c in s[1:]:\n        if c != prev:\n            parts.append((prev, t))\n            t = 1\n            prev = c\n        else:\n            t += 1\n    parts.append((prev, t))\n\n    print(\"\".join([f\"{k}{v}\" for k, v in parts]))\n
"},{"location":"solutions/#same-digits-easy","title":"Same Digits (Easy)","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\npairs = []\nfor x in range(a, b + 1):\n    for y in range(x, b + 1):\n        xy = x * y\n        if sorted(str(xy)) == sorted(str(x) + str(y)):\n            pairs.append((x, y, xy))\nprint(f\"{len(pairs)} digit-preserving pair(s)\")\nfor x, y, xy in pairs:\n    print(f\"x = {x}, y = {y}, xy = {xy}\")\n
"},{"location":"solutions/#same-digits-hard","title":"Same Digits (Hard)","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\npairs = []\nfor x in range(a, b + 1):\n    for y in range(x, b + 1):\n        xy = x * y\n        if x * y > b:\n            break\n        if sorted(str(xy)) == sorted(str(x) + str(y)):\n            pairs.append((x, y, xy))\n    if x * x > b:\n        break\n\nprint(f\"{len(pairs)} digit-preserving pair(s)\")\nfor x, y, xy in pairs:\n    print(f\"x = {x}, y = {y}, xy = {xy}\")\n
"},{"location":"solutions/#saving-daylight","title":"Saving Daylight","text":"Solution in Python Python 
while True:\n    try:\n        s = input().split()\n    except:\n        break\n\n    t1, t2 = s[-2:]\n\n    h1, m1 = [int(d) for d in t1.split(\":\")]\n    h2, m2 = [int(d) for d in t2.split(\":\")]\n\n    mins = (h2 - h1) * 60 + (m2 - m1)\n    h = mins // 60\n    m = mins % 60\n\n    ans = s[:-2]\n    ans.extend([str(h), \"hours\", str(m), \"minutes\"])\n\n    print(\" \".join(ans))\n
"},{"location":"solutions/#saving-for-retirement","title":"Saving For Retirement","text":"Solution in Python Python 
import math\n\nB, Br, Bs, A, As = [int(d) for d in input().split()]\nrate = Bs * (Br - B) / As\nAr = math.ceil(rate) + A\nif rate.is_integer():\n    Ar += 1\nprint(Ar)\n
"},{"location":"solutions/#scaling-recipe","title":"Scaling Recipe","text":"Solution in Python Python 
import math\n\nn, x, y = [int(d) for d in input().split()]\ni = [int(input()) for _ in range(n)]\n\n# for python 3.9+ (https://docs.python.org/3.9/library/math.html#math.gcd)\n# s = math.gcd(x, *i)\n\ns = math.gcd(x, i[0])\nfor k in range(1, n):\n    s = math.gcd(s, i[k])\n\nx /= s\ni = [v / s for v in i]\n\nscale = y / x\nfor v in i:\n    print(int(scale * v))\n
"},{"location":"solutions/#school-spirit","title":"School Spirit","text":"Solution in Python Python 
n = int(input())\ns = []\nfor _ in range(n):\n    s.append(int(input()))\n\n\ndef group_score(s):\n    gs = 0\n    for i in range(len(s)):\n        gs += s[i] * (0.8**i)\n    return 0.2 * gs\n\n\nprint(group_score(s))\nnew_gs = []\nfor i in range(n):\n    new_gs.append(group_score([s[j] for j in range(n) if j != i]))\nprint(sum(new_gs) / len(new_gs))\n
"},{"location":"solutions/#secret-message","title":"Secret Message","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    m = input()\n    k = math.ceil(len(m) ** 0.5)\n\n    m += \"*\" * (k * k - len(m))\n    rows = [m[i : i + k] for i in range(0, len(m), k)]\n\n    s = []\n    for i in range(k):\n        s.append(\"\".join([row[i] for row in rows if row[i] != \"*\"][::-1]))\n    print(\"\".join(s))\n
"},{"location":"solutions/#secure-doors","title":"Secure Doors","text":"Solution in Python Python 
pool = set()\nfor _ in range(int(input())):\n    action, name = input().split()\n    if action == \"entry\":\n        print(name, \"entered\", \"(ANOMALY)\" if name in pool else \"\")\n        pool.add(name)\n    elif action == \"exit\":\n        print(name, \"exited\", \"(ANOMALY)\" if name not in pool else \"\")\n        pool.discard(name)\n
"},{"location":"solutions/#server","title":"Server","text":"Solution in Python Python 
_, t = [int(d) for d in input().split()]\ntotal, used = 0, 0\nfor v in [int(d) for d in input().split()]:\n    if used + v <= t:\n        total += 1\n        used += v\n    else:\n        break\nprint(total)\n
"},{"location":"solutions/#seven-wonders","title":"Seven Wonders","text":"Solution in Python Python 
from collections import Counter\n\nc = Counter(input())\nscore = 0\nfor value in c.values():\n    score += value**2\nif len(c.values()) == 3:\n    score += 7 * min(c.values())\nprint(score)\n
"},{"location":"solutions/#shattered-cake","title":"Shattered Cake","text":"Solution in Python Python 
w, n = int(input()), int(input())\ntotal = 0\nfor _ in range(n):\n    _w, _l = [int(d) for d in input().split()]\n    total += _w * _l\nprint(int(total / w))\n
"},{"location":"solutions/#shopaholic","title":"Shopaholic","text":"Solution in Python Python 
n = int(input())\nc = [int(d) for d in input().split()]\n\nc = sorted(c, reverse=True)\ngroups = [c[i : i + 3] if i + 3 < n else c[i:] for i in range(0, n, 3)]\n\nprint(sum(g[-1] if len(g) == 3 else 0 for g in groups))\n
"},{"location":"solutions/#shopping-list-easy","title":"Shopping List (Easy)","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\nitems = []\nfor _ in range(n):\n    items.append(set(input().split()))\n\nans = items[0]\nans = ans.intersection(*items[1:])\n\nprint(len(ans))\nprint(\"\\n\".join(sorted(list(ans))))\n
"},{"location":"solutions/#sibice","title":"Sibice","text":"Solution in Python Python 
import math\n\nn, w, h = [int(d) for d in input().split()]\nfor _ in range(n):\n    line = int(input())\n    if line <= math.sqrt(w**2 + h**2):\n        print(\"DA\")\n    else:\n        print(\"NE\")\n
"},{"location":"solutions/#sideways-sorting","title":"Sideways Sorting","text":"Solution in Python Python 
while True:\n    r, c = [int(d) for d in input().split()]\n    if not r and not c:\n        break\n    s = []\n    for _ in range(r):\n        s.append(input())\n    items = []\n    for i in range(c):\n        items.append(\"\".join(s[j][i] for j in range(r)))\n    items = sorted(items, key=lambda t: t.lower())\n    for i in range(r):\n        print(\"\".join(items[j][i] for j in range(c)))\n
"},{"location":"solutions/#digit-product","title":"Digit Product","text":"Solution in Python Python 
def digit_product(x):\n    ans = 1\n    while x:\n        ans *= x % 10 or 1\n        x //= 10\n    return ans\n\n\nx = int(input())\nwhile True:\n    x = digit_product(x)\n    if x < 10:\n        break\nprint(x)\n
"},{"location":"solutions/#simon-says","title":"Simon Says","text":"Solution in Python Python 
for _ in range(int(input())):\n    command = input()\n    start = \"simon says \"\n    if command.startswith(start):\n        print(command[len(start) :])\n    else:\n        print()\n
"},{"location":"solutions/#simone","title":"Simone","text":"Solution in Python Python 
from collections import Counter\n\nn, k = [int(d) for d in input().split()]\n\ns = Counter(int(d) for d in input().split())\n\nleast = min(s.values())\nif len(s.values()) < k:\n    least = 0\nans = 0\nc = []\nfor i in range(k):\n    if s[i + 1] == least:\n        c.append(str(i + 1))\n        ans += 1\nprint(ans)\nprint(\" \".join(c))\n
"},{"location":"solutions/#simon-says_1","title":"Simon Says","text":"Solution in Python Python 
for _ in range(int(input())):\n    command = input()\n    start = \"Simon says \"\n    if command.startswith(start):\n        print(command[len(start) :])\n
"},{"location":"solutions/#simple-addition","title":"Simple Addition","text":"Solution in Python Python 
a, b = input(), input()\n\na = a[::-1]\nb = b[::-1]\ni = 0\nans = \"\"\ncarry = 0\nwhile i < len(a) or i < len(b):\n    if i < len(a) and i < len(b):\n        s = int(a[i]) + int(b[i]) + carry\n\n    elif i < len(a):\n        s = int(a[i]) + carry\n\n    else:\n        s = int(b[i]) + carry\n    ans += str(s % 10)\n    carry = s // 10\n    i += 1\nif carry:\n    ans += str(carry)\nprint(ans[::-1])\n\n# or simply\n# print(int(a) + int(b))\n
"},{"location":"solutions/#simple-factoring","title":"Simple Factoring","text":"Solution in Python Python 
for _ in range(int(input())):\n    a, b, c = [int(d) for d in input().split()]\n    import math\n\n    if not b**2 - 4 * a * c < 0 and math.sqrt(b**2 - 4 * a * c).is_integer():\n        print(\"YES\")\n    else:\n        print(\"NO\")\n
"},{"location":"solutions/#sith","title":"Sith","text":"Solution in Python Python 
_ = input()\na = int(input())\nb = int(input())\ndiff = int(input())\nif diff <= 0:\n    print(\"JEDI\")\nelif a < b:\n    print(\"SITH\")\nelse:\n    print(\"VEIT EKKI\")\n
"},{"location":"solutions/#sjecista","title":"Sjecista","text":"Solution in Python Python 
n = int(input())\nprint((n - 3) * (n - 2) * (n - 1) * (n) // 24)\n
"},{"location":"solutions/#skener","title":"Skener","text":"Solution in Python Python 
r, _, zr, zc = [int(d) for d in input().split()]\nmatrix = []\nfor _ in range(r):\n    matrix.append(input())\n\nans = []\n\nfor row in matrix:\n    for i in range(zr):\n        ans.append(row)\n\nfor row in ans:\n    print(\"\".join([col * zc for col in row]))\n
"},{"location":"solutions/#skocimis","title":"Skocimis","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b, c int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Scan(&c)\n    x := b - a\n    y := c - b\n    ans := x\n    if ans < y {\n        ans = y\n    }\n    ans -= 1\n    fmt.Println(ans)\n}\n
a, b, c = [int(d) for d in input().split()]\nprint(max(b - a, c - b) - 1)\n
"},{"location":"solutions/#turn-it-up","title":"Turn It Up!","text":"Solution in Python Python 
volume = 7\nfor _ in range(int(input())):\n    if input() == \"Skru op!\":\n        volume = min(volume + 1, 10)\n    else:\n        volume = max(volume - 1, 0)\nprint(volume)\n
"},{"location":"solutions/#slatkisi","title":"Slatkisi","text":"Solution in Python Python 
c, k = [int(d) for d in input().split()]\nd = 10**k\nc = (c // d) * d + (d if (c % d) / d >= 0.5 else 0)\nprint(c)\n
"},{"location":"solutions/#smil","title":"SMIL","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass SMIL {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String m = s.nextLine();\n        int size = m.length();\n        int i = 0;\n        while (i < size) {\n            if (m.charAt(i) == ':' || m.charAt(i) == ';') {\n                if (i + 1 < size && m.charAt(i + 1) == ')') {\n                    System.out.println(i);\n                    i += 2;\n                    continue;\n                }\n                if (i + 2 < size && m.charAt(i + 1) == '-' && m.charAt(i + 2) == ')') {\n                    System.out.println(i);\n                    i += 3;\n                    continue;\n                }\n            }\n            i += 1;\n        }\n    }\n}\n
s = input()\n\ni = 0\nsize = len(s)\nwhile i < size:\n    if s[i] in [\":\", \";\"]:\n        if i + 1 < size and s[i + 1] == \")\":\n            print(i)\n            i += 2\n            continue\n        if i + 2 < size and s[i + 1] == \"-\" and s[i + 2] == \")\":\n            print(i)\n            i += 3\n            continue\n\n    i += 1\n
"},{"location":"solutions/#soda-slurper","title":"Soda Slurper","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var e, f, c int\n    fmt.Scan(&e)\n    fmt.Scan(&f)\n    fmt.Scan(&c)\n    total := 0\n    s := e + f\n    for s >= c {\n        total += s / c\n        s = s%c + s/c\n    }\n    fmt.Println(total)\n}\n
e, f, c = [int(d) for d in input().split()]\ntotal = 0\ns = e + f\nwhile s >= c:\n    total += s // c\n    s = s % c + s // c\nprint(total)\n
"},{"location":"solutions/#sok","title":"Sok","text":"Solution in Python Python 
a, b, c = [int(d) for d in input().split()]\ni, j, k = [int(d) for d in input().split()]\ns = min(a / i, b / j, c / k)\nprint(a - i * s, b - j * s, c - k * s)\n
"},{"location":"solutions/#some-sum","title":"Some Sum","text":"Solution in Python Python 
n = int(input())\nif n == 1:\n    print(\"Either\")\nelif n == 2:\n    print(\"Odd\")\nelif n % 2 == 0:\n    print(\"Even\" if (n / 2) % 2 == 0 else \"Odd\")\nelse:\n    print(\"Either\")\n
"},{"location":"solutions/#sort","title":"Sort","text":"Solution in Python Python 
from collections import Counter\n\nn, c = [int(d) for d in input().split()]\nnum = [int(d) for d in input().split()]\n\nfreq = Counter(num)\nprint(\n    \" \".join(\n        [\n            str(d)\n            for d in sorted(\n                num, key=lambda k: (freq[k], n - num.index(k)), reverse=True\n            )\n        ]\n    )\n)\n
"},{"location":"solutions/#sort-of-sorting","title":"Sort of Sorting","text":"Solution in Python Python 
first = True\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    else:\n        if not first:\n            print()\n    first = False\n    names = []\n    for _ in range(n):\n        names.append(input())\n    print(\"\\n\".join(sorted(names, key=lambda k: k[:2])))\n
"},{"location":"solutions/#sort-two-numbers","title":"Sort Two Numbers","text":"Solutions in 3 languages C++GoPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a = 0, b = 0;\n    cin >> a >> b;\n    if (a < b)\n    {\n        cout << a << \" \" << b;\n    }\n    else\n    {\n        cout << b << \" \" << a;\n    }\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    if a < b {\n        fmt.Printf(\"%d %d\\n\", a, b)\n    } else {\n        fmt.Printf(\"%d %d\\n\", b, a)\n    }\n}\n
line = input()\na, b = [int(d) for d in line.split()]\nif a < b:\n    print(a, b)\nelse:\n    print(b, a)\n
"},{"location":"solutions/#sottkvi","title":"S\u00f3ttkv\u00ed","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass Sottkvi {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int k = s.nextInt();\n        int today = s.nextInt();\n        int ans = 0;\n        for (int i = 0; i < n; i++) {\n            int d = s.nextInt();\n            if (d + 14 - today <= k) {\n                ans += 1;\n            }\n        }\n        System.out.println(ans);\n\n    }\n}\n
n, k, today = [int(d) for d in input().split()]\nres = 0\nfor _ in range(n):\n    d = int(input())\n    if d + 14 - today <= k:\n        res += 1\nprint(res)\n
"},{"location":"solutions/#soylent","title":"Soylent","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    n = int(input())\n    print(math.ceil(n / 400))\n
"},{"location":"solutions/#space-race","title":"Space Race","text":"Solution in Python Python 
n = int(input())\n_ = input()\nd = {}\nfor _ in range(n):\n    entry = input().split()\n    d[entry[0]] = float(entry[-1])\n\nprint(min(d, key=lambda k: d[k]))\n
"},{"location":"solutions/#spavanac","title":"Spavanac","text":"Solutions in 3 languages C++JavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int h, m;\n    cin >> h >> m;\n\n    int mm = m - 45;\n    int borrow = 0;\n    if (mm < 0)\n    {\n        mm += 60;\n        borrow = 1;\n    }\n    int hh = h - borrow;\n    if (hh < 0)\n    {\n        hh += 24;\n    }\n    cout << hh << \" \" << mm << endl;\n    return 0;\n}\n
import java.util.Scanner;\n\nclass Spavanac {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int h = s.nextInt();\n        int m = s.nextInt();\n\n        int mm = m - 45;\n        int borrow = 0;\n        if (mm < 0) {\n            mm += 60;\n            borrow = 1;\n        }\n\n        int hh = h - borrow;\n        if (hh < 0) {\n            hh += 24;\n        }\n        System.out.println(hh + \" \" + mm);\n    }\n}\n
h, m = [int(d) for d in input().split()]\n\nmm = m - 45\n\nborrow = 0\nif mm < 0:\n    mm += 60\n    borrow = 1\n\nhh = h - borrow\nif hh < 0:\n    hh += 24\n\nprint(hh, mm)\n
"},{"location":"solutions/#speeding","title":"Speeding","text":"Solution in Python Python 
n = int(input())\nmile, time, max_speed = 0, 0, 0\nfor _ in range(n):\n    t, s = [int(d) for d in input().split()]\n    if not t and not s:\n        continue\n    speed = int((s - mile) / (t - time))\n    if speed > max_speed:\n        max_speed = speed\n    mile, time = s, t\nprint(max_speed)\n
"},{"location":"solutions/#speed-limit","title":"Speed Limit","text":"Solution in Python Python 
while True:\n    n = int(input())\n    if n == -1:\n        break\n    miles = 0\n    elapsed = 0\n    for _ in range(n):\n        s, t = [int(d) for d in input().split()]\n        miles += s * (t - elapsed)\n        elapsed = t\n    print(f\"{miles} miles\")\n
"},{"location":"solutions/#spelling-bee","title":"Spelling Bee","text":"Solution in Python Python 
hexagon = input()\nc = hexagon[0]\nhexagon = set(list(hexagon))\nn = int(input())\nvalid = []\nfor _ in range(n):\n    w = input()\n    if c in w and len(w) >= 4 and set(list(w)) <= hexagon:\n        valid.append(w)\nprint(\"\\n\".join(valid))\n
"},{"location":"solutions/#spritt","title":"Spritt","text":"Solution in Python Python 
n, x = [int(d) for d in input().split()]\nfor _ in range(n):\n    x -= int(input())\n    if x < 0:\n        print(\"Neibb\")\n        break\nif x >= 0:\n    print(\"Jebb\")\n
"},{"location":"solutions/#square-peg","title":"Square Peg","text":"Solution in Python Python 
l, r = [int(d) for d in input().split()]\nif 2 * (l / 2) ** 2 <= r**2:\n    print(\"fits\")\nelse:\n    print(\"nope\")\n
"},{"location":"solutions/#stafur","title":"Stafur","text":"Solution in Python Python 
l = input()\nif l in \"AEIOU\":\n    print(\"Jebb\")\nelif l == \"Y\":\n    print(\"Kannski\")\nelse:\n    print(\"Neibb\")\n
"},{"location":"solutions/#statistics","title":"Statistics","text":"Solution in Python Python 
case_num = 0\nwhile True:\n    try:\n        line = input()\n    except:\n        break\n    case_num += 1\n    numbers = [int(d) for d in line.split()[1:]]\n    print(f\"Case {case_num}: {min(numbers)} {max(numbers)} {max(numbers)-min(numbers)}\")\n
"},{"location":"solutions/#sticky-keys","title":"Sticky Keys","text":"Solution in Python Python 
message = input()\n\nl = [message[0]]\nfor i in message[1:]:\n    if i != l[-1]:\n        l.append(i)\nprint(\"\".join(l))\n
"},{"location":"solutions/#messy-lists","title":"Messy lists","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()]\ns = sorted(a)\nprint(sum([i != j for i, j in zip(a, s)]))\n
"},{"location":"solutions/#stopwatch","title":"Stopwatch","text":"Solution in Python Python 
n = int(input())\ntimes = []\nfor _ in range(n):\n    times.append(int(input()))\nif n % 2:\n    print(\"still running\")\nelse:\n    seconds = 0\n    for i in range(0, n, 2):\n        seconds += times[i + 1] - times[i]\n    print(seconds)\n
"},{"location":"solutions/#streets-ahead","title":"Streets Ahead","text":"Solution in Python Python 
n, q = [int(d) for d in input().split()]\n\ns = {}\nfor i in range(n):\n    s[input()] = i\n\nfor _ in range(q):\n    a, b = input().split()\n    print(abs(s[a] - s[b]) - 1)\n
"},{"location":"solutions/#successful-zoom","title":"Successful Zoom","text":"Solution in Python Python 
n = int(input())\nx = [int(d) for d in input().split()]\nfound = False\nfor k in range(1, n // 2 + 1):\n    v = [x[i] for i in range(k - 1, n, k)]\n    if all([v[i] < v[i + 1] for i in range(len(v) - 1)]):\n        print(k)\n        found = True\n        break\nif not found:\n    print(\"ABORT!\")\n
"},{"location":"solutions/#sum-kind-of-problem","title":"Sum Kind of Problem","text":"Solution in Python Python 
for _ in range(int(input())):\n    k, n = [int(d) for d in input().split()]\n    s1 = sum(range(1, n + 1))\n    s2 = sum(range(1, 2 * n + 1, 2))\n    s3 = sum(range(2, 2 * (n + 1), 2))\n    print(k, s1, s2, s3)\n
"},{"location":"solutions/#sum-of-the-others","title":"Sum of the Others","text":"Solution in Python Python 
while True:\n    try:\n        n = [int(d) for d in input().split()]\n    except:\n        break\n\n    for i in range(len(n)):\n        if n[i] == sum([n[j] for j in range(len(n)) if j != i]):\n            print(n[i])\n            break\n
"},{"location":"solutions/#sum-squared-digits-function","title":"Sum Squared Digits Function","text":"Solution in Python Python 
for _ in range(int(input())):\n    k, b, n = [int(d) for d in input().split()]\n    ssd = 0\n    while n:\n        ssd += (n % b) ** 2\n        n //= b\n    print(k, ssd)\n
"},{"location":"solutions/#sun-and-moon","title":"Sun and Moon","text":"Solution in Python Python 
sun_years_ago, sun_cycle = [int(v) for v in input().split()]\nmoon_years_ago, moon_cycle = [int(v) for v in input().split()]\n\nfor t in range(1, 5001):\n    if (t + sun_years_ago) % sun_cycle == 0 and (t + moon_years_ago) % moon_cycle == 0:\n        print(t)\n        break\n
"},{"location":"solutions/#symmetric-order","title":"Symmetric Order","text":"Solution in Python Python 
set_num = 0\nwhile True:\n    size = int(input())\n    if size == 0:\n        break\n\n    names = []\n    for _ in range(size):\n        names.append(input())\n\n    set_num += 1\n    print(f\"SET {set_num}\")\n\n    top, bottom = [], []\n    for i in range(1, size, 2):\n        bottom.append(names[i])\n    for i in range(0, size, 2):\n        top.append(names[i])\n    names = top + bottom[::-1]\n    for name in names:\n        print(name)\n
"},{"location":"solutions/#synchronizing-lists","title":"Synchronizing Lists","text":"Solution in Python Python 
while True:\n    n = int(input())\n    if not n:\n        break\n    a, b = [], []\n    for _ in range(n):\n        a.append(int(input()))\n    for _ in range(n):\n        b.append(int(input()))\n    mapping = dict(zip(sorted(a), sorted(b)))\n    for key in a:\n        print(mapping[key])\n    print()\n
"},{"location":"solutions/#t9-spelling","title":"T9 Spelling","text":"Solution in Python Python 
n = int(input())\nmapping = {\n    \"2\": \"abc\",\n    \"3\": \"def\",\n    \"4\": \"ghi\",\n    \"5\": \"jkl\",\n    \"6\": \"mno\",\n    \"7\": \"pqrs\",\n    \"8\": \"tuv\",\n    \"9\": \"wxyz\",\n    \"0\": \" \",\n}\n\nfor i in range(n):\n    ans = []\n    prev = \"\"\n    for c in input():\n        for d, r in mapping.items():\n            if c in r:\n                if d == prev:\n                    ans.append(\" \")\n                ans.append(d * (r.index(c) + 1))\n                prev = d\n                break\n    print(f\"Case #{i+1}: {''.join(ans)}\")\n
"},{"location":"solutions/#tais-formula","title":"Tai's formula","text":"Solution in Python Python 
n = int(input())\nt1, v1 = [float(d) for d in input().split()]\ntotal = 0\nfor _ in range(n - 1):\n    t2, v2 = [float(d) for d in input().split()]\n    total += (v1 + v2) * (t2 - t1) / 2\n    t1, v1 = t2, v2\ntotal /= 1000\nprint(total)\n
"},{"location":"solutions/#tajna","title":"Tajna","text":"Solution in Python Python 
s = input()\n\nl = len(s)\nr = int(l**0.5)\nwhile l % r:\n    r -= 1\nc = l // r\n\nparts = [s[i : i + r] for i in range(0, l, r)]\n\nprint(\"\".join([\"\".join([row[i] for row in parts]) for i in range(r)]))\n
"},{"location":"solutions/#tarifa","title":"Tarifa","text":"Solution in Python Python 
x = int(input())\nn = int(input())\nused = 0\nfor _ in range(n):\n    used += int(input())\nprint(x * (n + 1) - used)\n
"},{"location":"solutions/#temperature-confusion","title":"Temperature Confusion","text":"Solution in Python Python 
import math\n\na, b = [int(d) for d in input().split(\"/\")]\nx, y = 5 * a - 160 * b, 9 * b\ngcd = math.gcd(x, y)\nx //= gcd\ny //= gcd\n\nprint(f\"{x}/{y}\")\n
"},{"location":"solutions/#test-drive","title":"Test Drive","text":"Solution in Python Python 
a, b, c = [int(d) for d in input().split()]\nx, y = b - a, c - b\nif x == y:\n    print(\"cruised\")\nelif x * y < 0:\n    print(\"turned\")\nelif abs(y) > abs(x):\n    print(\"accelerated\")\nelse:\n    print(\"braked\")\n
"},{"location":"solutions/#tetration","title":"Tetration","text":"Solution in Python Python 
import math\n\nn = float(input())\nprint(f\"{math.pow(n,1/n):.6f}\")\n
"},{"location":"solutions/#thanos","title":"Thanos","text":"Solution in Python Python 
for _ in range(int(input())):\n    p, r, f = [int(d) for d in input().split()]\n    y = 0\n    while p <= f:\n        p *= r\n        y += 1\n    print(y)\n
"},{"location":"solutions/#the-grand-adventure","title":"The Grand Adventure","text":"Solution in Python Python 
mapping = {\"b\": \"$\", \"t\": \"|\", \"j\": \"*\"}\nfor _ in range(int(input())):\n    a = input()\n    bag = []\n    early_fail = False\n    for i in a:\n        if i in mapping.values():\n            bag.append(i)\n        elif i in mapping:\n            if not bag or bag.pop() != mapping[i]:\n                print(\"NO\")\n                early_fail = True\n                break\n    if not early_fail:\n        print(\"YES\" if not bag else \"NO\")\n
"},{"location":"solutions/#the-last-problem","title":"The Last Problem","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"os\"\n)\n\nfunc main() {\n    scanner := bufio.NewScanner(os.Stdin)\n    scanner.Scan()\n    s := scanner.Text()\n    fmt.Println(\"Thank you,\", s+\",\", \"and farewell!\")\n}\n
print(f\"Thank you, {input()}, and farewell!\")\n
"},{"location":"solutions/#this-aint-your-grandpas-checkerboard","title":"This Ain't Your Grandpa's Checkerboard","text":"Solution in Python Python 
n = int(input())\nb = []\nfor _ in range(n):\n    b.append(input())\n\n\ndef check(b, n):\n    for row in b:\n        if row.count(\"W\") != row.count(\"B\"):\n            return False\n\n        for j in range(0, n - 3):\n            if row[j] == row[j + 1] == row[j + 2]:\n                return False\n\n    for i in range(n):\n        col = [\"\".join(row[i]) for row in b]\n\n        if col.count(\"W\") != col.count(\"B\"):\n            return False\n\n        for j in range(0, n - 3):\n            if col[j] == col[j + 1] == col[j + 2]:\n                return False\n\n    return True\n\n\nvalid = check(b, n)\nprint(1 if valid else 0)\n
"},{"location":"solutions/#stuck-in-a-time-loop","title":"Stuck In A Time Loop","text":"Solutions in 2 languages C++Python 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a;\n    cin >> a;\n    for (int i = 0; i < a; i++)\n    {\n        cout << i + 1 << \" Abracadabra\" << endl;\n    }\n}\n
n = int(input())\nfor i in range(n):\n    print(f\"{i+1} Abracadabra\")\n
"},{"location":"solutions/#title-cost","title":"Title Cost","text":"Solution in Python Python 
s, c = input().split()\nc = float(c)\nprint(min(c, len(s)))\n
"},{"location":"solutions/#toflur","title":"T\u00f6flur","text":"Solution in Python Python 
n = int(input())\na = sorted([int(d) for d in input().split()])\nscore = sum([(a[j] - a[j + 1]) ** 2 for j in range(n - 1)])\nprint(score)\n
"},{"location":"solutions/#toilet-seat","title":"Toilet Seat","text":"Solution in Python Python 
t = input()\n\n\ndef u(pos, preference):\n    if pos == preference == \"U\":\n        return 0\n    elif pos == preference == \"D\":\n        return 1\n    elif pos == \"U\" and preference == \"D\":\n        return 2\n    else:\n        return 1\n\n\ndef l(pos, preference):\n    if pos == preference == \"U\":\n        return 1\n    elif pos == preference == \"D\":\n        return 0\n    elif pos == \"U\" and preference == \"D\":\n        return 1\n    else:\n        return 2\n\n\ndef b(pos, preference):\n    if pos == preference:\n        return 0\n    else:\n        return 1\n\n\npu = [u(pos, preference) for pos, preference in zip(t[0] + \"U\" * (len(t) - 2), t[1:])]\npl = [l(pos, preference) for pos, preference in zip(t[0] + \"D\" * (len(t) - 2), t[1:])]\npb = [b(pos, preference) for pos, preference in zip(t[0] + t[1:-1], t[1:])]\n\nprint(sum(pu))\nprint(sum(pl))\nprint(sum(pb))\n
"},{"location":"solutions/#tolower","title":"ToLower","text":"Solution in Python Python 
p, t = [int(d) for d in input().split()]\nscore = 0\nfor _ in range(p):\n    solved = True\n    for _ in range(t):\n        s = input()\n        if solved:\n            s = s[0].lower() + s[1:]\n            if s.lower() == s:\n                continue\n        solved = False\n    if solved:\n        score += 1\nprint(score)\n
"},{"location":"solutions/#tower-construction","title":"Tower Construction","text":"Solution in Python Python 
_ = input()\nn = 0\ntop = 0\nfor d in [int(d) for d in input().split()]:\n    if not top or d > top:\n        n += 1\n    top = d\n\nprint(n)\n
"},{"location":"solutions/#touchscreen-keyboard","title":"Touchscreen Keyboard","text":"Solution in Python Python 
k = [\n    \"qwertyuiop\",\n    \"asdfghjkl\",\n    \"zxcvbnm\",\n]\n\n\ndef d(a, b):\n    for r1 in range(3):\n        if a in k[r1]:\n            c1 = k[r1].index(a)\n            break\n    for r2 in range(3):\n        if b in k[r2]:\n            c2 = k[r2].index(b)\n            break\n\n    return abs(c1 - c2) + abs(r1 - r2)\n\n\nfor _ in range(int(input())):\n    x, n = input().split()\n    n, w = int(n), []\n\n    for _ in range(n):\n        y = input()\n        dist = sum([d(a, b) for a, b in zip(list(x), list(y))])\n        w.append([y, dist])\n\n    print(\"\\n\".join([f\"{k} {v}\" for k, v in sorted(w, key=lambda k: (k[1], k[0]))]))\n
"},{"location":"solutions/#transit-woes","title":"Transit Woes","text":"Solution in Python Python 
s, t, n = [int(d) for d in input().split()]\nds = [int(d) for d in input().split()]\nbs = [int(d) for d in input().split()]\ncs = [int(d) for d in input().split()]\n\nfor i in range(n):\n    s += ds[i]\n    if not s % cs[i]:\n        wait_b = 0\n    else:\n        wait_b = cs[i] - s % cs[i]\n    s += wait_b + bs[i]\n\ns += ds[n]\n\nif s <= t:\n    print(\"yes\")\nelse:\n    print(\"no\")\n
"},{"location":"solutions/#tri","title":"Tri","text":"Solution in Python Python 
from operator import add, sub, truediv, mul\n\na, b, c = [int(d) for d in input().split()]\nops = {\n    \"+\": add,\n    \"-\": sub,\n    \"*\": mul,\n    \"/\": truediv,\n}\n\nfor op, func in ops.items():\n    if a == func(b, c):\n        print(f\"{a}={b}{op}{c}\")\n        break\n    if func(a, b) == c:\n        print(f\"{a}{op}{b}={c}\")\n
"},{"location":"solutions/#triangle-area","title":"Triangle Area","text":"Solutions in 4 languages C++GoJavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int h, b;\n    cin >> h >> b;\n    cout << float(h) * b / 2 << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Println(float32(a) * float32(b) / 2)\n}\n
import java.util.Scanner;\n\nclass TriangleArea {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        float a = s.nextFloat();\n        int b = s.nextInt();\n        System.out.println(a * b / 2);\n    }\n}\n
a, b = [int(d) for d in input().split()]\nprint(a * b / 2)\n
"},{"location":"solutions/#trik","title":"Trik","text":"Solution in Python Python 
moves = input()\nball = [1, 0, 0]\nfor move in moves:\n    if move == \"A\":\n        ball[0], ball[1] = ball[1], ball[0]\n    if move == \"B\":\n        ball[1], ball[2] = ball[2], ball[1]\n    if move == \"C\":\n        ball[0], ball[2] = ball[2], ball[0]\n\nif ball[0]:\n    print(1)\nelif ball[1]:\n    print(2)\nelse:\n    print(3)\n
"},{"location":"solutions/#triple-texting","title":"Triple Texting","text":"Solution in Python Python 
from collections import Counter\n\ns = input()\ntimes = 3\nsize = len(s) // times\nmessages = []\nfor i in range(0, len(s), size):\n    messages.append(s[i : i + size])\n\noriginal = \"\"\nfor i in range(size):\n    chars = [m[i] for m in messages]\n    if len(set(chars)) == 1:\n        original += chars[0]\n    else:\n        c = Counter(chars)\n        original += max(c, key=lambda k: c[k])\n\nprint(original)\n
"},{"location":"solutions/#take-two-stones","title":"Take Two Stones","text":"Solutions in 6 languages GoHaskellJavaJavaScriptKotlinPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    if n%2 == 1 {\n        fmt.Println(\"Alice\")\n    } else {\n        fmt.Println(\"Bob\")\n    }\n}\n
main = do\n    input <- getLine\n    let n = (read input :: Int)\n    if  n `mod` 2  ==  1\n    then putStrLn \"Alice\"\n        else putStrLn \"Bob\"\n
import java.util.Scanner;\n\nclass TakeTwoStones {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        if (n % 2 == 1) {\n            System.out.println(\"Alice\");\n        } else {\n            System.out.println(\"Bob\");\n        }\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (n) => {\n  if (parseInt(n) % 2) {\n    console.log(\"Alice\");\n  } else {\n    console.log(\"Bob\");\n  }\n});\n
fun main() {\n    if (readLine()!!.toInt() % 2 == 1) {\n        println(\"Alice\")\n    } else {\n        println(\"Bob\")\n    }\n}\n
if int(input()) % 2:\n    print(\"Alice\")\nelse:\n    print(\"Bob\")\n
"},{"location":"solutions/#two-sum","title":"Two-sum","text":"Solutions in 4 languages C++GoJavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a, b;\n    cin >> a >> b;\n    cout << a + b << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Println(a + b)\n}\n
import java.util.Scanner;\n\nclass TwoSum {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a = s.nextInt();\n        int b = s.nextInt();\n        System.out.println(a + b);\n    }\n}\n
line = input()\na, b = [int(d) for d in line.split()]\nprint(a + b)\n
"},{"location":"solutions/#ullen-dullen-doff","title":"\u00dallen d\u00fallen doff","text":"Solution in Python Python 
n = int(input())\nnames = input().split()\nif n < 13:\n    i = 13 % n - 1\nelse:\n    i = 12\nprint(names[i])\n
"},{"location":"solutions/#ultimate-binary-watch","title":"Ultimate Binary Watch","text":"Solution in Python Python 
t = [int(d) for d in input()]\nb = [f\"{d:b}\".zfill(4) for d in t]\n\nfor r in range(4):\n    row = [\".\" if b[i][r] == \"0\" else \"*\" for i in range(4)]\n    row.insert(2, \" \")\n    print(\" \".join(row))\n
"},{"location":"solutions/#undead-or-alive","title":"Undead or Alive","text":"Solution in Python Python 
s = input()\n\nsmiley = \":)\" in s\n\nfrowny = \":(\" in s\n\nif not frowny and smiley:\n    print(\"alive\")\n\nelif frowny and not smiley:\n    print(\"undead\")\n\nelif frowny and smiley:\n    print(\"double agent\")\n\nelse:\n    print(\"machine\")\n
"},{"location":"solutions/#unlock-pattern","title":"Unlock Pattern","text":"Solution in Python Python 
import math\n\n\ndef dist(a, b):\n    return math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)\n\n\ncoords = {}\nfor i in range(3):\n    n = [int(d) for d in input().split()]\n    for j in range(3):\n        coords[n[j]] = (i, j)\n\nvalues = [coords[k] for k in sorted(coords)]\ntotal, prev = 0, 0\nfor i in range(1, 9):\n    total += dist(values[i], values[prev])\n    prev = i\nprint(total)\n
"},{"location":"solutions/#arrangement","title":"Arrangement","text":"Solution in Python Python 
import math\n\nn, m = int(input()), int(input())\n\nk = math.ceil(m / n)\n\nfor _ in range(n - (n * k - m)):\n    print(\"*\" * k)\nfor _ in range(n * k - m):\n    print(\"*\" * (k - 1))\n
"},{"location":"solutions/#utf-8","title":"UTF-8","text":"Solution in Python Python 
n = int(input())\ns = []\nfor _ in range(n):\n    s.append(input())\n\ni = 0\nnum = 0\nerr = False\nt = [0] * 4\nwhile i < n:\n    a = s[i]\n    if a.startswith(\"0\") and not num:\n        num = 0\n        t[0] += 1\n    elif a.startswith(\"110\") and not num:\n        t[1] += 1\n        num = 1\n    elif a.startswith(\"1110\") and not num:\n        t[2] += 1\n        num = 2\n    elif a.startswith(\"11110\") and not num:\n        t[3] += 1\n        num = 3\n    elif a.startswith(\"10\") and num:\n        num -= 1\n    else:\n        err = True\n        break\n    i += 1\n\nif err or num:\n    print(\"invalid\")\nelse:\n    print(\"\\n\".join([str(d) for d in t]))\n
"},{"location":"solutions/#vaccine-efficacy","title":"Vaccine Efficacy","text":"Solution in Python Python 
participants = int(input())\n\nvaccinated = 0\ncontrol = 0\ninfected_control_a = 0\ninfected_vaccinated_a = 0\ninfected_control_b = 0\ninfected_vaccinated_b = 0\ninfected_control_c = 0\ninfected_vaccinated_c = 0\n\nfor p in range(participants):\n    record = input()\n    v, a, b, c = list(record)\n\n    if v == \"N\":\n        control += 1\n    else:\n        vaccinated += 1\n\n    if a == \"Y\":\n        if v == \"N\":\n            infected_control_a += 1\n        else:\n            infected_vaccinated_a += 1\n\n    if b == \"Y\":\n        if v == \"N\":\n            infected_control_b += 1\n        else:\n            infected_vaccinated_b += 1\n\n    if c == \"Y\":\n        if v == \"N\":\n            infected_control_c += 1\n        else:\n            infected_vaccinated_c += 1\n\n\ndef get_vaccine_efficacy(infected_vaccinated, vaccinated, infected_control, control):\n    infection_rate_vaccinated = infected_vaccinated / vaccinated\n    infection_rate_control = infected_control / control\n    return 1 - infection_rate_vaccinated / infection_rate_control\n\n\nvaccine_efficacy = [\n    get_vaccine_efficacy(\n        infected_vaccinated_a,\n        vaccinated,\n        infected_control_a,\n        control,\n    ),\n    get_vaccine_efficacy(\n        infected_vaccinated_b,\n        vaccinated,\n        infected_control_b,\n        control,\n    ),\n    get_vaccine_efficacy(\n        infected_vaccinated_c,\n        vaccinated,\n        infected_control_c,\n        control,\n    ),\n]\n\nfor value in vaccine_efficacy:\n    if value <= 0:\n        print(\"Not Effective\")\n    else:\n        print(f\"{value*100:.6f}\")\n
"},{"location":"solutions/#right-of-way","title":"Right-of-Way","text":"Solution in Python Python 
d = [\"North\", \"East\", \"South\", \"West\"]\na, b, c = input().split()\nia = d.index(a)\nib = d.index(b)\nic = d.index(c)\n\nib = (ib - ia) % 4\nic = (ic - ia) % 4\nia -= ia\n\nif ib == 2:\n    print(\"Yes\" if ic == 3 else \"No\")\nelif ib == 1:\n    print(\"Yes\" if ic in [2, 3] else \"No\")\nelse:\n    print(\"No\")\n
"},{"location":"solutions/#variable-arithmetic","title":"Variable Arithmetic","text":"Solution in Python Python 
context = {}\nwhile True:\n    s = input()\n    if s == \"0\":\n        break\n\n    if \"=\" in s:\n        x, y = [d.strip() for d in s.split(\"=\")]\n        context[x] = int(y)\n    else:\n        v = [d.strip() for d in s.split(\"+\")]\n        t = 0\n        n = []\n        for d in v:\n            if d.isdigit():\n                t += int(d)\n            elif d in context:\n                t += context[d]\n            else:\n                n.append(d)\n        if len(n) < len(v):\n            n = [str(t)] + n\n        print(\" + \".join(n))\n
"},{"location":"solutions/#veci","title":"Veci","text":"Solution in Python Python 
from itertools import permutations\n\nx = input()\n\nvalues = sorted(set([int(\"\".join(v)) for v in permutations(x, len(x))]))\n\nindex = values.index(int(x))\nif index + 1 < len(values):\n    print(values[index + 1])\nelse:\n    print(0)\n
"},{"location":"solutions/#vector-functions","title":"Vector Functions","text":"Solution in C++ C++ 
#include \"vectorfunctions.h\"\n#include <algorithm>\n\nvoid backwards(std::vector<int> &vec)\n{\n    vec = std::vector<int>(vec.rbegin(), vec.rend());\n}\n\nstd::vector<int> everyOther(const std::vector<int> &vec)\n{\n    std::vector<int> ans;\n\n    for (int i = 0; i < vec.size(); i += 2)\n        ans.push_back(vec[i]);\n\n    return ans;\n}\n\nint smallest(const std::vector<int> &vec)\n{\n    return *min_element(vec.begin(), vec.end());\n}\n\nint sum(const std::vector<int> &vec)\n{\n    int ans = 0;\n\n    for (auto it = begin(vec); it != end(vec); ++it)\n    {\n        ans += *it;\n    }\n\n    return ans;\n}\n\nint veryOdd(const std::vector<int> &suchVector)\n{\n    int ans = 0;\n    for (int i = 1; i < suchVector.size(); i += 2)\n    {\n        if (suchVector[i] % 2 == 1)\n            ans++;\n    }\n\n    return ans;\n}\n
"},{"location":"solutions/#veur-lokaar-heiar","title":"Ve\u00f0ur - Loka\u00f0ar hei\u00f0ar","text":"Solution in Python Python 
v = int(input())\nfor _ in range(int(input())):\n    s, k = input().split()\n    if int(k) >= v:\n        print(s, \"opin\")\n    else:\n        print(s, \"lokud\")\n
"},{"location":"solutions/#veur-vindhrai","title":"Ve\u00f0ur - Vindhra\u00f0i","text":"Solution in Python Python 
k = float(input())\nif k < 0.3:\n    print(\"logn\")\nelif k < 1.6:\n    print(\"Andvari\")\nelif k < 3.4:\n    print(\"Kul\")\nelif k < 5.5:\n    print(\"Gola\")\nelif k < 8.0:\n    print(\"Stinningsgola\")\nelif k < 10.8:\n    print(\"Kaldi\")\nelif k < 13.9:\n    print(\"Stinningskaldi\")\nelif k < 17.2:\n    print(\"Allhvass vindur\")\nelif k < 20.8:\n    print(\"Hvassvidri\")\nelif k < 24.5:\n    print(\"Stormur\")\nelif k < 28.5:\n    print(\"Rok\")\n\nelif k < 32.7:\n    print(\"Ofsavedur\")\nelse:\n    print(\"Farvidri\")\n
"},{"location":"solutions/#vefjonatjon","title":"Vef\u00fej\u00f3natj\u00f3n","text":"Solution in Python Python 
n = int(input())\nparts = [0, 0, 0]\nfor _ in range(n):\n    for i, value in enumerate(input().split()):\n        if value == \"J\":\n            parts[i] += 1\nprint(min(parts))\n
"},{"location":"solutions/#velkomin","title":"Velkomin!","text":"Solution in Python Python 
print(\"VELKOMIN!\")\n
"},{"location":"solutions/#who-wins","title":"Who wins?","text":"Solution in Python Python 
board = []\nfor _ in range(3):\n    board.append(input().split())\n\nwinner = \"\"\nfor i in range(3):\n    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != \"_\":\n        winner = board[i][0]\n        break\n    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != \"_\":\n        winner = board[0][i]\n        break\n\nif board[0][0] == board[1][1] == board[2][2] and board[1][1] != \"_\":\n    winner = board[1][1]\nelif board[0][2] == board[1][1] == board[2][0] and board[1][1] != \"_\":\n    winner = board[1][1]\n\nif not winner:\n    winner = \"ingen\"\nelif winner == \"X\":\n    winner = \"Johan\"\nelse:\n    winner = \"Abdullah\"\n\nprint(f\"{winner} har vunnit\")\n
"},{"location":"solutions/#video-speedup","title":"Video Speedup","text":"Solution in Python Python 
n, p, k = [int(d) for d in input().split()]\ni = [int(d) for d in input().split()]\n\nstart, total = 0, 0\nspeed = 1\nfor ti in i:\n    total += speed * (ti - start)\n    start = ti\n    speed += p / 100\ntotal += speed * (k - start)\nprint(f\"{total:.3f}\")\n
"},{"location":"solutions/#visnuningur","title":"Vi\u00f0sn\u00faningur","text":"Solution in Python Python 
print(input()[::-1])\n
"},{"location":"solutions/#popular-vote","title":"Popular Vote","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = int(input())\n    votes = [int(input()) for _ in range(n)]\n    largest = max(votes)\n    if votes.count(largest) > 1:\n        print(\"no winner\")\n    else:\n        total = sum(votes)\n        winner = votes.index(largest)\n        print(\n            \"majority\" if votes[winner] > total / 2 else \"minority\",\n            \"winner\",\n            winner + 1,\n        )\n
"},{"location":"solutions/#warehouse","title":"Warehouse","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = int(input())\n    warehouse = {}\n    for _ in range(n):\n        s = input().split()\n        name, quantity = s[0], int(s[1])\n        if name not in warehouse:\n            warehouse[name] = quantity\n        else:\n            warehouse[name] += quantity\n    print(len(warehouse))\n    names = sorted(warehouse)\n    for name in sorted(\n        warehouse, key=lambda k: (warehouse[k], -names.index(k)), reverse=True\n    ):\n        print(name, warehouse[name])\n
"},{"location":"solutions/#weak-vertices","title":"Weak Vertices","text":"Solution in Python Python 
from itertools import combinations\n\nwhile True:\n    n = int(input())\n    if n == -1:\n        break\n    graph = {}\n    for i in range(n):\n        graph[str(i)] = [str(v) for v, e in zip(range(n), input().split()) if e == \"1\"]\n\n    # listing the weak vertices ordered from least to greatest\n    # I guess it means vertex number, not the weakness\n    # keys = sorted(graph, key=lambda x: len(graph[x]), reverse=True)\n\n    keys = graph.keys()\n\n    result = []\n\n    for key in keys:\n        has_triangle = False\n        for a, b in combinations(graph[key], 2):\n            if a in graph[b] and b in graph[a]:\n                has_triangle = True\n                break\n\n        if not has_triangle:\n            result.append(key)\n\n    print(\" \".join(result))\n
"},{"location":"solutions/#wertyu","title":"WERTYU","text":"Solution in Python Python 
mapping = {\n    # row 1\n    \"1\": \"`\",\n    \"2\": \"1\",\n    \"3\": \"2\",\n    \"4\": \"3\",\n    \"5\": \"4\",\n    \"6\": \"5\",\n    \"7\": \"6\",\n    \"8\": \"7\",\n    \"9\": \"8\",\n    \"0\": \"9\",\n    \"-\": \"0\",\n    \"=\": \"-\",\n    # row 2\n    \"W\": \"Q\",\n    \"E\": \"W\",\n    \"R\": \"E\",\n    \"T\": \"R\",\n    \"Y\": \"T\",\n    \"U\": \"Y\",\n    \"I\": \"U\",\n    \"O\": \"I\",\n    \"P\": \"O\",\n    \"[\": \"P\",\n    \"]\": \"[\",\n    \"\\\\\": \"]\",\n    # row 3\n    \"S\": \"A\",\n    \"D\": \"S\",\n    \"F\": \"D\",\n    \"G\": \"F\",\n    \"H\": \"G\",\n    \"J\": \"H\",\n    \"K\": \"J\",\n    \"L\": \"K\",\n    \";\": \"L\",\n    \"'\": \";\",\n    # row 4\n    \"X\": \"Z\",\n    \"C\": \"X\",\n    \"V\": \"C\",\n    \"B\": \"V\",\n    \"N\": \"B\",\n    \"M\": \"N\",\n    \",\": \"M\",\n    \".\": \",\",\n    \"/\": \".\",\n    \" \": \" \",\n}\n\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    print(\"\".join([mapping[c] for c in s]))\n
"},{"location":"solutions/#what-does-the-fox-say","title":"What does the fox say?","text":"Solution in Python Python 
for _ in range(int(input())):\n    words = input().split()\n    others = set()\n    while True:\n        line = input()\n        if line == \"what does the fox say?\":\n            break\n        w = line.split()[-1]\n        others.add(w)\n    print(\" \".join(w for w in words if w not in others))\n
"},{"location":"solutions/#which-is-greater","title":"Which is Greater?","text":"Solutions in 5 languages C++GoJavaJavaScriptPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a, b;\n    cin >> a >> b;\n    int ans = (a > b) ? 1 : 0;\n    cout << ans << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    if a > b {\n        fmt.Println(1)\n    } else {\n        fmt.Println(0)\n    }\n}\n
import java.util.Scanner;\n\nclass WhichisGreater {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a = s.nextInt();\n        int b = s.nextInt();\n        if (a>b){\n            System.out.println(1);\n        }else{\n            System.out.println(0);\n        }\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  [a, b] = line\n    .trim()\n    .split(\" \")\n    .map((e) => parseInt(e));\n  if (a > b) {\n    console.log(1);\n  } else {\n    console.log(0);\n  }\n});\n
a, b = [int(d) for d in input().split()]\nif a > b:\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#wizard-of-odds","title":"Wizard of Odds","text":"Solution in Python Python 
import math\n\nn, k = [int(d) for d in input().split()]\nans = math.log(n, 2) <= k\nif ans:\n    print(\"Your wish is granted!\")\nelse:\n    print(\"You will become a flying monkey!\")\n
"},{"location":"solutions/#words-for-numbers","title":"Words for Numbers","text":"Solution in Python Python 
mapping = {\n    0: \"zero\",\n    1: \"one\",\n    2: \"two\",\n    3: \"three\",\n    4: \"four\",\n    5: \"five\",\n    6: \"six\",\n    7: \"seven\",\n    8: \"eight\",\n    9: \"nine\",\n    10: \"ten\",\n    11: \"eleven\",\n    12: \"twelve\",\n}\n\n\ndef f(d):\n    if d < 13:\n        return mapping[d]\n\n    ones = d % 10\n    if d < 20:\n        return {3: \"thir\", 5: \"fif\", 8: \"eigh\"}.get(ones, mapping[ones]) + \"teen\"\n\n    tens = d // 10\n    return (\n        {2: \"twen\", 3: \"thir\", 4: \"for\", 5: \"fif\", 8: \"eigh\"}.get(tens, mapping[tens])\n        + \"ty\"\n        + (\"-\" + mapping[ones] if ones else \"\")\n    )\n\n\ndef t(w):\n    if w.isdigit():\n        return f(int(w))\n    else:\n        return w\n\n\nwhile True:\n    try:\n        words = input()\n    except:\n        break\n    print(\" \".join([t(w) for w in words.split()]))\n
"},{"location":"solutions/#yin-and-yang-stones","title":"Yin and Yang Stones","text":"Solution in Python Python 
s = input()\nprint(1 if s.count(\"W\") == s.count(\"B\") else 0)\n
"},{"location":"solutions/#yoda","title":"Yoda","text":"Solution in Python Python 
a, b = input(), input()\nsize = max(len(a), len(b))\n\na = [int(d) for d in a.zfill(size)]\nb = [int(d) for d in b.zfill(size)]\n\nans_a = [d1 for d1, d2 in zip(a, b) if d1 >= d2]\nans_b = [d2 for d1, d2 in zip(a, b) if d2 >= d1]\n\n\ndef f(ans):\n    if not ans:\n        return \"YODA\"\n    else:\n        return int(\"\".join([str(d) for d in ans]))\n\n\nprint(f(ans_a))\nprint(f(ans_b))\n
"},{"location":"solutions/#zamka","title":"Zamka","text":"Solution in Python Python 
l, d, x = input(), input(), input()\nl, d, x = int(l), int(d), int(x)\n\nfor i in range(l, d + 1):\n    if sum([int(d) for d in str(i)]) == x:\n        print(i)\n        break\n\nfor i in range(d, l - 1, -1):\n    if sum([int(d) for d in str(i)]) == x:\n        print(i)\n        break\n
"},{"location":"solutions/#stand-on-zanzibar","title":"Stand on Zanzibar","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass StandOnZanzibar {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int t = s.nextInt();\n        for (int i = 0; i < t; i++) {\n            int total = 0;\n            int n = 0;\n            int init = 1;\n            while (true) {\n                n = s.nextInt();\n                if (n == 0) {\n                    break;\n                }\n                total += Math.max(n - 2 * init, 0);\n                init = n;\n            }\n            System.out.println(total);\n        }\n    }\n}\n
for _ in range(int(input())):\n    numbers = [int(d) for d in input().split()[:-1]]\n    total = 0\n    for i in range(1, len(numbers)):\n        total += max(numbers[i] - 2 * numbers[i - 1], 0)\n    print(total)\n
"},{"location":"solutions/#un-bear-able-zoo","title":"Un-bear-able Zoo","text":"Solution in Python Python 
from collections import Counter\n\nlc = 0\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    lc += 1\n    l = Counter()\n    for _ in range(n):\n        animal = input().lower().split()\n        l[animal[-1]] += 1\n    print(f\"List {lc}:\")\n    print(\"\\n\".join([f\"{k} | {l[k]}\" for k in sorted(l)]))\n
"},{"location":"solutions/#zoom","title":"Zoom","text":"Solution in Python Python 
n, k = [int(d) for d in input().split()]\nx = [int(d) for d in input().split()]\nprint(\" \".join([str(x[i]) for i in range(k - 1, n, k)]))\n
"}]} \ No newline at end of file +{"config":{"lang":["en"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"Home","text":""},{"location":"#kattis","title":"Kattis","text":""},{"location":"#summary-by-difficulty","title":"Summary by Difficulty","text":""},{"location":"#summary-by-initial","title":"Summary by Initial","text":""},{"location":"#summary-by-language","title":"Summary by Language","text":"

Thanks to all 5 contributors.

"},{"location":"solutions/","title":"Solutions","text":""},{"location":"solutions/#10-kinds-of-people","title":"10 Kinds of People","text":"Solution in Python Python 
# 22/25\n\n\nfrom copy import deepcopy\n\n\nrow, col = [int(d) for d in input().split()]\nm = []\nfor _ in range(row):\n    m.append([int(d) for d in input()])\n\ndirections = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n\n\ndef reachable(m, r1, c1, r2, c2):\n    _m = deepcopy(m)\n\n    q = []\n    q.append((r1, c1))\n    kind = _m[r1][c1]\n\n    while len(q):\n        r, c = q.pop()\n        _m[r][c] = -1\n\n        if (r, c) == (r2, c2):\n            return True\n\n        for x, y in directions:\n            a = r + x\n            b = c + y\n            if a >= 0 and b >= 0 and a < row and b < col and _m[a][b] == kind:\n                q.append((a, b))\n\n    return False\n\n\nn = int(input())\nfor _ in range(n):\n    r1, c1, r2, c2 = [int(d) - 1 for d in input().split()]\n    if reachable(m, r1, c1, r2, c2):\n        print(\"decimal\" if m[r1][c1] else \"binary\")\n    else:\n        print(\"neither\")\n
"},{"location":"solutions/#1-d-frogger-easy","title":"1-D Frogger (Easy)","text":"Solutions in 2 languages C++Python 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n, s, m, curspace, cnt = 0;\n    cin >> n >> s >> m;\n    int board[n];\n\n    for (int i = 0; i < n; i++)\n    {\n        int tmp;\n        cin >> tmp;\n        board[i] = tmp;\n    }\n    curspace = s - 1;\n\n    while (true)\n    {\n        if (curspace < 0)\n        {\n            cout << \"left\" << endl;\n            break;\n        }\n        else if (curspace > n - 1)\n        {\n            cout << \"right\" << endl;\n            break;\n        }\n        int temp = board[curspace];\n        if (temp == 999)\n        {\n            cout << \"cycle\" << endl;\n            break;\n        }\n        else if (temp == m)\n        {\n            cout << \"magic\" << endl;\n            break;\n        }\n        else\n        {\n            cnt += 1;\n            board[curspace] = 999;\n            curspace += temp;\n        }\n    }\n    cout << cnt << endl;\n}\n
n, s, m = [int(d) for d in input().split()]\nb = [int(d) for d in input().split()]\nvisited, hops = set(), 0\nwhile True:\n    if s in visited:\n        print(\"cycle\")\n        break\n    elif s < 1:\n        print(\"left\")\n        break\n    elif s > n:\n        print(\"right\")\n        break\n    elif b[s - 1] == m:\n        print(\"magic\")\n        break\n    else:\n        visited.add(s)\n        s += b[s - 1]\n        hops += 1\nprint(hops)\n
"},{"location":"solutions/#3d-printed-statues","title":"3D Printed Statues","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport (\n    \"fmt\"\n    \"math\"\n)\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    d := 1.0\n    for math.Pow(2, d-1) < float64(n) {\n        d += 1\n    }\n    fmt.Println(d)\n}\n
import java.util.Scanner;\n\nclass ThreeDPrintedStatues {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int d = 1;\n        while (Math.pow(2, d - 1) < n) {\n            d += 1;\n        }\n        System.out.println(d);\n    }\n}\n
n = int(input())\nd = 1\nwhile 2 ** (d - 1) < n:\n    d += 1\nprint(d)\n
"},{"location":"solutions/#4-thought","title":"4 thought","text":"Solution in Python Python 
from itertools import product\n\nops = [\"+\", \"-\", \"*\", \"//\"]\n\nfor _ in range(int(input())):\n    s = int(input())\n    solved = False\n    for op1, op2, op3 in product(ops, ops, ops):\n        e = f\"4 {op1} 4 {op2} 4 {op3} 4\"\n        try:\n            ans = eval(e) == s\n        except:\n            ans = False\n        if ans:\n            print(f\"{e.replace('//','/')} = {s}\")\n            solved = True\n            break\n    if not solved:\n        print(\"no solution\")\n
"},{"location":"solutions/#99-problems","title":"99 Problems","text":"Solution in Python Python 
import math\n\nn = int(input())\nceil = math.ceil(n / 100) * 100 - 1\nfloor = math.floor(n / 100) * 100 - 1\nif ceil == floor:\n    print(ceil)\nelse:\n    if abs(ceil - n) <= abs(n - floor) or floor < 0:\n        print(ceil)\n    else:\n        print(floor)\n
"},{"location":"solutions/#aaah","title":"Aaah!","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var a, b string\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    if strings.Count(a, \"a\") >= strings.Count(b, \"a\") {\n        fmt.Println(\"go\")\n    } else {\n        fmt.Println(\"no\")\n    }\n}\n
a, b = input(), input()\nif a.count(\"a\") >= b.count(\"a\"):\n    print(\"go\")\nelse:\n    print(\"no\")\n
"},{"location":"solutions/#abc","title":"ABC","text":"Solution in Python Python 
numbers = sorted([int(d) for d in input().split()])\norders = list(input())\norder_map = {\n    \"A\": 0,\n    \"B\": 1,\n    \"C\": 2,\n}\n\nprint(\" \".join([str(numbers[order_map[o]]) for o in orders]))\n
"},{"location":"solutions/#above-average","title":"Above Average","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    numbers = [int(d) for d in input().split()[1:]]\n    ave = sum(numbers) / len(numbers)\n    above_ave = [d > ave for d in numbers]\n    print(f\"{sum(above_ave)/len(numbers):.3%}\")\n
"},{"location":"solutions/#acm-contest-scoring","title":"ACM Contest Scoring","text":"Solution in Python Python 
problems = {}\nsolved = set()\nwhile True:\n    line = input()\n    if line == \"-1\":\n        break\n    t, p, ans = line.split()\n    t = int(t)\n    if p in solved:\n        continue\n    if p not in problems:\n        problems[p] = [(t, ans)]\n    else:\n        problems[p].append((t, ans))\n    if ans == \"right\":\n        solved.add(p)\n\nscore = 0\nfor p in problems:\n    t, ans = problems[p][-1]\n    if ans == \"right\":\n        score += t + 20 * len(problems[p][:-1])\n\nprint(len(solved), score)\n
"},{"location":"solutions/#adding-trouble","title":"Adding Trouble","text":"Solution in Python Python 
a, b, c = [int(v) for v in input().split()]\nif a + b == c:\n    print(\"correct!\")\nelse:\n    print(\"wrong!\")\n
"},{"location":"solutions/#adding-words","title":"Adding Words","text":"Solution in Python Python 
name = {}\nvalue = {}\nop = [\"-\", \"+\"]\nwhile True:\n    try:\n        s = input().split()\n    except:\n        break\n\n    if s[0] == \"clear\":\n        name.clear()\n        value.clear()\n    elif s[0] == \"def\":\n        n, v = s[1:]\n        v = int(v)\n        if n in name:\n            value.pop(name[n])\n        name[n] = v\n        value[v] = n\n    elif s[0] == \"calc\":\n        try:\n            ans = eval(\"\".join([str(name[p]) if p not in op else p for p in s[1:-1]]))\n        except:\n            ans = \"unknown\"\n\n        ans = value.get(ans, \"unknown\")\n        print(\" \".join(s[1:] + [ans]))\n
"},{"location":"solutions/#add-two-numbers","title":"Add Two Numbers","text":"Solutions in 4 languages GoJavaJavaScriptPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Println(a + b)\n}\n
import java.util.Scanner;\n\nclass AddTwoNumbers {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a = s.nextInt(), b = s.nextInt();\n        System.out.println(a + b);\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  [a, b] = line\n    .trim()\n    .split(\" \")\n    .map((e) => parseInt(e));\n  console.log(a + b);\n});\n
line = input()\na, b = line.split()\na = int(a)\nb = int(b)\nprint(a + b)\n
"},{"location":"solutions/#akcija","title":"Akcija","text":"Solution in Python Python 
n = int(input())\nc = [int(input()) for _ in range(n)]\n\nc = sorted(c, reverse=True)\ngroups = [c[i : i + 3] if i + 3 < n else c[i:] for i in range(0, n, 3)]\n\nprint(sum(sum(g if len(g) < 3 else g[:2]) for g in groups))\n
"},{"location":"solutions/#alex-and-barb","title":"Alex and Barb","text":"Solution in Python Python 
k, m, n = [int(d) for d in input().split()]\n\nprint(\"Barb\" if k % (m + n) < m else \"Alex\")\n
"},{"location":"solutions/#alphabet-spam","title":"Alphabet Spam","text":"Solution in Python Python 
s = input()\ntotal = len(s)\nwhites = s.count(\"_\")\nlowers = len([c for c in s if ord(c) >= ord(\"a\") and ord(c) <= ord(\"z\")])\nuppers = len([c for c in s if ord(c) >= ord(\"A\") and ord(c) <= ord(\"Z\")])\nsymbols = total - whites - lowers - uppers\nprint(f\"{whites/total:.15f}\")\nprint(f\"{lowers/total:.15f}\")\nprint(f\"{uppers/total:.15f}\")\nprint(f\"{symbols/total:.15f}\")\n
"},{"location":"solutions/#ameriskur-vinnustaur","title":"Amer\u00edskur vinnusta\u00f0ur","text":"Solution in Python Python 
print(int(input()) * 0.09144)\n
"},{"location":"solutions/#amsterdam-distance","title":"Amsterdam Distance","text":"Solution in Python Python 
import math\n\nm, n, r = input().split()\nm = int(m)\nn = int(n)\nr = float(r)\ncoords = [int(d) for d in input().split()]\np = r / n\n\ndist1 = 0\ndist1 += p * abs(coords[1] - coords[3])\ndist1 += (\n    math.pi\n    * r\n    * ((min(coords[3], coords[1]) if coords[3] != coords[1] else coords[1]) / n)\n    * (abs(coords[0] - coords[2]) / m)\n)\n\ndist2 = p * abs(coords[1] + coords[3])\n\nprint(min(dist1, dist2))\n
"},{"location":"solutions/#a-new-alphabet","title":"A New Alphabet","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"os\"\n    \"strings\"\n)\n\nfunc main() {\n    mapping := map[string]string{\n        \"a\": \"@\",\n        \"b\": \"8\",\n        \"c\": \"(\",\n        \"d\": \"|)\",\n        \"e\": \"3\",\n        \"f\": \"#\",\n        \"g\": \"6\",\n        \"h\": \"[-]\",\n        \"i\": \"|\",\n        \"j\": \"_|\",\n        \"k\": \"|<\",\n        \"l\": \"1\",\n        \"m\": \"[]\\\\/[]\",\n        \"n\": \"[]\\\\[]\",\n        \"o\": \"0\",\n        \"p\": \"|D\",\n        \"q\": \"(,)\",\n        \"r\": \"|Z\",\n        \"s\": \"$\",\n        \"t\": \"']['\",\n        \"u\": \"|_|\",\n        \"v\": \"\\\\/\",\n        \"w\": \"\\\\/\\\\/\",\n        \"x\": \"}{\",\n        \"y\": \"`/\",\n        \"z\": \"2\",\n    }\n    scanner := bufio.NewScanner(os.Stdin)\n    scanner.Scan()\n    line := scanner.Text()\n    runes := []rune(strings.ToLower(line))\n    for i := 0; i < len(runes); i++ {\n        v, ok := mapping[string(runes[i])]\n        if ok {\n            fmt.Printf(v)\n        } else {\n            fmt.Printf(string(runes[i]))\n        }\n    }\n}\n
mapping = {\n    \"a\": \"@\",\n    \"b\": \"8\",\n    \"c\": \"(\",\n    \"d\": \"|)\",\n    \"e\": \"3\",\n    \"f\": \"#\",\n    \"g\": \"6\",\n    \"h\": \"[-]\",\n    \"i\": \"|\",\n    \"j\": \"_|\",\n    \"k\": \"|<\",\n    \"l\": \"1\",\n    \"m\": \"[]\\\\/[]\",\n    \"n\": \"[]\\\\[]\",\n    \"o\": \"0\",\n    \"p\": \"|D\",\n    \"q\": \"(,)\",\n    \"r\": \"|Z\",\n    \"s\": \"$\",\n    \"t\": \"']['\",\n    \"u\": \"|_|\",\n    \"v\": \"\\\\/\",\n    \"w\": \"\\\\/\\\\/\",\n    \"x\": \"}{\",\n    \"y\": \"`/\",\n    \"z\": \"2\",\n}\nprint(\"\".join([mapping.get(c, c) for c in input().lower()]))\n
"},{"location":"solutions/#another-brick-in-the-wall","title":"Another Brick in the Wall","text":"Solution in Python Python 
h, w, n = [int(d) for d in input().split()]\nb = [int(d) for d in input().split()]\n\ni, tw, th, done = 0, 0, 0, False\nwhile i < n:\n    if tw + b[i] <= w:\n        tw += b[i]\n        if tw == w:\n            tw = 0\n            th += 1\n        if th == h and tw == 0:\n            done = True\n            break\n    else:\n        break\n    i += 1\n\nprint(\"YES\" if done else \"NO\")\n
"},{"location":"solutions/#another-candies","title":"Another Candies","text":"Solution in Python Python 
for _ in range(int(input())):\n    _ = input()\n    n = int(input())\n    s = 0\n    for _ in range(n):\n        s += int(input())\n        if s > n:\n            s %= n\n    print(\"NO\" if s % n else \"YES\")\n
"},{"location":"solutions/#apaxiaaaaaaaaaaaans","title":"Apaxiaaaaaaaaaaaans!","text":"Solution in Python Python 
name = input()\ncompact = \"\"\nfor s in name:\n    if not compact or s != compact[-1]:\n        compact += s\nprint(compact)\n
"},{"location":"solutions/#honour-thy-apaxian-parent","title":"Honour Thy (Apaxian) Parent","text":"Solution in Python Python 
y, p = input().split()\nif y.endswith(\"e\"):\n    name = y + \"x\" + p\nelif y[-1] in \"aiou\":\n    name = y[:-1] + \"ex\" + p\nelif y.endswith(\"ex\"):\n    name = y + p\nelse:\n    name = y + \"ex\" + p\n\nprint(name)\n
"},{"location":"solutions/#a-real-challenge","title":"A Real Challenge","text":"Solutions in 3 languages GoJavaScriptPython 
package main\n\nimport (\n    \"fmt\"\n    \"math\"\n)\n\nfunc main() {\n    var a int\n    fmt.Scan(&a)\n    fmt.Println(4 * math.Sqrt(float64(a)))\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (a) => {\n  console.log(4 * Math.sqrt(parseInt(a)));\n});\n
import math\n\ns = int(input())\nprint(4 * math.sqrt(s))\n
"},{"location":"solutions/#are-you-listening","title":"Are You Listening?","text":"Solution in Python Python 
import math\n\ncx, cy, n = [int(d) for d in input().split()]\n\nd = []\nfor _ in range(n):\n    x, y, r = [int(d) for d in input().split()]\n    d.append(((x - cx) ** 2 + (y - cy) ** 2) ** 0.5 - r)\nv = sorted(d)[2]\nprint(math.floor(v) if v > 0 else 0)\n
"},{"location":"solutions/#arithmetic","title":"Arithmetic","text":"Solution in Python Python 
import math\n\nmapping8 = {\n    \"0\": \"000\",\n    \"1\": \"001\",\n    \"2\": \"010\",\n    \"3\": \"011\",\n    \"4\": \"100\",\n    \"5\": \"101\",\n    \"6\": \"110\",\n    \"7\": \"111\",\n}\nmapping16 = {\n    \"0000\": \"0\",\n    \"0001\": \"1\",\n    \"0010\": \"2\",\n    \"0011\": \"3\",\n    \"0100\": \"4\",\n    \"0101\": \"5\",\n    \"0110\": \"6\",\n    \"0111\": \"7\",\n    \"1000\": \"8\",\n    \"1001\": \"9\",\n    \"1010\": \"A\",\n    \"1011\": \"B\",\n    \"1100\": \"C\",\n    \"1101\": \"D\",\n    \"1110\": \"E\",\n    \"1111\": \"F\",\n}\n\nb = \"\".join([mapping8[c] for c in input()])\nb = b.zfill(math.ceil(len(b) / 4) * 4)\nans = \"\".join([mapping16[b[i : i + 4]] for i in range(0, len(b), 4)])\nif ans != \"0\":\n    ans = ans.lstrip(\"0\")\nprint(ans)\n
"},{"location":"solutions/#arithmetic-functions","title":"Arithmetic Functions","text":"Solution in C++ C++ 
#include \"arithmeticfunctions.h\"\n\n// Compute x^3\nint cube(int x)\n{\n    return x * x * x;\n}\n\n// Compute the maximum of x and y\nint max(int x, int y)\n{\n    if (x > y)\n    {\n        return x;\n    }\n    else\n    {\n        return y;\n    }\n}\n\n// Compute x - y\nint difference(int x, int y)\n{\n    return x - y;\n}\n
"},{"location":"solutions/#army-strength-easy","title":"Army Strength (Easy)","text":"Solution in Python Python 
t = int(input())\nfor _ in range(t):\n    input()\n    ng, nm = [int(d) for d in input().split()]\n    g = [int(d) for d in input().split()]\n    m = [int(d) for d in input().split()]\n    if max(m) > max(g):\n        print(\"MechaGodzilla\")\n    else:\n        print(\"Godzilla\")\n
"},{"location":"solutions/#army-strength-hard","title":"Army Strength (Hard)","text":"Solution in Python Python 
t = int(input())\nfor _ in range(t):\n    input()\n    ng, nm = [int(d) for d in input().split()]\n    g = [int(d) for d in input().split()]\n    m = [int(d) for d in input().split()]\n    if max(m) > max(g):\n        print(\"MechaGodzilla\")\n    else:\n        print(\"Godzilla\")\n
"},{"location":"solutions/#astrological-sign","title":"Astrological Sign","text":"Solution in Python Python 
for _ in range(int(input())):\n    d, m = input().split()\n    d = int(d)\n    if (m == \"Mar\" and d >= 21) or (m == \"Apr\" and d <= 20):\n        print(\"Aries\")\n    elif (m == \"Apr\" and d >= 21) or (m == \"May\" and d <= 20):\n        print(\"Taurus\")\n    elif (m == \"May\" and d >= 21) or (m == \"Jun\" and d <= 21):\n        print(\"Gemini\")\n    elif (m == \"Jun\" and d >= 22) or (m == \"Jul\" and d <= 22):\n        print(\"Cancer\")\n    elif (m == \"Jul\" and d >= 23) or (m == \"Aug\" and d <= 22):\n        print(\"Leo\")\n    elif (m == \"Aug\" and d >= 23) or (m == \"Sep\" and d <= 21):\n        print(\"Virgo\")\n    elif (m == \"Sep\" and d >= 22) or (m == \"Oct\" and d <= 22):\n        print(\"Libra\")\n    elif (m == \"Oct\" and d >= 23) or (m == \"Nov\" and d <= 22):\n        print(\"Scorpio\")\n    elif (m == \"Nov\" and d >= 23) or (m == \"Dec\" and d <= 21):\n        print(\"Sagittarius\")\n    elif (m == \"Dec\" and d >= 22) or (m == \"Jan\" and d <= 20):\n        print(\"Capricorn\")\n    elif (m == \"Jan\" and d >= 21) or (m == \"Feb\" and d <= 19):\n        print(\"Aquarius\")\n    elif (m == \"Feb\" and d >= 20) or (m == \"Mar\" and d <= 20):\n        print(\"Pisces\")\n
"},{"location":"solutions/#autori","title":"Autori","text":"Solution in Python Python 
print(\"\".join([part[0] for part in input().split(\"-\")]))\n
"},{"location":"solutions/#average-character","title":"Average Character","text":"Solution in Python Python 
s = input()\ns = [ord(c) for c in s]\ns = sum(s) // len(s)\nprint(chr(s))\n
"},{"location":"solutions/#avion","title":"Avion","text":"Solution in Python Python 
ans = []\nfor i in range(5):\n    row = input()\n    if \"FBI\" in row:\n        ans.append(str(i + 1))\nif not ans:\n    print(\"HE GOT AWAY!\")\nelse:\n    print(\" \".join(ans))\n
"},{"location":"solutions/#babelfish","title":"Babelfish","text":"Solution in Python Python 
d = []\nwhile True:\n    line = input()\n    if not line:\n        break\n    w, f = line.split()\n    d.append((f, w))\n\nd = dict(d)\nwhile True:\n    try:\n        line = input()\n    except:\n        break\n    print(d.get(line, \"eh\"))\n
"},{"location":"solutions/#baby-bites","title":"Baby Bites","text":"Solution in Python Python 
n = int(input())\na = input().split()\nc = [str(d) for d in range(1, n + 1)]\ninplace = [i == j if i.isnumeric() and j.isnumeric() else None for i, j in zip(a, c)]\ninplace = [v for v in inplace if v is not None]\nprint(\"makes sense\" if all(inplace) else \"something is fishy\")\n
"},{"location":"solutions/#baby-panda","title":"Baby Panda","text":"Solution in Python Python 
import math\n\nn, m = [int(d) for d in input().split()]\nd = 0\nwhile m:\n    c = math.floor(math.log(m, 2))\n    d += 1\n    m -= 2**c\nprint(d)\n
"},{"location":"solutions/#backspace","title":"Backspace","text":"Solution in Python Python 
ans = []\nfor c in input():\n    if c != \"<\":\n        ans.append(c)\n    else:\n        ans.pop()\nprint(\"\".join(ans))\n
"},{"location":"solutions/#bacon-eggs-and-spam","title":"Bacon, Eggs, and Spam","text":"Solution in Python Python 
while True:\n    n = int(input())\n    if not n:\n        break\n    record = {}\n    for _ in range(n):\n        order = input().split()\n        name = order[0]\n        items = order[1:]\n        for item in items:\n            if item not in record:\n                record[item] = [name]\n            else:\n                record[item].append(name)\n    for name in sorted(record):\n        print(name, \" \".join(sorted(record[name])))\n    print()\n
"},{"location":"solutions/#bannor","title":"Bannor\u00f0","text":"Solution in Python Python 
s = set(input())\nm = input().split()\nprint(\" \".join([\"*\" * len(p) if s & set(p) else p for p in m]))\n
"},{"location":"solutions/#basketball-one-on-one","title":"Basketball One-on-One","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass BasketballOneOnOne {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String scores = s.nextLine();\n        System.out.println(scores.charAt(scores.length() - 2));\n    }\n}\n
scores = input()\nsize = len(scores)\na = sum([int(scores[i + 1]) for i in range(size) if scores[i] == \"A\"])\nb = sum([int(scores[i + 1]) for i in range(size) if scores[i] == \"B\"])\nif a > b:\n    print(\"A\")\nelse:\n    print(\"B\")\n
"},{"location":"solutions/#batter-up","title":"Batter Up","text":"Solution in Python Python 
_ = input()\nat_bats = [int(d) for d in input().split()]\nans = [d for d in at_bats if d >= 0]\nprint(sum(ans) / len(ans))\n
"},{"location":"solutions/#beat-the-spread","title":"Beat the Spread!","text":"Solution in Python Python 
for _ in range(int(input())):\n    a, b = [int(d) for d in input().split()]\n    if a < b or (a + b) % 2:\n        print(\"impossible\")\n    else:\n        print((a + b) // 2, (a - b) // 2)\n
"},{"location":"solutions/#beavergnaw","title":"Beavergnaw","text":"Solution in Python Python 
import math\n\nwhile True:\n    D, V = [int(d) for d in input().split()]\n    if not D and not V:\n        break\n    # R = D / 2\n    # r = d / 2\n    # V + \u03c0 * (r**2) * (2*r) + 2 * (1/3) * \u03c0 * (R-r) * (r**2 + r*R + R**2) == \u03c0 * (R**2) * (2*R)\n    print(math.pow(D**3 - 6 * V / math.pi, 1 / 3))\n
"},{"location":"solutions/#beekeeper","title":"Beekeeper","text":"Solution in Python Python 
def count(word):\n    return sum(word.count(c * 2) for c in \"aeiouy\")\n\n\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    words = []\n    for _ in range(n):\n        words.append(input())\n    print(max(words, key=count))\n
"},{"location":"solutions/#bela","title":"Bela","text":"Solution in Python Python 
table = {\n    \"A\": {True: 11, False: 11},\n    \"K\": {True: 4, False: 4},\n    \"Q\": {True: 3, False: 3},\n    \"J\": {True: 20, False: 2},\n    \"T\": {True: 10, False: 10},\n    \"9\": {True: 14, False: 0},\n    \"8\": {True: 0, False: 0},\n    \"7\": {True: 0, False: 0},\n}\n\nn, b = input().split()\nn = int(n)\ntotal = 0\n\nfor _ in range(4 * n):\n    card = input()\n    f, s = card[0], card[1]\n    total += table[f][s == b]\n\nprint(total)\n
"},{"location":"solutions/#betting","title":"Betting","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a float32\n    fmt.Scan(&a)\n    fmt.Printf(\"%.10f\", 100/a)\n    fmt.Println()\n    fmt.Printf(\"%.10f\", 100/(100-a))\n}\n
a = int(input())\nprint(f\"{100/a:.10f}\")\nprint(f\"{100/(100-a):.10f}\")\n
"},{"location":"solutions/#bijele","title":"Bijele","text":"Solution in Python Python 
should_contain = (1, 1, 2, 2, 2, 8)\nfound = [int(d) for d in input().split()]\nprint(\" \".join([str(a - b) for a, b in zip(should_contain, found)]))\n
"},{"location":"solutions/#black-friday","title":"Black Friday","text":"Solution in Python Python 
from collections import Counter\n\nn = input()\na = [int(d) for d in input().split()]\nc = Counter(a)\nkeys = [k for k in c if c[k] == 1]\nif not keys:\n    print(\"none\")\nelse:\n    print(a.index(max(keys)) + 1)\n
"},{"location":"solutions/#blueberry-waffle","title":"Blueberry Waffle","text":"Solution in Python Python 
r, f = [int(d) for d in input().split()]\n\na = f // r\nb = (f - a * r) / r >= 0.5\n\nprint(\"up\" if (a + b) % 2 == 0 else \"down\")\n
"},{"location":"solutions/#bluetooth","title":"Bluetooth","text":"Solution in Python Python 
n = int(input())\ncond = {}\n\n\ndef f(t):\n    if t[0].isdigit():\n        return (f'R{\"u\" if t[1]==\"+\" else \"l\"}', t[0])\n    else:\n        return (f'L{\"u\" if t[0]==\"+\" else \"l\"}', t[1])\n\n\nfor _ in range(n):\n    t, p = input().split()\n    q, d = f(t)\n    if p == \"b\":\n        if p not in cond:\n            cond[p] = [q]\n        else:\n            cond[p].append(q)\n    elif p == \"m\":\n        if p not in cond:\n            cond[p] = [(q, d)]\n        else:\n            cond[p].append((q, d))\n\nl, r = True, True\n\nif \"R\" in [c[0] for c in cond.get(\"b\", [])]:\n    r = False\nif \"L\" in [c[0] for c in cond.get(\"b\", [])]:\n    l = False\n\nru = len([d for q, d in cond.get(\"m\", []) if q == \"Ru\"])\nrl = len([d for q, d in cond.get(\"m\", []) if q == \"Rl\"])\nlu = len([d for q, d in cond.get(\"m\", []) if q == \"Lu\"])\nll = len([d for q, d in cond.get(\"m\", []) if q == \"Ll\"])\n\nif ru == 8 or rl == 8:\n    r = False\nif lu == 8 or ll == 8:\n    l = False\n\nif not l and not r:\n    print(2)\nelif l and not r:\n    print(0)\nelif r and not l:\n    print(1)\nelse:\n    print(\"?\")\n
"},{"location":"solutions/#boat-parts","title":"Boat Parts","text":"Solution in Python Python 
p, n = [int(d) for d in input().split()]\nboat = set()\nd = -1\nfor i in range(n):\n    w = input()\n    boat.add(w)\n    if len(boat) == p:\n        d = i + 1\n        break\nif d == -1:\n    print(\"paradox avoided\")\nelse:\n    print(d)\n
"},{"location":"solutions/#booking-a-room","title":"Booking a Room","text":"Solution in Python Python 
r, n = [int(d) for d in input().split()]\nbooked = [int(input()) for _ in range(n)]\navailable = set(range(1, 1 + r)) - set(booked)\nprint(\"too late\" if r == n else available.pop())\n
"},{"location":"solutions/#boss-battle","title":"Boss Battle","text":"Solution in Python Python 
n = int(input())\nprint(n - 2 if n // 4 else 1)\n
"},{"location":"solutions/#bottled-up-feelings","title":"Bottled-Up Feelings","text":"Solution in Python Python 
s, v1, v2 = [int(d) for d in input().split()]\n\nn1 = s // v1\nif not s % v1:\n    print(n1, 0)\nelse:\n    while True:\n        if not (s - n1 * v1) % v2:\n            print(n1, (s - n1 * v1) // v2)\n            break\n        else:\n            n1 -= 1\n            if n1 < 0:\n                break\n    if n1 < 0:\n        print(\"Impossible\")\n
"},{"location":"solutions/#bounding-robots","title":"Bounding Robots","text":"Solution in Python Python 
while True:\n    room_x, room_y = [int(d) for d in input().split()]\n    if not room_x and not room_y:\n        break\n\n    robot_x, robot_y = 0, 0\n    actual_x, actual_y = 0, 0\n\n    n = int(input())\n    for _ in range(n):\n        direction, step = input().split()\n        step = int(step)\n\n        if direction == \"u\":\n            robot_y += step\n            actual_y = min(room_y - 1, actual_y + step)\n        elif direction == \"d\":\n            robot_y -= step\n            actual_y = max(0, actual_y - step)\n        elif direction == \"r\":\n            robot_x += step\n            actual_x = min(room_x - 1, actual_x + step)\n        elif direction == \"l\":\n            robot_x -= step\n            actual_x = max(0, actual_x - step)\n\n    print(f\"Robot thinks {robot_x} {robot_y}\")\n    print(f\"Actually at {actual_x} {actual_y}\")\n    print()\n
"},{"location":"solutions/#bracket-matching","title":"Bracket Matching","text":"Solution in Python Python 
n = int(input())\ns = input()\nstack = []\nis_valid = True\nfor i in range(n):\n    c = s[i]\n    if c in (\"(\", \"[\", \"{\"):\n        stack.append(c)\n    else:\n        if len(stack) == 0:\n            is_valid = False\n            break\n        last = stack.pop()\n        if c == \")\" and last != \"(\":\n            is_valid = False\n            break\n        if c == \"]\" and last != \"[\":\n            is_valid = False\n            break\n        if c == \"}\" and last != \"{\":\n            is_valid = False\n            break\n\nprint(\"Valid\" if is_valid and not len(stack) else \"Invalid\")\n
"},{"location":"solutions/#breaking-branches","title":"Breaking Branches","text":"Solutions in 5 languages GoHaskellJavaJavaScriptPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    if n%2 == 0 {\n        fmt.Println(\"Alice\")\n        fmt.Println(1)\n    } else {\n        fmt.Println(\"Bob\")\n    }\n}\n
main = do\n    input <- getLine\n    let n = (read input :: Int)\n    if  n `mod` 2  ==  0\n    then do putStrLn \"Alice\"\n            putStrLn \"1\"\n        else putStrLn \"Bob\"\n
import java.util.Scanner;\n\nclass BreakingBranches {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        if (n % 2 == 0) {\n            System.out.println(\"Alice\");\n            System.out.println(1);\n        } else {\n            System.out.println(\"Bob\");\n        }\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (n) => {\n  if (parseInt(n) % 2) {\n    console.log(\"Bob\");\n  } else {\n    console.log(\"Alice\");\n    console.log(1);\n  }\n});\n
n = int(input())\nif n % 2:\n    print(\"Bob\")\nelse:\n    print(\"Alice\")\n    print(1)\n
"},{"location":"solutions/#broken-calculator","title":"Broken Calculator","text":"Solution in Python Python 
prev = 1\nfor _ in range(int(input())):\n    a, op, b = input().split()\n    a, b = int(a), int(b)\n    if op == \"+\":\n        ans = a + b - prev\n    elif op == \"-\":\n        ans = (a - b) * prev\n    elif op == \"*\":\n        ans = (a * b) ** 2\n    elif op == \"/\":\n        ans = (a + 1) // 2 if a % 2 else a // 2\n\n    print(ans)\n    prev = ans\n
"},{"location":"solutions/#broken-swords","title":"Broken Swords","text":"Solution in Python Python 
tb, lr = 0, 0\nfor _ in range(int(input())):\n    s = input()\n    tb += s[:2].count(\"0\")\n    lr += s[2:].count(\"0\")\n\nswords = min(tb, lr) // 2\ntb -= swords * 2\nlr -= swords * 2\n\nprint(f\"{swords} {tb} {lr}\")\n
"},{"location":"solutions/#buka","title":"Buka","text":"Solution in Python Python 
a, op, b = input(), input(), input()\npa, pb = a.count(\"0\"), b.count(\"0\")\nif op == \"*\":\n    print(f\"1{'0'*(pa+pb)}\")\nelif op == \"+\":\n    if pa == pb:\n        ans = f\"2{'0'*pa}\"\n    else:\n        ans = f\"1{'0'*(abs(pa-pb)-1)}1{'0'*min(pa,pb)}\"\n    print(ans)\n
"},{"location":"solutions/#bus","title":"Bus","text":"Solution in Python Python 
def f(n):\n    if n == 1:\n        return 1\n    else:\n        return int(2 * (f(n - 1) + 0.5))\n\n\nfor _ in range(int(input())):\n    print(f(int(input())))\n
"},{"location":"solutions/#bus-numbers","title":"Bus Numbers","text":"Solution in Python Python 
n = int(input())\nnumbers = sorted([int(d) for d in input().split()])\n\nprev = numbers[0]\nans = {prev: 1}\nfor i in range(1, n):\n    if numbers[i] == prev + ans[prev]:\n        ans[prev] += 1\n    else:\n        prev = numbers[i]\n        ans[prev] = 1\n\nprint(\n    \" \".join(\n        [\n            f\"{key}-{key+value-1}\"\n            if value > 2\n            else \" \".join([str(d) for d in range(key, key + value)])\n            for key, value in ans.items()\n        ]\n    )\n)\n
"},{"location":"solutions/#calories-from-fat","title":"Calories From Fat","text":"Solution in Python Python 
mapping = {\"fat\": 9, \"protein\": 4, \"sugar\": 4, \"starch\": 4, \"alcohol\": 7}\n\n\ndef c(x, category):\n    if \"g\" in x:\n        return (int(x[:-1]) * mapping[category], \"C\")\n    elif \"C\" in x:\n        return (int(x[:-1]), \"C\")\n    elif \"%\" in x:\n        return (int(x[:-1]) / 100, \"%\")\n\n\ndef solve(items):\n    fat_c, total_c = 0, 0\n    for fat, protein, sugar, starch, alcohol in items:\n        fat_c += fat\n        total_c += fat + protein + sugar + starch + alcohol\n\n    return f\"{fat_c/total_c:.0%}\"\n\n\nitems = []\nwhile True:\n    s = input()\n    if s == \"-\":\n        if not items:\n            break\n        print(solve(items))\n\n        items = []\n        continue\n\n    fat, protein, sugar, starch, alcohol = s.split()\n    mapping.keys()\n\n    total_c, total_p = 0, 0\n\n    reading = []\n    for v, k in zip(s.split(), mapping.keys()):\n        n, t = c(v, k)\n        if t == \"C\":\n            total_c += n\n        elif t == \"%\":\n            total_p += n\n        reading.append((n, t))\n\n    total_c = total_c / (1 - total_p)\n\n    item = []\n    for n, t in reading:\n        if t == \"%\":\n            item.append(n * total_c)\n        else:\n            item.append(n)\n\n    items.append(item)\n
"},{"location":"solutions/#canadians-eh","title":"Canadians, eh?","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"os\"\n    \"strings\"\n)\n\nfunc main() {\n    scanner := bufio.NewScanner(os.Stdin)\n    scanner.Scan()\n    line := scanner.Text()\n    if strings.HasSuffix(line, \"eh?\") {\n        fmt.Println(\"Canadian!\")\n    } else {\n        fmt.Println(\"Imposter!\")\n    }\n}\n
import java.util.Scanner;\n\nclass CanadiansEh {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String line = s.nextLine();\n        if (line.endsWith(\"eh?\")) {\n            System.out.println(\"Canadian!\");\n        } else {\n            System.out.println(\"Imposter!\");\n        }\n    }\n}\n
line = input()\nif line.endswith(\"eh?\"):\n    print(\"Canadian!\")\nelse:\n    print(\"Imposter!\")\n
"},{"location":"solutions/#careful-ascent","title":"Careful Ascent","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\nn = int(input())\nshields = []\nfor _ in range(n):\n    l, u, f = input().split()\n    l = int(l)\n    u = int(u)\n    f = float(f)\n    shields.append((l, u, f))\n\nshields.append((b,))\ns = shields[0][0]\nfor i in range(n):\n    s += (shields[i][1] - shields[i][0]) * shields[i][2]\n    s += shields[i + 1][0] - shields[i][1]\nprint(f\"{a/s:.6f}\")\n
"},{"location":"solutions/#solving-for-carrots","title":"Solving for Carrots","text":"Solution in Python Python 
n, ans = [int(d) for d in input().split()]\nfor _ in range(n):\n    input()\nprint(ans)\n
"},{"location":"solutions/#catalan-numbers","title":"Catalan Numbers","text":"Solution in Python Python 
# https://en.wikipedia.org/wiki/Catalan_number\np = [1]\nfor i in range(10000):\n    p.append(p[-1] * (i + 1))\n\nfor _ in range(int(input())):\n    n = int(input())\n    print(p[2 * n] // (p[n + 1] * p[n]))\n
"},{"location":"solutions/#cd","title":"CD","text":"Solution in Python Python 
while True:\n    n, m = [int(d) for d in input().split()]\n    if not n and not m:\n        break\n    a = [int(input()) for _ in range(n)]\n    b = [int(input()) for _ in range(m)]\n    total, i, j = 0, 0, 0\n    while i < n and j < m:\n        if a[i] == b[j]:\n            total += 1\n            i += 1\n            j += 1\n        elif a[i] < b[j]:\n            i += 1\n        else:\n            j += 1\n    while i < n:\n        if a[i] == b[-1]:\n            total += 1\n            break\n        i += 1\n    while j < n:\n        if a[-1] == b[j]:\n            total += 1\n            break\n        j += 1\n    print(total)\n
"},{"location":"solutions/#cetiri","title":"Cetiri","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"sort\"\n)\n\nfunc main() {\n    var a, b, c int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Scan(&c)\n    s := []int{a, b, c}\n    sort.Ints(s)\n    a, b, c = s[0], s[1], s[2]\n    if c-b == b-a {\n        fmt.Println(c + c - b)\n    } else if c-b > b-a {\n        fmt.Println(c - b + a)\n    } else {\n        fmt.Println(a + c - b)\n    }\n}\n
a, b, c = sorted([int(d) for d in input().split()])\nif c - b == b - a:\n    print(c + c - b)\nelif c - b > b - a:\n    print(c - b + a)\nelse:\n    print(a + c - b)\n
"},{"location":"solutions/#cetvrta","title":"Cetvrta","text":"Solution in Python Python 
from collections import Counter\n\nx, y = Counter(), Counter()\n\nfor _ in range(3):\n    _x, _y = [int(d) for d in input().split()]\n    x[_x] += 1\n    y[_y] += 1\n\n\nfor key in x:\n    if x[key] == 1:\n        print(key, \" \")\n        break\n\nfor key in y:\n    if y[key] == 1:\n        print(key)\n        break\n
"},{"location":"solutions/#chanukah-challenge","title":"Chanukah Challenge","text":"Solution in Python Python 
for _ in range(int(input())):\n    k, n = [int(d) for d in input().split()]\n    print(k, int((1 + n) * n / 2 + n))\n
"},{"location":"solutions/#character-development","title":"Character Development","text":"Solution in Python Python 
def f(m):\n    ans = 0\n    for n in range(2, m + 1):\n        a, b = 1, 1\n        for i in range(m - n + 1, m + 1):\n            a *= i\n        for i in range(1, n + 1):\n            b *= i\n        ans += a // b\n    return ans\n\n\nprint(f(int(input())))\n
"},{"location":"solutions/#chocolate-division","title":"Chocolate Division","text":"Solution in Python Python 
r, c = [int(v) for v in input().split()]\n\nchocolate_bar_cuts = (r * c) - 1\n\nif chocolate_bar_cuts % 2 == 1:\n    print(\"Alf\")\nelse:\n    print(\"Beata\")\n
"},{"location":"solutions/#preludes","title":"Preludes","text":"Solution in Python Python 
alternatives = [(\"A#\", \"Bb\"), (\"C#\", \"Db\"), (\"D#\", \"Eb\"), (\"F#\", \"Gb\"), (\"G#\", \"Ab\")]\n\n\nm = dict(alternatives + [(b, a) for a, b in alternatives])\n\ni = 1\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    key, tone = s.split()\n    if key in m:\n        print(f\"Case {i}: {m[key]} {tone}\")\n    else:\n        print(f\"Case {i}: UNIQUE\")\n\n    i += 1\n
"},{"location":"solutions/#cinema-crowds","title":"Cinema Crowds","text":"Solution in Python Python 
n, m = [int(v) for v in input().split()]\n\nsize = [int(v) for v in input().split()]\n\ngroups_admitted = 0\n\nfor i in range(m):\n    if size[i] <= n:\n        n -= size[i]\n        groups_admitted += 1\n\nprint(m - groups_admitted)\n
"},{"location":"solutions/#cinema-crowds-2","title":"Cinema Crowds 2","text":"Solution in Python Python 
n, m = [int(t) for t in input().split()]\np = [int(t) for t in input().split()]\n\nd = 0\nl = 0\nfor i in range(m):\n    if p[i] > n - d:\n        break\n    else:\n        k = p[i]\n        d += k\n        l += 1\n\nprint(m - l)\n
"},{"location":"solutions/#class-field-trip","title":"Class Field Trip","text":"Solution in Python Python 
a = input()\nb = input()\n\ni, j = 0, 0\nans = []\nwhile i < len(a) and j < len(b):\n    if a[i] < b[j]:\n        ans.append(a[i])\n        i += 1\n    else:\n        ans.append(b[j])\n        j += 1\n\n\nans += a[i:] if i < len(a) else b[j:]\n\nprint(\"\".join(ans))\n
"},{"location":"solutions/#a-furious-cocktail","title":"A Furious Cocktail","text":"Solution in Python Python 
n, t = [int(d) for d in input().split()]\np = [int(input()) for _ in range(n)]\np = sorted(p, reverse=True)\nending = p[0]\nable = True\nfor i in range(1, n):\n    if t * i >= ending:\n        print(\"NO\")\n        able = False\n        break\n    if t * i + p[i] < ending:\n        ending = t * i + p[i]\nif able:\n    print(\"YES\")\n
"},{"location":"solutions/#code-cleanups","title":"Code Cleanups","text":"Solution in Python Python 
n = int(input())\np = [int(d) for d in input().split()]\nprev = []\nt = 0\nfor v in p:\n    if not prev:\n        prev.append(v)\n        continue\n    d = (19 + sum(prev)) // len(prev)\n    if v <= d:\n        prev.append(v)\n    else:\n        prev = [v]\n        t += 1\nif prev:\n    t += 1\nprint(t)\n
"},{"location":"solutions/#code-to-save-lives","title":"Code to Save Lives","text":"Solution in Python Python 
t = int(input())\nfor _ in range(t):\n    a = int(input().replace(\" \", \"\"))\n    b = int(input().replace(\" \", \"\"))\n    print(\" \".join(str(a + b)))\n
"},{"location":"solutions/#coffee-cup-combo","title":"Coffee Cup Combo","text":"Solution in Python Python 
n = int(input())\nawake = [0] * n\ns = list(input())\nfor i in range(n):\n    if s[i] == \"1\":\n        awake[i] = 1\n        if i + 1 < n:\n            awake[i + 1] = 1\n        if i + 2 < n:\n            awake[i + 2] = 1\nprint(sum(awake))\n
"},{"location":"solutions/#cold-puter-science","title":"Cold-puter Science","text":"Solution in Python Python 
_ = input()\nprint(len([t for t in input().split() if \"-\" in t]))\n
"},{"location":"solutions/#competitive-arcade-basketball","title":"Competitive Arcade Basketball","text":"Solution in Python Python 
from collections import Counter\n\nn, p, m = [int(d) for d in input().split()]\n\nrecords = Counter()\nwinners = []\nnames = [input() for _ in range(n)]\nfor r in range(m):\n    name, point = input().split()\n    point = int(point)\n    records[name] += point\n    if records[name] >= p and name not in winners:\n        winners.append(name)\nif not winners:\n    print(\"No winner!\")\nelse:\n    print(\"\\n\".join([f\"{n} wins!\" for n in winners]))\n
"},{"location":"solutions/#completing-the-square","title":"Completing the Square","text":"Solution in Python Python 
x1, y1 = [int(d) for d in input().split()]\nx2, y2 = [int(d) for d in input().split()]\nx3, y3 = [int(d) for d in input().split()]\n\nd12 = (x1 - x2) ** 2 + (y1 - y2) ** 2\nd13 = (x1 - x3) ** 2 + (y1 - y3) ** 2\nd23 = (x2 - x3) ** 2 + (y2 - y3) ** 2\n\nif d12 == d13:\n    x, y = x2 + x3 - x1, y2 + y3 - y1\nelif d12 == d23:\n    x, y = x1 + x3 - x2, y1 + y3 - y2\nelse:\n    x, y = x1 + x2 - x3, y1 + y2 - y3\n\nprint(x, y)\n
"},{"location":"solutions/#compound-words","title":"Compound Words","text":"Solution in Python Python 
from itertools import permutations\n\nl = []\nwhile True:\n    try:\n        l.extend(input().split())\n    except:\n        break\n\nw = set()\nfor i, j in permutations(l, 2):\n    w.add(f\"{i}{j}\")\n\n\nprint(\"\\n\".join(sorted(w)))\n
"},{"location":"solutions/#conformity","title":"Conformity","text":"Solution in Python Python 
from collections import Counter\n\nn = int(input())\nentries = []\nfor _ in range(n):\n    entries.append(\" \".join(sorted(input().split())))\n\nsummary = Counter(entries)\npopular = max(summary.values())\n\nprint(sum([summary[e] for e in summary if summary[e] == popular]))\n
"},{"location":"solutions/#contingency-planning","title":"Contingency Planning","text":"Solution in Python Python 
def permutations(n, c):\n    value = 1\n    for i in range(n - c + 1, n + 1):\n        value *= i\n    return value\n\n\nn = int(input())\nans = 0\nfor i in range(1, n + 1):\n    ans += permutations(n, i)\nif ans > 1_000_000_000:\n    print(\"JUST RUN!!\")\nelse:\n    print(ans)\n
"},{"location":"solutions/#cryptographers-conundrum","title":"Cryptographer's Conundrum","text":"Solution in Python Python 
text = input()\ntotal = 0\nfor i in range(0, len(text), 3):\n    if text[i] != \"P\":\n        total += 1\n    if text[i + 1] != \"E\":\n        total += 1\n    if text[i + 2] != \"R\":\n        total += 1\nprint(total)\n
"},{"location":"solutions/#convex-polygon-area","title":"Convex Polygon Area","text":"Solution in Python Python 
for _ in range(int(input())):\n    values = [int(d) for d in input().split()]\n    coords = values[1:]\n    n = values[0]\n\n    coords.append(coords[0])\n    coords.append(coords[1])\n\n    area = 0\n    for i in range(0, 2 * n, 2):\n        x1, y1 = coords[i], coords[i + 1]\n        x2, y2 = coords[i + 2], coords[i + 3]\n        area += x1 * y2 - x2 * y1\n\n    print(0.5 * abs(area))\n
"},{"location":"solutions/#cooking-water","title":"Cooking Water","text":"Solution in Python Python 
n = int(input())\nlb, ub = 0, 1000\nfor _ in range(n):\n    a, b = [int(d) for d in input().split()]\n    lb = max(lb, a)\n    ub = min(ub, b)\n\nif lb > ub:\n    print(\"edward is right\")\nelse:\n    print(\"gunilla has a point\")\n
"},{"location":"solutions/#cosmic-path-optimization","title":"Cosmic Path Optimization","text":"Solution in Python Python 
import math\n\nm = int(input())\nt = [int(d) for d in input().split()]\nprint(f\"{math.floor(sum(t)/m)}\")\n
"},{"location":"solutions/#costume-contest","title":"Costume Contest","text":"Solution in Python Python 
from collections import Counter\n\nn = int(input())\nc = Counter()\nfor _ in range(n):\n    c[input()] += 1\nprint(\"\\n\".join(sorted([k for k, v in c.items() if v == min(c.values())])))\n
"},{"location":"solutions/#count-doubles","title":"Count Doubles","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\nvalues = [int(d) for d in input().split()]\nans = 0\nfor i in range(n - m + 1):\n    if len([v for v in values[i : i + m] if not v % 2]) >= 2:\n        ans += 1\nprint(ans)\n
"},{"location":"solutions/#counting-clauses","title":"Counting Clauses","text":"Solution in Python Python 
m, _ = [int(d) for d in input().split()]\nfor _ in range(m):\n    input()\nif m >= 8:\n    print(\"satisfactory\")\nelse:\n    print(\"unsatisfactory\")\n
"},{"location":"solutions/#count-the-vowels","title":"Count the Vowels","text":"Solution in Python Python 
print(len([c for c in input().lower() if c in \"aeiou\"]))\n
"},{"location":"solutions/#course-scheduling","title":"Course Scheduling","text":"Solution in Python Python 
from collections import Counter\n\nc = Counter()\nn = {}\n\nfor _ in range(int(input())):\n    r = input().split()\n    name, course = \" \".join(r[:2]), r[-1]\n    if course not in n:\n        n[course] = set()\n\n    if name not in n[course]:\n        c[course] += 1\n        n[course].add(name)\n\nfor k in sorted(c.keys()):\n    print(f\"{k} {c[k]}\")\n
"},{"location":"solutions/#cpr-number","title":"CPR Number","text":"Solution in Python Python 
cpr = input().replace(\"-\", \"\")\nvalues = [4, 3, 2, 7, 6, 5, 4, 3, 2, 1]\ntotal = 0\nfor d, v in zip(cpr, values):\n    total += int(d) * v\nif not total % 11:\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#crne","title":"Crne","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n)\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    a := n / 2\n    b := n - a\n    fmt.Println((a + 1) * (b + 1))\n}\n
n = int(input())\na = n // 2\nb = n - a\nprint((a + 1) * (b + 1))\n
"},{"location":"solutions/#cudoviste","title":"Cudoviste","text":"Solution in Python Python 
r, c = [int(d) for d in input().split()]\nparking = []\nfor _ in range(r):\n    parking.append(input())\n\n\ndef count_spaces(parking, squash):\n    total = 0\n    for i in range(r - 1):\n        for j in range(c - 1):\n            spaces = [\n                parking[i][j],\n                parking[i + 1][j],\n                parking[i][j + 1],\n                parking[i + 1][j + 1],\n            ]\n            if (\n                all(s in \".X\" for s in spaces)\n                and sum([s == \"X\" for s in spaces]) == squash\n            ):\n                total += 1\n    return total\n\n\nfor num in range(0, 5):\n    print(count_spaces(parking, num))\n
"},{"location":"solutions/#stacking-cups","title":"Stacking Cups","text":"Solution in Python Python 
size = {}\nfor _ in range(int(input())):\n    parts = input().split()\n    if parts[0].isdigit():\n        size[parts[1]] = int(parts[0]) / 2\n    else:\n        size[parts[0]] = int(parts[1])\nfor color in sorted(size, key=lambda x: size[x]):\n    print(color)\n
"},{"location":"solutions/#cut-in-line","title":"Cut in Line","text":"Solution in Python Python 
n = int(input())\nqueue = []\nfor _ in range(n):\n    queue.append(input())\n\nc = int(input())\nfor _ in range(c):\n    event = input().split()\n    if event[0] == \"leave\":\n        queue.remove(event[1])\n    elif event[0] == \"cut\":\n        queue.insert(queue.index(event[2]), event[1])\n\nfor name in queue:\n    print(name)\n
"},{"location":"solutions/#cut-the-negativity","title":"Cut the Negativity","text":"Solution in Python Python 
n = int(input())\n\npositives = []\nfor i in range(n):\n    numbers = [int(d) for d in input().split()]\n    for j in range(n):\n        if numbers[j] > 0:\n            positives.append((str(i + 1), str(j + 1), str(numbers[j])))\n\nprint(len(positives))\nfor p in positives:\n    print(\" \".join(p))\n
"},{"location":"solutions/#cyanide-rivers","title":"Cyanide Rivers","text":"Solution in Python Python 
import math\n\ns = input()\nt = s.split(\"1\")\nprint(max([math.ceil(len(z) / 2) for z in t]))\n
"},{"location":"solutions/#cypher-decypher","title":"Cypher Decypher","text":"Solution in Python Python 
from string import ascii_uppercase\n\n\ndef f(n, m):\n    return ascii_uppercase[(n * m) % 26]\n\n\nm = input()\nfor _ in range(int(input())):\n    s = input()\n    print(\"\".join([f(ascii_uppercase.index(c), int(d)) for c, d in zip(s, m)]))\n
"},{"location":"solutions/#damaged-equation","title":"Damaged Equation","text":"Solution in Python Python 
from itertools import product\n\na, b, c, d = [int(d) for d in input().split()]\nops = [\"*\", \"+\", \"-\", \"//\"]\nvalid = False\nfor op1, op2 in product(ops, ops):\n    e = f\"{a} {op1} {b} == {c} {op2} {d}\"\n    try:\n        if eval(e):\n            print(e.replace(\"==\", \"=\").replace(\"//\", \"/\"))\n            valid = True\n    except:\n        pass\nif not valid:\n    print(\"problems ahead\")\n
"},{"location":"solutions/#datum","title":"Datum","text":"Solution in Python Python 
from datetime import datetime\n\nd, m = [int(d) for d in input().split()]\nprint(datetime(year=2009, month=m, day=d).strftime(\"%A\"))\n
"},{"location":"solutions/#death-knight-hero","title":"Death Knight Hero","text":"Solution in Python Python 
total = 0\nfor _ in range(int(input())):\n    if \"CD\" not in input():\n        total += 1\nprint(total)\n
"},{"location":"solutions/#delimiter-soup","title":"Delimiter Soup","text":"Solution in Python Python 
n = int(input())\ns = input()\n\nstack = []\n\nvalid = True\n\nfor i in range(n):\n    c = s[i]\n    if c in [\"(\", \"[\", \"{\"]:\n        stack.append(c)\n    if c in [\")\", \"]\", \"}\"]:\n        if len(stack) == 0:\n            valid = False\n            break\n\n        v = stack.pop()\n        if c == \")\" and v != \"(\":\n            valid = False\n            break\n        elif c == \"]\" and v != \"[\":\n            valid = False\n            break\n        elif c == \"}\" and v != \"{\":\n            valid = False\n            break\n\nif valid:\n    print(\"ok so far\")\nelse:\n    print(c, i)\n
"},{"location":"solutions/#detailed-differences","title":"Detailed Differences","text":"Solution in Python Python 
for _ in range(int(input())):\n    s1, s2 = input(), input()\n    result = [\".\" if c1 == c2 else \"*\" for c1, c2 in zip(s1, s2)]\n    print(s1)\n    print(s2)\n    print(\"\".join(result))\n
"},{"location":"solutions/#dice-cup","title":"Dice Cup","text":"Solution in Python Python 
d1, d2 = [int(d) for d in input().split()]\n\nsums = []\nfor i in range(1, d1 + 1):\n    for j in range(1, d2 + 1):\n        sums.append(i + j)\n\nfrom collections import Counter\n\nc = Counter(sums)\nmost_likely = max(c.values())\nfor key in sorted(c.keys()):\n    if c[key] == most_likely:\n        print(key)\n
"},{"location":"solutions/#dice-game","title":"Dice Game","text":"Solution in Python Python 
g = [int(d) for d in input().split()]\ne = [int(d) for d in input().split()]\n\n\ndef ev(d):\n    total, count = 0, 0\n    for i in range(d[0], d[1] + 1):\n        for j in range(d[2], d[3] + 1):\n            total += i + j\n            count += 1\n    return total / count\n\n\nratio = ev(g) / ev(e)\nif ratio > 1:\n    print(\"Gunnar\")\nelif ratio < 1:\n    print(\"Emma\")\nelse:\n    print(\"Tie\")\n
"},{"location":"solutions/#a-different-problem","title":"A Different Problem","text":"Solution in Python Python 
while True:\n    try:\n        line = input()\n    except:\n        break\n    a, b = [int(d) for d in line.split()]\n    print(abs(a - b))\n
"},{"location":"solutions/#different-distances","title":"Different Distances","text":"Solution in Python Python 
while True:\n    line = input()\n    if line == \"0\":\n        break\n    x1, y1, x2, y2, p = [float(d) for d in line.split()]\n    print((abs(x1 - x2) ** p + abs(y1 - y2) ** p) ** (1 / p))\n
"},{"location":"solutions/#digit-swap","title":"Digit Swap","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport (\n    \"fmt\"\n)\n\nfunc reverse(str string) (ans string) {\n    for _, v := range str {\n        ans = string(v) + ans\n    }\n    return\n}\nfunc main() {\n    var str string\n    fmt.Scan(&str)\n    fmt.Println(reverse(str))\n}\n
import java.util.*;\n\nclass DigitSwap {\n    public static void main(String[] argv){\n        Scanner s = new Scanner(System.in);\n        StringBuilder ans = new StringBuilder();\n        ans.append(s.nextLine());\n        ans.reverse();\n        System.out.println(ans);\n    }\n}\n
print(input()[::-1])\n
"},{"location":"solutions/#disc-district","title":"Disc District","text":"Solution in Python Python 
print(1, input())\n
"},{"location":"solutions/#divvying-up","title":"Divvying Up","text":"Solution in Python Python 
_ = input()\np = [int(d) for d in input().split()]\nif sum(p) % 3:\n    print(\"no\")\nelse:\n    print(\"yes\")\n
"},{"location":"solutions/#dont-fall-down-stairs","title":"Don't Fall Down Stairs","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()] + [0]\nprint(sum(max(a[i] - a[i + 1] - 1, 0) for i in range(n)))\n
"},{"location":"solutions/#double-password","title":"Double Password","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass DoublePassword {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String a = s.nextLine();\n        String b = s.nextLine();\n        int number = 1;\n        for (int i = 0; i < a.length(); i++) {\n            if (a.charAt(i) == b.charAt(i)) {\n                number *= 1;\n            } else {\n                number *= 2;\n            }\n        }\n        System.out.println(number);\n\n    }\n}\n
a, b = input(), input()\nnumber = 1\nfor c1, c2 in zip(a, b):\n    if c1 == c2:\n        number *= 1\n    else:\n        number *= 2\nprint(number)\n
"},{"location":"solutions/#drinking-song","title":"Drinking Song","text":"Solution in Python Python 
n = int(input())\nw = input()\n\nfor i in range(n):\n    a = f\"{n-i} bottle{'s' if n-i >1 else ''}\"\n    b = f\"{'no more' if n-i-1==0 else n-i-1 } bottle{'' if n-i-1==1 else 's'}\"\n    c = f\"{'one' if n-i>1 else 'it' }\"\n    d = f\"{' on the wall' if n-i-1 else ''}\"\n    print(f\"{a} of {w} on the wall, {a} of {w}.\")\n    print(f\"Take {c} down, pass it around, {b} of {w}{d}.\")\n    if n - i - 1:\n        print()\n
"},{"location":"solutions/#drivers-dilemma","title":"Driver's Dilemma","text":"Solution in Python Python 
c, x, m = [float(d) for d in input().split()]\ntop = 0\nfor _ in range(6):\n    mph, mpg = [float(d) for d in input().split()]\n\n    if m / mph * x + m / mpg <= c / 2:\n        top = mph\nif top:\n    print(f\"YES {top:.0f}\")\nelse:\n    print(\"NO\")\n
"},{"location":"solutions/#drm-messages","title":"DRM Messages","text":"Solution in Python Python 
l = ord(\"A\")\nr = ord(\"Z\")\n\n\ndef divide(message):\n    half = len(message) // 2\n    return message[:half], message[half:]\n\n\ndef to_ord(c, rotation):\n    new_chr = ord(c) + rotation\n    return new_chr if new_chr <= r else l + (new_chr - r - 1)\n\n\ndef rotate(half):\n    rotation = sum([ord(c) - l for c in half])\n    rotation %= 26\n    result = [to_ord(c, rotation) for c in half]\n    return \"\".join([chr(c) for c in result])\n\n\ndef merge(first, second):\n    rotations = [ord(c) - l for c in second]\n    result = [to_ord(c, rotation) for c, rotation in zip(first, rotations)]\n    return \"\".join([chr(c) for c in result])\n\n\nmessage = input()\nfirst, second = divide(message)\nprint(merge(rotate(first), rotate(second)))\n
"},{"location":"solutions/#drunk-vigenere","title":"Drunk Vigen\u00e8re","text":"Solution in Python Python 
import string\n\nuppers = string.ascii_uppercase\n\n\ndef unshift(c, k, f):\n    index = uppers.index(k)\n    if f:\n        new_index = uppers.index(c) + index\n    else:\n        new_index = uppers.index(c) - index\n    return uppers[new_index % 26]\n\n\nmessage, key = input(), input()\nprint(\"\".join([unshift(c, k, i % 2) for i, (c, k) in enumerate(zip(message, key))]))\n
"},{"location":"solutions/#early-winter","title":"Early Winter","text":"Solution in Python Python 
n, m = [int(_) for _ in input().split()]\nd = [int(_) for _ in input().split()]\nd = [v > m for v in d]\n\n\nfor k in range(n):\n    if not d[k]:\n        break\n\nif all(d):\n    print(\"It had never snowed this early!\")\nelse:\n    print(f\"It hadn't snowed this early in {k} years!\")\n
"},{"location":"solutions/#the-easiest-problem-is-this-one","title":"The Easiest Problem Is This One","text":"Solution in Python Python 
while True:\n    n = input()\n    if n == \"0\":\n        break\n    s1 = sum([int(d) for d in n])\n\n    n = int(n)\n    p = 11\n    while True:\n        s2 = sum([int(d) for d in str(n * p)])\n        if s2 == s1:\n            break\n        p += 1\n\n    print(p)\n
"},{"location":"solutions/#echo-echo-echo","title":"Echo Echo Echo","text":"Solution in Python Python 
word = input().strip()\nprint(\" \".join([word] * 3))\n
"},{"location":"solutions/#egypt","title":"Egypt","text":"Solution in Python Python 
while True:\n    sides = sorted([int(d) for d in input().split()])\n    if not all(sides):\n        break\n    if sides[0] ** 2 + sides[1] ** 2 == sides[2] ** 2:\n        print(\"right\")\n    else:\n        print(\"wrong\")\n
"},{"location":"solutions/#ekki-daui-opna-inni","title":"Ekki dau\u00f0i opna inni","text":"Solution in Python Python 
l = []\nwhile True:\n    try:\n        l.append(input().split(\"|\"))\n    except:\n        break\n\nl = [l[i][0] for i in range(len(l))] + [\" \"] + [l[i][1] for i in range(len(l))]\nprint(\"\".join(l))\n
"},{"location":"solutions/#election-paradox","title":"Election Paradox","text":"Solution in Python Python 
n = int(input())\np = [int(d) for d in input().split()]\np = sorted(p)\nt = 0\nfor i in range(0, n // 2 + 1):\n    t += p[i] // 2\nfor i in range(n // 2 + 1, n):\n    t += p[i]\nprint(t)\n
"},{"location":"solutions/#electrical-outlets","title":"Electrical Outlets","text":"Solution in Python Python 
for _ in range(int(input())):\n    print(sum([int(d) - 1 for d in input().split()[1:]]) + 1)\n
"},{"location":"solutions/#eligibility","title":"Eligibility","text":"Solution in Python Python 
for _ in range(int(input())):\n    name, pss, dob, courses = input().split()\n    courses = int(courses)\n    pss = [int(d) for d in pss.split(\"/\")]\n    dob = [int(d) for d in dob.split(\"/\")]\n    if pss[0] >= 2010 or dob[0] >= 1991:\n        print(name, \"eligible\")\n    elif courses > 40:\n        print(name, \"ineligible\")\n    else:\n        print(name, \"coach petitions\")\n
"},{"location":"solutions/#encoded-message","title":"Encoded Message","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    message = input()\n    size = int(math.sqrt(len(message)))\n    m = []\n    for i in range(size):\n        m.append(message[i * size : (i + 1) * size])\n\n    ans = []\n    for i in range(size - 1, -1, -1):\n        for j in range(size):\n            ans.append(m[j][i])\n    print(\"\".join(ans))\n
"},{"location":"solutions/#endurvinnsla","title":"Endurvinnsla","text":"Solution in Python Python 
_ = input()\np = float(input())\nn = int(input())\nitems = [input() == \"ekki plast\" for _ in range(n)]\nprint(\"Jebb\" if sum(items) <= p * n else \"Neibb\")\n
"},{"location":"solutions/#engineering-english","title":"Engineering English","text":"Solution in Python Python 
seen = set()\n\nwhile True:\n    try:\n        s = input().split()\n    except:\n        break\n    d = []\n    for t in s:\n        if t.lower() not in seen:\n            seen.add(t.lower())\n        else:\n            t = \".\"\n        d.append(t)\n    print(\" \".join(d))\n
"},{"location":"solutions/#erase-securely","title":"Erase Securely","text":"Solution in Python Python 
n = int(input())\na, b = input(), input()\nif n % 2:\n    print(\n        \"Deletion\", \"failed\" if not all([i != j for i, j in zip(a, b)]) else \"succeeded\"\n    )\nelse:\n    print(\n        \"Deletion\", \"failed\" if not all([i == j for i, j in zip(a, b)]) else \"succeeded\"\n    )\n
"},{"location":"solutions/#espresso","title":"Espresso!","text":"Solution in Python Python 
n, s = [int(d) for d in input().split()]\nrefill = 0\ntank = s\nfor _ in range(n):\n    o = input()\n    if \"L\" in o:\n        w = int(o[:-1]) + 1\n    else:\n        w = int(o)\n    if tank - w < 0:\n        refill += 1\n        tank = s\n\n    tank -= w\nprint(refill)\n
"},{"location":"solutions/#estimating-the-area-of-a-circle","title":"Estimating the Area of a Circle","text":"Solution in Python Python 
import math\n\nwhile True:\n    r, m, c = input().split()\n    if r == \"0\" and m == \"0\" and c == \"0\":\n        break\n    r = float(r)\n    m, c = int(m), int(c)\n    print(math.pi * r * r, 4 * r * r * c / m)\n
"},{"location":"solutions/#evening-out-1","title":"Evening Out 1","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\nc = a % b\nprint(min(c, b - c))\n
"},{"location":"solutions/#event-planning","title":"Event Planning","text":"Solution in Python Python 
n, b, h, w = [int(d) for d in input().split()]\n\ncosts = []\nfor _ in range(h):\n    p = int(input())\n    a = [int(d) for d in input().split()]\n    if not any([_a >= n for _a in a]):\n        costs.append(None)\n        continue\n    c = p * n\n    if c > b:\n        c = None\n    costs.append(c)\n\ncosts = [c for c in costs if c]\nif not costs:\n    print(\"stay home\")\nelse:\n    print(min(costs))\n
"},{"location":"solutions/#ive-been-everywhere-man","title":"I've Been Everywhere, Man","text":"Solution in Python Python 
cities = {}\nfor i in range(int(input())):\n    cities[i] = set()\n    for _ in range(int(input())):\n        cities[i].add(input())\n\nprint(\"\\n\".join([str(len(s)) for s in cities.values()]))\n
"},{"location":"solutions/#exactly-electrical","title":"Exactly Electrical","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\nc, d = [int(d) for d in input().split()]\nt = int(input())\nm = abs(a - c) + abs(b - d)\nprint(\"Y\" if m <= t and (m - t) % 2 == 0 else \"N\")\n
"},{"location":"solutions/#exam","title":"Exam","text":"Solution in Python Python 
k = int(input())\ny = input()\nf = input()\nsame, different = 0, 0\nfor a, b in zip(y, f):\n    if a == b:\n        same += 1\n    else:\n        different += 1\nprint(min(same, k) + min(different, (len(y) - k)))\n
"},{"location":"solutions/#expected-earnings","title":"Expected Earnings","text":"Solution in Python Python 
n, k, p = input().split()\nn = int(n)\nk = int(k)\np = float(p)\nev = n * p - k\nif ev < 0:\n    print(\"spela\")\nelse:\n    print(\"spela inte!\")\n
"},{"location":"solutions/#eye-of-sauron","title":"Eye of Sauron","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var drawing string\n    fmt.Scan(&drawing)\n    parts := strings.Split(drawing, \"()\")\n    left, right := parts[0], parts[1]\n    if left == right {\n        fmt.Println(\"correct\")\n    } else {\n        fmt.Println(\"fix\")\n    }\n}\n
drawing = input()\nleft, right = drawing.split(\"()\")\nif left == right:\n    print(\"correct\")\nelse:\n    print(\"fix\")\n
"},{"location":"solutions/#fading-wind","title":"Fading Wind","text":"Solution in Python Python 
h, k, v, s = [int(d) for d in input().split()]\nt = 0\nwhile h > 0:\n    v += s\n    v -= max(1, v // 10)\n    if v >= k:\n        h += 1\n    elif v > 0:\n        h -= 1\n        if not h:\n            v = 0\n    else:\n        h = 0\n        v = 0\n    t += v\n    if s > 0:\n        s -= 1\nprint(t)\n
"},{"location":"solutions/#faktor","title":"Faktor","text":"Solution in Python Python 
a, i = [int(d) for d in input().split()]\nprint(a * (i - 1) + 1)\n
"},{"location":"solutions/#falling-apart","title":"Falling Apart","text":"Solution in Python Python 
n = int(input())\na = sorted([int(d) for d in input().split()], reverse=True)\nprint(\n    sum([a[i] for i in range(0, n, 2)]),\n    sum([a[i] for i in range(1, n, 2)]),\n)\n
"},{"location":"solutions/#false-sense-of-security","title":"False Sense of Security","text":"Solution in Python Python 
encoding = {\n    \"A\": \".-\",\n    \"B\": \"-...\",\n    \"C\": \"-.-.\",\n    \"D\": \"-..\",\n    \"E\": \".\",\n    \"F\": \"..-.\",\n    \"G\": \"--.\",\n    \"H\": \"....\",\n    \"I\": \"..\",\n    \"J\": \".---\",\n    \"K\": \"-.-\",\n    \"L\": \".-..\",\n    \"M\": \"--\",\n    \"N\": \"-.\",\n    \"O\": \"---\",\n    \"P\": \".--.\",\n    \"Q\": \"--.-\",\n    \"R\": \".-.\",\n    \"S\": \"...\",\n    \"T\": \"-\",\n    \"U\": \"..-\",\n    \"V\": \"...-\",\n    \"W\": \".--\",\n    \"X\": \"-..-\",\n    \"Y\": \"-.--\",\n    \"Z\": \"--..\",\n    \"_\": \"..--\",\n    \",\": \".-.-\",\n    \".\": \"---.\",\n    \"?\": \"----\",\n}\n\ndecoding = dict([(v, k) for k, v in encoding.items()])\n\nwhile True:\n    try:\n        encoded = input()\n    except:\n        break\n    length = [len(encoding[c]) for c in encoded]\n    morse = \"\".join([encoding[c] for c in encoded])\n\n    ans, s = \"\", 0\n    for i in reversed(length):\n        ans += decoding[morse[s : s + i]]\n        s += i\n    print(ans)\n
"},{"location":"solutions/#fast-food-prizes","title":"Fast Food Prizes","text":"Solution in Python Python 
for _ in range(int(input())):\n    n, m = [int(d) for d in input().split()]\n    r = []\n    for _ in range(n):\n        s = input().split()\n        p = int(s[-1])\n        k = [int(d) for d in s[1:-1]]\n        r.append((k, p))\n    s = [int(d) for d in input().split()]\n\n    ans = 0\n    for t, p in r:\n        c = min([s[d - 1] for d in t])\n        ans += p * c\n\n    print(ans)\n
"},{"location":"solutions/#fbi-universal-control-numbers","title":"FBI Universal Control Numbers","text":"Solution in Python Python 
m = {\n    \"0\": 0,\n    \"1\": 1,\n    \"2\": 2,\n    \"3\": 3,\n    \"4\": 4,\n    \"5\": 5,\n    \"6\": 6,\n    \"7\": 7,\n    \"8\": 8,\n    \"9\": 9,\n    \"A\": 10,\n    \"B\": 8,\n    \"C\": 11,\n    \"D\": 12,\n    \"E\": 13,\n    \"F\": 14,\n    \"G\": 11,\n    \"H\": 15,\n    \"I\": 1,\n    \"J\": 16,\n    \"K\": 17,\n    \"L\": 18,\n    \"M\": 19,\n    \"N\": 20,\n    \"O\": 0,\n    \"P\": 21,\n    \"Q\": 0,\n    \"R\": 22,\n    \"S\": 5,\n    \"T\": 23,\n    \"U\": 24,\n    \"V\": 24,\n    \"W\": 25,\n    \"X\": 26,\n    \"Y\": 24,\n    \"Z\": 2,\n}\nw = [2, 4, 5, 7, 8, 10, 11, 13]\n\nfor _ in range(int(input())):\n    i, d = input().split()\n    t = sum([m[b] * a for a, b in zip(w, d)])\n    if t % 27 == m[d[-1]]:\n        s = sum([m[b] * 27**a for a, b in zip(range(8), d[:8][::-1])])\n        print(f\"{i} {s}\")\n    else:\n        print(f\"{i} Invalid\")\n
"},{"location":"solutions/#framtiar-fifa","title":"Framt\u00ed\u00f0ar FIFA","text":"Solution in Python Python 
n = int(input())\nm = int(input())\nprint(2022 + n // m)\n
"},{"location":"solutions/#fifty-shades-of-pink","title":"Fifty Shades of Pink","text":"Solution in Python Python 
total = 0\nfor _ in range(int(input())):\n    button = input().lower()\n    if \"pink\" in button or \"rose\" in button:\n        total += 1\nif not total:\n    print(\"I must watch Star Wars with my daughter\")\nelse:\n    print(total)\n
"},{"location":"solutions/#filip","title":"Filip","text":"Solution in Python Python 
a, b = input().split()\na, b = a[::-1], b[::-1]\nif a > b:\n    print(a)\nelse:\n    print(b)\n
"},{"location":"solutions/#final-exam","title":"Final Exam","text":"Solution in Python Python 
n = int(input())\nans, score = [], 0\nfor i in range(n):\n    ans.append(input())\n    if i == 0:\n        continue\n    if ans[i] == ans[i - 1]:\n        score += 1\nprint(score)\n
"},{"location":"solutions/#finding-an-a","title":"Finding An A","text":"Solutions in 3 languages C++GoPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    string a;\n    cin >> a;\n\n    int found = a.find_first_of(\"a\");\n\n    cout << a.substr(found);\n\n    return 0;\n}\n
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scan(&s)\n    index := strings.Index(s, \"a\")\n    fmt.Println(s[index:])\n}\n
word = input()\nprint(word[word.find(\"a\") :])\n
"},{"location":"solutions/#fizzbuzz","title":"FizzBuzz","text":"Solution in Python Python 
x, y, n = [int(d) for d in input().split()]\nfor i in range(1, n + 1):\n    ans = \"\"\n    if not i % x:\n        ans += \"Fizz\"\n    if not i % y:\n        ans += \"Buzz\"\n    if not ans:\n        ans = i\n    print(ans)\n
"},{"location":"solutions/#flexible-spaces","title":"Flexible Spaces","text":"Solution in Python Python 
w, p = [int(d) for d in input().split()]\nl = [int(d) for d in input().split()]\nl = [0] + l + [w]\nc = set()\nfor i in range(p + 1):\n    for j in range(i + 1, p + 2):\n        c.add(l[j] - l[i])\nprint(\" \".join([str(d) for d in sorted(c)]))\n
"},{"location":"solutions/#birthday-memorization","title":"Birthday Memorization","text":"Solution in Python Python 
n = int(input())\nrecords = {}\nfor _ in range(n):\n    s, c, date = input().split()\n    c = int(c)\n    date = \"\".join(date.split(\"/\")[::-1])\n    if date not in records:\n        records[date] = (s, c)\n    else:\n        _, _c = records[date]\n        if c > _c:\n            records[date] = (s, c)\nprint(len(records.keys()))\nordered_keys = sorted(records, key=lambda k: records[k][0])\nfor key in ordered_keys:\n    print(records[key][0])\n
"},{"location":"solutions/#forced-choice","title":"Forced Choice","text":"Solution in Python Python 
_, p, s = input().split()\nfor _ in range(int(s)):\n    if p in input().split()[1:]:\n        print(\"KEEP\")\n    else:\n        print(\"REMOVE\")\n
"},{"location":"solutions/#free-food","title":"Free Food","text":"Solution in Python Python 
n = int(input())\ndays = set()\nfor _ in range(n):\n    start, end = [int(d) for d in input().split()]\n    days.update(range(start, end + 1))\nprint(len(days))\n
"},{"location":"solutions/#from-a-to-b","title":"From A to B","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\n\nif a <= b:\n    print(b - a)\nelse:\n    total = 0\n    while a > b:\n        if a % 2:\n            a += 1\n            total += 1\n        a /= 2\n        total += 1\n    total += b - a\n    print(int(total))\n
"},{"location":"solutions/#fyi","title":"FYI","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scan(&s)\n    if strings.HasPrefix(s, \"555\") {\n        fmt.Println(1)\n    } else {\n        fmt.Println(0)\n    }\n}\n
if input().startswith(\"555\"):\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#gandalfs-spell","title":"Gandalf's Spell","text":"Solution in Python Python 
c = list(input())\ns = input().split()\nif len(c) != len(s):\n    print(\"False\")\nelse:\n    d, valid = {}, True\n    for a, b in zip(c, s):\n        if a not in d:\n            d[a] = b\n        else:\n            if d[a] != b:\n                print(\"False\")\n                valid = False\n                break\n    if valid:\n        if len(set(d.keys())) == len(set(d.values())):\n            print(\"True\")\n        else:\n            print(\"False\")\n
"},{"location":"solutions/#gcd","title":"GCD","text":"Solution in Python Python 
import math\n\na, b = [int(d) for d in input().split()]\n\nprint(math.gcd(a, b))\n
"},{"location":"solutions/#gcvwr","title":"GCVWR","text":"Solution in Python Python 
g, t, n = [int(d) for d in input().split()]\ncapacity = (g - t) * 0.9\nitems = sum([int(d) for d in input().split()])\nprint(int(capacity - items))\n
"},{"location":"solutions/#gene-block","title":"Gene Block","text":"Solution in Python Python 
mapping = {\n    1: 3,\n    2: 6,\n    3: 9,\n    4: 2,\n    5: 5,\n    6: 8,\n    7: 1,\n    8: 4,\n    9: 7,\n    0: 10,\n}\n\nfor _ in range(int(input())):\n    n = int(input())\n    d = n % 10\n\n    if n >= 7 * mapping[d]:\n        print(mapping[d])\n    else:\n        print(-1)\n
"},{"location":"solutions/#gerrymandering","title":"Gerrymandering","text":"Solution in Python Python 
p, _ = [int(d) for d in input().split()]\nvotes = {}\nfor _ in range(p):\n    d, a, b = [int(d) for d in input().split()]\n    if d not in votes:\n        votes[d] = {\"A\": a, \"B\": b}\n    else:\n        votes[d][\"A\"] += a\n        votes[d][\"B\"] += b\n\ntotal_wa, total_wb = 0, 0\nfor d in sorted(votes):\n    total = votes[d][\"A\"] + votes[d][\"B\"]\n    t = total // 2 + 1\n    winner = \"A\" if votes[d][\"A\"] > votes[d][\"B\"] else \"B\"\n    wa = votes[d][\"A\"] - t if votes[d][\"A\"] > votes[d][\"B\"] else votes[d][\"A\"]\n    wb = votes[d][\"B\"] - t if votes[d][\"B\"] > votes[d][\"A\"] else votes[d][\"B\"]\n    print(winner, wa, wb)\n    total_wa += wa\n    total_wb += wb\nv = sum([sum(ab.values()) for ab in votes.values()])\nprint(abs(total_wa - total_wb) / v)\n
"},{"location":"solutions/#glasses-foggy-moms-spaghetti","title":"Glasses Foggy, Mom's Spaghetti","text":"Solution in Python Python 
import math\n\nd, x, y, h = input().split()\nd = int(d)\nx = int(x)\ny = int(y)\nh = int(h)\n\nangle1 = (math.atan(y / x)) - (math.atan((y - h / 2) / x))\nangle2 = (math.atan((y + h / 2) / x)) - (math.atan(y / x))\n\nd1 = math.tan(angle1) * d\nd2 = math.tan(angle2) * d\n\nprint(d1 + d2)\n
"},{"location":"solutions/#goat-rope","title":"Goat Rope","text":"Solution in Python Python 
x, y, x1, y1, x2, y2 = [int(d) for d in input().split()]\n\nif x >= x1 and x <= x2:\n    print(min(abs(y - y1), abs(y - y2)))\nelif y >= y1 and y <= y2:\n    print(min(abs(x - x1), abs(x - x2)))\nelse:\n    x3, y3 = x1, y2\n    x4, y4 = x2, y1\n    l = [\n        ((x - a) ** 2 + (y - b) ** 2) ** 0.5\n        for a, b in [(x1, y1), (x2, y2), (x1, y2), (x2, y1)]\n    ]\n    print(min(l))\n
"},{"location":"solutions/#goomba-stacks","title":"Goomba Stacks","text":"Solution in Python Python 
n = int(input())\ntotal = 0\nresult = True\nfor _ in range(n):\n    g, b = [int(d) for d in input().split()]\n    total += g\n    if total < b:\n        result = False\nprint(\"possible\" if result else \"impossible\")\n
"},{"location":"solutions/#grading","title":"Grading","text":"Solution in Python Python 
line = input()\nscore = int(input())\na, b, c, d, e = [int(d) for d in line.split()]\nif score >= a:\n    print(\"A\")\nelif score >= b:\n    print(\"B\")\nelif score >= c:\n    print(\"C\")\nelif score >= d:\n    print(\"D\")\nelif score >= e:\n    print(\"E\")\nelse:\n    print(\"F\")\n
"},{"location":"solutions/#grass-seed-inc","title":"Grass Seed Inc.","text":"Solution in Python Python 
c = float(input())\ntotal = 0\nfor _ in range(int(input())):\n    w, l = [float(d) for d in input().split()]\n    total += c * w * l\nprint(f\"{total:.7f}\")\n
"},{"location":"solutions/#greedily-increasing-subsequence","title":"Greedily Increasing Subsequence","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()]\n\ng = [a[0]]\nfor i in range(1, n):\n    v = a[i]\n    if v > g[-1]:\n        g.append(v)\nprint(len(g))\nprint(\" \".join([str(d) for d in g]))\n
"},{"location":"solutions/#greedy-polygons","title":"Greedy Polygons","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    n, l, d, g = [int(d) for d in input().split()]\n    a = n * l * l / (4 * math.tan(math.pi / n))\n    a += n * l * d * g\n    a += math.pi * ((d * g) ** 2)\n    print(a)\n
"},{"location":"solutions/#greetings","title":"Greetings!","text":"Solution in Python Python 
print(input().replace(\"e\", \"ee\"))\n
"},{"location":"solutions/#guess-the-number","title":"Guess the Number","text":"Solution in Python Python 
start, end = 1, 1000\nwhile True:\n    guess = (start + end) // 2\n    print(guess)\n    resp = input()\n    if resp == \"correct\":\n        break\n    elif resp == \"higher\":\n        start = guess + 1\n    else:\n        end = guess\n
"},{"location":"solutions/#watch-out-for-those-hailstones","title":"Watch Out For Those Hailstones!","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n)\n\nfunc h(n int) int {\n    if n == 1 {\n        return 1\n    } else if n%2 == 0 {\n        return n + h(n/2)\n    } else {\n        return n + h(3*n+1)\n    }\n}\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    fmt.Println(h(n))\n}\n
def h(n):\n    if n == 1:\n        return 1\n    else:\n        return n + (h(n // 2) if n % 2 == 0 else h(3 * n + 1))\n\n\nn = int(input())\nprint(h(n))\n
"},{"location":"solutions/#hailstone-sequences","title":"Hailstone Sequences","text":"Solution in Python Python 
n = int(input())\ns = [n]\nwhile True:\n    v = s[-1]\n    if v == 1:\n        break\n    elif v % 2 == 0:\n        s.append(v // 2)\n    else:\n        s.append(3 * v + 1)\nprint(len(s))\n
"},{"location":"solutions/#half-a-cookie","title":"Half a Cookie","text":"Solution in Python Python 
import math\n\nwhile True:\n    try:\n        r, x, y = [float(d) for d in input().split()]\n    except:\n        break\n    if x**2 + y**2 >= r**2:\n        print(\"miss\")\n    else:\n        # https://mathworld.wolfram.com/CircularSegment.html\n        d = math.sqrt(x**2 + y**2)\n        h = r - d\n        a = math.acos((r - h) / r)\n        t = (r - h) * math.sqrt(2 * r * h - h * h)\n        p = (r**2) * a\n        s = p - t\n        print(math.pi * (r**2) - s, s)\n
"},{"location":"solutions/#hangman","title":"Hangman","text":"Solution in Python Python 
word = set(list(input()))\nguess = input()\ntries = 0\ncorrect = 0\nfor c in guess:\n    if c in word:\n        correct += 1\n    else:\n        tries += 1\n\n    if correct == len(word):\n        break\n\nif tries >= 10:\n    print(\"LOSE\")\nelse:\n    print(\"WIN\")\n
"},{"location":"solutions/#harshad-numbers","title":"Harshad Numbers","text":"Solution in Python Python 
n = int(input())\nwhile True:\n    sd = sum([int(d) for d in str(n)])\n    if not n % sd:\n        break\n    n += 1\nprint(n)\n
"},{"location":"solutions/#haughty-cuisine","title":"Haughty Cuisine","text":"Solution in Python Python 
from random import randint\n\nn = int(input())\nmenu = []\nfor _ in range(n):\n    menu.append(input().split())\n\nprint(\"\\n\".join(menu[randint(0, n - 1)]))\n
"},{"location":"solutions/#head-guard","title":"Head Guard","text":"Solution in Python Python 
while True:\n    try:\n        s = input()\n    except:\n        break\n    parts = []\n    prev, t = s[0], 1\n    for c in s[1:]:\n        if c != prev:\n            parts.append((prev, t))\n            t = 1\n            prev = c\n        else:\n            t += 1\n    parts.append((prev, t))\n    print(\"\".join([f\"{v}{k}\" for k, v in parts]))\n
"},{"location":"solutions/#heart-rate","title":"Heart Rate","text":"Solution in Python Python 
for _ in range(int(input())):\n    b, p = [float(d) for d in input().split()]\n    min_abpm = 60 / p * (b - 1)\n    bpm = 60 * b / p\n    max_abpm = 60 / p * (b + 1)\n    print(f\"{min_abpm:.4f} {bpm:.4f} {max_abpm:.4f}\")\n
"},{"location":"solutions/#homework","title":"Homework","text":"Solution in Python Python 
total = 0\nparts = input().split(\";\")\nfor part in parts:\n    ranges = part.split(\"-\")\n    if len(ranges) == 1:\n        total += 1\n    else:\n        total += len(range(int(ranges[0]), int(ranges[1]))) + 1\nprint(total)\n
"},{"location":"solutions/#heirs-dilemma","title":"Heir's Dilemma","text":"Solution in Python Python 
l, h = [int(d) for d in input().split()]\ntotal = 0\nfor i in range(l, h + 1):\n    digits = set(str(i))\n    if len(digits) != 6 or \"0\" in digits:\n        continue\n    if not all([i % int(d) == 0 for d in digits]):\n        continue\n    total += 1\nprint(total)\n
"},{"location":"solutions/#heliocentric","title":"Heliocentric","text":"Solution in Python Python 
def offset(d, b):\n    return (b - d % b) % b\n\n\ncc = 1\nwhile True:\n    try:\n        a, b = [int(d) for d in input().split()]\n    except:\n        break\n\n    offset_a, offset_b = offset(a, 365), offset(b, 687)\n\n    if offset_a == offset_b:\n        print(f\"Case {cc}:\", offset_a)\n    else:\n        t = offset_a\n        while True:\n            t += 365\n            if (offset(t, 687) + offset_b) % 687 == 0:\n                break\n        print(f\"Case {cc}:\", t)\n\n    cc += 1\n
"},{"location":"solutions/#hello-world","title":"Hello World!","text":"Solutions in 8 languages C++GoHaskellJavaJavaScriptKotlinPythonRust 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    cout << \"Hello World!\" << endl;\n\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    fmt.Println(\"Hello World!\")\n}\n
main = putStrLn \"Hello World!\"\n
class HelloWorld {\n    public static void main(String[] args) {\n        System.out.println(\"Hello World!\");\n    }\n}\n
console.log(\"Hello World!\");\n
fun main() {\n    println(\"Hello World!\")\n}\n
print(\"Hello World!\")\n
fn main() {\n    println!(\"Hello World!\");\n}\n
"},{"location":"solutions/#help-a-phd-candidate-out","title":"Help a PhD candidate out!","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    line = input()\n    parts = line.split(\"+\")\n    if len(parts) == 1:\n        print(\"skipped\")\n    else:\n        print(int(parts[0]) + int(parts[1]))\n
"},{"location":"solutions/#herman","title":"Herman","text":"Solution in Python Python 
import math\n\nr = int(input())\nprint(f\"{math.pi*r*r:.6f}\")\nprint(2 * r * r)\n
"},{"location":"solutions/#hissing-microphone","title":"Hissing Microphone","text":"Solutions in 3 languages C++JavaScriptPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    string a;\n    cin >> a;\n\n    if (a.find(\"ss\") == -1)\n    {\n        cout << \"no hiss\" << endl;\n    }\n    else\n    {\n        cout << \"hiss\" << endl;\n    }\n\n    return 0;\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  if (line.includes(\"ss\")) {\n    console.log(\"hiss\");\n  } else {\n    console.log(\"no hiss\");\n  }\n});\n
a = input()\nif \"ss\" in a:\n    print(\"hiss\")\nelse:\n    print(\"no hiss\")\n
"},{"location":"solutions/#hitting-the-targets","title":"Hitting the Targets","text":"Solution in Python Python 
def in_rectangle(x1, y1, x2, y2, x, y):\n    x1, x2 = min(x1, x2), max(x1, x2)\n    y1, y2 = min(y1, y2), max(y1, y2)\n    if x in range(x1, x2 + 1) and y in range(y1, y2 + 1):\n        return True\n    else:\n        return False\n\n\ndef in_circle(x0, y0, r, x, y):\n    return (x0 - x) ** 2 + (y0 - y) ** 2 <= r**2\n\n\nm = int(input())\nshapes = []\nfor _ in range(m):\n    values = input().split()\n    shapes.append((values[0], *[int(d) for d in values[1:]]))\n\nn = int(input())\nfor _ in range(n):\n    total = 0\n    x, y = [int(d) for d in input().split()]\n    for shape in shapes:\n        if shape[0] == \"rectangle\":\n            total += in_rectangle(*shape[1:], x, y)\n        elif shape[0] == \"circle\":\n            total += in_circle(*shape[1:], x, y)\n    print(total)\n
"},{"location":"solutions/#hot-hike","title":"Hot Hike","text":"Solution in Python Python 
n = int(input())\nt = [int(d) for d in input().split()]\norder = sorted(range(n - 2), key=lambda k: max(t[k], t[k + 2]))\nd = order[0]\nv = max(t[d], t[d + 2])\nprint(d + 1, v)\n
"},{"location":"solutions/#hragreining","title":"Hra\u00f0greining","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scan(&s)\n    if strings.Contains(s, \"COV\") {\n        fmt.Println(\"Veikur!\")\n    } else {\n        fmt.Println(\"Ekki veikur!\")\n    }\n}\n
print(\"Veikur!\" if \"COV\" in input() else \"Ekki veikur!\")\n
"},{"location":"solutions/#the-amazing-human-cannonball","title":"The Amazing Human Cannonball","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    v0, a, x1, h1, h2 = [float(d) for d in input().split()]\n    a = math.radians(a)\n    t = x1 / (v0 * math.cos(a))\n    y = v0 * t * math.sin(a) - 0.5 * 9.81 * (t**2)\n    if y < h1 + 1 or y > h2 - 1:\n        print(\"Not Safe\")\n    else:\n        print(\"Safe\")\n
"},{"location":"solutions/#hvert-skal-mta","title":"Hvert Skal M\u00e6ta?","text":"Solution in Python Python 
mapping = {\n    \"Reykjavik\": \"Reykjavik\",\n    \"Kopavogur\": \"Reykjavik\",\n    \"Hafnarfjordur\": \"Reykjavik\",\n    \"Reykjanesbaer\": \"Reykjavik\",\n    \"Akureyri\": \"Akureyri\",\n    \"Gardabaer\": \"Reykjavik\",\n    \"Mosfellsbaer\": \"Reykjavik\",\n    \"Arborg\": \"Reykjavik\",\n    \"Akranes\": \"Reykjavik\",\n    \"Fjardabyggd\": \"Akureyri\",\n    \"Mulathing\": \"Akureyri\",\n    \"Seltjarnarnes\": \"Reykjavik\",\n}\nprint(mapping[input()])\n
"},{"location":"solutions/#icpc-awards","title":"ICPC Awards","text":"Solution in Python Python 
n = int(input())\nshown = {}\nfor _ in range(n):\n    u, t = input().split()\n    if u not in shown and len(shown.keys()) < 12:\n        print(u, t)\n        shown[u] = True\n
"},{"location":"solutions/#illuminati-spotti","title":"Illuminati Spotti","text":"Solution in Python Python 
n = int(input())\nm = []\nfor _ in range(n):\n    m.append(input().split())\ntotal = 0\nfor i in range(1, n - 1):\n    for j in range(i):\n        for k in range(i + 1, n):\n            if m[i][j] == m[k][j] == m[k][i] == \"1\":\n                total += 1\nprint(total)\n
"},{"location":"solutions/#inheritance","title":"Inheritance","text":"Solution in Python Python 
from itertools import product\n\np = input()\nans = []\nfor i in range(len(p)):\n    for t in product(\"24\", repeat=i + 1):\n        if int(p) % int(\"\".join(t)) == 0:\n            ans.append(int(\"\".join(t)))\nprint(\"\\n\".join([str(d) for d in sorted(ans)]))\n
"},{"location":"solutions/#international-dates","title":"International Dates","text":"Solution in Python Python 
aa, bb, _ = [int(d) for d in input().split(\"/\")]\n\nif aa > 12 and bb <= 12:\n    print(\"EU\")\nelif aa <= 12 and bb > 12:\n    print(\"US\")\nelse:\n    print(\"either\")\n
"},{"location":"solutions/#isithalloweencom","title":"IsItHalloween.com","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var m, d string\n    fmt.Scan(&m)\n    fmt.Scan(&d)\n    if (m == \"OCT\" && d == \"31\") || (m == \"DEC\" && d == \"25\") {\n        fmt.Println(\"yup\")\n    } else {\n        fmt.Println(\"nope\")\n    }\n}\n
m, d = input().split()\nif (m == \"OCT\" and d == \"31\") or (m == \"DEC\" and d == \"25\"):\n    print(\"yup\")\nelse:\n    print(\"nope\")\n
"},{"location":"solutions/#jabuke","title":"Jabuke","text":"Solution in Python Python 
xa, ya = [int(d) for d in input().split()]\nxb, yb = [int(d) for d in input().split()]\nxc, yc = [int(d) for d in input().split()]\nn = int(input())\narea = abs(xa * (yb - yc) + xb * (yc - ya) + xc * (ya - yb)) / 2\nprint(f\"{area:.1f}\")\n\n\ndef sign(x1, y1, x2, y2, x3, y3):\n    return (x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3)\n\n\ndef in_triangle(x, y, x1, y1, x2, y2, x3, y3):\n    d1 = sign(x, y, x1, y1, x2, y2)\n    d2 = sign(x, y, x2, y2, x3, y3)\n    d3 = sign(x, y, x3, y3, x1, y1)\n\n    has_neg = d1 < 0 or d2 < 0 or d3 < 0\n    has_pos = d1 > 0 or d2 > 0 or d3 > 0\n\n    return not (has_neg and has_pos)\n\n\ntotal = 0\nfor _ in range(n):\n    x, y = [int(d) for d in input().split()]\n    if in_triangle(x, y, xa, ya, xb, yb, xc, yc):\n        total += 1\nprint(total)\n
"},{"location":"solutions/#jack-o-lantern-juxtaposition","title":"Jack-O'-Lantern Juxtaposition","text":"Solution in Python Python 
numbers = [int(n) for n in input().split()]\nresult = 1\nfor n in numbers:\n    result *= n\nprint(result)\n
"},{"location":"solutions/#janitor-troubles","title":"Janitor Troubles","text":"Solution in Python Python 
import math\n\na, b, c, d = [int(d) for d in input().split()]\ns = (a + b + c + d) / 2\nprint(math.sqrt((s - a) * (s - b) * (s - c) * (s - d)))\n
"},{"location":"solutions/#jewelry-box","title":"Jewelry Box","text":"Solution in Python Python 
def f(h):\n    a = x - 2 * h\n    b = y - 2 * h\n    return a * b * h\n\n\nfor _ in range(int(input())):\n    x, y = [int(d) for d in input().split()]\n    h = (x + y - ((x + y) ** 2 - 3 * x * y) ** 0.5) / 6\n    print(f\"{f(h):.11f}\")\n
"},{"location":"solutions/#job-expenses","title":"Job Expenses","text":"Solution in Python Python 
_ = input()\nprint(-sum([int(d) for d in input().split() if \"-\" in d]))\n
"},{"location":"solutions/#joint-jog-jam","title":"Joint Jog Jam","text":"Solution in Python Python 
import math\n\n\ndef dist(x1, y1, x2, y2):\n    return math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\n\n\ncoords = [int(d) for d in input().split()]\nprint(max(dist(*coords[:4]), dist(*coords[4:])))\n
"},{"location":"solutions/#judging-moose","title":"Judging Moose","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var l, r int\n    fmt.Scan(&l)\n    fmt.Scan(&r)\n    if l == 0 && r == 0 {\n        fmt.Println(\"Not a moose\")\n    } else {\n        p := 2 * l\n        if r > l {\n            p = 2 * r\n        }\n        t := \"Odd\"\n        if l == r {\n            t = \"Even\"\n        }\n        fmt.Println(t, p)\n    }\n}\n
l, r = [int(d) for d in input().split()]\nif not l and not r:\n    print(\"Not a moose\")\nelse:\n    p = 2 * max(l, r)\n    print(\"Odd\" if l != r else \"Even\", p)\n
"},{"location":"solutions/#jumbo-javelin","title":"Jumbo Javelin","text":"Solution in Python Python 
n = int(input())\nlength = 0\nfor _ in range(n):\n    length += int(input())\nlength -= n - 1\nprint(length)\n
"},{"location":"solutions/#just-a-minute","title":"Just a Minute","text":"Solution in Python Python 
a, b = [], []\nfor _ in range(int(input())):\n    x, y = [int(d) for d in input().split()]\n    a.append(x * 60)\n    b.append(y)\nans = sum(b) / sum(a)\nif ans <= 1:\n    ans = \"measurement error\"\nprint(ans)\n
"},{"location":"solutions/#running-race","title":"Running Race","text":"Solution in Python Python 
l, k, _ = [int(d) for d in input().split()]\n\nrecord = {}\nfor _ in range(l):\n    i, t = input().split()\n    mm, ss = [int(d) for d in t.split(\".\")]\n    s = mm * 60 + ss\n    if i in record:\n        record[i].append(s)\n    else:\n        record[i] = [s]\n\ndelete = [i for i in record if len(record[i]) != k]\nfor i in delete:\n    record.pop(i)\n\nsorted_i = sorted(record, key=lambda i: (sum(record[i]), int(i)))\nprint(\"\\n\".join(sorted_i))\n
"},{"location":"solutions/#karte","title":"Karte","text":"Solution in Python Python 
from collections import Counter\n\ns = input()\ncards = {\n    \"P\": Counter(),\n    \"K\": Counter(),\n    \"H\": Counter(),\n    \"T\": Counter(),\n}\nduplicated = False\nfor i in range(0, len(s), 3):\n    suit = s[i]\n    card = s[i + 1 : i + 3]\n    if cards[suit][card]:\n        duplicated = True\n        break\n    cards[suit][card] += 1\n\nif not duplicated:\n    print(\" \".join([str(13 - len(c)) for c in cards.values()]))\nelse:\n    print(\"GRESKA\")\n
"},{"location":"solutions/#kemija","title":"Kemija","text":"Solutions in 2 languages JavaScriptPython 
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  for (let c of \"aeiou\") {\n    const regex = new RegExp(`${c}p${c}`, \"g\");\n    line = line.replace(regex, c);\n  }\n  console.log(line);\n});\n
s = input()\n\nfor c in \"aeiou\":\n    s = s.replace(f\"{c}p{c}\", c)\n\nprint(s)\n
"},{"location":"solutions/#the-key-to-cryptography","title":"The Key to Cryptography","text":"Solution in Python Python 
import string\n\nuppers = string.ascii_uppercase\n\n\ndef decrypt(c, k):\n    index = (uppers.index(c) - uppers.index(k)) % 26\n    return uppers[index]\n\n\nm, w = input(), input()\n\nsize_w = len(w)\nsize_m = len(m)\no = []\nfor i in range(0, size_m, size_w):\n    if i + size_w < size_m:\n        l = zip(m[i : i + size_w], w)\n    else:\n        l = zip(m[i:], w)\n    t = \"\".join([decrypt(c, k) for c, k in l])\n    o.append(t)\n    w = t\nprint(\"\".join(o))\n
"},{"location":"solutions/#keywords","title":"Keywords","text":"Solution in Python Python 
keywords = set()\nfor _ in range(int(input())):\n    keywords.add(input().lower().replace(\"-\", \" \"))\nprint(len(keywords))\n
"},{"location":"solutions/#kitten-on-a-tree","title":"Kitten on a Tree","text":"Solution in Python Python 
k = input()\nb = []\nwhile True:\n    line = input()\n    if line == \"-1\":\n        break\n    b.append(line.split())\n\np = [k]\nt = k\nwhile True:\n    found = False\n    for row in b:\n        if t in row[1:]:\n            p.append(row[0])\n            found = True\n            t = row[0]\n            break\n    if not found:\n        break\n\nprint(\" \".join(p))\n
"},{"location":"solutions/#kleptography","title":"Kleptography","text":"Solution in Python Python 
from string import ascii_lowercase as l\n\n\nn, m = [int(d) for d in input().split()]\np = input()\nc = input()\np = p[::-1]\nc = c[::-1]\n\nans = \"\"\nfor i in range(0, m, n):\n    if i + n < m:\n        part = c[i : i + n]\n    else:\n        part = c[i:]\n\n    ans += p\n    p = \"\".join([l[(l.index(a) - l.index(b)) % 26] for a, b in zip(part, p)])\n\nans += p\nprint(ans[::-1][n:])\n
"},{"location":"solutions/#knight-packing","title":"Knight Packing","text":"Solution in Python Python 
if int(input()) % 2:\n    print(\"first\")\nelse:\n    print(\"second\")\n
"},{"location":"solutions/#knot-knowledge","title":"Knot Knowledge","text":"Solution in Python Python 
input()\ntotal = set(input().split())\nknown = set(input().split())\nprint((total - known).pop())\n
"},{"location":"solutions/#kornislav","title":"Kornislav","text":"Solution in Python Python 
numbers = sorted([int(d) for d in input().split()])\nprint(numbers[0] * numbers[2])\n
"},{"location":"solutions/#krizaljka","title":"Kri\u017ealjka","text":"Solution in Python Python 
a, b = input().split()\nfor i in range(len(a)):\n    if a[i] in b:\n        j = b.index(a[i])\n        break\n\nrows = []\n\nfor k in range(j):\n    rows.append(\".\" * i + b[k] + \".\" * (len(a) - i - 1))\n\nrows.append(a)\n\nfor k in range(j + 1, len(b)):\n    rows.append(\".\" * i + b[k] + \".\" * (len(a) - i - 1))\n\nprint(\"\\n\".join(rows))\n
"},{"location":"solutions/#ladder","title":"Ladder","text":"Solution in Python Python 
import math\n\nh, v = [int(d) for d in input().split()]\nprint(math.ceil(h / math.sin(math.radians(v))))\n
"},{"location":"solutions/#lamps","title":"Lamps","text":"Solution in Python Python 
h, p = [int(d) for d in input().split()]\n\ndays = 0\ncost_bulb, cost_lamp = 5, 60\nused_bulb, used_lamp = 0, 0\n\nwhile True:\n    days += 1\n    cost_bulb += 60 * h * p / 100000\n    cost_lamp += 11 * h * p / 100000\n    used_bulb += h\n    used_lamp += h\n\n    if used_bulb > 1000:\n        cost_bulb += 5\n        used_bulb -= 1000\n\n    if used_lamp > 8000:\n        cost_lamp += 60\n        used_lamp -= 8000\n\n    if cost_bulb > cost_lamp:\n        break\n\nprint(days)\n
"},{"location":"solutions/#laptop-sticker","title":"Laptop Sticker","text":"Solutions in 3 languages C++GoPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int wc, hc, ws, hs;\n    cin >> wc >> hc >> ws >> hs;\n    if (wc - 2 >= ws && hc - 2 >= hs)\n    {\n        cout << 1 << endl;\n    }\n    else\n    {\n        cout << 0 << endl;\n    }\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var wc, hc, ws, hs int\n    fmt.Scan(&wc)\n    fmt.Scan(&hc)\n    fmt.Scan(&ws)\n    fmt.Scan(&hs)\n    if wc-2 >= ws && hc-2 >= hs {\n\n        fmt.Println(1)\n\n    } else {\n\n        fmt.Println(0)\n\n    }\n}\n
wc, hc, ws, hs = [int(d) for d in input().split()]\nif wc - 2 >= ws and hc - 2 >= hs:\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#last-factorial-digit","title":"Last Factorial Digit","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = int(input())\n    number = 1\n    for i in range(1, n + 1):\n        number *= i\n    print(number % 10)\n
"},{"location":"solutions/#left-beehind","title":"Left Beehind","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x, y int\n    for true {\n        fmt.Scan(&x)\n        fmt.Scan(&y)\n        if x == 0 && y == 0 {\n            break\n        }\n        if x+y == 13 {\n            fmt.Println(\"Never speak again.\")\n        } else if x > y {\n            fmt.Println(\"To the convention.\")\n        } else if x == y {\n            fmt.Println(\"Undecided.\")\n        } else {\n            fmt.Println(\"Left beehind.\")\n        }\n    }\n}\n
import java.util.Scanner;\n\nclass LeftBeehind {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        while (true) {\n            int x = s.nextInt();\n            int y = s.nextInt();\n            if (x == 0 && y == 0) {\n                break;\n            }\n            if (x + y == 13) {\n                System.out.println(\"Never speak again.\");\n            } else if (x > y) {\n                System.out.println(\"To the convention.\");\n            } else if (x == y) {\n                System.out.println(\"Undecided.\");\n            } else {\n                System.out.println(\"Left beehind.\");\n            }\n        }\n    }\n}\n
while True:\n    x, y = [int(d) for d in input().split()]\n    if not x and not y:\n        break\n    if x + y == 13:\n        print(\"Never speak again.\")\n    elif x > y:\n        print(\"To the convention.\")\n    elif x == y:\n        print(\"Undecided.\")\n    else:\n        print(\"Left beehind.\")\n
"},{"location":"solutions/#leggja-saman","title":"Leggja saman","text":"Solution in Python Python 
m = int(input())\nn = int(input())\nprint(m + n)\n
"},{"location":"solutions/#license-to-launch","title":"License to Launch","text":"Solution in Python Python 
_ = input()\njunks = [int(d) for d in input().split()]\nprint(junks.index(min(junks)))\n
"},{"location":"solutions/#line-them-up","title":"Line Them Up","text":"Solution in Python Python 
n = int(input())\nnames = []\nfor _ in range(n):\n    names.append(input())\norder = []\nfor i in range(1, n):\n    order.append(names[i] > names[i - 1])\nif all(order):\n    print(\"INCREASING\")\nelif not any(order):\n    print(\"DECREASING\")\nelse:\n    print(\"NEITHER\")\n
"},{"location":"solutions/#a-list-game","title":"A List Game","text":"Solution in Python Python 
import math\n\nx = int(input())\n\np = 1\ntotal = 0\n\nwhile x % 2 == 0:\n    p = 2\n    x /= 2\n    total += 1\n\n\nfor i in range(3, math.ceil(math.sqrt(x)) + 1, 2):\n    while x % i == 0:\n        p = i\n        x /= i\n        total += 1\nif x > 1:\n    total += 1\n\n\nif p == 1:\n    total = 1\n\n\nprint(total)\n
"},{"location":"solutions/#locust-locus","title":"Locust Locus","text":"Solution in Python Python 
from math import gcd\n\nn = int(input())\nl = []\nfor _ in range(n):\n    y, c1, c2 = [int(d) for d in input().split()]\n    g = gcd(c1, c2)\n    l.append(y + g * (c1 // g) * (c2 // g))\nprint(min(l))\n
"},{"location":"solutions/#logic-functions","title":"Logic Functions","text":"Solution in C++ C++ 
#include \"logicfunctions.h\"\n\n// Compute xor\nvoid exclusive(bool x, bool y, bool &ans)\n{\n    ans = x != y;\n}\n\n// Compute implication\nvoid implies(bool x, bool y, bool &ans)\n{\n    if (x && !y)\n    {\n        ans = false;\n    }\n    else\n    {\n        ans = true;\n    }\n}\n\n// Compute equivalence\nvoid equivalence(bool x, bool y, bool &ans)\n{\n    ans = x == y;\n}\n
"},{"location":"solutions/#lost-lineup","title":"Lost Lineup","text":"Solution in Python Python 
n = int(input())\norder = [int(d) for d in input().split()]\nd = range(1, n)\norder = dict(zip(d, order))\nranges = range(1, n + 1)\nresult = [\"1\"]\nfor k in sorted(order, key=lambda x: order[x]):\n    result.append(str(ranges[k]))\nprint(\" \".join(result))\n
"},{"location":"solutions/#luhns-checksum-algorithm","title":"Luhn's Checksum Algorithm","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = input()[::-1]\n    checksum = 0\n    for i in range(len(n)):\n        s = int(n[i]) * (i % 2 + 1)\n        if s > 9:\n            s = sum([int(d) for d in str(s)])\n        checksum += s\n\n    print(\"FAIL\" if checksum % 10 else \"PASS\")\n
"},{"location":"solutions/#magic-trick","title":"Magic Trick","text":"Solution in Python Python 
s = input()\ncounter = {}\nguess = 1\nfor c in s:\n    if c in counter:\n        guess = 0\n        break\n    else:\n        counter[c] = None\nprint(guess)\n
"},{"location":"solutions/#making-a-meowth","title":"Making A Meowth","text":"Solution in Python Python 
n, p, x, y = [int(d) for d in input().split()]\nprint(p * x + p // (n - 1) * y)\n
"},{"location":"solutions/#identifying-map-tiles","title":"Identifying Map Tiles","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"fmt\"\n    \"math\"\n)\n\nfunc main() {\n    var s string\n    fmt.Scanln(&s)\n    zoom := len(s)\n    var x, y float64\n    for i := 0; i < zoom; i++ {\n        d := math.Pow(2, float64(zoom)-float64(i)-1)\n        if s[i] == '1' {\n            x += d\n        } else if s[i] == '2' {\n            y += d\n        } else if s[i] == '3' {\n            x += d\n            y += d\n        }\n    }\n    fmt.Printf(\"%d %d %d\", zoom, int64(x), int64(y))\n}\n
s = input()\nx, y = 0, 0\nzoom = len(s)\nfor i in range(len(s)):\n    d = 2 ** (zoom - i - 1)\n    if s[i] == \"1\":\n        x += d\n    elif s[i] == \"2\":\n        y += d\n    elif s[i] == \"3\":\n        x += d\n        y += d\nprint(f\"{zoom} {x} {y}\")\n
"},{"location":"solutions/#marko","title":"Marko","text":"Solution in Python Python 
mapping = {\n    \"2\": \"abc\",\n    \"3\": \"def\",\n    \"4\": \"ghi\",\n    \"5\": \"jkl\",\n    \"6\": \"mno\",\n    \"7\": \"pqrs\",\n    \"8\": \"tuv\",\n    \"9\": \"wxyz\",\n}\nn = []\nfor _ in range(int(input())):\n    w = input()\n    t = \"\"\n    for c in w:\n        for d, r in mapping.items():\n            if c in r:\n                t += d\n                break\n    n.append(t)\n\nd = input()\nprint(sum([d == t for t in n]))\n
"},{"location":"solutions/#mars-window","title":"Mars Window","text":"Solution in Python Python 
y = int(input())\nprint(\"YES\" if 26 - ((y - 2018) * 12 - 4) % 26 <= 12 else \"NO\")\n
"},{"location":"solutions/#math-homework","title":"Math Homework","text":"Solution in Python Python 
b, d, c, l = [int(d) for d in input().split()]\nsolved = False\nfor i in range(l // b + 1):\n    for j in range((l - b * i) // d + 1):\n        for k in range((l - b * i - d * j) // c + 1):\n            if b * i + d * j + c * k == l:\n                print(i, j, k)\n                solved = True\nif not solved:\n    print(\"impossible\")\n
"},{"location":"solutions/#mean-words","title":"Mean Words","text":"Solution in Python Python 
n = int(input())\nwords = []\nfor _ in range(n):\n    words.append(input())\nm = max([len(w) for w in words])\nans = []\nfor i in range(m):\n    values = [ord(w[i]) for w in words if len(w) > i]\n    ans.append(sum(values) // len(values))\nprint(\"\".join(chr(d) for d in ans))\n
"},{"location":"solutions/#imperial-measurement","title":"Imperial Measurement","text":"Solution in Python Python 
mapping = {\n    \"th\": \"thou\",\n    \"in\": \"inch\",\n    \"ft\": \"foot\",\n    \"yd\": \"yard\",\n    \"ch\": \"chain\",\n    \"fur\": \"furlong\",\n    \"mi\": \"mile\",\n    \"lea\": \"league\",\n}\nnames = list(mapping.values())\nscale = [1, 1000, 12, 3, 22, 10, 8, 3]\n\nv, a, _, b = input().split()\nv = int(v)\nna, nb = mapping.get(a, a), mapping.get(b, b)\nia, ib = names.index(na), names.index(nb)\n\nrate = 1\nfor s in scale[min(ia, ib) + 1 : max(ia, ib) + 1]:\n    rate *= s\n\nprint(v * rate if ia > ib else v / rate)\n
"},{"location":"solutions/#metaprogramming","title":"Metaprogramming","text":"Solution in Python Python 
c = {}\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    parts = s.split()\n    if parts[0] == \"define\":\n        v, n = parts[1:]\n        c[n] = int(v)\n    elif parts[0] == \"eval\":\n        x, y, z = parts[1:]\n        if x not in c or z not in c:\n            print(\"undefined\")\n        elif y == \"=\":\n            print(\"true\" if c[x] == c[z] else \"false\")\n        elif y == \">\":\n            print(\"true\" if c[x] > c[z] else \"false\")\n        elif y == \"<\":\n            print(\"true\" if c[x] < c[z] else \"false\")\n
"},{"location":"solutions/#methodic-multiplication","title":"Methodic Multiplication","text":"Solution in Python Python 
a, b = input(), input()\nt = a.count(\"S\") * b.count(\"S\")\nprint(\"S(\" * t + \"0\" + \")\" * t)\n
"},{"location":"solutions/#metronome","title":"Metronome","text":"Solution in Python Python 
n = int(input())\nprint(f\"{n/4:.2f}\")\n
"},{"location":"solutions/#mia","title":"Mia","text":"Solution in Python Python 
def score(a, b):\n    roll = set([a, b])\n    if roll == {1, 2}:\n        return (3, None)\n    elif len(roll) == 1:\n        return (2, a)\n    else:\n        a, b = min(a, b), max(b, a)\n        return (1, 10 * b + a)\n\n\nwhile True:\n    rolls = [int(d) for d in input().split()]\n    if not any(rolls):\n        break\n    score1 = score(*rolls[:2])\n    score2 = score(*rolls[2:])\n    if score1 == score2:\n        print(\"Tie.\")\n    elif score1[0] == score2[0]:\n        print(f\"Player {1 if score1[1] > score2[1] else 2} wins.\")\n    else:\n        print(f\"Player {1 if score1[0] > score2[0] else 2} wins.\")\n
"},{"location":"solutions/#missing-numbers","title":"Missing Numbers","text":"Solution in Python Python 
numbers = []\nfor _ in range(int(input())):\n    numbers.append(int(input()))\n\nis_good_job = True\nfor i in range(1, max(numbers) + 1):\n    if i not in numbers:\n        is_good_job = False\n        print(i)\n\nif is_good_job:\n    print(\"good job\")\n
"},{"location":"solutions/#mixed-fractions","title":"Mixed Fractions","text":"Solution in Python Python 
while True:\n    m, n = [int(d) for d in input().split()]\n    if not m and not n:\n        break\n    a = m // n\n    b = m % n\n    print(f\"{a} {b} / {n}\")\n
"},{"location":"solutions/#mjehuric","title":"Mjehuric","text":"Solution in Python Python 
f = input().split()\nwhile f != [str(d) for d in range(1, 6)]:\n    for i in range(4):\n        if f[i] > f[i + 1]:\n            f[i], f[i + 1] = f[i + 1], f[i]\n            print(\" \".join(f))\n
"},{"location":"solutions/#moderate-pace","title":"Moderate Pace","text":"Solution in Python Python 
n = int(input())\ndistances = [[int(d) for d in input().split()] for _ in range(3)]\nplan = [sorted([d[i] for d in distances])[1] for i in range(n)]\nprint(\" \".join([str(d) for d in plan]))\n
"},{"location":"solutions/#modulo","title":"Modulo","text":"Solution in Python Python 
n = set()\nfor _ in range(10):\n    n.add(int(input()) % 42)\nprint(len(n))\n
"},{"location":"solutions/#monopoly","title":"Monopoly","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()]\nt = 0\nm = 0\nfor i in range(1, 7):\n    for j in range(1, 7):\n        t += 1\n        if i + j in a:\n            m += 1\nprint(m / t)\n
"},{"location":"solutions/#moscow-dream","title":"Moscow Dream","text":"Solution in Python Python 
a, b, c, n = [int(d) for d in input().split()]\n\nif not all(d > 0 for d in [a, b, c]):\n    print(\"NO\")\nelse:\n    print(\"YES\" if a + b + c >= n and n >= 3 else \"NO\")\n
"},{"location":"solutions/#mosquito-multiplication","title":"Mosquito Multiplication","text":"Solution in Python Python 
while True:\n    try:\n        m, p, l, e, r, s, n = [int(d) for d in input().split()]\n    except:\n        break\n    for _ in range(n):\n        pp = p\n        p = l // r\n        l = e * m\n        m = pp // s\n    print(m)\n
"},{"location":"solutions/#mrcodeformatgrader","title":"MrCodeFormatGrader","text":"Solution in Python Python 
def f(numbers):\n    prev = numbers[0]\n    ans = {prev: 1}\n    for i in range(1, len(numbers)):\n        if numbers[i] == prev + ans[prev]:\n            ans[prev] += 1\n        else:\n            prev = numbers[i]\n            ans[prev] = 1\n\n    parts = [\n        f\"{key}-{key+value-1}\"\n        if value > 1\n        else \" \".join([str(d) for d in range(key, key + value)])\n        for key, value in ans.items()\n    ]\n\n    return \", \".join(parts[:-1]) + \" and \" + parts[-1]\n\n\nc, n = [int(d) for d in input().split()]\nerrors = [int(d) for d in input().split()]\ncorrect = [i for i in range(1, 1 + c) if i not in errors]\n\nprint(\"Errors:\", f(errors))\nprint(\"Correct:\", f(correct))\n
"},{"location":"solutions/#mult","title":"Mult!","text":"Solution in Python Python 
n = int(input())\nb = None\nfor _ in range(n):\n    d = int(input())\n    if not b:\n        b = d\n        continue\n\n    if d % b == 0:\n        print(d)\n        b = None\n
"},{"location":"solutions/#mumble-rap","title":"Mumble Rap","text":"Solution in Python Python 
n = int(input())\ns = input()\na = []\nd = \"\"\nimport string\n\nfor i in range(n):\n    if s[i] in string.digits:\n        d += s[i]\n\n    else:\n        if d:\n            a.append(int(d))\n            d = \"\"\nif d:\n    a.append(int(d))\n\nprint(max(a))\n
"},{"location":"solutions/#musical-scales","title":"Musical Scales","text":"Solution in Python Python 
notes = [\"A\", \"A#\", \"B\", \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\"]\noffset = [2, 2, 1, 2, 2, 2]\nmajors = {}\nfor i in range(len(notes)):\n    name = notes[i]\n    progression = [name]\n    for i in offset:\n        index = (notes.index(progression[-1]) + i) % len(notes)\n        progression.append(notes[index])\n    majors[name] = progression\n\n_ = input()\nscales = set(input().split())\nprint(\" \".join([n for n in majors if scales < set(majors[n])]) or \"none\")\n
"},{"location":"solutions/#music-your-way","title":"Music Your Way","text":"Solution in Python Python 
cols = input().split()\nm = int(input())\nsongs = [input().split() for _ in range(m)]\nn = int(input())\n\nfor i in range(n):\n    col = input()\n    index = cols.index(col)\n    songs = sorted(songs, key=lambda k: k[index])\n    print(\" \".join(cols))\n    for song in songs:\n        print(\" \".join(song))\n    if i < n - 1:\n        print()\n
"},{"location":"solutions/#mylla","title":"Mylla","text":"Solution in Python Python 
board = []\nfor _ in range(3):\n    board.append(list(input()))\n\nwinner = \"\"\nfor i in range(3):\n    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != \"_\":\n        winner = board[i][0]\n        break\n    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != \"_\":\n        winner = board[0][i]\n        break\n\nif board[0][0] == board[1][1] == board[2][2] and board[1][1] != \"_\":\n    winner = board[1][1]\nelif board[0][2] == board[1][1] == board[2][0] and board[1][1] != \"_\":\n    winner = board[1][1]\n\nif winner == \"O\":\n    winner = \"Jebb\"\nelse:\n    winner = \"Neibb\"\n\nprint(winner)\n
"},{"location":"solutions/#nasty-hacks","title":"Nasty Hacks","text":"Solutions in 2 languages C++Python 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n, r, e, c;\n    cin >> n;\n\n    for (int i = 0; i < n; i++)\n    {\n        cin >> r >> e >> c;\n        if ((e - c) > r)\n        {\n            cout << \"advertise\";\n        }\n        else if ((e - c) < r)\n        {\n            cout << \"do not advertise\";\n        }\n        else\n        {\n            cout << \"does not matter\";\n        }\n    }\n}\n
for _ in range(int(input())):\n    r, e, c = [int(d) for d in input().split()]\n    if e > r + c:\n        print(\"advertise\")\n    elif e < r + c:\n        print(\"do not advertise\")\n    else:\n        print(\"does not matter\")\n
"},{"location":"solutions/#no-duplicates","title":"No Duplicates","text":"Solution in Python Python 
words = input().split()\n\ncounter = {}\nrepeated = False\nfor w in words:\n    if w in counter:\n        repeated = True\n        break\n    else:\n        counter[w] = None\nif repeated:\n    print(\"no\")\nelse:\n    print(\"yes\")\n
"},{"location":"solutions/#no-thanks","title":"No Thanks!","text":"Solution in Python Python 
n = int(input())\nv = sorted([int(d) for d in input().split()])\n\nprev = v[0]\nans = {prev: 1}\nfor i in range(1, n):\n    if v[i] == prev + ans[prev]:\n        ans[prev] += 1\n    else:\n        prev = v[i]\n        ans[prev] = 1\n\nprint(sum(ans.keys()))\n
"},{"location":"solutions/#n-sum","title":"N-sum","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass NSum {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int ans = 0;\n        for (int i = 0; i < n; i++) {\n            ans += s.nextInt();\n        }\n        System.out.println(ans);\n    }\n}\n
_ = int(input())\nnumbers = []\nfor d in input().split():\n    numbers.append(int(d))\nprint(sum(numbers))\n
"},{"location":"solutions/#number-fun","title":"Number Fun","text":"Solution in Python Python 
for _ in range(int(input())):\n    a, b, c = [int(d) for d in input().split()]\n    if a + b == c or a * b == c or a - b == c or b - a == c or a / b == c or b / a == c:\n        print(\"Possible\")\n    else:\n        print(\"Impossible\")\n
"},{"location":"solutions/#odd-echo","title":"Odd Echo","text":"Solution in Python Python 
n = int(input())\nwords = []\nfor _ in range(n):\n    words.append(input())\nfor i in range(0, n, 2):\n    print(words[i])\n
"},{"location":"solutions/#odd-gnome","title":"Odd Gnome","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    g = [int(d) for d in input().split()][1:]\n    prev = g[0]\n    for i in range(1, len(g)):\n        if g[i] != prev + 1:\n            break\n        prev = g[i]\n    print(i + 1)\n
"},{"location":"solutions/#oddities","title":"Oddities","text":"Solution in Python Python 
n = int(input())\nfor _ in range(n):\n    x = int(input())\n    if x % 2:\n        res = \"odd\"\n    else:\n        res = \"even\"\n    print(f\"{x} is {res}\")\n
"},{"location":"solutions/#odd-man-out","title":"Odd Man Out","text":"Solution in Python Python 
from collections import Counter\n\nn = int(input())\nfor i in range(n):\n    _ = input()\n    c = Counter(input().split())\n    print(f\"Case #{i+1}: {' '.join(v for v in c if c[v]==1)}\")\n
"},{"location":"solutions/#off-world-records","title":"Off-World Records","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass OffWorldRecords {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int c = s.nextInt();\n        int p = s.nextInt();\n        int ans = 0;\n\n        for (int i = 0; i < n; i++) {\n            int h = s.nextInt();\n            if (h > c + p) {\n                ans += 1;\n                p = c;\n                c = h;\n            }\n        }\n        System.out.println(ans);\n    }\n}\n
n, c, p = [int(d) for d in input().split()]\nans = 0\nfor _ in range(n):\n    h = int(input())\n    if h > c + p:\n        ans += 1\n        c, p = h, c\nprint(ans)\n
"},{"location":"solutions/#reverse","title":"Reverse","text":"Solution in Python Python 
n = int(input())\nnumbers = []\nfor _ in range(n):\n    numbers.append(int(input()))\nfor d in numbers[::-1]:\n    print(d)\n
"},{"location":"solutions/#oktalni","title":"Oktalni","text":"Solution in Python Python 
import math\n\nmapping = {\n    \"000\": \"0\",\n    \"001\": \"1\",\n    \"010\": \"2\",\n    \"011\": \"3\",\n    \"100\": \"4\",\n    \"101\": \"5\",\n    \"110\": \"6\",\n    \"111\": \"7\",\n}\nb = input()\nlength = 3 * math.ceil(len(b) / 3)\nb = b.zfill(length)\n\nprint(\"\".join([mapping[b[i : i + 3]] for i in range(0, length, 3)]))\n
"},{"location":"solutions/#one-chicken-per-person","title":"One Chicken Per Person!","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\n\ndiff = n - m\nif diff > 0:\n    print(f\"Dr. Chaz needs {diff} more piece{'s' if diff >1 else ''} of chicken!\")\nelse:\n    diff = abs(diff)\n    print(\n        f\"Dr. Chaz will have {diff} piece{'s' if diff >1 else ''} of chicken left over!\"\n    )\n
"},{"location":"solutions/#ordinals","title":"Ordinals","text":"Solution in Python Python 
def f(n):\n    if n == 0:\n        return \"{}\"\n    else:\n        ans = \",\".join([f(i) for i in range(n)])\n        return \"{\" + ans + \"}\"\n\n\nprint(f(int(input())))\n
"},{"location":"solutions/#ornaments","title":"Ornaments","text":"Solution in Python Python 
import math\n\nwhile True:\n    r, h, s = [int(d) for d in input().split()]\n    if not r and not h and not s:\n        break\n    l = math.sqrt(h**2 - r**2) * 2\n    a = math.pi - math.acos(r / h)\n    l += 2 * math.pi * r * (a / math.pi)\n    l *= 1 + s / 100\n    print(f\"{l:.2f}\")\n
"},{"location":"solutions/#ostgotska","title":"\u00d6stg\u00f6tska","text":"Solution in Python Python 
sentence = input()\nwords = sentence.split()\nif len([w for w in words if \"ae\" in w]) / len(words) >= 0.4:\n    print(\"dae ae ju traeligt va\")\nelse:\n    print(\"haer talar vi rikssvenska\")\n
"},{"location":"solutions/#overdraft","title":"Overdraft","text":"Solution in Python Python 
n = int(input())\ns = 0\nb = 0\nfor _ in range(n):\n    t = int(input())\n    if t > 0:\n        b += t\n    elif b + t < 0:\n        s -= b + t\n        b = 0\n    else:\n        b += t\nprint(s)\n
"},{"location":"solutions/#ovissa","title":"\u00d3vissa","text":"Solution in Python Python 
print(input().count(\"u\"))\n
"},{"location":"solutions/#the-owl-and-the-fox","title":"The Owl and the Fox","text":"Solution in Python Python 
def sd(n):\n    return sum([int(d) for d in str(n)])\n\n\nfor _ in range(int(input())):\n    n = int(input())\n    s = sd(n) - 1\n    d = n - 1\n    while True:\n        if sd(d) == s:\n            break\n        d -= 1\n    print(d)\n
"},{"location":"solutions/#pachyderm-peanut-packing","title":"Pachyderm Peanut Packing","text":"Solution in Python Python 
def inbox(coords, x, y):\n    if x >= coords[0] and x <= coords[2] and y >= coords[1] and y <= coords[3]:\n        return True\n    return False\n\n\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    box = {}\n    for i in range(n):\n        desc = input().split()\n        size = desc[-1]\n        coords = [float(d) for d in desc[:-1]]\n        box[i] = (coords, size)\n    m = int(input())\n    for _ in range(m):\n        desc = input().split()\n        size = desc[-1]\n        x, y = [float(d) for d in desc[:-1]]\n        floor = True\n        for i in range(n):\n            coords, box_size = box[i]\n            if inbox(coords, x, y):\n                floor = False\n                break\n        if floor:\n            status = \"floor\"\n        else:\n            status = \"correct\" if box_size == size else box_size\n        print(size, status)\n    print()\n
"},{"location":"solutions/#parent-gap","title":"Parent Gap","text":"Solution in Python Python 
from datetime import datetime\n\nyear = int(input())\n\nmother = datetime(year, 5, 1).isoweekday()\nfather = datetime(year, 6, 1).isoweekday()\n\nx = 7 - mother\ny = 7 - father\ndaymother = 1 + x + 7\ndayfather = 1 + y + 14\n\ndaymother = datetime(year, 5, daymother)\ndayfather = datetime(year, 6, dayfather)\n\nprint(((dayfather - daymother).days) // 7, \"weeks\")\n
"},{"location":"solutions/#parket","title":"Parket","text":"Solution in Python Python 
import math\n\nr, b = [int(d) for d in input().split()]\nw = math.floor((r + b) ** 0.5)\nwhile w:\n    if (r + b) / w == (r + 4) / 2 - w:\n        print((r + 4) // 2 - w, w)\n        break\n    w -= 1\n
"},{"location":"solutions/#parking","title":"Parking","text":"Solution in Python Python 
a, b, c = [int(d) for d in input().split()]\nt = [0] * 100\nfor _ in range(3):\n    start, end = [int(d) - 1 for d in input().split()]\n    for i in range(start, end):\n        t[i] += 1\n\ntotal = 0\nmapping = {\n    3: c,\n    2: b,\n    1: a,\n}\nfor s in t:\n    total += mapping.get(s, 0) * s\nprint(total)\n
"},{"location":"solutions/#parking_1","title":"Parking","text":"Solution in Python Python 
for _ in range(int(input())):\n    _ = input()\n    positions = [int(d) for d in input().split()]\n    print(2 * (max(positions) - min(positions)))\n
"},{"location":"solutions/#patuljci","title":"Patuljci","text":"Solution in Python Python 
d = [int(input()) for _ in range(9)]\ndiff = sum(d) - 100\nend = False\nfor i in range(8):\n    for j in range(i + 1, 9):\n        if d[i] + d[j] == diff:\n            end = True\n            break\n    if end:\n        break\nprint(\"\\n\".join([str(d[k]) for k in range(9) if k not in [i, j]]))\n
"},{"location":"solutions/#paul-eigon","title":"Paul Eigon","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n, p, q int\n    fmt.Scan(&n)\n    fmt.Scan(&p)\n    fmt.Scan(&q)\n    if ((p+q)/n)%2 == 0 {\n        fmt.Println(\"paul\")\n    } else {\n        fmt.Println(\"opponent\")\n    }\n}\n
n, p, q = [int(d) for d in input().split()]\n\nif ((p + q) // n) % 2 == 0:\n    print(\"paul\")\nelse:\n    print(\"opponent\")\n
"},{"location":"solutions/#peach-powder-polygon","title":"Peach Powder Polygon","text":"Solution in Python Python 
n = int(input())\nprint(\"Yes\" if n % 4 else \"No\")\n
"},{"location":"solutions/#pea-soup-and-pancakes","title":"Pea Soup and Pancakes","text":"Solution in Python Python 
found = False\nfor _ in range(int(input())):\n    k = int(input())\n\n    name = input()\n    items = [input() for _ in range(k)]\n    if \"pea soup\" in items and \"pancakes\" in items:\n        found = True\n        print(name)\n        break\n\nif not found:\n    print(\"Anywhere is fine I guess\")\n
"},{"location":"solutions/#peragrams","title":"Peragrams","text":"Solution in Python Python 
from collections import Counter\n\ns = Counter(input())\nv = [d for d in s.values() if d % 2]\nv = sorted(v)[:-1]\n\nprint(len(v))\n
"},{"location":"solutions/#perket","title":"Perket","text":"Solution in Python Python 
from itertools import combinations\n\nn = int(input())\nl = [[int(d) for d in input().split()] for _ in range(n)]\n\nc = []\nfor i in range(1, n + 1):\n    c.extend(list(combinations(l, i)))\n\nd = []\nfor i in c:\n    s, b = 1, 0\n    for x, y in i:\n        s *= x\n        b += y\n    d.append(abs(s - b))\n\nprint(min(d))\n
"},{"location":"solutions/#permuted-arithmetic-sequence","title":"Permuted Arithmetic Sequence","text":"Solution in Python Python 
def arithmetic(n):\n    d = [n[i] - n[i + 1] for i in range(len(n) - 1)]\n    return True if len(set(d)) == 1 else False\n\n\nfor _ in range(int(input())):\n    s = input().split()\n    n = [int(d) for d in s[1:]]\n    if arithmetic(n):\n        print(\"arithmetic\")\n    elif arithmetic(sorted(n)):\n        print(\"permuted arithmetic\")\n    else:\n        print(\"non-arithmetic\")\n
"},{"location":"solutions/#pervasive-heart-monitor","title":"Pervasive Heart Monitor","text":"Solution in Python Python 
while True:\n    try:\n        line = input().split()\n    except:\n        break\n\n    name, rate = [], []\n    for p in line:\n        if p.isalpha():\n            name.append(p)\n        else:\n            rate.append(float(p))\n    name = \" \".join(name)\n    rate = sum(rate) / len(rate)\n    print(f\"{rate:.6f} {name}\")\n
"},{"location":"solutions/#pet","title":"Pet","text":"Solution in Python Python 
winner, max_score = 0, 0\nfor i in range(5):\n    score = sum([int(d) for d in input().split()])\n    if score > max_score:\n        max_score = score\n        winner = i + 1\n\nprint(winner, max_score)\n
"},{"location":"solutions/#piece-of-cake","title":"Piece of Cake!","text":"Solution in Python Python 
n, h, v = [int(d) for d in input().split()]\nprint(4 * max(h * v, (n - h) * (n - v), h * (n - v), v * (n - h)))\n
"},{"location":"solutions/#pig-latin","title":"Pig Latin","text":"Solution in Python Python 
def translate(w):\n    if w[0] in \"aeiouy\":\n        return w + \"yay\"\n    else:\n        i = 1\n        while i < len(w):\n            if w[i] in \"aeiouy\":\n                break\n            i += 1\n        return w[i:] + w[:i] + \"ay\"\n\n\nwhile True:\n    try:\n        text = input()\n        print(\" \".join([translate(w) for w in text.split()]))\n    except:\n        break\n
"},{"location":"solutions/#a-vicious-pikeman-easy","title":"A Vicious Pikeman (Easy)","text":"Solution in Python Python 
def f(n, time, l):\n    total_time, penalty = 0, 0\n    for i, t in enumerate(sorted(l)):\n        if total_time + t > time:\n            return i, penalty\n        total_time += t\n        penalty = (penalty + total_time) % 1_000_000_007\n    return n, penalty\n\n\nn, t = [int(d) for d in input().split()]\na, b, c, t0 = [int(d) for d in input().split()]\nl = [t0]\nfor _ in range(n - 1):\n    l.append(((a * l[-1] + b) % c) + 1)\n\n\nn, penalty = f(n, t, l)\nprint(n, penalty)\n
"},{"location":"solutions/#pizza-crust","title":"Pizza Crust","text":"Solution in Python Python 
r, c = [int(d) for d in input().split()]\nprint(f\"{(r-c)**2 / r**2 * 100:.6f}\")\n
"},{"location":"solutions/#pizzubestun","title":"Pizzubestun","text":"Solution in Python Python 
n = int(input())\nprices = [int(input().split()[-1]) for _ in range(n)]\nif n % 2:\n    prices.append(0)\nprices = sorted(prices, reverse=True)\nprint(sum(prices[i] for i in range(0, len(prices), 2)))\n
"},{"location":"solutions/#planetaris","title":"Planetaris","text":"Solution in Python Python 
_, a = [int(d) for d in input().split()]\ne = sorted([int(d) + 1 for d in input().split()])\n\nt = 0\nfor s in e:\n    if a >= s:\n        t += 1\n        a -= s\n    else:\n        break\nprint(t)\n
"},{"location":"solutions/#planina","title":"Planina","text":"Solution in Python Python 
def p(n):\n    if n == 1:\n        return 3\n    else:\n        return p(n - 1) * 2 - 1\n\n\nn = int(input())\nprint(p(n) ** 2)\n
"},{"location":"solutions/#planting-trees","title":"Planting Trees","text":"Solution in Python Python 
n = int(input())\nt = [int(d) for d in input().split()]\n\ndays = [v + d for v, d in zip(sorted(t, reverse=True), range(1, n + 1))]\nprint(max(days) + 1)\n
"},{"location":"solutions/#pokechat","title":"Pokechat","text":"Solution in Python Python 
chars = input()\nids = input()\nids = [int(ids[i : i + 3]) - 1 for i in range(0, len(ids), 3)]\nprint(\"\".join([chars[i] for i in ids]))\n
"},{"location":"solutions/#poker-hand","title":"Poker Hand","text":"Solution in Python Python 
from collections import Counter\n\nhands = [h[0] for h in input().split()]\nprint(max(Counter(hands).values()))\n
"},{"location":"solutions/#polynomial-multiplication-1","title":"Polynomial Multiplication 1","text":"Solution in Python Python 
from collections import Counter\n\nfor _ in range(int(input())):\n    n = int(input())\n    a = [int(d) for d in input().split()]\n    m = int(input())\n    b = [int(d) for d in input().split()]\n    p = Counter()\n    for i in range(n + 1):\n        for j in range(m + 1):\n            p[i + j] += a[i] * b[j]\n    keys = max([k for k in p.keys() if p[k] != 0])\n    print(keys)\n    print(\" \".join([str(p[k]) for k in range(keys + 1)]))\n
"},{"location":"solutions/#popularity-contest","title":"Popularity Contest","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\np = [0] * n\nfor _ in range(m):\n    a, b = [int(d) - 1 for d in input().split()]\n    p[a] += 1\n    p[b] += 1\nprint(\" \".join([str(a - b) for a, b in zip(p, range(1, 1 + n))]))\n
"},{"location":"solutions/#pot","title":"Pot","text":"Solution in Python Python 
n = int(input())\ntotal = 0\nfor _ in range(n):\n    line = input()\n    n, p = int(line[:-1]), int(line[-1])\n    total += n**p\nprint(total)\n
"},{"location":"solutions/#saving-princess-peach","title":"Saving Princess Peach","text":"Solution in Python Python 
n, y = [int(d) for d in input().split()]\nfound = []\nfor _ in range(y):\n    found.append(int(input()))\nfound = set(found)\nfor i in range(n):\n    if i not in found:\n        print(i)\nprint(f\"Mario got {len(found)} of the dangerous obstacles.\")\n
"},{"location":"solutions/#printing-costs","title":"Printing Costs","text":"Solution in Python Python 
t = \"\"\"\n    0        !   9        \"   6        #  24        $  29        %  22\n&  24        '   3        (  12        )  12        *  17        +  13\n,   7        -   7        .   4        /  10        0  22        1  19\n2  22        3  23        4  21        5  27        6  26        7  16\n8  23        9  26        :   8        ;  11        <  10        =  14\n>  10        ?  15        @  32        A  24        B  29        C  20\nD  26        E  26        F  20        G  25        H  25        I  18\nJ  18        K  21        L  16        M  28        N  25        O  26\nP  23        Q  31        R  28        S  25        T  16        U  23\nV  19        W  26        X  18        Y  14        Z  22        [  18\n\\  10        ]  18        ^   7        _   8        `   3        a  23\nb  25        c  17        d  25        e  23        f  18        g  30\nh  21        i  15        j  20        k  21        l  16        m  22\nn  18        o  20        p  25        q  25        r  13        s  21\nt  17        u  17        v  13        w  19        x  13        y  24\nz  19        {  18        |  12        }  18        ~   9\n\"\"\"\n\nm = []\nfor row in t.splitlines():\n    if not row:\n        continue\n    values = row.split()\n    if len(values) % 2:\n        values.insert(0, \" \")\n\n    for i in range(0, len(values), 2):\n        m.append((values[i], int(values[i + 1])))\nm = dict(m)\n\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    print(sum([m[c] for c in s]))\n
"},{"location":"solutions/#provinces-and-gold","title":"Provinces and Gold","text":"Solution in Python Python 
g, s, c = [int(d) for d in input().split()]\n\nbuying = 3 * g + 2 * s + 1 * c\nresult = []\n\nif buying >= 8:\n    result.append(\"Province\")\nelif buying >= 5:\n    result.append(\"Duchy\")\nelif buying >= 2:\n    result.append(\"Estate\")\n\nif buying >= 6:\n    result.append(\"Gold\")\nelif buying >= 3:\n    result.append(\"Silver\")\nelse:\n    result.append(\"Copper\")\n\nprint(\" or \".join(result))\n
"},{"location":"solutions/#prsteni","title":"Prsteni","text":"Solution in Python Python 
import math\n\n_ = input()\nnumbers = [int(d) for d in input().split()]\n\nbase = numbers.pop(0)\n\ngcd = [math.gcd(base, n) for n in numbers]\n\nfor g, n in zip(gcd, numbers):\n    print(f\"{int(base/g)}/{int(n/g)}\")\n
"},{"location":"solutions/#prva","title":"Prva","text":"Solution in Python Python 
r, c = [int(d) for d in input().split()]\npuzzle = []\nfor _ in range(r):\n    puzzle.append(input())\n\nwords = set()\nfor row in puzzle:\n    words.update([w for w in row.split(\"#\") if len(w) > 1])\nfor i in range(c):\n    col = \"\".join([row[i] for row in puzzle])\n    words.update([w for w in col.split(\"#\") if len(w) > 1])\n\nprint(sorted(words)[0])\n
"},{"location":"solutions/#ptice","title":"Ptice","text":"Solution in Python Python 
def adrian(n):\n    if n == 0:\n        return \"\"\n    elif n == 1:\n        return \"A\"\n    elif n == 2:\n        return \"AB\"\n    elif n == 3:\n        return \"ABC\"\n    else:\n        duplicate = n // 3\n        return adrian(3) * duplicate + adrian(n % 3)\n\n\ndef bruno(n):\n    if n == 0:\n        return \"\"\n    elif n == 1:\n        return \"B\"\n    elif n == 2:\n        return \"BA\"\n    elif n == 3:\n        return \"BAB\"\n    elif n == 4:\n        return \"BABC\"\n    else:\n        duplicate = n // 4\n        return bruno(4) * duplicate + bruno(n % 4)\n\n\ndef goran(n):\n    if n == 0:\n        return \"\"\n    elif n in [1, 2]:\n        return \"C\" * n\n    elif n in [3, 4]:\n        return \"CC\" + \"A\" * (n - 2)\n    elif n in [5, 6]:\n        return \"CCAA\" + \"B\" * (n - 4)\n    else:\n        duplicate = n // 6\n        return goran(6) * duplicate + goran(n % 6)\n\n\ndef get_score(ans, guess):\n    return sum([a == g for a, g in zip(ans, guess)])\n\n\nn = int(input())\nans = input()\n\nresult = {}\nresult[\"Adrian\"] = get_score(ans, adrian(n))\nresult[\"Bruno\"] = get_score(ans, bruno(n))\nresult[\"Goran\"] = get_score(ans, goran(n))\n\nbest = max(result.values())\nprint(best)\n\nfor name, score in result.items():\n    if score == best:\n        print(name)\n
"},{"location":"solutions/#building-pyramids","title":"Building Pyramids","text":"Solution in Python Python 
n = int(input())\n\nheight = 0\nwhile True:\n    height += 1\n    blocks = (2 * height - 1) ** 2\n    if blocks > n:\n        height -= 1\n        break\n    n -= blocks\n\nprint(height)\n
"},{"location":"solutions/#quality-adjusted-life-year","title":"Quality-Adjusted Life-Year","text":"Solution in Python Python 
qaly = 0\nfor _ in range(int(input())):\n    q, y = input().split()\n    q, y = float(q), float(y)\n    qaly += q * y\nprint(qaly)\n
"},{"location":"solutions/#quadrant-selection","title":"Quadrant Selection","text":"Solutions in 4 languages GoJavaPythonRust 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x, y int\n    fmt.Scan(&x)\n    fmt.Scan(&y)\n    if x > 0 {\n        if y > 0 {\n            fmt.Println(1)\n        } else {\n            fmt.Println(4)\n        }\n    } else {\n        if y > 0 {\n            fmt.Println(2)\n        } else {\n            fmt.Println(3)\n        }\n    }\n}\n
import java.util.Scanner;\n\nclass QuadrantSelection {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int x = s.nextInt();\n        int y = s.nextInt();\n\n        if (x > 0) {\n            if (y > 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(4);\n            }\n        } else {\n            if (y > 0) {\n                System.out.println(2);\n            } else {\n                System.out.println(3);\n            }\n        }\n\n    }\n}\n
x = int(input())\ny = int(input())\nif x > 0:\n    if y > 0:\n        print(1)\n    else:\n        print(4)\nelse:\n    if y > 0:\n        print(2)\n    else:\n        print(3)\n
fn main() {\n    let mut line1 = String::new();\n    std::io::stdin().read_line(&mut line1).unwrap();\n    let x: i32 = line1.trim().parse().unwrap();\n\n    let mut line2 = String::new();\n    std::io::stdin().read_line(&mut line2).unwrap();\n    let y: i32 = line2.trim().parse().unwrap();\n\n    if x > 0 {\n        if y > 0 {\n            println!(\"1\");\n        } else {\n            println!(\"4\");\n        }\n    } else {\n        if y > 0 {\n            println!(\"2\");\n        } else {\n            println!(\"3\");\n        }\n    }\n}\n
"},{"location":"solutions/#quick-brown-fox","title":"Quick Brown Fox","text":"Solution in Python Python 
import string\n\nfor _ in range(int(input())):\n    p = set([c for c in input().lower() if c.isalpha()])\n    if len(p) == 26:\n        print(\"pangram\")\n    else:\n        print(\n            f\"missing {''.join([c for c in string.ascii_lowercase[:26] if c not in p])}\"\n        )\n
"},{"location":"solutions/#quick-estimates","title":"Quick Estimates","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass QuickEstimates {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        for (int i = 0; i < n; i++) {\n            String cost = s.next();\n            System.out.println(cost.length());\n        }\n    }\n}\n
for _ in range(int(input())):\n    print(len(input()))\n
"},{"location":"solutions/#quite-a-problem","title":"Quite a Problem","text":"Solution in Python Python 
while True:\n    try:\n        line = input()\n    except:\n        break\n\n    if \"problem\" in line.lower():\n        print(\"yes\")\n    else:\n        print(\"no\")\n
"},{"location":"solutions/#r2","title":"R2","text":"Solutions in 4 languages C++GoJavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int r1, s;\n    cin >> r1 >> s;\n    cout << 2 * s - r1 << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var r1, s int\n    fmt.Scan(&r1)\n    fmt.Scan(&s)\n    fmt.Println(2*s - r1)\n}\n
import java.util.Scanner;\n\nclass R2 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int r1 = scanner.nextInt();\n        int s = scanner.nextInt();\n        System.out.println(2 * s - r1);\n    }\n}\n
r1, s = [int(d) for d in input().split()]\nr2 = 2 * s - r1\nprint(r2)\n
"},{"location":"solutions/#racing-around-the-alphabet","title":"Racing Around the Alphabet","text":"Solution in Python Python 
import math\n\ntokens = dict([(chr(c), c - ord(\"A\") + 1) for c in range(ord(\"A\"), ord(\"Z\") + 1)])\ntokens[\" \"] = 27\ntokens[\"'\"] = 28\nt = math.pi * 60 / (28 * 15)\nfor _ in range(int(input())):\n    m = input()\n    total = 1\n    prev = m[0]\n    for c in m[1:]:\n        dist = abs(tokens[prev] - tokens[c])\n        total += 1 + t * min(dist, 28 - dist)\n        prev = c\n    print(total)\n
"},{"location":"solutions/#ragged-right","title":"Ragged Right","text":"Solution in Python Python 
l = []\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    l.append(len(s))\nm = max(l)\nprint(sum([(n - m) ** 2 for n in l[:-1]]))\n
"},{"location":"solutions/#railroad","title":"Railroad","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x, y int\n    fmt.Scan(&x)\n    fmt.Scan(&y)\n    if y%2 == 1 {\n        fmt.Println(\"impossible\")\n    } else {\n        fmt.Println(\"possible\")\n    }\n}\n
import java.util.Scanner;\n\nclass Railroad {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int x = s.nextInt();\n        int y = s.nextInt();\n        if (y % 2 == 1) {\n            System.out.println(\"impossible\");\n        } else {\n            System.out.println(\"possible\");\n        }\n    }\n}\n
_, y = [int(d) for d in input().split()]\nif y % 2:\n    print(\"impossible\")\nelse:\n    print(\"possible\")\n
"},{"location":"solutions/#a-rank-problem","title":"A Rank Problem","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\nranking = [f\"T{i}\" for i in range(1, 1 + n)]\nfor _ in range(m):\n    i, j = input().split()\n    if ranking.index(i) < ranking.index(j):\n        continue\n    ranking.remove(j)\n    ranking.insert(ranking.index(i) + 1, j)\nprint(\" \".join(ranking))\n
"},{"location":"solutions/#rating-problems","title":"Rating Problems","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass RatingProblems {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int k = s.nextInt();\n        int score = 0;\n        for (int i = 0; i < k; i++) {\n            score += s.nextInt();\n        }\n        float min = (score - 3 * (n - k)) / (float) n;\n        float max = (score + 3 * (n - k)) / (float) n;\n        System.out.println(min + \" \" + max);\n    }\n}\n
n, k = [int(d) for d in input().split()]\nscore = 0\nfor _ in range(k):\n    score += int(input())\n\nprint((score - 3 * (n - k)) / n, (score + 3 * (n - k)) / n)\n
"},{"location":"solutions/#a-rational-sequence-2","title":"A Rational Sequence 2","text":"Solution in Python Python 
def f(l, r):\n    if l == r:\n        return 1\n    elif l > r:\n        return 2 * f(l - r, r) + 1\n    else:\n        return 2 * f(l, r - l)\n\n\nfor _ in range(int(input())):\n    k, v = input().split()\n    l, r = [int(d) for d in v.split(\"/\")]\n    print(f\"{k} {f(l,r)}\")\n
"},{"location":"solutions/#scaling-recipes","title":"Scaling Recipes","text":"Solution in Python Python 
for i in range(int(input())):\n    r, p, d = [int(d) for d in input().split()]\n    recipe = {}\n    main = None\n    for _ in range(r):\n        name, weight, percent = input().split()\n        weight = float(weight)\n        percent = float(percent)\n        if percent == 100.0:\n            main = name\n        recipe[name] = (weight, percent)\n    scale = d / p\n    print(f\"Recipe # {i+1}\")\n    dw = recipe[main][0] * scale\n    for k in recipe:\n        print(k, f\"{recipe[k][1] * dw / 100:.1f}\")\n    print(\"-\" * 40)\n
"},{"location":"solutions/#recount","title":"Recount","text":"Solution in Python Python 
from collections import Counter\n\nc = Counter()\nwhile True:\n    try:\n        name = input()\n    except:\n        break\n    c[name] += 1\n\nhighest = max(c.values())\nnames = [k for k in c if c[k] == highest]\nprint(\"Runoff!\" if len(names) > 1 else names.pop())\n
"},{"location":"solutions/#rectangle-area","title":"Rectangle Area","text":"Solution in Python Python 
x1, y1, x2, y2 = [float(d) for d in input().split()]\n\nprint(abs((x1 - x2) * (y1 - y2)))\n
"},{"location":"solutions/#reduced-id-numbers","title":"Reduced ID Numbers","text":"Solution in Python Python 
g = int(input())\nids = []\nfor _ in range(g):\n    ids.append(int(input()))\n\nm = 1\nwhile True:\n    v = [d % m for d in ids]\n    if g == len(set(v)):\n        break\n    m += 1\n\nprint(m)\n
"},{"location":"solutions/#relocation","title":"Relocation","text":"Solution in Python Python 
n, q = [int(d) for d in input().split()]\nx = [int(d) for d in input().split()]\nfor _ in range(q):\n    req = [int(d) for d in input().split()]\n    if req[0] == 1:\n        x[req[1] - 1] = req[2]\n    elif req[0] == 2:\n        print(abs(x[req[1] - 1] - x[req[2] - 1]))\n
"},{"location":"solutions/#restaurant-opening","title":"Restaurant Opening","text":"Solution in Python Python 
from itertools import product\n\nn, m = [int(d) for d in input().split()]\n\ng = []\nfor _ in range(n):\n    g.append([int(d) for d in input().split()])\n\nl = list(product(range(n), range(m)))\n\nc = []\nfor i, j in l:\n    s = 0\n    for a, b in l:\n        s += g[a][b] * (abs(i - a) + abs(j - b))\n    c.append(s)\n\nprint(min(c))\n
"},{"location":"solutions/#reversed-binary-numbers","title":"Reversed Binary Numbers","text":"Solution in Python Python 
n = int(input())\n\nb = []\nwhile n:\n    b.append(n % 2)\n    n //= 2\n\nprint(sum([d * (2**p) for d, p in zip(b, reversed(range(len(b))))]))\n
"},{"location":"solutions/#reverse-rot","title":"Reverse Rot","text":"Solution in Python Python 
import string\n\nrotations = string.ascii_uppercase + \"_.\"\n\n\ndef rotate(c, n):\n    index = (rotations.index(c) + n) % 28\n    return rotations[index]\n\n\nwhile True:\n    line = input()\n    if line == \"0\":\n        break\n    n, m = line.split()\n    n = int(n)\n    print(\"\".join([rotate(c, n) for c in m[::-1]]))\n
"},{"location":"solutions/#rijeci","title":"Rije\u010di","text":"Solutions in 3 languages GoJavaPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    a := 1\n    b := 0\n    for i := 0; i < n; i++ {\n        a, b = b, b+a\n    }\n    fmt.Println(a, b)\n}\n
import java.util.Scanner;\n\nclass Rijeci {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int k = s.nextInt();\n        int a = 1;\n        int b = 0;\n        for (int i = 0; i < k; i++) {\n            int t = b;\n            b = a + b;\n            a = t;\n\n        }\n\n        System.out.println(a + \" \" + b);\n    }\n}\n
k = int(input())\na, b = 1, 0\nfor _ in range(k):\n    a, b = b, b + a\n\nprint(a, b)\n
"},{"location":"solutions/#roaming-romans","title":"Roaming Romans","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x float64\n    fmt.Scan(&x)\n    fmt.Println(int(x*1000*5280/4854 + 0.5))\n}\n
x = float(input())\nprint(int(x * 1000 * 5280 / 4854 + 0.5))\n
"},{"location":"solutions/#run-length-encoding-run","title":"Run-Length Encoding, Run!","text":"Solution in Python Python 
action, s = input().split()\nif action == \"D\":\n    print(\"\".join([s[i] * int(s[i + 1]) for i in range(0, len(s), 2)]))\nelif action == \"E\":\n    parts = []\n    prev, t = s[0], 1\n    for c in s[1:]:\n        if c != prev:\n            parts.append((prev, t))\n            t = 1\n            prev = c\n        else:\n            t += 1\n    parts.append((prev, t))\n\n    print(\"\".join([f\"{k}{v}\" for k, v in parts]))\n
"},{"location":"solutions/#same-digits-easy","title":"Same Digits (Easy)","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\npairs = []\nfor x in range(a, b + 1):\n    for y in range(x, b + 1):\n        xy = x * y\n        if sorted(str(xy)) == sorted(str(x) + str(y)):\n            pairs.append((x, y, xy))\nprint(f\"{len(pairs)} digit-preserving pair(s)\")\nfor x, y, xy in pairs:\n    print(f\"x = {x}, y = {y}, xy = {xy}\")\n
"},{"location":"solutions/#same-digits-hard","title":"Same Digits (Hard)","text":"Solution in Python Python 
a, b = [int(d) for d in input().split()]\npairs = []\nfor x in range(a, b + 1):\n    for y in range(x, b + 1):\n        xy = x * y\n        if x * y > b:\n            break\n        if sorted(str(xy)) == sorted(str(x) + str(y)):\n            pairs.append((x, y, xy))\n    if x * x > b:\n        break\n\nprint(f\"{len(pairs)} digit-preserving pair(s)\")\nfor x, y, xy in pairs:\n    print(f\"x = {x}, y = {y}, xy = {xy}\")\n
"},{"location":"solutions/#saving-daylight","title":"Saving Daylight","text":"Solution in Python Python 
while True:\n    try:\n        s = input().split()\n    except:\n        break\n\n    t1, t2 = s[-2:]\n\n    h1, m1 = [int(d) for d in t1.split(\":\")]\n    h2, m2 = [int(d) for d in t2.split(\":\")]\n\n    mins = (h2 - h1) * 60 + (m2 - m1)\n    h = mins // 60\n    m = mins % 60\n\n    ans = s[:-2]\n    ans.extend([str(h), \"hours\", str(m), \"minutes\"])\n\n    print(\" \".join(ans))\n
"},{"location":"solutions/#saving-for-retirement","title":"Saving For Retirement","text":"Solution in Python Python 
import math\n\nB, Br, Bs, A, As = [int(d) for d in input().split()]\nrate = Bs * (Br - B) / As\nAr = math.ceil(rate) + A\nif rate.is_integer():\n    Ar += 1\nprint(Ar)\n
"},{"location":"solutions/#scaling-recipe","title":"Scaling Recipe","text":"Solution in Python Python 
import math\n\nn, x, y = [int(d) for d in input().split()]\ni = [int(input()) for _ in range(n)]\n\n# for python 3.9+ (https://docs.python.org/3.9/library/math.html#math.gcd)\n# s = math.gcd(x, *i)\n\ns = math.gcd(x, i[0])\nfor k in range(1, n):\n    s = math.gcd(s, i[k])\n\nx /= s\ni = [v / s for v in i]\n\nscale = y / x\nfor v in i:\n    print(int(scale * v))\n
"},{"location":"solutions/#school-spirit","title":"School Spirit","text":"Solution in Python Python 
n = int(input())\ns = []\nfor _ in range(n):\n    s.append(int(input()))\n\n\ndef group_score(s):\n    gs = 0\n    for i in range(len(s)):\n        gs += s[i] * (0.8**i)\n    return 0.2 * gs\n\n\nprint(group_score(s))\nnew_gs = []\nfor i in range(n):\n    new_gs.append(group_score([s[j] for j in range(n) if j != i]))\nprint(sum(new_gs) / len(new_gs))\n
"},{"location":"solutions/#secret-message","title":"Secret Message","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    m = input()\n    k = math.ceil(len(m) ** 0.5)\n\n    m += \"*\" * (k * k - len(m))\n    rows = [m[i : i + k] for i in range(0, len(m), k)]\n\n    s = []\n    for i in range(k):\n        s.append(\"\".join([row[i] for row in rows if row[i] != \"*\"][::-1]))\n    print(\"\".join(s))\n
"},{"location":"solutions/#secure-doors","title":"Secure Doors","text":"Solution in Python Python 
pool = set()\nfor _ in range(int(input())):\n    action, name = input().split()\n    if action == \"entry\":\n        print(name, \"entered\", \"(ANOMALY)\" if name in pool else \"\")\n        pool.add(name)\n    elif action == \"exit\":\n        print(name, \"exited\", \"(ANOMALY)\" if name not in pool else \"\")\n        pool.discard(name)\n
"},{"location":"solutions/#server","title":"Server","text":"Solution in Python Python 
_, t = [int(d) for d in input().split()]\ntotal, used = 0, 0\nfor v in [int(d) for d in input().split()]:\n    if used + v <= t:\n        total += 1\n        used += v\n    else:\n        break\nprint(total)\n
"},{"location":"solutions/#seven-wonders","title":"Seven Wonders","text":"Solution in Python Python 
from collections import Counter\n\nc = Counter(input())\nscore = 0\nfor value in c.values():\n    score += value**2\nif len(c.values()) == 3:\n    score += 7 * min(c.values())\nprint(score)\n
"},{"location":"solutions/#shattered-cake","title":"Shattered Cake","text":"Solution in Python Python 
w, n = int(input()), int(input())\ntotal = 0\nfor _ in range(n):\n    _w, _l = [int(d) for d in input().split()]\n    total += _w * _l\nprint(int(total / w))\n
"},{"location":"solutions/#shopaholic","title":"Shopaholic","text":"Solution in Python Python 
n = int(input())\nc = [int(d) for d in input().split()]\n\nc = sorted(c, reverse=True)\ngroups = [c[i : i + 3] if i + 3 < n else c[i:] for i in range(0, n, 3)]\n\nprint(sum(g[-1] if len(g) == 3 else 0 for g in groups))\n
"},{"location":"solutions/#shopping-list-easy","title":"Shopping List (Easy)","text":"Solution in Python Python 
n, m = [int(d) for d in input().split()]\nitems = []\nfor _ in range(n):\n    items.append(set(input().split()))\n\nans = items[0]\nans = ans.intersection(*items[1:])\n\nprint(len(ans))\nprint(\"\\n\".join(sorted(list(ans))))\n
"},{"location":"solutions/#sibice","title":"Sibice","text":"Solution in Python Python 
import math\n\nn, w, h = [int(d) for d in input().split()]\nfor _ in range(n):\n    line = int(input())\n    if line <= math.sqrt(w**2 + h**2):\n        print(\"DA\")\n    else:\n        print(\"NE\")\n
"},{"location":"solutions/#sideways-sorting","title":"Sideways Sorting","text":"Solution in Python Python 
while True:\n    r, c = [int(d) for d in input().split()]\n    if not r and not c:\n        break\n    s = []\n    for _ in range(r):\n        s.append(input())\n    items = []\n    for i in range(c):\n        items.append(\"\".join(s[j][i] for j in range(r)))\n    items = sorted(items, key=lambda t: t.lower())\n    for i in range(r):\n        print(\"\".join(items[j][i] for j in range(c)))\n
"},{"location":"solutions/#digit-product","title":"Digit Product","text":"Solution in Python Python 
def digit_product(x):\n    ans = 1\n    while x:\n        ans *= x % 10 or 1\n        x //= 10\n    return ans\n\n\nx = int(input())\nwhile True:\n    x = digit_product(x)\n    if x < 10:\n        break\nprint(x)\n
"},{"location":"solutions/#simon-says","title":"Simon Says","text":"Solution in Python Python 
for _ in range(int(input())):\n    command = input()\n    start = \"simon says \"\n    if command.startswith(start):\n        print(command[len(start) :])\n    else:\n        print()\n
"},{"location":"solutions/#simone","title":"Simone","text":"Solution in Python Python 
from collections import Counter\n\nn, k = [int(d) for d in input().split()]\n\ns = Counter(int(d) for d in input().split())\n\nleast = min(s.values())\nif len(s.values()) < k:\n    least = 0\nans = 0\nc = []\nfor i in range(k):\n    if s[i + 1] == least:\n        c.append(str(i + 1))\n        ans += 1\nprint(ans)\nprint(\" \".join(c))\n
"},{"location":"solutions/#simon-says_1","title":"Simon Says","text":"Solution in Python Python 
for _ in range(int(input())):\n    command = input()\n    start = \"Simon says \"\n    if command.startswith(start):\n        print(command[len(start) :])\n
"},{"location":"solutions/#simple-addition","title":"Simple Addition","text":"Solution in Python Python 
a, b = input(), input()\n\na = a[::-1]\nb = b[::-1]\ni = 0\nans = \"\"\ncarry = 0\nwhile i < len(a) or i < len(b):\n    if i < len(a) and i < len(b):\n        s = int(a[i]) + int(b[i]) + carry\n\n    elif i < len(a):\n        s = int(a[i]) + carry\n\n    else:\n        s = int(b[i]) + carry\n    ans += str(s % 10)\n    carry = s // 10\n    i += 1\nif carry:\n    ans += str(carry)\nprint(ans[::-1])\n\n# or simply\n# print(int(a) + int(b))\n
"},{"location":"solutions/#simple-factoring","title":"Simple Factoring","text":"Solution in Python Python 
for _ in range(int(input())):\n    a, b, c = [int(d) for d in input().split()]\n    import math\n\n    if not b**2 - 4 * a * c < 0 and math.sqrt(b**2 - 4 * a * c).is_integer():\n        print(\"YES\")\n    else:\n        print(\"NO\")\n
"},{"location":"solutions/#sith","title":"Sith","text":"Solution in Python Python 
_ = input()\na = int(input())\nb = int(input())\ndiff = int(input())\nif diff <= 0:\n    print(\"JEDI\")\nelif a < b:\n    print(\"SITH\")\nelse:\n    print(\"VEIT EKKI\")\n
"},{"location":"solutions/#sjecista","title":"Sjecista","text":"Solution in Python Python 
n = int(input())\nprint((n - 3) * (n - 2) * (n - 1) * (n) // 24)\n
"},{"location":"solutions/#skener","title":"Skener","text":"Solution in Python Python 
r, _, zr, zc = [int(d) for d in input().split()]\nmatrix = []\nfor _ in range(r):\n    matrix.append(input())\n\nans = []\n\nfor row in matrix:\n    for i in range(zr):\n        ans.append(row)\n\nfor row in ans:\n    print(\"\".join([col * zc for col in row]))\n
"},{"location":"solutions/#skocimis","title":"Skocimis","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b, c int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Scan(&c)\n    x := b - a\n    y := c - b\n    ans := x\n    if ans < y {\n        ans = y\n    }\n    ans -= 1\n    fmt.Println(ans)\n}\n
a, b, c = [int(d) for d in input().split()]\nprint(max(b - a, c - b) - 1)\n
"},{"location":"solutions/#turn-it-up","title":"Turn It Up!","text":"Solution in Python Python 
volume = 7\nfor _ in range(int(input())):\n    if input() == \"Skru op!\":\n        volume = min(volume + 1, 10)\n    else:\n        volume = max(volume - 1, 0)\nprint(volume)\n
"},{"location":"solutions/#slatkisi","title":"Slatkisi","text":"Solution in Python Python 
c, k = [int(d) for d in input().split()]\nd = 10**k\nc = (c // d) * d + (d if (c % d) / d >= 0.5 else 0)\nprint(c)\n
"},{"location":"solutions/#smil","title":"SMIL","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass SMIL {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        String m = s.nextLine();\n        int size = m.length();\n        int i = 0;\n        while (i < size) {\n            if (m.charAt(i) == ':' || m.charAt(i) == ';') {\n                if (i + 1 < size && m.charAt(i + 1) == ')') {\n                    System.out.println(i);\n                    i += 2;\n                    continue;\n                }\n                if (i + 2 < size && m.charAt(i + 1) == '-' && m.charAt(i + 2) == ')') {\n                    System.out.println(i);\n                    i += 3;\n                    continue;\n                }\n            }\n            i += 1;\n        }\n    }\n}\n
s = input()\n\ni = 0\nsize = len(s)\nwhile i < size:\n    if s[i] in [\":\", \";\"]:\n        if i + 1 < size and s[i + 1] == \")\":\n            print(i)\n            i += 2\n            continue\n        if i + 2 < size and s[i + 1] == \"-\" and s[i + 2] == \")\":\n            print(i)\n            i += 3\n            continue\n\n    i += 1\n
"},{"location":"solutions/#soda-slurper","title":"Soda Slurper","text":"Solutions in 2 languages GoPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var e, f, c int\n    fmt.Scan(&e)\n    fmt.Scan(&f)\n    fmt.Scan(&c)\n    total := 0\n    s := e + f\n    for s >= c {\n        total += s / c\n        s = s%c + s/c\n    }\n    fmt.Println(total)\n}\n
e, f, c = [int(d) for d in input().split()]\ntotal = 0\ns = e + f\nwhile s >= c:\n    total += s // c\n    s = s % c + s // c\nprint(total)\n
"},{"location":"solutions/#sok","title":"Sok","text":"Solution in Python Python 
a, b, c = [int(d) for d in input().split()]\ni, j, k = [int(d) for d in input().split()]\ns = min(a / i, b / j, c / k)\nprint(a - i * s, b - j * s, c - k * s)\n
"},{"location":"solutions/#some-sum","title":"Some Sum","text":"Solution in Python Python 
n = int(input())\nif n == 1:\n    print(\"Either\")\nelif n == 2:\n    print(\"Odd\")\nelif n % 2 == 0:\n    print(\"Even\" if (n / 2) % 2 == 0 else \"Odd\")\nelse:\n    print(\"Either\")\n
"},{"location":"solutions/#sort","title":"Sort","text":"Solution in Python Python 
from collections import Counter\n\nn, c = [int(d) for d in input().split()]\nnum = [int(d) for d in input().split()]\n\nfreq = Counter(num)\nprint(\n    \" \".join(\n        [\n            str(d)\n            for d in sorted(\n                num, key=lambda k: (freq[k], n - num.index(k)), reverse=True\n            )\n        ]\n    )\n)\n
"},{"location":"solutions/#sort-of-sorting","title":"Sort of Sorting","text":"Solution in Python Python 
first = True\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    else:\n        if not first:\n            print()\n    first = False\n    names = []\n    for _ in range(n):\n        names.append(input())\n    print(\"\\n\".join(sorted(names, key=lambda k: k[:2])))\n
"},{"location":"solutions/#sort-two-numbers","title":"Sort Two Numbers","text":"Solutions in 3 languages C++GoPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a = 0, b = 0;\n    cin >> a >> b;\n    if (a < b)\n    {\n        cout << a << \" \" << b;\n    }\n    else\n    {\n        cout << b << \" \" << a;\n    }\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    if a < b {\n        fmt.Printf(\"%d %d\\n\", a, b)\n    } else {\n        fmt.Printf(\"%d %d\\n\", b, a)\n    }\n}\n
line = input()\na, b = [int(d) for d in line.split()]\nif a < b:\n    print(a, b)\nelse:\n    print(b, a)\n
"},{"location":"solutions/#sottkvi","title":"S\u00f3ttkv\u00ed","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass Sottkvi {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int k = s.nextInt();\n        int today = s.nextInt();\n        int ans = 0;\n        for (int i = 0; i < n; i++) {\n            int d = s.nextInt();\n            if (d + 14 - today <= k) {\n                ans += 1;\n            }\n        }\n        System.out.println(ans);\n\n    }\n}\n
n, k, today = [int(d) for d in input().split()]\nres = 0\nfor _ in range(n):\n    d = int(input())\n    if d + 14 - today <= k:\n        res += 1\nprint(res)\n
"},{"location":"solutions/#soylent","title":"Soylent","text":"Solution in Python Python 
import math\n\nfor _ in range(int(input())):\n    n = int(input())\n    print(math.ceil(n / 400))\n
"},{"location":"solutions/#space-race","title":"Space Race","text":"Solution in Python Python 
n = int(input())\n_ = input()\nd = {}\nfor _ in range(n):\n    entry = input().split()\n    d[entry[0]] = float(entry[-1])\n\nprint(min(d, key=lambda k: d[k]))\n
"},{"location":"solutions/#spavanac","title":"Spavanac","text":"Solutions in 3 languages C++JavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int h, m;\n    cin >> h >> m;\n\n    int mm = m - 45;\n    int borrow = 0;\n    if (mm < 0)\n    {\n        mm += 60;\n        borrow = 1;\n    }\n    int hh = h - borrow;\n    if (hh < 0)\n    {\n        hh += 24;\n    }\n    cout << hh << \" \" << mm << endl;\n    return 0;\n}\n
import java.util.Scanner;\n\nclass Spavanac {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int h = s.nextInt();\n        int m = s.nextInt();\n\n        int mm = m - 45;\n        int borrow = 0;\n        if (mm < 0) {\n            mm += 60;\n            borrow = 1;\n        }\n\n        int hh = h - borrow;\n        if (hh < 0) {\n            hh += 24;\n        }\n        System.out.println(hh + \" \" + mm);\n    }\n}\n
h, m = [int(d) for d in input().split()]\n\nmm = m - 45\n\nborrow = 0\nif mm < 0:\n    mm += 60\n    borrow = 1\n\nhh = h - borrow\nif hh < 0:\n    hh += 24\n\nprint(hh, mm)\n
"},{"location":"solutions/#speeding","title":"Speeding","text":"Solution in Python Python 
n = int(input())\nmile, time, max_speed = 0, 0, 0\nfor _ in range(n):\n    t, s = [int(d) for d in input().split()]\n    if not t and not s:\n        continue\n    speed = int((s - mile) / (t - time))\n    if speed > max_speed:\n        max_speed = speed\n    mile, time = s, t\nprint(max_speed)\n
"},{"location":"solutions/#speed-limit","title":"Speed Limit","text":"Solution in Python Python 
while True:\n    n = int(input())\n    if n == -1:\n        break\n    miles = 0\n    elapsed = 0\n    for _ in range(n):\n        s, t = [int(d) for d in input().split()]\n        miles += s * (t - elapsed)\n        elapsed = t\n    print(f\"{miles} miles\")\n
"},{"location":"solutions/#spelling-bee","title":"Spelling Bee","text":"Solution in Python Python 
hexagon = input()\nc = hexagon[0]\nhexagon = set(list(hexagon))\nn = int(input())\nvalid = []\nfor _ in range(n):\n    w = input()\n    if c in w and len(w) >= 4 and set(list(w)) <= hexagon:\n        valid.append(w)\nprint(\"\\n\".join(valid))\n
"},{"location":"solutions/#spritt","title":"Spritt","text":"Solution in Python Python 
n, x = [int(d) for d in input().split()]\nfor _ in range(n):\n    x -= int(input())\n    if x < 0:\n        print(\"Neibb\")\n        break\nif x >= 0:\n    print(\"Jebb\")\n
"},{"location":"solutions/#square-peg","title":"Square Peg","text":"Solution in Python Python 
l, r = [int(d) for d in input().split()]\nif 2 * (l / 2) ** 2 <= r**2:\n    print(\"fits\")\nelse:\n    print(\"nope\")\n
"},{"location":"solutions/#stafur","title":"Stafur","text":"Solution in Python Python 
l = input()\nif l in \"AEIOU\":\n    print(\"Jebb\")\nelif l == \"Y\":\n    print(\"Kannski\")\nelse:\n    print(\"Neibb\")\n
"},{"location":"solutions/#statistics","title":"Statistics","text":"Solution in Python Python 
case_num = 0\nwhile True:\n    try:\n        line = input()\n    except:\n        break\n    case_num += 1\n    numbers = [int(d) for d in line.split()[1:]]\n    print(f\"Case {case_num}: {min(numbers)} {max(numbers)} {max(numbers)-min(numbers)}\")\n
"},{"location":"solutions/#sticky-keys","title":"Sticky Keys","text":"Solution in Python Python 
message = input()\n\nl = [message[0]]\nfor i in message[1:]:\n    if i != l[-1]:\n        l.append(i)\nprint(\"\".join(l))\n
"},{"location":"solutions/#messy-lists","title":"Messy lists","text":"Solution in Python Python 
n = int(input())\na = [int(d) for d in input().split()]\ns = sorted(a)\nprint(sum([i != j for i, j in zip(a, s)]))\n
"},{"location":"solutions/#stopwatch","title":"Stopwatch","text":"Solution in Python Python 
n = int(input())\ntimes = []\nfor _ in range(n):\n    times.append(int(input()))\nif n % 2:\n    print(\"still running\")\nelse:\n    seconds = 0\n    for i in range(0, n, 2):\n        seconds += times[i + 1] - times[i]\n    print(seconds)\n
"},{"location":"solutions/#streets-ahead","title":"Streets Ahead","text":"Solution in Python Python 
n, q = [int(d) for d in input().split()]\n\ns = {}\nfor i in range(n):\n    s[input()] = i\n\nfor _ in range(q):\n    a, b = input().split()\n    print(abs(s[a] - s[b]) - 1)\n
"},{"location":"solutions/#successful-zoom","title":"Successful Zoom","text":"Solution in Python Python 
n = int(input())\nx = [int(d) for d in input().split()]\nfound = False\nfor k in range(1, n // 2 + 1):\n    v = [x[i] for i in range(k - 1, n, k)]\n    if all([v[i] < v[i + 1] for i in range(len(v) - 1)]):\n        print(k)\n        found = True\n        break\nif not found:\n    print(\"ABORT!\")\n
"},{"location":"solutions/#sum-kind-of-problem","title":"Sum Kind of Problem","text":"Solution in Python Python 
for _ in range(int(input())):\n    k, n = [int(d) for d in input().split()]\n    s1 = sum(range(1, n + 1))\n    s2 = sum(range(1, 2 * n + 1, 2))\n    s3 = sum(range(2, 2 * (n + 1), 2))\n    print(k, s1, s2, s3)\n
"},{"location":"solutions/#sum-of-the-others","title":"Sum of the Others","text":"Solution in Python Python 
while True:\n    try:\n        n = [int(d) for d in input().split()]\n    except:\n        break\n\n    for i in range(len(n)):\n        if n[i] == sum([n[j] for j in range(len(n)) if j != i]):\n            print(n[i])\n            break\n
"},{"location":"solutions/#sum-squared-digits-function","title":"Sum Squared Digits Function","text":"Solution in Python Python 
for _ in range(int(input())):\n    k, b, n = [int(d) for d in input().split()]\n    ssd = 0\n    while n:\n        ssd += (n % b) ** 2\n        n //= b\n    print(k, ssd)\n
"},{"location":"solutions/#sun-and-moon","title":"Sun and Moon","text":"Solution in Python Python 
sun_years_ago, sun_cycle = [int(v) for v in input().split()]\nmoon_years_ago, moon_cycle = [int(v) for v in input().split()]\n\nfor t in range(1, 5001):\n    if (t + sun_years_ago) % sun_cycle == 0 and (t + moon_years_ago) % moon_cycle == 0:\n        print(t)\n        break\n
"},{"location":"solutions/#symmetric-order","title":"Symmetric Order","text":"Solution in Python Python 
set_num = 0\nwhile True:\n    size = int(input())\n    if size == 0:\n        break\n\n    names = []\n    for _ in range(size):\n        names.append(input())\n\n    set_num += 1\n    print(f\"SET {set_num}\")\n\n    top, bottom = [], []\n    for i in range(1, size, 2):\n        bottom.append(names[i])\n    for i in range(0, size, 2):\n        top.append(names[i])\n    names = top + bottom[::-1]\n    for name in names:\n        print(name)\n
"},{"location":"solutions/#synchronizing-lists","title":"Synchronizing Lists","text":"Solution in Python Python 
while True:\n    n = int(input())\n    if not n:\n        break\n    a, b = [], []\n    for _ in range(n):\n        a.append(int(input()))\n    for _ in range(n):\n        b.append(int(input()))\n    mapping = dict(zip(sorted(a), sorted(b)))\n    for key in a:\n        print(mapping[key])\n    print()\n
"},{"location":"solutions/#t9-spelling","title":"T9 Spelling","text":"Solution in Python Python 
n = int(input())\nmapping = {\n    \"2\": \"abc\",\n    \"3\": \"def\",\n    \"4\": \"ghi\",\n    \"5\": \"jkl\",\n    \"6\": \"mno\",\n    \"7\": \"pqrs\",\n    \"8\": \"tuv\",\n    \"9\": \"wxyz\",\n    \"0\": \" \",\n}\n\nfor i in range(n):\n    ans = []\n    prev = \"\"\n    for c in input():\n        for d, r in mapping.items():\n            if c in r:\n                if d == prev:\n                    ans.append(\" \")\n                ans.append(d * (r.index(c) + 1))\n                prev = d\n                break\n    print(f\"Case #{i+1}: {''.join(ans)}\")\n
"},{"location":"solutions/#tais-formula","title":"Tai's formula","text":"Solution in Python Python 
n = int(input())\nt1, v1 = [float(d) for d in input().split()]\ntotal = 0\nfor _ in range(n - 1):\n    t2, v2 = [float(d) for d in input().split()]\n    total += (v1 + v2) * (t2 - t1) / 2\n    t1, v1 = t2, v2\ntotal /= 1000\nprint(total)\n
"},{"location":"solutions/#tajna","title":"Tajna","text":"Solution in Python Python 
s = input()\n\nl = len(s)\nr = int(l**0.5)\nwhile l % r:\n    r -= 1\nc = l // r\n\nparts = [s[i : i + r] for i in range(0, l, r)]\n\nprint(\"\".join([\"\".join([row[i] for row in parts]) for i in range(r)]))\n
"},{"location":"solutions/#tarifa","title":"Tarifa","text":"Solution in Python Python 
x = int(input())\nn = int(input())\nused = 0\nfor _ in range(n):\n    used += int(input())\nprint(x * (n + 1) - used)\n
"},{"location":"solutions/#temperature-confusion","title":"Temperature Confusion","text":"Solution in Python Python 
import math\n\na, b = [int(d) for d in input().split(\"/\")]\nx, y = 5 * a - 160 * b, 9 * b\ngcd = math.gcd(x, y)\nx //= gcd\ny //= gcd\n\nprint(f\"{x}/{y}\")\n
"},{"location":"solutions/#test-drive","title":"Test Drive","text":"Solution in Python Python 
a, b, c = [int(d) for d in input().split()]\nx, y = b - a, c - b\nif x == y:\n    print(\"cruised\")\nelif x * y < 0:\n    print(\"turned\")\nelif abs(y) > abs(x):\n    print(\"accelerated\")\nelse:\n    print(\"braked\")\n
"},{"location":"solutions/#tetration","title":"Tetration","text":"Solution in Python Python 
import math\n\nn = float(input())\nprint(f\"{math.pow(n,1/n):.6f}\")\n
"},{"location":"solutions/#thanos","title":"Thanos","text":"Solution in Python Python 
for _ in range(int(input())):\n    p, r, f = [int(d) for d in input().split()]\n    y = 0\n    while p <= f:\n        p *= r\n        y += 1\n    print(y)\n
"},{"location":"solutions/#the-grand-adventure","title":"The Grand Adventure","text":"Solution in Python Python 
mapping = {\"b\": \"$\", \"t\": \"|\", \"j\": \"*\"}\nfor _ in range(int(input())):\n    a = input()\n    bag = []\n    early_fail = False\n    for i in a:\n        if i in mapping.values():\n            bag.append(i)\n        elif i in mapping:\n            if not bag or bag.pop() != mapping[i]:\n                print(\"NO\")\n                early_fail = True\n                break\n    if not early_fail:\n        print(\"YES\" if not bag else \"NO\")\n
"},{"location":"solutions/#the-last-problem","title":"The Last Problem","text":"Solutions in 2 languages GoPython 
package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"os\"\n)\n\nfunc main() {\n    scanner := bufio.NewScanner(os.Stdin)\n    scanner.Scan()\n    s := scanner.Text()\n    fmt.Println(\"Thank you,\", s+\",\", \"and farewell!\")\n}\n
print(f\"Thank you, {input()}, and farewell!\")\n
"},{"location":"solutions/#this-aint-your-grandpas-checkerboard","title":"This Ain't Your Grandpa's Checkerboard","text":"Solution in Python Python 
n = int(input())\nb = []\nfor _ in range(n):\n    b.append(input())\n\n\ndef check(b, n):\n    for row in b:\n        if row.count(\"W\") != row.count(\"B\"):\n            return False\n\n        for j in range(0, n - 3):\n            if row[j] == row[j + 1] == row[j + 2]:\n                return False\n\n    for i in range(n):\n        col = [\"\".join(row[i]) for row in b]\n\n        if col.count(\"W\") != col.count(\"B\"):\n            return False\n\n        for j in range(0, n - 3):\n            if col[j] == col[j + 1] == col[j + 2]:\n                return False\n\n    return True\n\n\nvalid = check(b, n)\nprint(1 if valid else 0)\n
"},{"location":"solutions/#stuck-in-a-time-loop","title":"Stuck In A Time Loop","text":"Solutions in 2 languages C++Python 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a;\n    cin >> a;\n    for (int i = 0; i < a; i++)\n    {\n        cout << i + 1 << \" Abracadabra\" << endl;\n    }\n}\n
n = int(input())\nfor i in range(n):\n    print(f\"{i+1} Abracadabra\")\n
"},{"location":"solutions/#title-cost","title":"Title Cost","text":"Solution in Python Python 
s, c = input().split()\nc = float(c)\nprint(min(c, len(s)))\n
"},{"location":"solutions/#toflur","title":"T\u00f6flur","text":"Solution in Python Python 
n = int(input())\na = sorted([int(d) for d in input().split()])\nscore = sum([(a[j] - a[j + 1]) ** 2 for j in range(n - 1)])\nprint(score)\n
"},{"location":"solutions/#toilet-seat","title":"Toilet Seat","text":"Solution in Python Python 
t = input()\n\n\ndef u(pos, preference):\n    if pos == preference == \"U\":\n        return 0\n    elif pos == preference == \"D\":\n        return 1\n    elif pos == \"U\" and preference == \"D\":\n        return 2\n    else:\n        return 1\n\n\ndef l(pos, preference):\n    if pos == preference == \"U\":\n        return 1\n    elif pos == preference == \"D\":\n        return 0\n    elif pos == \"U\" and preference == \"D\":\n        return 1\n    else:\n        return 2\n\n\ndef b(pos, preference):\n    if pos == preference:\n        return 0\n    else:\n        return 1\n\n\npu = [u(pos, preference) for pos, preference in zip(t[0] + \"U\" * (len(t) - 2), t[1:])]\npl = [l(pos, preference) for pos, preference in zip(t[0] + \"D\" * (len(t) - 2), t[1:])]\npb = [b(pos, preference) for pos, preference in zip(t[0] + t[1:-1], t[1:])]\n\nprint(sum(pu))\nprint(sum(pl))\nprint(sum(pb))\n
"},{"location":"solutions/#tolower","title":"ToLower","text":"Solution in Python Python 
p, t = [int(d) for d in input().split()]\nscore = 0\nfor _ in range(p):\n    solved = True\n    for _ in range(t):\n        s = input()\n        if solved:\n            s = s[0].lower() + s[1:]\n            if s.lower() == s:\n                continue\n        solved = False\n    if solved:\n        score += 1\nprint(score)\n
"},{"location":"solutions/#tower-construction","title":"Tower Construction","text":"Solution in Python Python 
_ = input()\nn = 0\ntop = 0\nfor d in [int(d) for d in input().split()]:\n    if not top or d > top:\n        n += 1\n    top = d\n\nprint(n)\n
"},{"location":"solutions/#touchscreen-keyboard","title":"Touchscreen Keyboard","text":"Solution in Python Python 
k = [\n    \"qwertyuiop\",\n    \"asdfghjkl\",\n    \"zxcvbnm\",\n]\n\n\ndef d(a, b):\n    for r1 in range(3):\n        if a in k[r1]:\n            c1 = k[r1].index(a)\n            break\n    for r2 in range(3):\n        if b in k[r2]:\n            c2 = k[r2].index(b)\n            break\n\n    return abs(c1 - c2) + abs(r1 - r2)\n\n\nfor _ in range(int(input())):\n    x, n = input().split()\n    n, w = int(n), []\n\n    for _ in range(n):\n        y = input()\n        dist = sum([d(a, b) for a, b in zip(list(x), list(y))])\n        w.append([y, dist])\n\n    print(\"\\n\".join([f\"{k} {v}\" for k, v in sorted(w, key=lambda k: (k[1], k[0]))]))\n
"},{"location":"solutions/#transit-woes","title":"Transit Woes","text":"Solution in Python Python 
s, t, n = [int(d) for d in input().split()]\nds = [int(d) for d in input().split()]\nbs = [int(d) for d in input().split()]\ncs = [int(d) for d in input().split()]\n\nfor i in range(n):\n    s += ds[i]\n    if not s % cs[i]:\n        wait_b = 0\n    else:\n        wait_b = cs[i] - s % cs[i]\n    s += wait_b + bs[i]\n\ns += ds[n]\n\nif s <= t:\n    print(\"yes\")\nelse:\n    print(\"no\")\n
"},{"location":"solutions/#tri","title":"Tri","text":"Solution in Python Python 
from operator import add, sub, truediv, mul\n\na, b, c = [int(d) for d in input().split()]\nops = {\n    \"+\": add,\n    \"-\": sub,\n    \"*\": mul,\n    \"/\": truediv,\n}\n\nfor op, func in ops.items():\n    if a == func(b, c):\n        print(f\"{a}={b}{op}{c}\")\n        break\n    if func(a, b) == c:\n        print(f\"{a}{op}{b}={c}\")\n
"},{"location":"solutions/#triangle-area","title":"Triangle Area","text":"Solutions in 4 languages C++GoJavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int h, b;\n    cin >> h >> b;\n    cout << float(h) * b / 2 << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Println(float32(a) * float32(b) / 2)\n}\n
import java.util.Scanner;\n\nclass TriangleArea {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        float a = s.nextFloat();\n        int b = s.nextInt();\n        System.out.println(a * b / 2);\n    }\n}\n
a, b = [int(d) for d in input().split()]\nprint(a * b / 2)\n
"},{"location":"solutions/#trik","title":"Trik","text":"Solution in Python Python 
moves = input()\nball = [1, 0, 0]\nfor move in moves:\n    if move == \"A\":\n        ball[0], ball[1] = ball[1], ball[0]\n    if move == \"B\":\n        ball[1], ball[2] = ball[2], ball[1]\n    if move == \"C\":\n        ball[0], ball[2] = ball[2], ball[0]\n\nif ball[0]:\n    print(1)\nelif ball[1]:\n    print(2)\nelse:\n    print(3)\n
"},{"location":"solutions/#triple-texting","title":"Triple Texting","text":"Solution in Python Python 
from collections import Counter\n\ns = input()\ntimes = 3\nsize = len(s) // times\nmessages = []\nfor i in range(0, len(s), size):\n    messages.append(s[i : i + size])\n\noriginal = \"\"\nfor i in range(size):\n    chars = [m[i] for m in messages]\n    if len(set(chars)) == 1:\n        original += chars[0]\n    else:\n        c = Counter(chars)\n        original += max(c, key=lambda k: c[k])\n\nprint(original)\n
"},{"location":"solutions/#take-two-stones","title":"Take Two Stones","text":"Solutions in 6 languages GoHaskellJavaJavaScriptKotlinPython 
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var n int\n    fmt.Scan(&n)\n    if n%2 == 1 {\n        fmt.Println(\"Alice\")\n    } else {\n        fmt.Println(\"Bob\")\n    }\n}\n
main = do\n    input <- getLine\n    let n = (read input :: Int)\n    if  n `mod` 2  ==  1\n    then putStrLn \"Alice\"\n        else putStrLn \"Bob\"\n
import java.util.Scanner;\n\nclass TakeTwoStones {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        if (n % 2 == 1) {\n            System.out.println(\"Alice\");\n        } else {\n            System.out.println(\"Bob\");\n        }\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (n) => {\n  if (parseInt(n) % 2) {\n    console.log(\"Alice\");\n  } else {\n    console.log(\"Bob\");\n  }\n});\n
fun main() {\n    if (readLine()!!.toInt() % 2 == 1) {\n        println(\"Alice\")\n    } else {\n        println(\"Bob\")\n    }\n}\n
if int(input()) % 2:\n    print(\"Alice\")\nelse:\n    print(\"Bob\")\n
"},{"location":"solutions/#two-sum","title":"Two-sum","text":"Solutions in 4 languages C++GoJavaPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a, b;\n    cin >> a >> b;\n    cout << a + b << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    fmt.Println(a + b)\n}\n
import java.util.Scanner;\n\nclass TwoSum {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a = s.nextInt();\n        int b = s.nextInt();\n        System.out.println(a + b);\n    }\n}\n
line = input()\na, b = [int(d) for d in line.split()]\nprint(a + b)\n
"},{"location":"solutions/#ullen-dullen-doff","title":"\u00dallen d\u00fallen doff","text":"Solution in Python Python 
n = int(input())\nnames = input().split()\nif n < 13:\n    i = 13 % n - 1\nelse:\n    i = 12\nprint(names[i])\n
"},{"location":"solutions/#ultimate-binary-watch","title":"Ultimate Binary Watch","text":"Solution in Python Python 
t = [int(d) for d in input()]\nb = [f\"{d:b}\".zfill(4) for d in t]\n\nfor r in range(4):\n    row = [\".\" if b[i][r] == \"0\" else \"*\" for i in range(4)]\n    row.insert(2, \" \")\n    print(\" \".join(row))\n
"},{"location":"solutions/#undead-or-alive","title":"Undead or Alive","text":"Solution in Python Python 
s = input()\n\nsmiley = \":)\" in s\n\nfrowny = \":(\" in s\n\nif not frowny and smiley:\n    print(\"alive\")\n\nelif frowny and not smiley:\n    print(\"undead\")\n\nelif frowny and smiley:\n    print(\"double agent\")\n\nelse:\n    print(\"machine\")\n
"},{"location":"solutions/#unlock-pattern","title":"Unlock Pattern","text":"Solution in Python Python 
import math\n\n\ndef dist(a, b):\n    return math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)\n\n\ncoords = {}\nfor i in range(3):\n    n = [int(d) for d in input().split()]\n    for j in range(3):\n        coords[n[j]] = (i, j)\n\nvalues = [coords[k] for k in sorted(coords)]\ntotal, prev = 0, 0\nfor i in range(1, 9):\n    total += dist(values[i], values[prev])\n    prev = i\nprint(total)\n
"},{"location":"solutions/#arrangement","title":"Arrangement","text":"Solution in Python Python 
import math\n\nn, m = int(input()), int(input())\n\nk = math.ceil(m / n)\n\nfor _ in range(n - (n * k - m)):\n    print(\"*\" * k)\nfor _ in range(n * k - m):\n    print(\"*\" * (k - 1))\n
"},{"location":"solutions/#utf-8","title":"UTF-8","text":"Solution in Python Python 
n = int(input())\ns = []\nfor _ in range(n):\n    s.append(input())\n\ni = 0\nnum = 0\nerr = False\nt = [0] * 4\nwhile i < n:\n    a = s[i]\n    if a.startswith(\"0\") and not num:\n        num = 0\n        t[0] += 1\n    elif a.startswith(\"110\") and not num:\n        t[1] += 1\n        num = 1\n    elif a.startswith(\"1110\") and not num:\n        t[2] += 1\n        num = 2\n    elif a.startswith(\"11110\") and not num:\n        t[3] += 1\n        num = 3\n    elif a.startswith(\"10\") and num:\n        num -= 1\n    else:\n        err = True\n        break\n    i += 1\n\nif err or num:\n    print(\"invalid\")\nelse:\n    print(\"\\n\".join([str(d) for d in t]))\n
"},{"location":"solutions/#vaccine-efficacy","title":"Vaccine Efficacy","text":"Solution in Python Python 
participants = int(input())\n\nvaccinated = 0\ncontrol = 0\ninfected_control_a = 0\ninfected_vaccinated_a = 0\ninfected_control_b = 0\ninfected_vaccinated_b = 0\ninfected_control_c = 0\ninfected_vaccinated_c = 0\n\nfor p in range(participants):\n    record = input()\n    v, a, b, c = list(record)\n\n    if v == \"N\":\n        control += 1\n    else:\n        vaccinated += 1\n\n    if a == \"Y\":\n        if v == \"N\":\n            infected_control_a += 1\n        else:\n            infected_vaccinated_a += 1\n\n    if b == \"Y\":\n        if v == \"N\":\n            infected_control_b += 1\n        else:\n            infected_vaccinated_b += 1\n\n    if c == \"Y\":\n        if v == \"N\":\n            infected_control_c += 1\n        else:\n            infected_vaccinated_c += 1\n\n\ndef get_vaccine_efficacy(infected_vaccinated, vaccinated, infected_control, control):\n    infection_rate_vaccinated = infected_vaccinated / vaccinated\n    infection_rate_control = infected_control / control\n    return 1 - infection_rate_vaccinated / infection_rate_control\n\n\nvaccine_efficacy = [\n    get_vaccine_efficacy(\n        infected_vaccinated_a,\n        vaccinated,\n        infected_control_a,\n        control,\n    ),\n    get_vaccine_efficacy(\n        infected_vaccinated_b,\n        vaccinated,\n        infected_control_b,\n        control,\n    ),\n    get_vaccine_efficacy(\n        infected_vaccinated_c,\n        vaccinated,\n        infected_control_c,\n        control,\n    ),\n]\n\nfor value in vaccine_efficacy:\n    if value <= 0:\n        print(\"Not Effective\")\n    else:\n        print(f\"{value*100:.6f}\")\n
"},{"location":"solutions/#right-of-way","title":"Right-of-Way","text":"Solution in Python Python 
d = [\"North\", \"East\", \"South\", \"West\"]\na, b, c = input().split()\nia = d.index(a)\nib = d.index(b)\nic = d.index(c)\n\nib = (ib - ia) % 4\nic = (ic - ia) % 4\nia -= ia\n\nif ib == 2:\n    print(\"Yes\" if ic == 3 else \"No\")\nelif ib == 1:\n    print(\"Yes\" if ic in [2, 3] else \"No\")\nelse:\n    print(\"No\")\n
"},{"location":"solutions/#variable-arithmetic","title":"Variable Arithmetic","text":"Solution in Python Python 
context = {}\nwhile True:\n    s = input()\n    if s == \"0\":\n        break\n\n    if \"=\" in s:\n        x, y = [d.strip() for d in s.split(\"=\")]\n        context[x] = int(y)\n    else:\n        v = [d.strip() for d in s.split(\"+\")]\n        t = 0\n        n = []\n        for d in v:\n            if d.isdigit():\n                t += int(d)\n            elif d in context:\n                t += context[d]\n            else:\n                n.append(d)\n        if len(n) < len(v):\n            n = [str(t)] + n\n        print(\" + \".join(n))\n
"},{"location":"solutions/#veci","title":"Veci","text":"Solution in Python Python 
from itertools import permutations\n\nx = input()\n\nvalues = sorted(set([int(\"\".join(v)) for v in permutations(x, len(x))]))\n\nindex = values.index(int(x))\nif index + 1 < len(values):\n    print(values[index + 1])\nelse:\n    print(0)\n
"},{"location":"solutions/#vector-functions","title":"Vector Functions","text":"Solution in C++ C++ 
#include \"vectorfunctions.h\"\n#include <algorithm>\n\nvoid backwards(std::vector<int> &vec)\n{\n    vec = std::vector<int>(vec.rbegin(), vec.rend());\n}\n\nstd::vector<int> everyOther(const std::vector<int> &vec)\n{\n    std::vector<int> ans;\n\n    for (int i = 0; i < vec.size(); i += 2)\n        ans.push_back(vec[i]);\n\n    return ans;\n}\n\nint smallest(const std::vector<int> &vec)\n{\n    return *min_element(vec.begin(), vec.end());\n}\n\nint sum(const std::vector<int> &vec)\n{\n    int ans = 0;\n\n    for (auto it = begin(vec); it != end(vec); ++it)\n    {\n        ans += *it;\n    }\n\n    return ans;\n}\n\nint veryOdd(const std::vector<int> &suchVector)\n{\n    int ans = 0;\n    for (int i = 1; i < suchVector.size(); i += 2)\n    {\n        if (suchVector[i] % 2 == 1)\n            ans++;\n    }\n\n    return ans;\n}\n
"},{"location":"solutions/#veur-lokaar-heiar","title":"Ve\u00f0ur - Loka\u00f0ar hei\u00f0ar","text":"Solution in Python Python 
v = int(input())\nfor _ in range(int(input())):\n    s, k = input().split()\n    if int(k) >= v:\n        print(s, \"opin\")\n    else:\n        print(s, \"lokud\")\n
"},{"location":"solutions/#veur-vindhrai","title":"Ve\u00f0ur - Vindhra\u00f0i","text":"Solution in Python Python 
k = float(input())\nif k < 0.3:\n    print(\"logn\")\nelif k < 1.6:\n    print(\"Andvari\")\nelif k < 3.4:\n    print(\"Kul\")\nelif k < 5.5:\n    print(\"Gola\")\nelif k < 8.0:\n    print(\"Stinningsgola\")\nelif k < 10.8:\n    print(\"Kaldi\")\nelif k < 13.9:\n    print(\"Stinningskaldi\")\nelif k < 17.2:\n    print(\"Allhvass vindur\")\nelif k < 20.8:\n    print(\"Hvassvidri\")\nelif k < 24.5:\n    print(\"Stormur\")\nelif k < 28.5:\n    print(\"Rok\")\n\nelif k < 32.7:\n    print(\"Ofsavedur\")\nelse:\n    print(\"Farvidri\")\n
"},{"location":"solutions/#vefjonatjon","title":"Vef\u00fej\u00f3natj\u00f3n","text":"Solution in Python Python 
n = int(input())\nparts = [0, 0, 0]\nfor _ in range(n):\n    for i, value in enumerate(input().split()):\n        if value == \"J\":\n            parts[i] += 1\nprint(min(parts))\n
"},{"location":"solutions/#velkomin","title":"Velkomin!","text":"Solution in Python Python 
print(\"VELKOMIN!\")\n
"},{"location":"solutions/#who-wins","title":"Who wins?","text":"Solution in Python Python 
board = []\nfor _ in range(3):\n    board.append(input().split())\n\nwinner = \"\"\nfor i in range(3):\n    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != \"_\":\n        winner = board[i][0]\n        break\n    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != \"_\":\n        winner = board[0][i]\n        break\n\nif board[0][0] == board[1][1] == board[2][2] and board[1][1] != \"_\":\n    winner = board[1][1]\nelif board[0][2] == board[1][1] == board[2][0] and board[1][1] != \"_\":\n    winner = board[1][1]\n\nif not winner:\n    winner = \"ingen\"\nelif winner == \"X\":\n    winner = \"Johan\"\nelse:\n    winner = \"Abdullah\"\n\nprint(f\"{winner} har vunnit\")\n
"},{"location":"solutions/#video-speedup","title":"Video Speedup","text":"Solution in Python Python 
n, p, k = [int(d) for d in input().split()]\ni = [int(d) for d in input().split()]\n\nstart, total = 0, 0\nspeed = 1\nfor ti in i:\n    total += speed * (ti - start)\n    start = ti\n    speed += p / 100\ntotal += speed * (k - start)\nprint(f\"{total:.3f}\")\n
"},{"location":"solutions/#visnuningur","title":"Vi\u00f0sn\u00faningur","text":"Solution in Python Python 
print(input()[::-1])\n
"},{"location":"solutions/#popular-vote","title":"Popular Vote","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = int(input())\n    votes = [int(input()) for _ in range(n)]\n    largest = max(votes)\n    if votes.count(largest) > 1:\n        print(\"no winner\")\n    else:\n        total = sum(votes)\n        winner = votes.index(largest)\n        print(\n            \"majority\" if votes[winner] > total / 2 else \"minority\",\n            \"winner\",\n            winner + 1,\n        )\n
"},{"location":"solutions/#warehouse","title":"Warehouse","text":"Solution in Python Python 
for _ in range(int(input())):\n    n = int(input())\n    warehouse = {}\n    for _ in range(n):\n        s = input().split()\n        name, quantity = s[0], int(s[1])\n        if name not in warehouse:\n            warehouse[name] = quantity\n        else:\n            warehouse[name] += quantity\n    print(len(warehouse))\n    names = sorted(warehouse)\n    for name in sorted(\n        warehouse, key=lambda k: (warehouse[k], -names.index(k)), reverse=True\n    ):\n        print(name, warehouse[name])\n
"},{"location":"solutions/#weak-vertices","title":"Weak Vertices","text":"Solution in Python Python 
from itertools import combinations\n\nwhile True:\n    n = int(input())\n    if n == -1:\n        break\n    graph = {}\n    for i in range(n):\n        graph[str(i)] = [str(v) for v, e in zip(range(n), input().split()) if e == \"1\"]\n\n    # listing the weak vertices ordered from least to greatest\n    # I guess it means vertex number, not the weakness\n    # keys = sorted(graph, key=lambda x: len(graph[x]), reverse=True)\n\n    keys = graph.keys()\n\n    result = []\n\n    for key in keys:\n        has_triangle = False\n        for a, b in combinations(graph[key], 2):\n            if a in graph[b] and b in graph[a]:\n                has_triangle = True\n                break\n\n        if not has_triangle:\n            result.append(key)\n\n    print(\" \".join(result))\n
"},{"location":"solutions/#wertyu","title":"WERTYU","text":"Solution in Python Python 
mapping = {\n    # row 1\n    \"1\": \"`\",\n    \"2\": \"1\",\n    \"3\": \"2\",\n    \"4\": \"3\",\n    \"5\": \"4\",\n    \"6\": \"5\",\n    \"7\": \"6\",\n    \"8\": \"7\",\n    \"9\": \"8\",\n    \"0\": \"9\",\n    \"-\": \"0\",\n    \"=\": \"-\",\n    # row 2\n    \"W\": \"Q\",\n    \"E\": \"W\",\n    \"R\": \"E\",\n    \"T\": \"R\",\n    \"Y\": \"T\",\n    \"U\": \"Y\",\n    \"I\": \"U\",\n    \"O\": \"I\",\n    \"P\": \"O\",\n    \"[\": \"P\",\n    \"]\": \"[\",\n    \"\\\\\": \"]\",\n    # row 3\n    \"S\": \"A\",\n    \"D\": \"S\",\n    \"F\": \"D\",\n    \"G\": \"F\",\n    \"H\": \"G\",\n    \"J\": \"H\",\n    \"K\": \"J\",\n    \"L\": \"K\",\n    \";\": \"L\",\n    \"'\": \";\",\n    # row 4\n    \"X\": \"Z\",\n    \"C\": \"X\",\n    \"V\": \"C\",\n    \"B\": \"V\",\n    \"N\": \"B\",\n    \"M\": \"N\",\n    \",\": \"M\",\n    \".\": \",\",\n    \"/\": \".\",\n    \" \": \" \",\n}\n\nwhile True:\n    try:\n        s = input()\n    except:\n        break\n    print(\"\".join([mapping[c] for c in s]))\n
"},{"location":"solutions/#what-does-the-fox-say","title":"What does the fox say?","text":"Solution in Python Python 
for _ in range(int(input())):\n    words = input().split()\n    others = set()\n    while True:\n        line = input()\n        if line == \"what does the fox say?\":\n            break\n        w = line.split()[-1]\n        others.add(w)\n    print(\" \".join(w for w in words if w not in others))\n
"},{"location":"solutions/#which-is-greater","title":"Which is Greater?","text":"Solutions in 5 languages C++GoJavaJavaScriptPython 
#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int a, b;\n    cin >> a >> b;\n    int ans = (a > b) ? 1 : 0;\n    cout << ans << endl;\n    return 0;\n}\n
package main\n\nimport \"fmt\"\n\nfunc main() {\n    var a, b int\n    fmt.Scan(&a)\n    fmt.Scan(&b)\n    if a > b {\n        fmt.Println(1)\n    } else {\n        fmt.Println(0)\n    }\n}\n
import java.util.Scanner;\n\nclass WhichisGreater {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a = s.nextInt();\n        int b = s.nextInt();\n        if (a>b){\n            System.out.println(1);\n        }else{\n            System.out.println(0);\n        }\n    }\n}\n
const readline = require(\"readline\");\nconst rl = readline.createInterface(process.stdin, process.stdout);\n\nrl.question(\"\", (line) => {\n  [a, b] = line\n    .trim()\n    .split(\" \")\n    .map((e) => parseInt(e));\n  if (a > b) {\n    console.log(1);\n  } else {\n    console.log(0);\n  }\n});\n
a, b = [int(d) for d in input().split()]\nif a > b:\n    print(1)\nelse:\n    print(0)\n
"},{"location":"solutions/#wizard-of-odds","title":"Wizard of Odds","text":"Solution in Python Python 
import math\n\nn, k = [int(d) for d in input().split()]\nans = math.log(n, 2) <= k\nif ans:\n    print(\"Your wish is granted!\")\nelse:\n    print(\"You will become a flying monkey!\")\n
"},{"location":"solutions/#words-for-numbers","title":"Words for Numbers","text":"Solution in Python Python 
mapping = {\n    0: \"zero\",\n    1: \"one\",\n    2: \"two\",\n    3: \"three\",\n    4: \"four\",\n    5: \"five\",\n    6: \"six\",\n    7: \"seven\",\n    8: \"eight\",\n    9: \"nine\",\n    10: \"ten\",\n    11: \"eleven\",\n    12: \"twelve\",\n}\n\n\ndef f(d):\n    if d < 13:\n        return mapping[d]\n\n    ones = d % 10\n    if d < 20:\n        return {3: \"thir\", 5: \"fif\", 8: \"eigh\"}.get(ones, mapping[ones]) + \"teen\"\n\n    tens = d // 10\n    return (\n        {2: \"twen\", 3: \"thir\", 4: \"for\", 5: \"fif\", 8: \"eigh\"}.get(tens, mapping[tens])\n        + \"ty\"\n        + (\"-\" + mapping[ones] if ones else \"\")\n    )\n\n\ndef t(w):\n    if w.isdigit():\n        return f(int(w))\n    else:\n        return w\n\n\nwhile True:\n    try:\n        words = input()\n    except:\n        break\n    print(\" \".join([t(w) for w in words.split()]))\n
"},{"location":"solutions/#yin-and-yang-stones","title":"Yin and Yang Stones","text":"Solution in Python Python 
s = input()\nprint(1 if s.count(\"W\") == s.count(\"B\") else 0)\n
"},{"location":"solutions/#yoda","title":"Yoda","text":"Solution in Python Python 
a, b = input(), input()\nsize = max(len(a), len(b))\n\na = [int(d) for d in a.zfill(size)]\nb = [int(d) for d in b.zfill(size)]\n\nans_a = [d1 for d1, d2 in zip(a, b) if d1 >= d2]\nans_b = [d2 for d1, d2 in zip(a, b) if d2 >= d1]\n\n\ndef f(ans):\n    if not ans:\n        return \"YODA\"\n    else:\n        return int(\"\".join([str(d) for d in ans]))\n\n\nprint(f(ans_a))\nprint(f(ans_b))\n
"},{"location":"solutions/#zamka","title":"Zamka","text":"Solution in Python Python 
l, d, x = input(), input(), input()\nl, d, x = int(l), int(d), int(x)\n\nfor i in range(l, d + 1):\n    if sum([int(d) for d in str(i)]) == x:\n        print(i)\n        break\n\nfor i in range(d, l - 1, -1):\n    if sum([int(d) for d in str(i)]) == x:\n        print(i)\n        break\n
"},{"location":"solutions/#stand-on-zanzibar","title":"Stand on Zanzibar","text":"Solutions in 2 languages JavaPython 
import java.util.Scanner;\n\nclass StandOnZanzibar {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int t = s.nextInt();\n        for (int i = 0; i < t; i++) {\n            int total = 0;\n            int n = 0;\n            int init = 1;\n            while (true) {\n                n = s.nextInt();\n                if (n == 0) {\n                    break;\n                }\n                total += Math.max(n - 2 * init, 0);\n                init = n;\n            }\n            System.out.println(total);\n        }\n    }\n}\n
for _ in range(int(input())):\n    numbers = [int(d) for d in input().split()[:-1]]\n    total = 0\n    for i in range(1, len(numbers)):\n        total += max(numbers[i] - 2 * numbers[i - 1], 0)\n    print(total)\n
"},{"location":"solutions/#un-bear-able-zoo","title":"Un-bear-able Zoo","text":"Solution in Python Python 
from collections import Counter\n\nlc = 0\nwhile True:\n    n = int(input())\n    if not n:\n        break\n    lc += 1\n    l = Counter()\n    for _ in range(n):\n        animal = input().lower().split()\n        l[animal[-1]] += 1\n    print(f\"List {lc}:\")\n    print(\"\\n\".join([f\"{k} | {l[k]}\" for k in sorted(l)]))\n
"},{"location":"solutions/#zoom","title":"Zoom","text":"Solution in Python Python 
n, k = [int(d) for d in input().split()]\nx = [int(d) for d in input().split()]\nprint(\" \".join([str(x[i]) for i in range(k - 1, n, k)]))\n
"}]} \ No newline at end of file diff --git a/sitemap.xml.gz b/sitemap.xml.gz index b85517d6f739a333c98efed42b72504732f7c137..3b63a0998efd30ad1e2cd19fbd5dfb9ab1f89115 100644 GIT binary patch delta 13 Ucmb=gXP58h;PAXHJCVHt02}-S5dZ)H delta 13 Ucmb=gXP58h;CMG(W+Hn903Lz_aR2}S diff --git a/solutions/index.html b/solutions/index.html index 6e7e8c3..e1d74f1 100644 --- a/solutions/index.html +++ b/solutions/index.html @@ -9,7 +9,7 @@ body[data-md-color-scheme="slate"] .gdesc-inner { background: var(--md-default-bg-color);} body[data-md-color-scheme="slate"] .gslide-title { color: var(--md-default-fg-color);} body[data-md-color-scheme="slate"] .gslide-desc { color: var(--md-default-fg-color);} -
Skip to content

Solutions

🔴 10 Kinds of People

Solution in Python 
 1
+                   
 
 
  
 
 
 
 
 
 
  
 
 
  
 
 
Solutions
 
🔴 10 Kinds of People
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -1661,7 +1661,7 @@
 
 
 
 
 
 
🟢 Boss Battle
 
 Solution in Python 
 
 
 
1
 2
n = int(input())
 print(n - 2 if n // 4 else 1)
-
 
 
 
 
 
🟢 Bounding Robots
 
 Solution in Python 
 
 
 
 1
+
 
 
 
 
 
🟢 Bottled-Up Feelings
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -1676,49 +1676,23 @@
 13
 14
 15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
while True:
-    room_x, room_y = [int(d) for d in input().split()]
-    if not room_x and not room_y:
-        break
-
-    robot_x, robot_y = 0, 0
-    actual_x, actual_y = 0, 0
-
-    n = int(input())
-    for _ in range(n):
-        direction, step = input().split()
-        step = int(step)
-
-        if direction == "u":
-            robot_y += step
-            actual_y = min(room_y - 1, actual_y + step)
-        elif direction == "d":
-            robot_y -= step
-            actual_y = max(0, actual_y - step)
-        elif direction == "r":
-            robot_x += step
-            actual_x = min(room_x - 1, actual_x + step)
-        elif direction == "l":
-            robot_x -= step
-            actual_x = max(0, actual_x - step)
-
-    print(f"Robot thinks {robot_x} {robot_y}")
-    print(f"Actually at {actual_x} {actual_y}")
-    print()
-
 
 
 
 
 
🟢 Bracket Matching
 
 Solution in Python 
 
 
 
 1
+16
s, v1, v2 = [int(d) for d in input().split()]
+
+n1 = s // v1
+if not s % v1:
+    print(n1, 0)
+else:
+    while True:
+        if not (s - n1 * v1) % v2:
+            print(n1, (s - n1 * v1) // v2)
+            break
+        else:
+            n1 -= 1
+            if n1 < 0:
+                break
+    if n1 < 0:
+        print("Impossible")
+
 
 
 
 
 
🟢 Bounding Robots
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -1741,31 +1715,41 @@
 21
 22
 23
-24
n = int(input())
-s = input()
-stack = []
-is_valid = True
-for i in range(n):
-    c = s[i]
-    if c in ("(", "[", "{"):
-        stack.append(c)
-    else:
-        if len(stack) == 0:
-            is_valid = False
-            break
-        last = stack.pop()
-        if c == ")" and last != "(":
-            is_valid = False
-            break
-        if c == "]" and last != "[":
-            is_valid = False
-            break
-        if c == "}" and last != "{":
-            is_valid = False
-            break
-
-print("Valid" if is_valid and not len(stack) else "Invalid")
-
 
 
 
 
 
🟢 Breaking Branches
 
 Solutions in 5 languages 
 
 
 
 1
+24
+25
+26
+27
+28
+29
while True:
+    room_x, room_y = [int(d) for d in input().split()]
+    if not room_x and not room_y:
+        break
+
+    robot_x, robot_y = 0, 0
+    actual_x, actual_y = 0, 0
+
+    n = int(input())
+    for _ in range(n):
+        direction, step = input().split()
+        step = int(step)
+
+        if direction == "u":
+            robot_y += step
+            actual_y = min(room_y - 1, actual_y + step)
+        elif direction == "d":
+            robot_y -= step
+            actual_y = max(0, actual_y - step)
+        elif direction == "r":
+            robot_x += step
+            actual_x = min(room_x - 1, actual_x + step)
+        elif direction == "l":
+            robot_x -= step
+            actual_x = max(0, actual_x - step)
+
+    print(f"Robot thinks {robot_x} {robot_y}")
+    print(f"Actually at {actual_x} {actual_y}")
+    print()
+
 
 
 
 
 
🟢 Bracket Matching
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -1778,60 +1762,80 @@
 11
 12
 13
-14
package main
-
-import "fmt"
-
-func main() {
-    var n int
-    fmt.Scan(&n)
-    if n%2 == 0 {
-        fmt.Println("Alice")
-        fmt.Println(1)
-    } else {
-        fmt.Println("Bob")
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
main = do
-    input <- getLine
-    let n = (read input :: Int)
-    if  n `mod` 2  ==  0
-    then do putStrLn "Alice"
-            putStrLn "1"
-        else putStrLn "Bob"
-
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
import java.util.Scanner;
-
-class BreakingBranches {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int n = s.nextInt();
-        if (n % 2 == 0) {
-            System.out.println("Alice");
-            System.out.println(1);
-        } else {
-            System.out.println("Bob");
-        }
-    }
-}
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
n = int(input())
+s = input()
+stack = []
+is_valid = True
+for i in range(n):
+    c = s[i]
+    if c in ("(", "[", "{"):
+        stack.append(c)
+    else:
+        if len(stack) == 0:
+            is_valid = False
+            break
+        last = stack.pop()
+        if c == ")" and last != "(":
+            is_valid = False
+            break
+        if c == "]" and last != "[":
+            is_valid = False
+            break
+        if c == "}" and last != "{":
+            is_valid = False
+            break
+
+print("Valid" if is_valid and not len(stack) else "Invalid")
+
 
 
 
 
 
🟢 Breaking Branches
 
 Solutions in 5 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
package main
+
+import "fmt"
+
+func main() {
+    var n int
+    fmt.Scan(&n)
+    if n%2 == 0 {
+        fmt.Println("Alice")
+        fmt.Println(1)
+    } else {
+        fmt.Println("Bob")
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
+6
+7
main = do
+    input <- getLine
+    let n = (read input :: Int)
+    if  n `mod` 2  ==  0
+    then do putStrLn "Alice"
+            putStrLn "1"
+        else putStrLn "Bob"
 
 
 
 
 1
  2
  3
@@ -1842,58 +1846,56 @@
  8
  9
 10
-11
const readline = require("readline");
-const rl = readline.createInterface(process.stdin, process.stdout);
-
-rl.question("", (n) => {
-  if (parseInt(n) % 2) {
-    console.log("Bob");
-  } else {
-    console.log("Alice");
-    console.log(1);
-  }
-});
-
 
 
 
1
-2
-3
-4
-5
-6
n = int(input())
-if n % 2:
-    print("Bob")
-else:
-    print("Alice")
-    print(1)
-
 
 
 
 
 
🟢 Broken Calculator
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
prev = 1
-for _ in range(int(input())):
-    a, op, b = input().split()
-    a, b = int(a), int(b)
-    if op == "+":
-        ans = a + b - prev
-    elif op == "-":
-        ans = (a - b) * prev
-    elif op == "*":
-        ans = (a * b) ** 2
-    elif op == "/":
-        ans = (a + 1) // 2 if a % 2 else a // 2
-
-    print(ans)
-    prev = ans
-
 
 
 
 
 
🟢 Broken Swords
 
 Solution in Python 
 
 
 
 1
+11
+12
+13
+14
import java.util.Scanner;
+
+class BreakingBranches {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        if (n % 2 == 0) {
+            System.out.println("Alice");
+            System.out.println(1);
+        } else {
+            System.out.println("Bob");
+        }
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
const readline = require("readline");
+const rl = readline.createInterface(process.stdin, process.stdout);
+
+rl.question("", (n) => {
+  if (parseInt(n) % 2) {
+    console.log("Bob");
+  } else {
+    console.log("Alice");
+    console.log(1);
+  }
+});
+
 
 
 
1
+2
+3
+4
+5
+6
n = int(input())
+if n % 2:
+    print("Bob")
+else:
+    print("Alice")
+    print(1)
+
 
 
 
 
 
🟢 Broken Calculator
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -1903,18 +1905,26 @@
  8
  9
 10
-11
tb, lr = 0, 0
+11
+12
+13
+14
+15
prev = 1
 for _ in range(int(input())):
-    s = input()
-    tb += s[:2].count("0")
-    lr += s[2:].count("0")
-
-swords = min(tb, lr) // 2
-tb -= swords * 2
-lr -= swords * 2
-
-print(f"{swords} {tb} {lr}")
-
 
 
 
 
 
🟢 Buka
 
 Solution in Python 
 
 
 
 1
+    a, op, b = input().split()
+    a, b = int(a), int(b)
+    if op == "+":
+        ans = a + b - prev
+    elif op == "-":
+        ans = (a - b) * prev
+    elif op == "*":
+        ans = (a * b) ** 2
+    elif op == "/":
+        ans = (a + 1) // 2 if a % 2 else a // 2
+
+    print(ans)
+    prev = ans
+
 
 
 
 
 
🟢 Broken Swords
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -1923,77 +1933,55 @@
  7
  8
  9
-10
a, op, b = input(), input(), input()
-pa, pb = a.count("0"), b.count("0")
-if op == "*":
-    print(f"1{'0'*(pa+pb)}")
-elif op == "+":
-    if pa == pb:
-        ans = f"2{'0'*pa}"
-    else:
-        ans = f"1{'0'*(abs(pa-pb)-1)}1{'0'*min(pa,pb)}"
-    print(ans)
-
 
 
 
 
 
🟢 Bus
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
def f(n):
-    if n == 1:
-        return 1
-    else:
-        return int(2 * (f(n - 1) + 0.5))
-
-
-for _ in range(int(input())):
-    print(f(int(input())))
-
 
 
 
 
 
🟢 Bus Numbers
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
n = int(input())
-numbers = sorted([int(d) for d in input().split()])
-
-prev = numbers[0]
-ans = {prev: 1}
-for i in range(1, n):
-    if numbers[i] == prev + ans[prev]:
-        ans[prev] += 1
-    else:
-        prev = numbers[i]
-        ans[prev] = 1
-
-print(
-    " ".join(
-        [
-            f"{key}-{key+value-1}"
-            if value > 2
-            else " ".join([str(d) for d in range(key, key + value)])
-            for key, value in ans.items()
-        ]
-    )
-)
-
 
 
 
 
 
🟢 Calories From Fat
 
 Solution in Python 
 
 
 
 1
+10
+11
tb, lr = 0, 0
+for _ in range(int(input())):
+    s = input()
+    tb += s[:2].count("0")
+    lr += s[2:].count("0")
+
+swords = min(tb, lr) // 2
+tb -= swords * 2
+lr -= swords * 2
+
+print(f"{swords} {tb} {lr}")
+
 
 
 
 
 
🟢 Buka
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
a, op, b = input(), input(), input()
+pa, pb = a.count("0"), b.count("0")
+if op == "*":
+    print(f"1{'0'*(pa+pb)}")
+elif op == "+":
+    if pa == pb:
+        ans = f"2{'0'*pa}"
+    else:
+        ans = f"1{'0'*(abs(pa-pb)-1)}1{'0'*min(pa,pb)}"
+    print(ans)
+
 
 
 
 
 
🟢 Bus
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
def f(n):
+    if n == 1:
+        return 1
+    else:
+        return int(2 * (f(n - 1) + 0.5))
+
+
+for _ in range(int(input())):
+    print(f(int(input())))
+
 
 
 
 
 
🟢 Bus Numbers
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2014,97 +2002,29 @@
 19
 20
 21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
mapping = {"fat": 9, "protein": 4, "sugar": 4, "starch": 4, "alcohol": 7}
-
+22
n = int(input())
+numbers = sorted([int(d) for d in input().split()])
 
-def c(x, category):
-    if "g" in x:
-        return (int(x[:-1]) * mapping[category], "C")
-    elif "C" in x:
-        return (int(x[:-1]), "C")
-    elif "%" in x:
-        return (int(x[:-1]) / 100, "%")
-
+prev = numbers[0]
+ans = {prev: 1}
+for i in range(1, n):
+    if numbers[i] == prev + ans[prev]:
+        ans[prev] += 1
+    else:
+        prev = numbers[i]
+        ans[prev] = 1
 
-def solve(items):
-    fat_c, total_c = 0, 0
-    for fat, protein, sugar, starch, alcohol in items:
-        fat_c += fat
-        total_c += fat + protein + sugar + starch + alcohol
-
-    return f"{fat_c/total_c:.0%}"
-
-
-items = []
-while True:
-    s = input()
-    if s == "-":
-        if not items:
-            break
-        print(solve(items))
-
-        items = []
-        continue
-
-    fat, protein, sugar, starch, alcohol = s.split()
-    mapping.keys()
-
-    total_c, total_p = 0, 0
-
-    reading = []
-    for v, k in zip(s.split(), mapping.keys()):
-        n, t = c(v, k)
-        if t == "C":
-            total_c += n
-        elif t == "%":
-            total_p += n
-        reading.append((n, t))
-
-    total_c = total_c / (1 - total_p)
-
-    item = []
-    for n, t in reading:
-        if t == "%":
-            item.append(n * total_c)
-        else:
-            item.append(n)
-
-    items.append(item)
-
 
 
 
 
 
🟢 Canadians, eh?
 
 Solutions in 3 languages 
 
 
 
 1
+print(
+    " ".join(
+        [
+            f"{key}-{key+value-1}"
+            if value > 2
+            else " ".join([str(d) for d in range(key, key + value)])
+            for key, value in ans.items()
+        ]
+    )
+)
+
 
 
 
 
 
🟢 Calories From Fat
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2122,26 +2042,100 @@
 16
 17
 18
-19
package main
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
+49
+50
+51
+52
+53
+54
+55
+56
mapping = {"fat": 9, "protein": 4, "sugar": 4, "starch": 4, "alcohol": 7}
 
-import (
-    "bufio"
-    "fmt"
-    "os"
-    "strings"
-)
-
-func main() {
-    scanner := bufio.NewScanner(os.Stdin)
-    scanner.Scan()
-    line := scanner.Text()
-    if strings.HasSuffix(line, "eh?") {
-        fmt.Println("Canadian!")
-    } else {
-        fmt.Println("Imposter!")
-    }
-}
-
 
 
 
 1
+
+def c(x, category):
+    if "g" in x:
+        return (int(x[:-1]) * mapping[category], "C")
+    elif "C" in x:
+        return (int(x[:-1]), "C")
+    elif "%" in x:
+        return (int(x[:-1]) / 100, "%")
+
+
+def solve(items):
+    fat_c, total_c = 0, 0
+    for fat, protein, sugar, starch, alcohol in items:
+        fat_c += fat
+        total_c += fat + protein + sugar + starch + alcohol
+
+    return f"{fat_c/total_c:.0%}"
+
+
+items = []
+while True:
+    s = input()
+    if s == "-":
+        if not items:
+            break
+        print(solve(items))
+
+        items = []
+        continue
+
+    fat, protein, sugar, starch, alcohol = s.split()
+    mapping.keys()
+
+    total_c, total_p = 0, 0
+
+    reading = []
+    for v, k in zip(s.split(), mapping.keys()):
+        n, t = c(v, k)
+        if t == "C":
+            total_c += n
+        elif t == "%":
+            total_p += n
+        reading.append((n, t))
+
+    total_c = total_c / (1 - total_p)
+
+    item = []
+    for n, t in reading:
+        if t == "%":
+            item.append(n * total_c)
+        else:
+            item.append(n)
+
+    items.append(item)
+
 
 
 
 
 
🟢 Canadians, eh?
 
 Solutions in 3 languages 
 
 
 
 1
  2
  3
  4
@@ -2153,135 +2147,119 @@
 10
 11
 12
-13
import java.util.Scanner;
+13
+14
+15
+16
+17
+18
+19
package main
 
-class CanadiansEh {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        String line = s.nextLine();
-        if (line.endsWith("eh?")) {
-            System.out.println("Canadian!");
-        } else {
-            System.out.println("Imposter!");
-        }
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
line = input()
-if line.endswith("eh?"):
-    print("Canadian!")
-else:
-    print("Imposter!")
-
 
 
 
 
 
🟢 Careful Ascent
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
a, b = [int(d) for d in input().split()]
-n = int(input())
-shields = []
-for _ in range(n):
-    l, u, f = input().split()
-    l = int(l)
-    u = int(u)
-    f = float(f)
-    shields.append((l, u, f))
-
-shields.append((b,))
-s = shields[0][0]
-for i in range(n):
-    s += (shields[i][1] - shields[i][0]) * shields[i][2]
-    s += shields[i + 1][0] - shields[i][1]
-print(f"{a/s:.6f}")
-
 
 
 
 
 
🟢 Solving for Carrots
 
 Solution in Python 
 
 
 
1
-2
-3
-4
n, ans = [int(d) for d in input().split()]
-for _ in range(n):
-    input()
-print(ans)
-
 
 
 
 
 
🟡 Catalan Numbers
 
 Solution in Python 
 
 
 
1
+import (
+    "bufio"
+    "fmt"
+    "os"
+    "strings"
+)
+
+func main() {
+    scanner := bufio.NewScanner(os.Stdin)
+    scanner.Scan()
+    line := scanner.Text()
+    if strings.HasSuffix(line, "eh?") {
+        fmt.Println("Canadian!")
+    } else {
+        fmt.Println("Imposter!")
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
import java.util.Scanner;
+
+class CanadiansEh {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        String line = s.nextLine();
+        if (line.endsWith("eh?")) {
+            System.out.println("Canadian!");
+        } else {
+            System.out.println("Imposter!");
+        }
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
line = input()
+if line.endswith("eh?"):
+    print("Canadian!")
+else:
+    print("Imposter!")
+
 
 
 
 
 
🟢 Careful Ascent
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
a, b = [int(d) for d in input().split()]
+n = int(input())
+shields = []
+for _ in range(n):
+    l, u, f = input().split()
+    l = int(l)
+    u = int(u)
+    f = float(f)
+    shields.append((l, u, f))
+
+shields.append((b,))
+s = shields[0][0]
+for i in range(n):
+    s += (shields[i][1] - shields[i][0]) * shields[i][2]
+    s += shields[i + 1][0] - shields[i][1]
+print(f"{a/s:.6f}")
+
 
 
 
 
 
🟢 Solving for Carrots
 
 Solution in Python 
 
 
 
1
 2
 3
-4
-5
-6
-7
-8
# https://en.wikipedia.org/wiki/Catalan_number
-p = [1]
-for i in range(10000):
-    p.append(p[-1] * (i + 1))
-
-for _ in range(int(input())):
-    n = int(input())
-    print(p[2 * n] // (p[n + 1] * p[n]))
-
 
 
 
 
 
🟡 CD
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
while True:
-    n, m = [int(d) for d in input().split()]
-    if not n and not m:
-        break
-    a = [int(input()) for _ in range(n)]
-    b = [int(input()) for _ in range(m)]
-    total, i, j = 0, 0, 0
-    while i < n and j < m:
-        if a[i] == b[j]:
-            total += 1
-            i += 1
-            j += 1
-        elif a[i] < b[j]:
-            i += 1
-        else:
-            j += 1
-    while i < n:
-        if a[i] == b[-1]:
-            total += 1
-            break
-        i += 1
-    while j < n:
-        if a[-1] == b[j]:
-            total += 1
-            break
-        j += 1
-    print(total)
-
 
 
 
 
 
🟢 Cetiri
 
 Solutions in 2 languages 
 
 
 
 1
+4
n, ans = [int(d) for d in input().split()]
+for _ in range(n):
+    input()
+print(ans)
+
 
 
 
 
 
🟡 Catalan Numbers
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
# https://en.wikipedia.org/wiki/Catalan_number
+p = [1]
+for i in range(10000):
+    p.append(p[-1] * (i + 1))
+
+for _ in range(int(input())):
+    n = int(input())
+    print(p[2 * n] // (p[n + 1] * p[n]))
+
 
 
 
 
 
🟡 CD
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2303,160 +2281,178 @@
 20
 21
 22
-23
package main
-
-import (
-    "fmt"
-    "sort"
-)
-
-func main() {
-    var a, b, c int
-    fmt.Scan(&a)
-    fmt.Scan(&b)
-    fmt.Scan(&c)
-    s := []int{a, b, c}
-    sort.Ints(s)
-    a, b, c = s[0], s[1], s[2]
-    if c-b == b-a {
-        fmt.Println(c + c - b)
-    } else if c-b > b-a {
-        fmt.Println(c - b + a)
-    } else {
-        fmt.Println(a + c - b)
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
a, b, c = sorted([int(d) for d in input().split()])
-if c - b == b - a:
-    print(c + c - b)
-elif c - b > b - a:
-    print(c - b + a)
-else:
-    print(a + c - b)
-
 
 
 
 
 
🟢 Cetvrta
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
from collections import Counter
-
-x, y = Counter(), Counter()
-
-for _ in range(3):
-    _x, _y = [int(d) for d in input().split()]
-    x[_x] += 1
-    y[_y] += 1
-
-
-for key in x:
-    if x[key] == 1:
-        print(key, " ")
-        break
-
-for key in y:
-    if y[key] == 1:
-        print(key)
-        break
-
 
 
 
 
 
🟢 Chanukah Challenge
 
 Solution in Python 
 
 
 
1
-2
-3
for _ in range(int(input())):
-    k, n = [int(d) for d in input().split()]
-    print(k, int((1 + n) * n / 2 + n))
-
 
 
 
 
 
🟢 Character Development
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
def f(m):
-    ans = 0
-    for n in range(2, m + 1):
-        a, b = 1, 1
-        for i in range(m - n + 1, m + 1):
-            a *= i
-        for i in range(1, n + 1):
-            b *= i
-        ans += a // b
-    return ans
-
-
-print(f(int(input())))
-
 
 
 
 
 
🟢 Chocolate Division
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
r, c = [int(v) for v in input().split()]
-
-chocolate_bar_cuts = (r * c) - 1
-
-if chocolate_bar_cuts % 2 == 1:
-    print("Alf")
-else:
-    print("Beata")
-
 
 
 
 
 
🟢 Preludes
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
alternatives = [("A#", "Bb"), ("C#", "Db"), ("D#", "Eb"), ("F#", "Gb"), ("G#", "Ab")]
+23
+24
+25
+26
+27
while True:
+    n, m = [int(d) for d in input().split()]
+    if not n and not m:
+        break
+    a = [int(input()) for _ in range(n)]
+    b = [int(input()) for _ in range(m)]
+    total, i, j = 0, 0, 0
+    while i < n and j < m:
+        if a[i] == b[j]:
+            total += 1
+            i += 1
+            j += 1
+        elif a[i] < b[j]:
+            i += 1
+        else:
+            j += 1
+    while i < n:
+        if a[i] == b[-1]:
+            total += 1
+            break
+        i += 1
+    while j < n:
+        if a[-1] == b[j]:
+            total += 1
+            break
+        j += 1
+    print(total)
+
 
 
 
 
 
🟢 Cetiri
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
package main
+
+import (
+    "fmt"
+    "sort"
+)
+
+func main() {
+    var a, b, c int
+    fmt.Scan(&a)
+    fmt.Scan(&b)
+    fmt.Scan(&c)
+    s := []int{a, b, c}
+    sort.Ints(s)
+    a, b, c = s[0], s[1], s[2]
+    if c-b == b-a {
+        fmt.Println(c + c - b)
+    } else if c-b > b-a {
+        fmt.Println(c - b + a)
+    } else {
+        fmt.Println(a + c - b)
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
+6
+7
a, b, c = sorted([int(d) for d in input().split()])
+if c - b == b - a:
+    print(c + c - b)
+elif c - b > b - a:
+    print(c - b + a)
+else:
+    print(a + c - b)
+
 
 
 
 
 
🟢 Cetvrta
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
from collections import Counter
+
+x, y = Counter(), Counter()
+
+for _ in range(3):
+    _x, _y = [int(d) for d in input().split()]
+    x[_x] += 1
+    y[_y] += 1
+
+
+for key in x:
+    if x[key] == 1:
+        print(key, " ")
+        break
+
+for key in y:
+    if y[key] == 1:
+        print(key)
+        break
+
 
 
 
 
 
🟢 Chanukah Challenge
 
 Solution in Python 
 
 
 
1
+2
+3
for _ in range(int(input())):
+    k, n = [int(d) for d in input().split()]
+    print(k, int((1 + n) * n / 2 + n))
+
 
 
 
 
 
🟢 Character Development
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
def f(m):
+    ans = 0
+    for n in range(2, m + 1):
+        a, b = 1, 1
+        for i in range(m - n + 1, m + 1):
+            a *= i
+        for i in range(1, n + 1):
+            b *= i
+        ans += a // b
+    return ans
+
+
+print(f(int(input())))
+
 
 
 
 
 
🟢 Chocolate Division
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
r, c = [int(v) for v in input().split()]
 
-
-m = dict(alternatives + [(b, a) for a, b in alternatives])
-
-i = 1
-while True:
-    try:
-        s = input()
-    except:
-        break
-    key, tone = s.split()
-    if key in m:
-        print(f"Case {i}: {m[key]} {tone}")
-    else:
-        print(f"Case {i}: UNIQUE")
-
-    i += 1
-
 
 
 
 
 
🟢 Cinema Crowds
 
 Solution in Python 
 
 
 
 1
+chocolate_bar_cuts = (r * c) - 1
+
+if chocolate_bar_cuts % 2 == 1:
+    print("Alf")
+else:
+    print("Beata")
+
 
 
 
 
 
🟢 Preludes
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2467,19 +2463,31 @@
  9
 10
 11
-12
n, m = [int(v) for v in input().split()]
+12
+13
+14
+15
+16
+17
+18
alternatives = [("A#", "Bb"), ("C#", "Db"), ("D#", "Eb"), ("F#", "Gb"), ("G#", "Ab")]
 
-size = [int(v) for v in input().split()]
-
-groups_admitted = 0
-
-for i in range(m):
-    if size[i] <= n:
-        n -= size[i]
-        groups_admitted += 1
-
-print(m - groups_admitted)
-
 
 
 
 
 
🟢 Cinema Crowds 2
 
 Solution in Python 
 
 
 
 1
+
+m = dict(alternatives + [(b, a) for a, b in alternatives])
+
+i = 1
+while True:
+    try:
+        s = input()
+    except:
+        break
+    key, tone = s.split()
+    if key in m:
+        print(f"Case {i}: {m[key]} {tone}")
+    else:
+        print(f"Case {i}: UNIQUE")
+
+    i += 1
+
 
 
 
 
 
🟢 Cinema Crowds
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2490,23 +2498,19 @@
  9
 10
 11
-12
-13
-14
n, m = [int(t) for t in input().split()]
-p = [int(t) for t in input().split()]
-
-d = 0
-l = 0
-for i in range(m):
-    if p[i] > n - d:
-        break
-    else:
-        k = p[i]
-        d += k
-        l += 1
-
-print(m - l)
-
 
 
 
 
 
🟢 Class Field Trip
 
 Solution in Python 
 
 
 
 1
+12
n, m = [int(v) for v in input().split()]
+
+size = [int(v) for v in input().split()]
+
+groups_admitted = 0
+
+for i in range(m):
+    if size[i] <= n:
+        n -= size[i]
+        groups_admitted += 1
+
+print(m - groups_admitted)
+
 
 
 
 
 
🟢 Cinema Crowds 2
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2519,27 +2523,21 @@
 11
 12
 13
-14
-15
-16
-17
a = input()
-b = input()
+14
n, m = [int(t) for t in input().split()]
+p = [int(t) for t in input().split()]
 
-i, j = 0, 0
-ans = []
-while i < len(a) and j < len(b):
-    if a[i] < b[j]:
-        ans.append(a[i])
-        i += 1
-    else:
-        ans.append(b[j])
-        j += 1
+d = 0
+l = 0
+for i in range(m):
+    if p[i] > n - d:
+        break
+    else:
+        k = p[i]
+        d += k
+        l += 1
 
-
-ans += a[i:] if i < len(a) else b[j:]
-
-print("".join(ans))
-
 
 
 
 
 
🟡 A Furious Cocktail
 
 Solution in Python 
 
 
 
 1
+print(m - l)
+
 
 
 
 
 
🟢 Class Field Trip
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2552,21 +2550,27 @@
 11
 12
 13
-14
n, t = [int(d) for d in input().split()]
-p = [int(input()) for _ in range(n)]
-p = sorted(p, reverse=True)
-ending = p[0]
-able = True
-for i in range(1, n):
-    if t * i >= ending:
-        print("NO")
-        able = False
-        break
-    if t * i + p[i] < ending:
-        ending = t * i + p[i]
-if able:
-    print("YES")
-
 
 
 
 
 
🟡 Code Cleanups
 
 Solution in Python 
 
 
 
 1
+14
+15
+16
+17
a = input()
+b = input()
+
+i, j = 0, 0
+ans = []
+while i < len(a) and j < len(b):
+    if a[i] < b[j]:
+        ans.append(a[i])
+        i += 1
+    else:
+        ans.append(b[j])
+        j += 1
+
+
+ans += a[i:] if i < len(a) else b[j:]
+
+print("".join(ans))
+
 
 
 
 
 
🟡 A Furious Cocktail
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2579,93 +2583,87 @@
 11
 12
 13
-14
-15
-16
-17
n = int(input())
-p = [int(d) for d in input().split()]
-prev = []
-t = 0
-for v in p:
-    if not prev:
-        prev.append(v)
-        continue
-    d = (19 + sum(prev)) // len(prev)
-    if v <= d:
-        prev.append(v)
-    else:
-        prev = [v]
-        t += 1
-if prev:
-    t += 1
-print(t)
-
 
 
 
 
 
🟢 Code to Save Lives
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
t = int(input())
-for _ in range(t):
-    a = int(input().replace(" ", ""))
-    b = int(input().replace(" ", ""))
-    print(" ".join(str(a + b)))
-
 
 
 
 
 
🟢 Coffee Cup Combo
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
n = int(input())
-awake = [0] * n
-s = list(input())
-for i in range(n):
-    if s[i] == "1":
-        awake[i] = 1
-        if i + 1 < n:
-            awake[i + 1] = 1
-        if i + 2 < n:
-            awake[i + 2] = 1
-print(sum(awake))
-
 
 
 
 
 
🟢 Cold-puter Science
 
 Solution in Python 
 
 
 
1
-2
_ = input()
-print(len([t for t in input().split() if "-" in t]))
-
 
 
 
 
 
🟢 Competitive Arcade Basketball
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
from collections import Counter
-
-n, p, m = [int(d) for d in input().split()]
-
-records = Counter()
-winners = []
-names = [input() for _ in range(n)]
-for r in range(m):
-    name, point = input().split()
-    point = int(point)
-    records[name] += point
-    if records[name] >= p and name not in winners:
-        winners.append(name)
-if not winners:
-    print("No winner!")
-else:
-    print("\n".join([f"{n} wins!" for n in winners]))
-
 
 
 
 
 
🟢 Completing the Square
 
 Solution in Python 
 
 
 
 1
+14
n, t = [int(d) for d in input().split()]
+p = [int(input()) for _ in range(n)]
+p = sorted(p, reverse=True)
+ending = p[0]
+able = True
+for i in range(1, n):
+    if t * i >= ending:
+        print("NO")
+        able = False
+        break
+    if t * i + p[i] < ending:
+        ending = t * i + p[i]
+if able:
+    print("YES")
+
 
 
 
 
 
🟡 Code Cleanups
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
n = int(input())
+p = [int(d) for d in input().split()]
+prev = []
+t = 0
+for v in p:
+    if not prev:
+        prev.append(v)
+        continue
+    d = (19 + sum(prev)) // len(prev)
+    if v <= d:
+        prev.append(v)
+    else:
+        prev = [v]
+        t += 1
+if prev:
+    t += 1
+print(t)
+
 
 
 
 
 
🟢 Code to Save Lives
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
t = int(input())
+for _ in range(t):
+    a = int(input().replace(" ", ""))
+    b = int(input().replace(" ", ""))
+    print(" ".join(str(a + b)))
+
 
 
 
 
 
🟢 Coffee Cup Combo
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
n = int(input())
+awake = [0] * n
+s = list(input())
+for i in range(n):
+    if s[i] == "1":
+        awake[i] = 1
+        if i + 1 < n:
+            awake[i + 1] = 1
+        if i + 2 < n:
+            awake[i + 2] = 1
+print(sum(awake))
+
 
 
 
 
 
🟢 Cold-puter Science
 
 Solution in Python 
 
 
 
1
+2
_ = input()
+print(len([t for t in input().split() if "-" in t]))
+
 
 
 
 
 
🟢 Competitive Arcade Basketball
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2680,23 +2678,25 @@
 13
 14
 15
-16
x1, y1 = [int(d) for d in input().split()]
-x2, y2 = [int(d) for d in input().split()]
-x3, y3 = [int(d) for d in input().split()]
+16
+17
from collections import Counter
+
+n, p, m = [int(d) for d in input().split()]
 
-d12 = (x1 - x2) ** 2 + (y1 - y2) ** 2
-d13 = (x1 - x3) ** 2 + (y1 - y3) ** 2
-d23 = (x2 - x3) ** 2 + (y2 - y3) ** 2
-
-if d12 == d13:
-    x, y = x2 + x3 - x1, y2 + y3 - y1
-elif d12 == d23:
-    x, y = x1 + x3 - x2, y1 + y3 - y2
-else:
-    x, y = x1 + x2 - x3, y1 + y2 - y3
-
-print(x, y)
-
 
 
 
 
 
🟢 Compound Words
 
 Solution in Python 
 
 
 
 1
+records = Counter()
+winners = []
+names = [input() for _ in range(n)]
+for r in range(m):
+    name, point = input().split()
+    point = int(point)
+    records[name] += point
+    if records[name] >= p and name not in winners:
+        winners.append(name)
+if not winners:
+    print("No winner!")
+else:
+    print("\n".join([f"{n} wins!" for n in winners]))
+
 
 
 
 
 
🟢 Completing the Square
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2710,22 +2710,24 @@
 12
 13
 14
-15
from itertools import permutations
-
-l = []
-while True:
-    try:
-        l.extend(input().split())
-    except:
-        break
-
-w = set()
-for i, j in permutations(l, 2):
-    w.add(f"{i}{j}")
-
-
-print("\n".join(sorted(w)))
-
 
 
 
 
 
🟢 Conformity
 
 Solution in Python 
 
 
 
 1
+15
+16
x1, y1 = [int(d) for d in input().split()]
+x2, y2 = [int(d) for d in input().split()]
+x3, y3 = [int(d) for d in input().split()]
+
+d12 = (x1 - x2) ** 2 + (y1 - y2) ** 2
+d13 = (x1 - x3) ** 2 + (y1 - y3) ** 2
+d23 = (x2 - x3) ** 2 + (y2 - y3) ** 2
+
+if d12 == d13:
+    x, y = x2 + x3 - x1, y2 + y3 - y1
+elif d12 == d23:
+    x, y = x1 + x3 - x2, y1 + y3 - y2
+else:
+    x, y = x1 + x2 - x3, y1 + y2 - y3
+
+print(x, y)
+
 
 
 
 
 
🟢 Compound Words
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2735,18 +2737,26 @@
  8
  9
 10
-11
from collections import Counter
+11
+12
+13
+14
+15
from itertools import permutations
 
-n = int(input())
-entries = []
-for _ in range(n):
-    entries.append(" ".join(sorted(input().split())))
-
-summary = Counter(entries)
-popular = max(summary.values())
-
-print(sum([summary[e] for e in summary if summary[e] == popular]))
-
 
 
 
 
 
🟢 Contingency Planning
 
 Solution in Python 
 
 
 
 1
+l = []
+while True:
+    try:
+        l.extend(input().split())
+    except:
+        break
+
+w = set()
+for i, j in permutations(l, 2):
+    w.add(f"{i}{j}")
+
+
+print("\n".join(sorted(w)))
+
 
 
 
 
 
🟢 Conformity
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2756,26 +2766,18 @@
  8
  9
 10
-11
-12
-13
-14
-15
def permutations(n, c):
-    value = 1
-    for i in range(n - c + 1, n + 1):
-        value *= i
-    return value
-
+11
from collections import Counter
+
+n = int(input())
+entries = []
+for _ in range(n):
+    entries.append(" ".join(sorted(input().split())))
 
-n = int(input())
-ans = 0
-for i in range(1, n + 1):
-    ans += permutations(n, i)
-if ans > 1_000_000_000:
-    print("JUST RUN!!")
-else:
-    print(ans)
-
 
 
 
 
 
🟢 Cryptographer's Conundrum
 
 Solution in Python 
 
 
 
 1
+summary = Counter(entries)
+popular = max(summary.values())
+
+print(sum([summary[e] for e in summary if summary[e] == popular]))
+
 
 
 
 
 
🟢 Contingency Planning
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2784,17 +2786,27 @@
  7
  8
  9
-10
text = input()
-total = 0
-for i in range(0, len(text), 3):
-    if text[i] != "P":
-        total += 1
-    if text[i + 1] != "E":
-        total += 1
-    if text[i + 2] != "R":
-        total += 1
-print(total)
-
 
 
 
 
 
🟢 Convex Polygon Area
 
 Solution in Python 
 
 
 
 1
+10
+11
+12
+13
+14
+15
def permutations(n, c):
+    value = 1
+    for i in range(n - c + 1, n + 1):
+        value *= i
+    return value
+
+
+n = int(input())
+ans = 0
+for i in range(1, n + 1):
+    ans += permutations(n, i)
+if ans > 1_000_000_000:
+    print("JUST RUN!!")
+else:
+    print(ans)
+
 
 
 
 
 
🟢 Cryptographer's Conundrum
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2803,27 +2815,17 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
for _ in range(int(input())):
-    values = [int(d) for d in input().split()]
-    coords = values[1:]
-    n = values[0]
-
-    coords.append(coords[0])
-    coords.append(coords[1])
-
-    area = 0
-    for i in range(0, 2 * n, 2):
-        x1, y1 = coords[i], coords[i + 1]
-        x2, y2 = coords[i + 2], coords[i + 3]
-        area += x1 * y2 - x2 * y1
-
-    print(0.5 * abs(area))
-
 
 
 
 
 
🟢 Cooking Water
 
 Solution in Python 
 
 
 
 1
+10
text = input()
+total = 0
+for i in range(0, len(text), 3):
+    if text[i] != "P":
+        total += 1
+    if text[i + 1] != "E":
+        total += 1
+    if text[i + 2] != "R":
+        total += 1
+print(total)
+
 
 
 
 
 
🟢 Convex Polygon Area
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -2833,246 +2835,246 @@
  8
  9
 10
-11
n = int(input())
-lb, ub = 0, 1000
-for _ in range(n):
-    a, b = [int(d) for d in input().split()]
-    lb = max(lb, a)
-    ub = min(ub, b)
-
-if lb > ub:
-    print("edward is right")
-else:
-    print("gunilla has a point")
-
 
 
 
 
 
🟢 Cosmic Path Optimization
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
import math
-
-m = int(input())
-t = [int(d) for d in input().split()]
-print(f"{math.floor(sum(t)/m)}")
-
 
 
 
 
 
🟢 Costume Contest
 
 Solution in Python 
 
 
 
1
+11
+12
+13
+14
+15
for _ in range(int(input())):
+    values = [int(d) for d in input().split()]
+    coords = values[1:]
+    n = values[0]
+
+    coords.append(coords[0])
+    coords.append(coords[1])
+
+    area = 0
+    for i in range(0, 2 * n, 2):
+        x1, y1 = coords[i], coords[i + 1]
+        x2, y2 = coords[i + 2], coords[i + 3]
+        area += x1 * y2 - x2 * y1
+
+    print(0.5 * abs(area))
+
 
 
 
 
 
🟢 Cooking Water
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
n = int(input())
+lb, ub = 0, 1000
+for _ in range(n):
+    a, b = [int(d) for d in input().split()]
+    lb = max(lb, a)
+    ub = min(ub, b)
+
+if lb > ub:
+    print("edward is right")
+else:
+    print("gunilla has a point")
+
 
 
 
 
 
🟢 Cosmic Path Optimization
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
-6
-7
from collections import Counter
+5
import math
 
-n = int(input())
-c = Counter()
-for _ in range(n):
-    c[input()] += 1
-print("\n".join(sorted([k for k, v in c.items() if v == min(c.values())])))
-
 
 
 
 
 
🟢 Count Doubles
 
 Solution in Python 
 
 
 
1
+m = int(input())
+t = [int(d) for d in input().split()]
+print(f"{math.floor(sum(t)/m)}")
+
 
 
 
 
 
🟢 Costume Contest
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
n, m = [int(d) for d in input().split()]
-values = [int(d) for d in input().split()]
-ans = 0
-for i in range(n - m + 1):
-    if len([v for v in values[i : i + m] if not v % 2]) >= 2:
-        ans += 1
-print(ans)
-
 
 
 
 
 
🟢 Counting Clauses
 
 Solution in Python 
 
 
 
1
+7
from collections import Counter
+
+n = int(input())
+c = Counter()
+for _ in range(n):
+    c[input()] += 1
+print("\n".join(sorted([k for k, v in c.items() if v == min(c.values())])))
+
 
 
 
 
 
🟢 Count Doubles
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
m, _ = [int(d) for d in input().split()]
-for _ in range(m):
-    input()
-if m >= 8:
-    print("satisfactory")
-else:
-    print("unsatisfactory")
-
 
 
 
 
 
🟢 Count the Vowels
 
 Solution in Python 
 
 
 
1
print(len([c for c in input().lower() if c in "aeiou"]))
-
 
 
 
 
 
🟢 Course Scheduling
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
from collections import Counter
-
-c = Counter()
-n = {}
-
-for _ in range(int(input())):
-    r = input().split()
-    name, course = " ".join(r[:2]), r[-1]
-    if course not in n:
-        n[course] = set()
-
-    if name not in n[course]:
-        c[course] += 1
-        n[course].add(name)
-
-for k in sorted(c.keys()):
-    print(f"{k} {c[k]}")
-
 
 
 
 
 
🟢 CPR Number
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
cpr = input().replace("-", "")
-values = [4, 3, 2, 7, 6, 5, 4, 3, 2, 1]
-total = 0
-for d, v in zip(cpr, values):
-    total += int(d) * v
-if not total % 11:
-    print(1)
-else:
-    print(0)
-
 
 
 
 
 
🟢 Crne
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
package main
-
-import (
-    "fmt"
-)
-
-func main() {
-    var n int
-    fmt.Scan(&n)
-    a := n / 2
-    b := n - a
-    fmt.Println((a + 1) * (b + 1))
-}
-
 
 
 
1
-2
-3
-4
n = int(input())
-a = n // 2
-b = n - a
-print((a + 1) * (b + 1))
-
 
 
 
 
 
🟢 Cudoviste
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
r, c = [int(d) for d in input().split()]
-parking = []
-for _ in range(r):
-    parking.append(input())
-
-
-def count_spaces(parking, squash):
-    total = 0
-    for i in range(r - 1):
-        for j in range(c - 1):
-            spaces = [
-                parking[i][j],
-                parking[i + 1][j],
-                parking[i][j + 1],
-                parking[i + 1][j + 1],
-            ]
-            if (
-                all(s in ".X" for s in spaces)
-                and sum([s == "X" for s in spaces]) == squash
-            ):
-                total += 1
-    return total
-
-
-for num in range(0, 5):
-    print(count_spaces(parking, num))
-
 
 
 
 
 
🟢 Stacking Cups
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
size = {}
-for _ in range(int(input())):
-    parts = input().split()
-    if parts[0].isdigit():
-        size[parts[1]] = int(parts[0]) / 2
-    else:
-        size[parts[0]] = int(parts[1])
-for color in sorted(size, key=lambda x: size[x]):
-    print(color)
-
 
 
 
 
 
🟢 Cut in Line
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
n = int(input())
-queue = []
-for _ in range(n):
-    queue.append(input())
-
-c = int(input())
-for _ in range(c):
-    event = input().split()
-    if event[0] == "leave":
-        queue.remove(event[1])
-    elif event[0] == "cut":
-        queue.insert(queue.index(event[2]), event[1])
-
-for name in queue:
-    print(name)
-
 
 
 
 
 
🟢 Cut the Negativity
 
 Solution in Python 
 
 
 
 1
+7
n, m = [int(d) for d in input().split()]
+values = [int(d) for d in input().split()]
+ans = 0
+for i in range(n - m + 1):
+    if len([v for v in values[i : i + m] if not v % 2]) >= 2:
+        ans += 1
+print(ans)
+
 
 
 
 
 
🟢 Counting Clauses
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
m, _ = [int(d) for d in input().split()]
+for _ in range(m):
+    input()
+if m >= 8:
+    print("satisfactory")
+else:
+    print("unsatisfactory")
+
 
 
 
 
 
🟢 Count the Vowels
 
 Solution in Python 
 
 
 
1
print(len([c for c in input().lower() if c in "aeiou"]))
+
 
 
 
 
 
🟢 Course Scheduling
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
from collections import Counter
+
+c = Counter()
+n = {}
+
+for _ in range(int(input())):
+    r = input().split()
+    name, course = " ".join(r[:2]), r[-1]
+    if course not in n:
+        n[course] = set()
+
+    if name not in n[course]:
+        c[course] += 1
+        n[course].add(name)
+
+for k in sorted(c.keys()):
+    print(f"{k} {c[k]}")
+
 
 
 
 
 
🟢 CPR Number
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
cpr = input().replace("-", "")
+values = [4, 3, 2, 7, 6, 5, 4, 3, 2, 1]
+total = 0
+for d, v in zip(cpr, values):
+    total += int(d) * v
+if not total % 11:
+    print(1)
+else:
+    print(0)
+
 
 
 
 
 
🟢 Crne
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
package main
+
+import (
+    "fmt"
+)
+
+func main() {
+    var n int
+    fmt.Scan(&n)
+    a := n / 2
+    b := n - a
+    fmt.Println((a + 1) * (b + 1))
+}
+
 
 
 
1
+2
+3
+4
n = int(input())
+a = n // 2
+b = n - a
+print((a + 1) * (b + 1))
+
 
 
 
 
 
🟢 Cudoviste
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
r, c = [int(d) for d in input().split()]
+parking = []
+for _ in range(r):
+    parking.append(input())
+
+
+def count_spaces(parking, squash):
+    total = 0
+    for i in range(r - 1):
+        for j in range(c - 1):
+            spaces = [
+                parking[i][j],
+                parking[i + 1][j],
+                parking[i][j + 1],
+                parking[i + 1][j + 1],
+            ]
+            if (
+                all(s in ".X" for s in spaces)
+                and sum([s == "X" for s in spaces]) == squash
+            ):
+                total += 1
+    return total
+
+
+for num in range(0, 5):
+    print(count_spaces(parking, num))
+
 
 
 
 
 
🟢 Stacking Cups
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
size = {}
+for _ in range(int(input())):
+    parts = input().split()
+    if parts[0].isdigit():
+        size[parts[1]] = int(parts[0]) / 2
+    else:
+        size[parts[0]] = int(parts[1])
+for color in sorted(size, key=lambda x: size[x]):
+    print(color)
+
 
 
 
 
 
🟢 Cut in Line
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3083,49 +3085,57 @@
  9
 10
 11
-12
n = int(input())
-
-positives = []
-for i in range(n):
-    numbers = [int(d) for d in input().split()]
-    for j in range(n):
-        if numbers[j] > 0:
-            positives.append((str(i + 1), str(j + 1), str(numbers[j])))
-
-print(len(positives))
-for p in positives:
-    print(" ".join(p))
-
 
 
 
 
 
🟢 Cyanide Rivers
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
import math
+12
+13
+14
+15
n = int(input())
+queue = []
+for _ in range(n):
+    queue.append(input())
+
+c = int(input())
+for _ in range(c):
+    event = input().split()
+    if event[0] == "leave":
+        queue.remove(event[1])
+    elif event[0] == "cut":
+        queue.insert(queue.index(event[2]), event[1])
+
+for name in queue:
+    print(name)
+
 
 
 
 
 
🟢 Cut the Negativity
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
n = int(input())
 
-s = input()
-t = s.split("1")
-print(max([math.ceil(len(z) / 2) for z in t]))
-
 
 
 
 
 
🟢 Cypher Decypher
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
from string import ascii_uppercase
+positives = []
+for i in range(n):
+    numbers = [int(d) for d in input().split()]
+    for j in range(n):
+        if numbers[j] > 0:
+            positives.append((str(i + 1), str(j + 1), str(numbers[j])))
+
+print(len(positives))
+for p in positives:
+    print(" ".join(p))
+
 
 
 
 
 
🟢 Cyanide Rivers
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
import math
 
-
-def f(n, m):
-    return ascii_uppercase[(n * m) % 26]
-
-
-m = input()
-for _ in range(int(input())):
-    s = input()
-    print("".join([f(ascii_uppercase.index(c), int(d)) for c, d in zip(s, m)]))
-
 
 
 
 
 
🟢 Damaged Equation
 
 Solution in Python 
 
 
 
 1
+s = input()
+t = s.split("1")
+print(max([math.ceil(len(z) / 2) for z in t]))
+
 
 
 
 
 
🟢 Cypher Decypher
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3135,141 +3145,135 @@
  8
  9
 10
-11
-12
-13
-14
-15
from itertools import product
+11
from string import ascii_uppercase
 
-a, b, c, d = [int(d) for d in input().split()]
-ops = ["*", "+", "-", "//"]
-valid = False
-for op1, op2 in product(ops, ops):
-    e = f"{a} {op1} {b} == {c} {op2} {d}"
-    try:
-        if eval(e):
-            print(e.replace("==", "=").replace("//", "/"))
-            valid = True
-    except:
-        pass
-if not valid:
-    print("problems ahead")
-
 
 
 
 
 
🟢 Datum
 
 Solution in Python 
 
 
 
1
-2
-3
-4
from datetime import datetime
+
+def f(n, m):
+    return ascii_uppercase[(n * m) % 26]
+
+
+m = input()
+for _ in range(int(input())):
+    s = input()
+    print("".join([f(ascii_uppercase.index(c), int(d)) for c, d in zip(s, m)]))
+
 
 
 
 
 
🟢 Damaged Equation
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
from itertools import product
 
-d, m = [int(d) for d in input().split()]
-print(datetime(year=2009, month=m, day=d).strftime("%A"))
-
 
 
 
 
 
🟢 Death Knight Hero
 
 Solution in Python 
 
 
 
1
+a, b, c, d = [int(d) for d in input().split()]
+ops = ["*", "+", "-", "//"]
+valid = False
+for op1, op2 in product(ops, ops):
+    e = f"{a} {op1} {b} == {c} {op2} {d}"
+    try:
+        if eval(e):
+            print(e.replace("==", "=").replace("//", "/"))
+            valid = True
+    except:
+        pass
+if not valid:
+    print("problems ahead")
+
 
 
 
 
 
🟢 Datum
 
 Solution in Python 
 
 
 
1
 2
 3
-4
-5
total = 0
-for _ in range(int(input())):
-    if "CD" not in input():
-        total += 1
-print(total)
-
 
 
 
 
 
🟢 Delimiter Soup
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
n = int(input())
-s = input()
-
-stack = []
-
-valid = True
-
-for i in range(n):
-    c = s[i]
-    if c in ["(", "[", "{"]:
-        stack.append(c)
-    if c in [")", "]", "}"]:
-        if len(stack) == 0:
-            valid = False
-            break
-
-        v = stack.pop()
-        if c == ")" and v != "(":
-            valid = False
-            break
-        elif c == "]" and v != "[":
-            valid = False
-            break
-        elif c == "}" and v != "{":
-            valid = False
-            break
-
-if valid:
-    print("ok so far")
-else:
-    print(c, i)
-
 
 
 
 
 
🟢 Detailed Differences
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
for _ in range(int(input())):
-    s1, s2 = input(), input()
-    result = ["." if c1 == c2 else "*" for c1, c2 in zip(s1, s2)]
-    print(s1)
-    print(s2)
-    print("".join(result))
-
 
 
 
 
 
🟢 Dice Cup
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
d1, d2 = [int(d) for d in input().split()]
-
-sums = []
-for i in range(1, d1 + 1):
-    for j in range(1, d2 + 1):
-        sums.append(i + j)
-
-from collections import Counter
-
-c = Counter(sums)
-most_likely = max(c.values())
-for key in sorted(c.keys()):
-    if c[key] == most_likely:
-        print(key)
-
 
 
 
 
 
🟢 Dice Game
 
 Solution in Python 
 
 
 
 1
+4
from datetime import datetime
+
+d, m = [int(d) for d in input().split()]
+print(datetime(year=2009, month=m, day=d).strftime("%A"))
+
 
 
 
 
 
🟢 Death Knight Hero
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
total = 0
+for _ in range(int(input())):
+    if "CD" not in input():
+        total += 1
+print(total)
+
 
 
 
 
 
🟢 Delimiter Soup
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
n = int(input())
+s = input()
+
+stack = []
+
+valid = True
+
+for i in range(n):
+    c = s[i]
+    if c in ["(", "[", "{"]:
+        stack.append(c)
+    if c in [")", "]", "}"]:
+        if len(stack) == 0:
+            valid = False
+            break
+
+        v = stack.pop()
+        if c == ")" and v != "(":
+            valid = False
+            break
+        elif c == "]" and v != "[":
+            valid = False
+            break
+        elif c == "}" and v != "{":
+            valid = False
+            break
+
+if valid:
+    print("ok so far")
+else:
+    print(c, i)
+
 
 
 
 
 
🟢 Detailed Differences
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
for _ in range(int(input())):
+    s1, s2 = input(), input()
+    result = ["." if c1 == c2 else "*" for c1, c2 in zip(s1, s2)]
+    print(s1)
+    print(s2)
+    print("".join(result))
+
 
 
 
 
 
🟢 Dice Cup
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3282,90 +3286,84 @@
 11
 12
 13
-14
-15
-16
-17
-18
-19
-20
g = [int(d) for d in input().split()]
-e = [int(d) for d in input().split()]
-
-
-def ev(d):
-    total, count = 0, 0
-    for i in range(d[0], d[1] + 1):
-        for j in range(d[2], d[3] + 1):
-            total += i + j
-            count += 1
-    return total / count
-
-
-ratio = ev(g) / ev(e)
-if ratio > 1:
-    print("Gunnar")
-elif ratio < 1:
-    print("Emma")
-else:
-    print("Tie")
-
 
 
 
 
 
🟡 A Different Problem
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
while True:
-    try:
-        line = input()
-    except:
-        break
-    a, b = [int(d) for d in line.split()]
-    print(abs(a - b))
-
 
 
 
 
 
🟢 Different Distances
 
 Solution in Python 
 
 
 
1
+14
d1, d2 = [int(d) for d in input().split()]
+
+sums = []
+for i in range(1, d1 + 1):
+    for j in range(1, d2 + 1):
+        sums.append(i + j)
+
+from collections import Counter
+
+c = Counter(sums)
+most_likely = max(c.values())
+for key in sorted(c.keys()):
+    if c[key] == most_likely:
+        print(key)
+
 
 
 
 
 
🟢 Dice Game
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
g = [int(d) for d in input().split()]
+e = [int(d) for d in input().split()]
+
+
+def ev(d):
+    total, count = 0, 0
+    for i in range(d[0], d[1] + 1):
+        for j in range(d[2], d[3] + 1):
+            total += i + j
+            count += 1
+    return total / count
+
+
+ratio = ev(g) / ev(e)
+if ratio > 1:
+    print("Gunnar")
+elif ratio < 1:
+    print("Emma")
+else:
+    print("Tie")
+
 
 
 
 
 
🟡 A Different Problem
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
while True:
-    line = input()
-    if line == "0":
-        break
-    x1, y1, x2, y2, p = [float(d) for d in line.split()]
-    print((abs(x1 - x2) ** p + abs(y1 - y2) ** p) ** (1 / p))
-
 
 
 
 
 
🟢 Digit Swap
 
 Solutions in 3 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
package main
-
-import (
-    "fmt"
-)
-
-func reverse(str string) (ans string) {
-    for _, v := range str {
-        ans = string(v) + ans
-    }
-    return
-}
-func main() {
-    var str string
-    fmt.Scan(&str)
-    fmt.Println(reverse(str))
-}
-
 
 
 
 1
+6
+7
while True:
+    try:
+        line = input()
+    except:
+        break
+    a, b = [int(d) for d in line.split()]
+    print(abs(a - b))
+
 
 
 
 
 
🟢 Different Distances
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
while True:
+    line = input()
+    if line == "0":
+        break
+    x1, y1, x2, y2, p = [float(d) for d in line.split()]
+    print((abs(x1 - x2) ** p + abs(y1 - y2) ** p) ** (1 / p))
+
 
 
 
 
 
🟢 Digit Swap
 
 Solutions in 3 languages 
 
 
 
 1
  2
  3
  4
@@ -3375,111 +3373,121 @@
  8
  9
 10
-11
import java.util.*;
+11
+12
+13
+14
+15
+16
+17
package main
 
-class DigitSwap {
-    public static void main(String[] argv){
-        Scanner s = new Scanner(System.in);
-        StringBuilder ans = new StringBuilder();
-        ans.append(s.nextLine());
-        ans.reverse();
-        System.out.println(ans);
+import (
+    "fmt"
+)
+
+func reverse(str string) (ans string) {
+    for _, v := range str {
+        ans = string(v) + ans
     }
-}
-
 
 
 
1
print(input()[::-1])
-
 
 
 
 
 
🟢 Disc District
 
 Solution in Python 
 
 
 
1
print(1, input())
-
 
 
 
 
 
🟢 Divvying Up
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
_ = input()
-p = [int(d) for d in input().split()]
-if sum(p) % 3:
-    print("no")
-else:
-    print("yes")
-
 
 
 
 
 
🟢 Don't Fall Down Stairs
 
 Solution in Python 
 
 
 
1
+    return
+}
+func main() {
+    var str string
+    fmt.Scan(&str)
+    fmt.Println(reverse(str))
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
import java.util.*;
+
+class DigitSwap {
+    public static void main(String[] argv){
+        Scanner s = new Scanner(System.in);
+        StringBuilder ans = new StringBuilder();
+        ans.append(s.nextLine());
+        ans.reverse();
+        System.out.println(ans);
+    }
+}
+
 
 
 
1
print(input()[::-1])
+
 
 
 
 
 
🟢 Disc District
 
 Solution in Python 
 
 
 
1
print(1, input())
+
 
 
 
 
 
🟢 Divvying Up
 
 Solution in Python 
 
 
 
1
 2
-3
n = int(input())
-a = [int(d) for d in input().split()] + [0]
-print(sum(max(a[i] - a[i + 1] - 1, 0) for i in range(n)))
-
 
 
 
 
 
🟢 Double Password
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
import java.util.Scanner;
-
-class DoublePassword {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        String a = s.nextLine();
-        String b = s.nextLine();
-        int number = 1;
-        for (int i = 0; i < a.length(); i++) {
-            if (a.charAt(i) == b.charAt(i)) {
-                number *= 1;
-            } else {
-                number *= 2;
-            }
-        }
-        System.out.println(number);
-
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
a, b = input(), input()
-number = 1
-for c1, c2 in zip(a, b):
-    if c1 == c2:
-        number *= 1
-    else:
-        number *= 2
-print(number)
-
 
 
 
 
 
🟢 Drinking Song
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
n = int(input())
-w = input()
-
-for i in range(n):
-    a = f"{n-i} bottle{'s' if n-i >1 else ''}"
-    b = f"{'no more' if n-i-1==0 else n-i-1 } bottle{'' if n-i-1==1 else 's'}"
-    c = f"{'one' if n-i>1 else 'it' }"
-    d = f"{' on the wall' if n-i-1 else ''}"
-    print(f"{a} of {w} on the wall, {a} of {w}.")
-    print(f"Take {c} down, pass it around, {b} of {w}{d}.")
-    if n - i - 1:
-        print()
-
 
 
 
 
 
🟢 Driver's Dilemma
 
 Solution in Python 
 
 
 
 1
+3
+4
+5
+6
_ = input()
+p = [int(d) for d in input().split()]
+if sum(p) % 3:
+    print("no")
+else:
+    print("yes")
+
 
 
 
 
 
🟢 Don't Fall Down Stairs
 
 Solution in Python 
 
 
 
1
+2
+3
n = int(input())
+a = [int(d) for d in input().split()] + [0]
+print(sum(max(a[i] - a[i + 1] - 1, 0) for i in range(n)))
+
 
 
 
 
 
🟢 Double Password
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
import java.util.Scanner;
+
+class DoublePassword {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        String a = s.nextLine();
+        String b = s.nextLine();
+        int number = 1;
+        for (int i = 0; i < a.length(); i++) {
+            if (a.charAt(i) == b.charAt(i)) {
+                number *= 1;
+            } else {
+                number *= 2;
+            }
+        }
+        System.out.println(number);
+
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
a, b = input(), input()
+number = 1
+for c1, c2 in zip(a, b):
+    if c1 == c2:
+        number *= 1
+    else:
+        number *= 2
+print(number)
+
 
 
 
 
 
🟢 Drinking Song
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3489,18 +3497,20 @@
  8
  9
 10
-11
c, x, m = [float(d) for d in input().split()]
-top = 0
-for _ in range(6):
-    mph, mpg = [float(d) for d in input().split()]
-
-    if m / mph * x + m / mpg <= c / 2:
-        top = mph
-if top:
-    print(f"YES {top:.0f}")
-else:
-    print("NO")
-
 
 
 
 
 
🟢 DRM Messages
 
 Solution in Python 
 
 
 
 1
+11
+12
n = int(input())
+w = input()
+
+for i in range(n):
+    a = f"{n-i} bottle{'s' if n-i >1 else ''}"
+    b = f"{'no more' if n-i-1==0 else n-i-1 } bottle{'' if n-i-1==1 else 's'}"
+    c = f"{'one' if n-i>1 else 'it' }"
+    d = f"{' on the wall' if n-i-1 else ''}"
+    print(f"{a} of {w} on the wall, {a} of {w}.")
+    print(f"Take {c} down, pass it around, {b} of {w}{d}.")
+    if n - i - 1:
+        print()
+
 
 
 
 
 
🟢 Driver's Dilemma
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3510,56 +3520,18 @@
  8
  9
 10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
l = ord("A")
-r = ord("Z")
-
-
-def divide(message):
-    half = len(message) // 2
-    return message[:half], message[half:]
-
-
-def to_ord(c, rotation):
-    new_chr = ord(c) + rotation
-    return new_chr if new_chr <= r else l + (new_chr - r - 1)
-
-
-def rotate(half):
-    rotation = sum([ord(c) - l for c in half])
-    rotation %= 26
-    result = [to_ord(c, rotation) for c in half]
-    return "".join([chr(c) for c in result])
-
-
-def merge(first, second):
-    rotations = [ord(c) - l for c in second]
-    result = [to_ord(c, rotation) for c, rotation in zip(first, rotations)]
-    return "".join([chr(c) for c in result])
-
-
-message = input()
-first, second = divide(message)
-print(merge(rotate(first), rotate(second)))
-
 
 
 
 
 
🟢 Drunk Vigenère
 
 Solution in Python 
 
 
 
 1
+11
c, x, m = [float(d) for d in input().split()]
+top = 0
+for _ in range(6):
+    mph, mpg = [float(d) for d in input().split()]
+
+    if m / mph * x + m / mpg <= c / 2:
+        top = mph
+if top:
+    print(f"YES {top:.0f}")
+else:
+    print("NO")
+
 
 
 
 
 
🟢 DRM Messages
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3574,23 +3546,51 @@
 13
 14
 15
-16
import string
-
-uppers = string.ascii_uppercase
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
l = ord("A")
+r = ord("Z")
+
 
-
-def unshift(c, k, f):
-    index = uppers.index(k)
-    if f:
-        new_index = uppers.index(c) + index
-    else:
-        new_index = uppers.index(c) - index
-    return uppers[new_index % 26]
+def divide(message):
+    half = len(message) // 2
+    return message[:half], message[half:]
+
+
+def to_ord(c, rotation):
+    new_chr = ord(c) + rotation
+    return new_chr if new_chr <= r else l + (new_chr - r - 1)
 
 
-message, key = input(), input()
-print("".join([unshift(c, k, i % 2) for i, (c, k) in enumerate(zip(message, key))]))
-
 
 
 
 
 
🟢 Early Winter
 
 Solution in Python 
 
 
 
 1
+def rotate(half):
+    rotation = sum([ord(c) - l for c in half])
+    rotation %= 26
+    result = [to_ord(c, rotation) for c in half]
+    return "".join([chr(c) for c in result])
+
+
+def merge(first, second):
+    rotations = [ord(c) - l for c in second]
+    result = [to_ord(c, rotation) for c, rotation in zip(first, rotations)]
+    return "".join([chr(c) for c in result])
+
+
+message = input()
+first, second = divide(message)
+print(merge(rotate(first), rotate(second)))
+
 
 
 
 
 
🟢 Drunk Vigenère
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3602,20 +3602,26 @@
 10
 11
 12
-13
n, m = [int(_) for _ in input().split()]
-d = [int(_) for _ in input().split()]
-d = [v > m for v in d]
+13
+14
+15
+16
import string
+
+uppers = string.ascii_uppercase
 
 
-for k in range(n):
-    if not d[k]:
-        break
-
-if all(d):
-    print("It had never snowed this early!")
-else:
-    print(f"It hadn't snowed this early in {k} years!")
-
 
 
 
 
 
🟢 The Easiest Problem Is This One
 
 Solution in Python 
 
 
 
 1
+def unshift(c, k, f):
+    index = uppers.index(k)
+    if f:
+        new_index = uppers.index(c) + index
+    else:
+        new_index = uppers.index(c) - index
+    return uppers[new_index % 26]
+
+
+message, key = input(), input()
+print("".join([unshift(c, k, i % 2) for i, (c, k) in enumerate(zip(message, key))]))
+
 
 
 
 
 
🟢 Early Winter
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3627,59 +3633,67 @@
 10
 11
 12
-13
-14
-15
while True:
-    n = input()
-    if n == "0":
-        break
-    s1 = sum([int(d) for d in n])
-
-    n = int(n)
-    p = 11
-    while True:
-        s2 = sum([int(d) for d in str(n * p)])
-        if s2 == s1:
-            break
-        p += 1
-
-    print(p)
-
 
 
 
 
 
🟢 Echo Echo Echo
 
 Solution in Python 
 
 
 
1
-2
word = input().strip()
-print(" ".join([word] * 3))
-
 
 
 
 
 
🟢 Egypt
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
while True:
-    sides = sorted([int(d) for d in input().split()])
-    if not all(sides):
-        break
-    if sides[0] ** 2 + sides[1] ** 2 == sides[2] ** 2:
-        print("right")
-    else:
-        print("wrong")
-
 
 
 
 
 
🟢 Ekki dauði opna inni
 
 Solution in Python 
 
 
 
1
+13
n, m = [int(_) for _ in input().split()]
+d = [int(_) for _ in input().split()]
+d = [v > m for v in d]
+
+
+for k in range(n):
+    if not d[k]:
+        break
+
+if all(d):
+    print("It had never snowed this early!")
+else:
+    print(f"It hadn't snowed this early in {k} years!")
+
 
 
 
 
 
🟢 The Easiest Problem Is This One
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
while True:
+    n = input()
+    if n == "0":
+        break
+    s1 = sum([int(d) for d in n])
+
+    n = int(n)
+    p = 11
+    while True:
+        s2 = sum([int(d) for d in str(n * p)])
+        if s2 == s1:
+            break
+        p += 1
+
+    print(p)
+
 
 
 
 
 
🟢 Echo Echo Echo
 
 Solution in Python 
 
 
 
1
+2
word = input().strip()
+print(" ".join([word] * 3))
+
 
 
 
 
 
🟢 Egypt
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
 7
-8
-9
l = []
-while True:
-    try:
-        l.append(input().split("|"))
-    except:
-        break
-
-l = [l[i][0] for i in range(len(l))] + [" "] + [l[i][1] for i in range(len(l))]
-print("".join(l))
-
 
 
 
 
 
🟢 Election Paradox
 
 Solution in Python 
 
 
 
1
+8
while True:
+    sides = sorted([int(d) for d in input().split()])
+    if not all(sides):
+        break
+    if sides[0] ** 2 + sides[1] ** 2 == sides[2] ** 2:
+        print("right")
+    else:
+        print("wrong")
+
 
 
 
 
 
🟢 Ekki dauði opna inni
 
 Solution in Python 
 
 
 
1
 2
 3
 4
@@ -3687,40 +3701,36 @@
 6
 7
 8
-9
n = int(input())
-p = [int(d) for d in input().split()]
-p = sorted(p)
-t = 0
-for i in range(0, n // 2 + 1):
-    t += p[i] // 2
-for i in range(n // 2 + 1, n):
-    t += p[i]
-print(t)
-
 
 
 
 
 
🟢 Electrical Outlets
 
 Solution in Python 
 
 
 
1
-2
for _ in range(int(input())):
-    print(sum([int(d) - 1 for d in input().split()[1:]]) + 1)
-
 
 
 
 
 
🟢 Eligibility
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
for _ in range(int(input())):
-    name, pss, dob, courses = input().split()
-    courses = int(courses)
-    pss = [int(d) for d in pss.split("/")]
-    dob = [int(d) for d in dob.split("/")]
-    if pss[0] >= 2010 or dob[0] >= 1991:
-        print(name, "eligible")
-    elif courses > 40:
-        print(name, "ineligible")
-    else:
-        print(name, "coach petitions")
-
 
 
 
 
 
🟢 Encoded Message
 
 Solution in Python 
 
 
 
 1
+9
l = []
+while True:
+    try:
+        l.append(input().split("|"))
+    except:
+        break
+
+l = [l[i][0] for i in range(len(l))] + [" "] + [l[i][1] for i in range(len(l))]
+print("".join(l))
+
 
 
 
 
 
🟢 Election Paradox
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
n = int(input())
+p = [int(d) for d in input().split()]
+p = sorted(p)
+t = 0
+for i in range(0, n // 2 + 1):
+    t += p[i] // 2
+for i in range(n // 2 + 1, n):
+    t += p[i]
+print(t)
+
 
 
 
 
 
🟢 Electrical Outlets
 
 Solution in Python 
 
 
 
1
+2
for _ in range(int(input())):
+    print(sum([int(d) - 1 for d in input().split()[1:]]) + 1)
+
 
 
 
 
 
🟢 Eligibility
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3730,62 +3740,54 @@
  8
  9
 10
-11
-12
-13
-14
import math
-
-for _ in range(int(input())):
-    message = input()
-    size = int(math.sqrt(len(message)))
-    m = []
-    for i in range(size):
-        m.append(message[i * size : (i + 1) * size])
-
-    ans = []
-    for i in range(size - 1, -1, -1):
-        for j in range(size):
-            ans.append(m[j][i])
-    print("".join(ans))
-
 
 
 
 
 
🟢 Endurvinnsla
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
_ = input()
-p = float(input())
-n = int(input())
-items = [input() == "ekki plast" for _ in range(n)]
-print("Jebb" if sum(items) <= p * n else "Neibb")
-
 
 
 
 
 
🟢 Engineering English
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
seen = set()
-
-while True:
-    try:
-        s = input().split()
-    except:
-        break
-    d = []
-    for t in s:
-        if t.lower() not in seen:
-            seen.add(t.lower())
-        else:
-            t = "."
-        d.append(t)
-    print(" ".join(d))
-
 
 
 
 
 
🟢 Erase Securely
 
 Solution in Python 
 
 
 
 1
+11
for _ in range(int(input())):
+    name, pss, dob, courses = input().split()
+    courses = int(courses)
+    pss = [int(d) for d in pss.split("/")]
+    dob = [int(d) for d in dob.split("/")]
+    if pss[0] >= 2010 or dob[0] >= 1991:
+        print(name, "eligible")
+    elif courses > 40:
+        print(name, "ineligible")
+    else:
+        print(name, "coach petitions")
+
 
 
 
 
 
🟢 Encoded Message
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
import math
+
+for _ in range(int(input())):
+    message = input()
+    size = int(math.sqrt(len(message)))
+    m = []
+    for i in range(size):
+        m.append(message[i * size : (i + 1) * size])
+
+    ans = []
+    for i in range(size - 1, -1, -1):
+        for j in range(size):
+            ans.append(m[j][i])
+    print("".join(ans))
+
 
 
 
 
 
🟢 Endurvinnsla
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
_ = input()
+p = float(input())
+n = int(input())
+items = [input() == "ekki plast" for _ in range(n)]
+print("Jebb" if sum(items) <= p * n else "Neibb")
+
 
 
 
 
 
🟢 Engineering English
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3794,17 +3796,27 @@
  7
  8
  9
-10
n = int(input())
-a, b = input(), input()
-if n % 2:
-    print(
-        "Deletion", "failed" if not all([i != j for i, j in zip(a, b)]) else "succeeded"
-    )
-else:
-    print(
-        "Deletion", "failed" if not all([i == j for i, j in zip(a, b)]) else "succeeded"
-    )
-
 
 
 
 
 
🟢 Espresso!
 
 Solution in Python 
 
 
 
 1
+10
+11
+12
+13
+14
+15
seen = set()
+
+while True:
+    try:
+        s = input().split()
+    except:
+        break
+    d = []
+    for t in s:
+        if t.lower() not in seen:
+            seen.add(t.lower())
+        else:
+            t = "."
+        d.append(t)
+    print(" ".join(d))
+
 
 
 
 
 
🟢 Erase Securely
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -3813,334 +3825,258 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
n, s = [int(d) for d in input().split()]
-refill = 0
-tank = s
-for _ in range(n):
-    o = input()
-    if "L" in o:
-        w = int(o[:-1]) + 1
-    else:
-        w = int(o)
-    if tank - w < 0:
-        refill += 1
-        tank = s
-
-    tank -= w
-print(refill)
-
 
 
 
 
 
🟢 Estimating the Area of a Circle
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
import math
-
-while True:
-    r, m, c = input().split()
-    if r == "0" and m == "0" and c == "0":
-        break
-    r = float(r)
-    m, c = int(m), int(c)
-    print(math.pi * r * r, 4 * r * r * c / m)
-
 
 
 
 
 
🟢 Evening Out 1
 
 Solution in Python 
 
 
 
1
+10
n = int(input())
+a, b = input(), input()
+if n % 2:
+    print(
+        "Deletion", "failed" if not all([i != j for i, j in zip(a, b)]) else "succeeded"
+    )
+else:
+    print(
+        "Deletion", "failed" if not all([i == j for i, j in zip(a, b)]) else "succeeded"
+    )
+
 
 
 
 
 
🟢 Espresso!
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
n, s = [int(d) for d in input().split()]
+refill = 0
+tank = s
+for _ in range(n):
+    o = input()
+    if "L" in o:
+        w = int(o[:-1]) + 1
+    else:
+        w = int(o)
+    if tank - w < 0:
+        refill += 1
+        tank = s
+
+    tank -= w
+print(refill)
+
 
 
 
 
 
🟢 Estimating the Area of a Circle
 
 Solution in Python 
 
 
 
1
 2
-3
a, b = [int(d) for d in input().split()]
-c = a % b
-print(min(c, b - c))
-
 
 
 
 
 
🟢 Event Planning
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
n, b, h, w = [int(d) for d in input().split()]
-
-costs = []
-for _ in range(h):
-    p = int(input())
-    a = [int(d) for d in input().split()]
-    if not any([_a >= n for _a in a]):
-        costs.append(None)
-        continue
-    c = p * n
-    if c > b:
-        c = None
-    costs.append(c)
-
-costs = [c for c in costs if c]
-if not costs:
-    print("stay home")
-else:
-    print(min(costs))
-
 
 
 
 
 
🟢 I've Been Everywhere, Man
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
cities = {}
-for i in range(int(input())):
-    cities[i] = set()
-    for _ in range(int(input())):
-        cities[i].add(input())
-
-print("\n".join([str(len(s)) for s in cities.values()]))
-
 
 
 
 
 
🟢 Exactly Electrical
 
 Solution in Python 
 
 
 
1
+3
+4
+5
+6
+7
+8
+9
import math
+
+while True:
+    r, m, c = input().split()
+    if r == "0" and m == "0" and c == "0":
+        break
+    r = float(r)
+    m, c = int(m), int(c)
+    print(math.pi * r * r, 4 * r * r * c / m)
+
 
 
 
 
 
🟢 Evening Out 1
 
 Solution in Python 
 
 
 
1
+2
+3
a, b = [int(d) for d in input().split()]
+c = a % b
+print(min(c, b - c))
+
 
 
 
 
 
🟢 Event Planning
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
n, b, h, w = [int(d) for d in input().split()]
+
+costs = []
+for _ in range(h):
+    p = int(input())
+    a = [int(d) for d in input().split()]
+    if not any([_a >= n for _a in a]):
+        costs.append(None)
+        continue
+    c = p * n
+    if c > b:
+        c = None
+    costs.append(c)
+
+costs = [c for c in costs if c]
+if not costs:
+    print("stay home")
+else:
+    print(min(costs))
+
 
 
 
 
 
🟢 I've Been Everywhere, Man
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
a, b = [int(d) for d in input().split()]
-c, d = [int(d) for d in input().split()]
-t = int(input())
-m = abs(a - c) + abs(b - d)
-print("Y" if m <= t and (m - t) % 2 == 0 else "N")
-
 
 
 
 
 
🟢 Exam
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
k = int(input())
-y = input()
-f = input()
-same, different = 0, 0
-for a, b in zip(y, f):
-    if a == b:
-        same += 1
-    else:
-        different += 1
-print(min(same, k) + min(different, (len(y) - k)))
-
 
 
 
 
 
🟢 Expected Earnings
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
n, k, p = input().split()
-n = int(n)
-k = int(k)
-p = float(p)
-ev = n * p - k
-if ev < 0:
-    print("spela")
-else:
-    print("spela inte!")
-
 
 
 
 
 
🟢 Eye of Sauron
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
package main
-
-import (
-    "fmt"
-    "strings"
-)
-
-func main() {
-    var drawing string
-    fmt.Scan(&drawing)
-    parts := strings.Split(drawing, "()")
-    left, right := parts[0], parts[1]
-    if left == right {
-        fmt.Println("correct")
-    } else {
-        fmt.Println("fix")
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
drawing = input()
-left, right = drawing.split("()")
-if left == right:
-    print("correct")
-else:
-    print("fix")
-
 
 
 
 
 
🟢 Fading Wind
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
h, k, v, s = [int(d) for d in input().split()]
-t = 0
-while h > 0:
-    v += s
-    v -= max(1, v // 10)
-    if v >= k:
-        h += 1
-    elif v > 0:
-        h -= 1
-        if not h:
-            v = 0
-    else:
-        h = 0
-        v = 0
-    t += v
-    if s > 0:
-        s -= 1
-print(t)
-
 
 
 
 
 
🟢 Faktor
 
 Solution in Python 
 
 
 
1
-2
a, i = [int(d) for d in input().split()]
-print(a * (i - 1) + 1)
-
 
 
 
 
 
🟢 Falling Apart
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
n = int(input())
-a = sorted([int(d) for d in input().split()], reverse=True)
-print(
-    sum([a[i] for i in range(0, n, 2)]),
-    sum([a[i] for i in range(1, n, 2)]),
-)
-
 
 
 
 
 
🟢 False Sense of Security
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
encoding = {
-    "A": ".-",
-    "B": "-...",
-    "C": "-.-.",
-    "D": "-..",
-    "E": ".",
-    "F": "..-.",
-    "G": "--.",
-    "H": "....",
-    "I": "..",
-    "J": ".---",
-    "K": "-.-",
-    "L": ".-..",
-    "M": "--",
-    "N": "-.",
-    "O": "---",
-    "P": ".--.",
-    "Q": "--.-",
-    "R": ".-.",
-    "S": "...",
-    "T": "-",
-    "U": "..-",
-    "V": "...-",
-    "W": ".--",
-    "X": "-..-",
-    "Y": "-.--",
-    "Z": "--..",
-    "_": "..--",
-    ",": ".-.-",
-    ".": "---.",
-    "?": "----",
-}
-
-decoding = dict([(v, k) for k, v in encoding.items()])
-
-while True:
-    try:
-        encoded = input()
-    except:
-        break
-    length = [len(encoding[c]) for c in encoded]
-    morse = "".join([encoding[c] for c in encoded])
-
-    ans, s = "", 0
-    for i in reversed(length):
-        ans += decoding[morse[s : s + i]]
-        s += i
-    print(ans)
-
 
 
 
 
 
🟢 Fast Food Prizes
 
 Solution in Python 
 
 
 
 1
+5
+6
+7
cities = {}
+for i in range(int(input())):
+    cities[i] = set()
+    for _ in range(int(input())):
+        cities[i].add(input())
+
+print("\n".join([str(len(s)) for s in cities.values()]))
+
 
 
 
 
 
🟢 Exactly Electrical
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
a, b = [int(d) for d in input().split()]
+c, d = [int(d) for d in input().split()]
+t = int(input())
+m = abs(a - c) + abs(b - d)
+print("Y" if m <= t and (m - t) % 2 == 0 else "N")
+
 
 
 
 
 
🟢 Exam
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
k = int(input())
+y = input()
+f = input()
+same, different = 0, 0
+for a, b in zip(y, f):
+    if a == b:
+        same += 1
+    else:
+        different += 1
+print(min(same, k) + min(different, (len(y) - k)))
+
 
 
 
 
 
🟢 Expected Earnings
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
n, k, p = input().split()
+n = int(n)
+k = int(k)
+p = float(p)
+ev = n * p - k
+if ev < 0:
+    print("spela")
+else:
+    print("spela inte!")
+
 
 
 
 
 
🟢 Eye of Sauron
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
package main
+
+import (
+    "fmt"
+    "strings"
+)
+
+func main() {
+    var drawing string
+    fmt.Scan(&drawing)
+    parts := strings.Split(drawing, "()")
+    left, right := parts[0], parts[1]
+    if left == right {
+        fmt.Println("correct")
+    } else {
+        fmt.Println("fix")
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
+6
drawing = input()
+left, right = drawing.split("()")
+if left == right:
+    print("correct")
+else:
+    print("fix")
+
 
 
 
 
 
🟢 Fading Wind
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
h, k, v, s = [int(d) for d in input().split()]
+t = 0
+while h > 0:
+    v += s
+    v -= max(1, v // 10)
+    if v >= k:
+        h += 1
+    elif v > 0:
+        h -= 1
+        if not h:
+            v = 0
+    else:
+        h = 0
+        v = 0
+    t += v
+    if s > 0:
+        s -= 1
+print(t)
+
 
 
 
 
 
🟢 Faktor
 
 Solution in Python 
 
 
 
1
+2
a, i = [int(d) for d in input().split()]
+print(a * (i - 1) + 1)
+
 
 
 
 
 
🟢 Falling Apart
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
n = int(input())
+a = sorted([int(d) for d in input().split()], reverse=True)
+print(
+    sum([a[i] for i in range(0, n, 2)]),
+    sum([a[i] for i in range(1, n, 2)]),
+)
+
 
 
 
 
 
🟢 False Sense of Security
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4155,23 +4091,87 @@
 13
 14
 15
-16
for _ in range(int(input())):
-    n, m = [int(d) for d in input().split()]
-    r = []
-    for _ in range(n):
-        s = input().split()
-        p = int(s[-1])
-        k = [int(d) for d in s[1:-1]]
-        r.append((k, p))
-    s = [int(d) for d in input().split()]
-
-    ans = 0
-    for t, p in r:
-        c = min([s[d - 1] for d in t])
-        ans += p * c
-
-    print(ans)
-
 
 
 
 
 
🟢 FBI Universal Control Numbers
 
 Solution in Python 
 
 
 
 1
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
encoding = {
+    "A": ".-",
+    "B": "-...",
+    "C": "-.-.",
+    "D": "-..",
+    "E": ".",
+    "F": "..-.",
+    "G": "--.",
+    "H": "....",
+    "I": "..",
+    "J": ".---",
+    "K": "-.-",
+    "L": ".-..",
+    "M": "--",
+    "N": "-.",
+    "O": "---",
+    "P": ".--.",
+    "Q": "--.-",
+    "R": ".-.",
+    "S": "...",
+    "T": "-",
+    "U": "..-",
+    "V": "...-",
+    "W": ".--",
+    "X": "-..-",
+    "Y": "-.--",
+    "Z": "--..",
+    "_": "..--",
+    ",": ".-.-",
+    ".": "---.",
+    "?": "----",
+}
+
+decoding = dict([(v, k) for k, v in encoding.items()])
+
+while True:
+    try:
+        encoded = input()
+    except:
+        break
+    length = [len(encoding[c]) for c in encoded]
+    morse = "".join([encoding[c] for c in encoded])
+
+    ans, s = "", 0
+    for i in reversed(length):
+        ans += decoding[morse[s : s + i]]
+        s += i
+    print(ans)
+
 
 
 
 
 
🟢 Fast Food Prizes
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4186,166 +4186,168 @@
 13
 14
 15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
m = {
-    "0": 0,
-    "1": 1,
-    "2": 2,
-    "3": 3,
-    "4": 4,
-    "5": 5,
-    "6": 6,
-    "7": 7,
-    "8": 8,
-    "9": 9,
-    "A": 10,
-    "B": 8,
-    "C": 11,
-    "D": 12,
-    "E": 13,
-    "F": 14,
-    "G": 11,
-    "H": 15,
-    "I": 1,
-    "J": 16,
-    "K": 17,
-    "L": 18,
-    "M": 19,
-    "N": 20,
-    "O": 0,
-    "P": 21,
-    "Q": 0,
-    "R": 22,
-    "S": 5,
-    "T": 23,
-    "U": 24,
-    "V": 24,
-    "W": 25,
-    "X": 26,
-    "Y": 24,
-    "Z": 2,
-}
-w = [2, 4, 5, 7, 8, 10, 11, 13]
-
-for _ in range(int(input())):
-    i, d = input().split()
-    t = sum([m[b] * a for a, b in zip(w, d)])
-    if t % 27 == m[d[-1]]:
-        s = sum([m[b] * 27**a for a, b in zip(range(8), d[:8][::-1])])
-        print(f"{i} {s}")
-    else:
-        print(f"{i} Invalid")
-
 
 
 
 
 
🟢 Framtíðar FIFA
 
 Solution in Python 
 
 
 
1
-2
-3
n = int(input())
-m = int(input())
-print(2022 + n // m)
-
 
 
 
 
 
🟢 Fifty Shades of Pink
 
 Solution in Python 
 
 
 
1
+16
for _ in range(int(input())):
+    n, m = [int(d) for d in input().split()]
+    r = []
+    for _ in range(n):
+        s = input().split()
+        p = int(s[-1])
+        k = [int(d) for d in s[1:-1]]
+        r.append((k, p))
+    s = [int(d) for d in input().split()]
+
+    ans = 0
+    for t, p in r:
+        c = min([s[d - 1] for d in t])
+        ans += p * c
+
+    print(ans)
+
 
 
 
 
 
🟢 FBI Universal Control Numbers
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
m = {
+    "0": 0,
+    "1": 1,
+    "2": 2,
+    "3": 3,
+    "4": 4,
+    "5": 5,
+    "6": 6,
+    "7": 7,
+    "8": 8,
+    "9": 9,
+    "A": 10,
+    "B": 8,
+    "C": 11,
+    "D": 12,
+    "E": 13,
+    "F": 14,
+    "G": 11,
+    "H": 15,
+    "I": 1,
+    "J": 16,
+    "K": 17,
+    "L": 18,
+    "M": 19,
+    "N": 20,
+    "O": 0,
+    "P": 21,
+    "Q": 0,
+    "R": 22,
+    "S": 5,
+    "T": 23,
+    "U": 24,
+    "V": 24,
+    "W": 25,
+    "X": 26,
+    "Y": 24,
+    "Z": 2,
+}
+w = [2, 4, 5, 7, 8, 10, 11, 13]
+
+for _ in range(int(input())):
+    i, d = input().split()
+    t = sum([m[b] * a for a, b in zip(w, d)])
+    if t % 27 == m[d[-1]]:
+        s = sum([m[b] * 27**a for a, b in zip(range(8), d[:8][::-1])])
+        print(f"{i} {s}")
+    else:
+        print(f"{i} Invalid")
+
 
 
 
 
 
🟢 Framtíðar FIFA
 
 Solution in Python 
 
 
 
1
 2
-3
-4
-5
-6
-7
-8
-9
total = 0
-for _ in range(int(input())):
-    button = input().lower()
-    if "pink" in button or "rose" in button:
-        total += 1
-if not total:
-    print("I must watch Star Wars with my daughter")
-else:
-    print(total)
-
 
 
 
 
 
🟢 Filip
 
 Solution in Python 
 
 
 
1
+3
n = int(input())
+m = int(input())
+print(2022 + n // m)
+
 
 
 
 
 
🟢 Fifty Shades of Pink
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
a, b = input().split()
-a, b = a[::-1], b[::-1]
-if a > b:
-    print(a)
-else:
-    print(b)
-
 
 
 
 
 
🟢 Final Exam
 
 Solution in Python 
 
 
 
1
+6
+7
+8
+9
total = 0
+for _ in range(int(input())):
+    button = input().lower()
+    if "pink" in button or "rose" in button:
+        total += 1
+if not total:
+    print("I must watch Star Wars with my daughter")
+else:
+    print(total)
+
 
 
 
 
 
🟢 Filip
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
-7
-8
-9
n = int(input())
-ans, score = [], 0
-for i in range(n):
-    ans.append(input())
-    if i == 0:
-        continue
-    if ans[i] == ans[i - 1]:
-        score += 1
-print(score)
-
 
 
 
 
 
🟢 Finding An A
 
 Solutions in 3 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
#include <iostream>
-
-using namespace std;
-
-int main()
-{
-    string a;
-    cin >> a;
-
-    int found = a.find_first_of("a");
-
-    cout << a.substr(found);
-
-    return 0;
-}
-
 
 
 
 1
+6
a, b = input().split()
+a, b = a[::-1], b[::-1]
+if a > b:
+    print(a)
+else:
+    print(b)
+
 
 
 
 
 
🟢 Final Exam
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
n = int(input())
+ans, score = [], 0
+for i in range(n):
+    ans.append(input())
+    if i == 0:
+        continue
+    if ans[i] == ans[i - 1]:
+        score += 1
+print(score)
+
 
 
 
 
 
🟢 Finding An A
 
 Solutions in 3 languages 
 
 
 
 1
  2
  3
  4
@@ -4357,137 +4359,139 @@
 10
 11
 12
-13
package main
+13
+14
+15
#include <iostream>
 
-import (
-    "fmt"
-    "strings"
-)
-
-func main() {
-    var s string
-    fmt.Scan(&s)
-    index := strings.Index(s, "a")
-    fmt.Println(s[index:])
-}
-
 
 
 
1
-2
word = input()
-print(word[word.find("a") :])
-
 
 
 
 
 
🟢 FizzBuzz
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
x, y, n = [int(d) for d in input().split()]
-for i in range(1, n + 1):
-    ans = ""
-    if not i % x:
-        ans += "Fizz"
-    if not i % y:
-        ans += "Buzz"
-    if not ans:
-        ans = i
-    print(ans)
-
 
 
 
 
 
🟢 Flexible Spaces
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
w, p = [int(d) for d in input().split()]
-l = [int(d) for d in input().split()]
-l = [0] + l + [w]
-c = set()
-for i in range(p + 1):
-    for j in range(i + 1, p + 2):
-        c.add(l[j] - l[i])
-print(" ".join([str(d) for d in sorted(c)]))
-
 
 
 
 
 
🟢 Birthday Memorization
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
n = int(input())
-records = {}
-for _ in range(n):
-    s, c, date = input().split()
-    c = int(c)
-    date = "".join(date.split("/")[::-1])
-    if date not in records:
-        records[date] = (s, c)
-    else:
-        _, _c = records[date]
-        if c > _c:
-            records[date] = (s, c)
-print(len(records.keys()))
-ordered_keys = sorted(records, key=lambda k: records[k][0])
-for key in ordered_keys:
-    print(records[key][0])
-
 
 
 
 
 
🟢 Forced Choice
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
_, p, s = input().split()
-for _ in range(int(s)):
-    if p in input().split()[1:]:
-        print("KEEP")
-    else:
-        print("REMOVE")
-
 
 
 
 
 
🟢 Free Food
 
 Solution in Python 
 
 
 
1
+using namespace std;
+
+int main()
+{
+    string a;
+    cin >> a;
+
+    int found = a.find_first_of("a");
+
+    cout << a.substr(found);
+
+    return 0;
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
package main
+
+import (
+    "fmt"
+    "strings"
+)
+
+func main() {
+    var s string
+    fmt.Scan(&s)
+    index := strings.Index(s, "a")
+    fmt.Println(s[index:])
+}
+
 
 
 
1
+2
word = input()
+print(word[word.find("a") :])
+
 
 
 
 
 
🟢 FizzBuzz
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
x, y, n = [int(d) for d in input().split()]
+for i in range(1, n + 1):
+    ans = ""
+    if not i % x:
+        ans += "Fizz"
+    if not i % y:
+        ans += "Buzz"
+    if not ans:
+        ans = i
+    print(ans)
+
 
 
 
 
 
🟢 Flexible Spaces
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
w, p = [int(d) for d in input().split()]
+l = [int(d) for d in input().split()]
+l = [0] + l + [w]
+c = set()
+for i in range(p + 1):
+    for j in range(i + 1, p + 2):
+        c.add(l[j] - l[i])
+print(" ".join([str(d) for d in sorted(c)]))
+
 
 
 
 
 
🟢 Birthday Memorization
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
n = int(input())
+records = {}
+for _ in range(n):
+    s, c, date = input().split()
+    c = int(c)
+    date = "".join(date.split("/")[::-1])
+    if date not in records:
+        records[date] = (s, c)
+    else:
+        _, _c = records[date]
+        if c > _c:
+            records[date] = (s, c)
+print(len(records.keys()))
+ordered_keys = sorted(records, key=lambda k: records[k][0])
+for key in ordered_keys:
+    print(records[key][0])
+
 
 
 
 
 
🟢 Forced Choice
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
n = int(input())
-days = set()
-for _ in range(n):
-    start, end = [int(d) for d in input().split()]
-    days.update(range(start, end + 1))
-print(len(days))
-
 
 
 
 
 
🟢 From A to B
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
a, b = [int(d) for d in input().split()]
-
-if a <= b:
-    print(b - a)
-else:
-    total = 0
-    while a > b:
-        if a % 2:
-            a += 1
-            total += 1
-        a /= 2
-        total += 1
-    total += b - a
-    print(int(total))
-
 
 
 
 
 
🟢 FYI
 
 Solutions in 2 languages 
 
 
 
 1
+6
_, p, s = input().split()
+for _ in range(int(s)):
+    if p in input().split()[1:]:
+        print("KEEP")
+    else:
+        print("REMOVE")
+
 
 
 
 
 
🟢 Free Food
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
n = int(input())
+days = set()
+for _ in range(n):
+    start, end = [int(d) for d in input().split()]
+    days.update(range(start, end + 1))
+print(len(days))
+
 
 
 
 
 
🟢 From A to B
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4500,126 +4504,112 @@
 11
 12
 13
-14
-15
-16
package main
+14
a, b = [int(d) for d in input().split()]
 
-import (
-    "fmt"
-    "strings"
-)
-
-func main() {
-    var s string
-    fmt.Scan(&s)
-    if strings.HasPrefix(s, "555") {
-        fmt.Println(1)
-    } else {
-        fmt.Println(0)
-    }
-}
-
 
 
 
1
-2
-3
-4
if input().startswith("555"):
-    print(1)
-else:
-    print(0)
-
 
 
 
 
 
🟢 Gandalf's Spell
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
c = list(input())
-s = input().split()
-if len(c) != len(s):
-    print("False")
-else:
-    d, valid = {}, True
-    for a, b in zip(c, s):
-        if a not in d:
-            d[a] = b
-        else:
-            if d[a] != b:
-                print("False")
-                valid = False
-                break
-    if valid:
-        if len(set(d.keys())) == len(set(d.values())):
-            print("True")
-        else:
-            print("False")
-
 
 
 
 
 
🟢 GCD
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
import math
-
-a, b = [int(d) for d in input().split()]
-
-print(math.gcd(a, b))
-
 
 
 
 
 
🟢 GCVWR
 
 Solution in Python 
 
 
 
1
+if a <= b:
+    print(b - a)
+else:
+    total = 0
+    while a > b:
+        if a % 2:
+            a += 1
+            total += 1
+        a /= 2
+        total += 1
+    total += b - a
+    print(int(total))
+
 
 
 
 
 
🟢 FYI
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
package main
+
+import (
+    "fmt"
+    "strings"
+)
+
+func main() {
+    var s string
+    fmt.Scan(&s)
+    if strings.HasPrefix(s, "555") {
+        fmt.Println(1)
+    } else {
+        fmt.Println(0)
+    }
+}
+
 
 
 
1
+2
+3
+4
if input().startswith("555"):
+    print(1)
+else:
+    print(0)
+
 
 
 
 
 
🟢 Gandalf's Spell
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
c = list(input())
+s = input().split()
+if len(c) != len(s):
+    print("False")
+else:
+    d, valid = {}, True
+    for a, b in zip(c, s):
+        if a not in d:
+            d[a] = b
+        else:
+            if d[a] != b:
+                print("False")
+                valid = False
+                break
+    if valid:
+        if len(set(d.keys())) == len(set(d.values())):
+            print("True")
+        else:
+            print("False")
+
 
 
 
 
 
🟢 GCD
 
 Solution in Python 
 
 
 
1
 2
 3
-4
g, t, n = [int(d) for d in input().split()]
-capacity = (g - t) * 0.9
-items = sum([int(d) for d in input().split()])
-print(int(capacity - items))
-
 
 
 
 
 
🟢 Gene Block
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
mapping = {
-    1: 3,
-    2: 6,
-    3: 9,
-    4: 2,
-    5: 5,
-    6: 8,
-    7: 1,
-    8: 4,
-    9: 7,
-    0: 10,
-}
-
-for _ in range(int(input())):
-    n = int(input())
-    d = n % 10
-
-    if n >= 7 * mapping[d]:
-        print(mapping[d])
-    else:
-        print(-1)
-
 
 
 
 
 
🟢 Gerrymandering
 
 Solution in Python 
 
 
 
 1
+4
+5
import math
+
+a, b = [int(d) for d in input().split()]
+
+print(math.gcd(a, b))
+
 
 
 
 
 
🟢 GCVWR
 
 Solution in Python 
 
 
 
1
+2
+3
+4
g, t, n = [int(d) for d in input().split()]
+capacity = (g - t) * 0.9
+items = sum([int(d) for d in input().split()])
+print(int(capacity - items))
+
 
 
 
 
 
🟢 Gene Block
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4639,30 +4629,28 @@
 18
 19
 20
-21
-22
p, _ = [int(d) for d in input().split()]
-votes = {}
-for _ in range(p):
-    d, a, b = [int(d) for d in input().split()]
-    if d not in votes:
-        votes[d] = {"A": a, "B": b}
-    else:
-        votes[d]["A"] += a
-        votes[d]["B"] += b
-
-total_wa, total_wb = 0, 0
-for d in sorted(votes):
-    total = votes[d]["A"] + votes[d]["B"]
-    t = total // 2 + 1
-    winner = "A" if votes[d]["A"] > votes[d]["B"] else "B"
-    wa = votes[d]["A"] - t if votes[d]["A"] > votes[d]["B"] else votes[d]["A"]
-    wb = votes[d]["B"] - t if votes[d]["B"] > votes[d]["A"] else votes[d]["B"]
-    print(winner, wa, wb)
-    total_wa += wa
-    total_wb += wb
-v = sum([sum(ab.values()) for ab in votes.values()])
-print(abs(total_wa - total_wb) / v)
-
 
 
 
 
 
🟢 Glasses Foggy, Mom's Spaghetti
 
 Solution in Python 
 
 
 
 1
+21
mapping = {
+    1: 3,
+    2: 6,
+    3: 9,
+    4: 2,
+    5: 5,
+    6: 8,
+    7: 1,
+    8: 4,
+    9: 7,
+    0: 10,
+}
+
+for _ in range(int(input())):
+    n = int(input())
+    d = n % 10
+
+    if n >= 7 * mapping[d]:
+        print(mapping[d])
+    else:
+        print(-1)
+
 
 
 
 
 
🟢 Gerrymandering
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4676,22 +4664,36 @@
 12
 13
 14
-15
import math
-
-d, x, y, h = input().split()
-d = int(d)
-x = int(x)
-y = int(y)
-h = int(h)
-
-angle1 = (math.atan(y / x)) - (math.atan((y - h / 2) / x))
-angle2 = (math.atan((y + h / 2) / x)) - (math.atan(y / x))
-
-d1 = math.tan(angle1) * d
-d2 = math.tan(angle2) * d
-
-print(d1 + d2)
-
 
 
 
 
 
🟢 Goat Rope
 
 Solution in Python 
 
 
 
 1
+15
+16
+17
+18
+19
+20
+21
+22
p, _ = [int(d) for d in input().split()]
+votes = {}
+for _ in range(p):
+    d, a, b = [int(d) for d in input().split()]
+    if d not in votes:
+        votes[d] = {"A": a, "B": b}
+    else:
+        votes[d]["A"] += a
+        votes[d]["B"] += b
+
+total_wa, total_wb = 0, 0
+for d in sorted(votes):
+    total = votes[d]["A"] + votes[d]["B"]
+    t = total // 2 + 1
+    winner = "A" if votes[d]["A"] > votes[d]["B"] else "B"
+    wa = votes[d]["A"] - t if votes[d]["A"] > votes[d]["B"] else votes[d]["A"]
+    wb = votes[d]["B"] - t if votes[d]["B"] > votes[d]["A"] else votes[d]["B"]
+    print(winner, wa, wb)
+    total_wa += wa
+    total_wb += wb
+v = sum([sum(ab.values()) for ab in votes.values()])
+print(abs(total_wa - total_wb) / v)
+
 
 
 
 
 
🟢 Glasses Foggy, Mom's Spaghetti
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4704,134 +4706,142 @@
 11
 12
 13
-14
x, y, x1, y1, x2, y2 = [int(d) for d in input().split()]
+14
+15
import math
 
-if x >= x1 and x <= x2:
-    print(min(abs(y - y1), abs(y - y2)))
-elif y >= y1 and y <= y2:
-    print(min(abs(x - x1), abs(x - x2)))
-else:
-    x3, y3 = x1, y2
-    x4, y4 = x2, y1
-    l = [
-        ((x - a) ** 2 + (y - b) ** 2) ** 0.5
-        for a, b in [(x1, y1), (x2, y2), (x1, y2), (x2, y1)]
-    ]
-    print(min(l))
-
 
 
 
 
 
🟢 Goomba Stacks
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
n = int(input())
-total = 0
-result = True
-for _ in range(n):
-    g, b = [int(d) for d in input().split()]
-    total += g
-    if total < b:
-        result = False
-print("possible" if result else "impossible")
-
 
 
 
 
 
🟢 Grading
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
line = input()
-score = int(input())
-a, b, c, d, e = [int(d) for d in line.split()]
-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")
-
 
 
 
 
 
🟢 Grass Seed Inc.
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
c = float(input())
-total = 0
-for _ in range(int(input())):
-    w, l = [float(d) for d in input().split()]
-    total += c * w * l
-print(f"{total:.7f}")
-
 
 
 
 
 
🟢 Greedily Increasing Subsequence
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
n = int(input())
-a = [int(d) for d in input().split()]
-
-g = [a[0]]
-for i in range(1, n):
-    v = a[i]
-    if v > g[-1]:
-        g.append(v)
-print(len(g))
-print(" ".join([str(d) for d in g]))
-
 
 
 
 
 
🟢 Greedy Polygons
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
import math
-
-for _ in range(int(input())):
-    n, l, d, g = [int(d) for d in input().split()]
-    a = n * l * l / (4 * math.tan(math.pi / n))
-    a += n * l * d * g
-    a += math.pi * ((d * g) ** 2)
-    print(a)
-
 
 
 
 
 
🟢 Greetings!
 
 Solution in Python 
 
 
 
1
print(input().replace("e", "ee"))
-
 
 
 
 
 
🟢 Guess the Number
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
start, end = 1, 1000
-while True:
-    guess = (start + end) // 2
-    print(guess)
-    resp = input()
-    if resp == "correct":
-        break
-    elif resp == "higher":
-        start = guess + 1
-    else:
-        end = guess
-
 
 
 
 
 
🟢 Watch Out For Those Hailstones!
 
 Solutions in 2 languages 
 
 
 
 1
+d, x, y, h = input().split()
+d = int(d)
+x = int(x)
+y = int(y)
+h = int(h)
+
+angle1 = (math.atan(y / x)) - (math.atan((y - h / 2) / x))
+angle2 = (math.atan((y + h / 2) / x)) - (math.atan(y / x))
+
+d1 = math.tan(angle1) * d
+d2 = math.tan(angle2) * d
+
+print(d1 + d2)
+
 
 
 
 
 
🟢 Goat Rope
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
x, y, x1, y1, x2, y2 = [int(d) for d in input().split()]
+
+if x >= x1 and x <= x2:
+    print(min(abs(y - y1), abs(y - y2)))
+elif y >= y1 and y <= y2:
+    print(min(abs(x - x1), abs(x - x2)))
+else:
+    x3, y3 = x1, y2
+    x4, y4 = x2, y1
+    l = [
+        ((x - a) ** 2 + (y - b) ** 2) ** 0.5
+        for a, b in [(x1, y1), (x2, y2), (x1, y2), (x2, y1)]
+    ]
+    print(min(l))
+
 
 
 
 
 
🟢 Goomba Stacks
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
n = int(input())
+total = 0
+result = True
+for _ in range(n):
+    g, b = [int(d) for d in input().split()]
+    total += g
+    if total < b:
+        result = False
+print("possible" if result else "impossible")
+
 
 
 
 
 
🟢 Grading
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
line = input()
+score = int(input())
+a, b, c, d, e = [int(d) for d in line.split()]
+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")
+
 
 
 
 
 
🟢 Grass Seed Inc.
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
c = float(input())
+total = 0
+for _ in range(int(input())):
+    w, l = [float(d) for d in input().split()]
+    total += c * w * l
+print(f"{total:.7f}")
+
 
 
 
 
 
🟢 Greedily Increasing Subsequence
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
n = int(input())
+a = [int(d) for d in input().split()]
+
+g = [a[0]]
+for i in range(1, n):
+    v = a[i]
+    if v > g[-1]:
+        g.append(v)
+print(len(g))
+print(" ".join([str(d) for d in g]))
+
 
 
 
 
 
🟢 Greedy Polygons
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
import math
+
+for _ in range(int(input())):
+    n, l, d, g = [int(d) for d in input().split()]
+    a = n * l * l / (4 * math.tan(math.pi / n))
+    a += n * l * d * g
+    a += math.pi * ((d * g) ** 2)
+    print(a)
+
 
 
 
 
 
🟢 Greetings!
 
 Solution in Python 
 
 
 
1
print(input().replace("e", "ee"))
+
 
 
 
 
 
🟢 Guess the Number
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4841,76 +4851,76 @@
  8
  9
 10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
package main
-
-import (
-    "fmt"
-)
-
-func h(n int) int {
-    if n == 1 {
-        return 1
-    } else if n%2 == 0 {
-        return n + h(n/2)
-    } else {
-        return n + h(3*n+1)
-    }
-}
-
-func main() {
-    var n int
-    fmt.Scan(&n)
-    fmt.Println(h(n))
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
def h(n):
-    if n == 1:
-        return 1
-    else:
-        return n + (h(n // 2) if n % 2 == 0 else h(3 * n + 1))
+11
start, end = 1, 1000
+while True:
+    guess = (start + end) // 2
+    print(guess)
+    resp = input()
+    if resp == "correct":
+        break
+    elif resp == "higher":
+        start = guess + 1
+    else:
+        end = guess
+
 
 
 
 
 
🟢 Watch Out For Those Hailstones!
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
package main
+
+import (
+    "fmt"
+)
 
-
-n = int(input())
-print(h(n))
-
 
 
 
 
 
🟢 Hailstone Sequences
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
n = int(input())
-s = [n]
-while True:
-    v = s[-1]
-    if v == 1:
-        break
-    elif v % 2 == 0:
-        s.append(v // 2)
-    else:
-        s.append(3 * v + 1)
-print(len(s))
-
 
 
 
 
  
 Solution in Python 
 
 
 
 1
+func h(n int) int {
+    if n == 1 {
+        return 1
+    } else if n%2 == 0 {
+        return n + h(n/2)
+    } else {
+        return n + h(3*n+1)
+    }
+}
+
+func main() {
+    var n int
+    fmt.Scan(&n)
+    fmt.Println(h(n))
+}
+
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
def h(n):
+    if n == 1:
+        return 1
+    else:
+        return n + (h(n // 2) if n % 2 == 0 else h(3 * n + 1))
+
+
+n = int(input())
+print(h(n))
+
 
 
 
 
 
🟢 Hailstone Sequences
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4920,32 +4930,18 @@
  8
  9
 10
-11
-12
-13
-14
-15
-16
-17
-18
import math
-
+11
n = int(input())
+s = [n]
 while True:
-    try:
-        r, x, y = [float(d) for d in input().split()]
-    except:
-        break
-    if x**2 + y**2 >= r**2:
-        print("miss")
-    else:
-        # https://mathworld.wolfram.com/CircularSegment.html
-        d = math.sqrt(x**2 + y**2)
-        h = r - d
-        a = math.acos((r - h) / r)
-        t = (r - h) * math.sqrt(2 * r * h - h * h)
-        p = (r**2) * a
-        s = p - t
-        print(math.pi * (r**2) - s, s)
-
 
 
 
 
 
🟢 Hangman
 
 Solution in Python 
 
 
 
 1
+    v = s[-1]
+    if v == 1:
+        break
+    elif v % 2 == 0:
+        s.append(v // 2)
+    else:
+        s.append(3 * v + 1)
+print(len(s))
+
 
 
 
 
  
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -4961,130 +4957,146 @@
 14
 15
 16
-17
word = set(list(input()))
-guess = input()
-tries = 0
-correct = 0
-for c in guess:
-    if c in word:
-        correct += 1
-    else:
-        tries += 1
-
-    if correct == len(word):
-        break
-
-if tries >= 10:
-    print("LOSE")
-else:
-    print("WIN")
-
 
 
 
 
 
🟢 Harshad Numbers
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
n = int(input())
-while True:
-    sd = sum([int(d) for d in str(n)])
-    if not n % sd:
-        break
-    n += 1
-print(n)
-
 
 
 
 
 
🟢 Haughty Cuisine
 
 Solution in Python 
 
 
 
1
+17
+18
import math
+
+while True:
+    try:
+        r, x, y = [float(d) for d in input().split()]
+    except:
+        break
+    if x**2 + y**2 >= r**2:
+        print("miss")
+    else:
+        # https://mathworld.wolfram.com/CircularSegment.html
+        d = math.sqrt(x**2 + y**2)
+        h = r - d
+        a = math.acos((r - h) / r)
+        t = (r - h) * math.sqrt(2 * r * h - h * h)
+        p = (r**2) * a
+        s = p - t
+        print(math.pi * (r**2) - s, s)
+
 
 
 
 
 
🟢 Hangman
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
word = set(list(input()))
+guess = input()
+tries = 0
+correct = 0
+for c in guess:
+    if c in word:
+        correct += 1
+    else:
+        tries += 1
+
+    if correct == len(word):
+        break
+
+if tries >= 10:
+    print("LOSE")
+else:
+    print("WIN")
+
 
 
 
 
 
🟢 Harshad Numbers
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
-8
from random import randint
-
-n = int(input())
-menu = []
-for _ in range(n):
-    menu.append(input().split())
-
-print("\n".join(menu[randint(0, n - 1)]))
-
 
 
 
 
 
🟢 Head Guard
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
while True:
-    try:
-        s = input()
-    except:
-        break
-    parts = []
-    prev, t = s[0], 1
-    for c in s[1:]:
-        if c != prev:
-            parts.append((prev, t))
-            t = 1
-            prev = c
-        else:
-            t += 1
-    parts.append((prev, t))
-    print("".join([f"{v}{k}" for k, v in parts]))
-
 
 
 
 
 
🟢 Heart Rate
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
for _ in range(int(input())):
-    b, p = [float(d) for d in input().split()]
-    min_abpm = 60 / p * (b - 1)
-    bpm = 60 * b / p
-    max_abpm = 60 / p * (b + 1)
-    print(f"{min_abpm:.4f} {bpm:.4f} {max_abpm:.4f}")
-
 
 
 
 
 
🟢 Homework
 
 Solution in Python 
 
 
 
1
+7
n = int(input())
+while True:
+    sd = sum([int(d) for d in str(n)])
+    if not n % sd:
+        break
+    n += 1
+print(n)
+
 
 
 
 
 
🟢 Haughty Cuisine
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
from random import randint
+
+n = int(input())
+menu = []
+for _ in range(n):
+    menu.append(input().split())
+
+print("\n".join(menu[randint(0, n - 1)]))
+
 
 
 
 
 
🟢 Head Guard
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
while True:
+    try:
+        s = input()
+    except:
+        break
+    parts = []
+    prev, t = s[0], 1
+    for c in s[1:]:
+        if c != prev:
+            parts.append((prev, t))
+            t = 1
+            prev = c
+        else:
+            t += 1
+    parts.append((prev, t))
+    print("".join([f"{v}{k}" for k, v in parts]))
+
 
 
 
 
 
🟢 Heart Rate
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
-7
-8
-9
total = 0
-parts = input().split(";")
-for part in parts:
-    ranges = part.split("-")
-    if len(ranges) == 1:
-        total += 1
-    else:
-        total += len(range(int(ranges[0]), int(ranges[1]))) + 1
-print(total)
-
 
 
 
 
 
🟢 Heir's Dilemma
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
l, h = [int(d) for d in input().split()]
-total = 0
-for i in range(l, h + 1):
-    digits = set(str(i))
-    if len(digits) != 6 or "0" in digits:
-        continue
-    if not all([i % int(d) == 0 for d in digits]):
-        continue
-    total += 1
-print(total)
-
 
 
 
 
 
🟢 Heliocentric
 
 Solution in Python 
 
 
 
 1
+6
for _ in range(int(input())):
+    b, p = [float(d) for d in input().split()]
+    min_abpm = 60 / p * (b - 1)
+    bpm = 60 * b / p
+    max_abpm = 60 / p * (b + 1)
+    print(f"{min_abpm:.4f} {bpm:.4f} {max_abpm:.4f}")
+
 
 
 
 
 
🟢 Homework
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
total = 0
+parts = input().split(";")
+for part in parts:
+    ranges = part.split("-")
+    if len(ranges) == 1:
+        total += 1
+    else:
+        total += len(range(int(ranges[0]), int(ranges[1]))) + 1
+print(total)
+
 
 
 
 
 
🟢 Heir's Dilemma
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -5093,45 +5105,17 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
def offset(d, b):
-    return (b - d % b) % b
-
-
-cc = 1
-while True:
-    try:
-        a, b = [int(d) for d in input().split()]
-    except:
-        break
-
-    offset_a, offset_b = offset(a, 365), offset(b, 687)
-
-    if offset_a == offset_b:
-        print(f"Case {cc}:", offset_a)
-    else:
-        t = offset_a
-        while True:
-            t += 365
-            if (offset(t, 687) + offset_b) % 687 == 0:
-                break
-        print(f"Case {cc}:", t)
-
-    cc += 1
-
 
 
 
 
 
🟢 Hello World!
 
 Solutions in 8 languages 
 
 
 
 1
+10
l, h = [int(d) for d in input().split()]
+total = 0
+for i in range(l, h + 1):
+    digits = set(str(i))
+    if len(digits) != 6 or "0" in digits:
+        continue
+    if not all([i % int(d) == 0 for d in digits]):
+        continue
+    total += 1
+print(total)
+
 
 
 
 
 
🟢 Heliocentric
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -5140,115 +5124,123 @@
  7
  8
  9
-10
#include <iostream>
-
-using namespace std;
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
def offset(d, b):
+    return (b - d % b) % b
+
 
-int main()
-{
-    cout << "Hello World!" << endl;
-
-    return 0;
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
package main
+cc = 1
+while True:
+    try:
+        a, b = [int(d) for d in input().split()]
+    except:
+        break
+
+    offset_a, offset_b = offset(a, 365), offset(b, 687)
+
+    if offset_a == offset_b:
+        print(f"Case {cc}:", offset_a)
+    else:
+        t = offset_a
+        while True:
+            t += 365
+            if (offset(t, 687) + offset_b) % 687 == 0:
+                break
+        print(f"Case {cc}:", t)
+
+    cc += 1
+
 
 
 
 
 
🟢 Hello World!
 
 Solutions in 8 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
#include <iostream>
 
-import "fmt"
+using namespace std;
 
-func main() {
-    fmt.Println("Hello World!")
-}
-
 
 
 
1
main = putStrLn "Hello World!"
-
 
 
 
1
-2
-3
-4
-5
class HelloWorld {
-    public static void main(String[] args) {
-        System.out.println("Hello World!");
-    }
-}
-
 
 
 
1
console.log("Hello World!");
-
 
 
 
1
-2
-3
fun main() {
-    println("Hello World!")
-}
-
 
 
 
1
print("Hello World!")
-
 
 
 
1
-2
-3
fn main() {
-    println!("Hello World!");
-}
-
 
 
 
 
 
🟢 Help a PhD candidate out!
 
 Solution in Python 
 
 
 
1
+int main()
+{
+    cout << "Hello World!" << endl;
+
+    return 0;
+}
+
 
 
 
1
+2
+3
+4
+5
+6
+7
package main
+
+import "fmt"
+
+func main() {
+    fmt.Println("Hello World!")
+}
+
 
 
 
1
main = putStrLn "Hello World!"
+
 
 
 
1
+2
+3
+4
+5
class HelloWorld {
+    public static void main(String[] args) {
+        System.out.println("Hello World!");
+    }
+}
+
 
 
 
1
console.log("Hello World!");
+
 
 
 
1
+2
+3
fun main() {
+    println("Hello World!")
+}
+
 
 
 
1
print("Hello World!")
+
 
 
 
1
 2
-3
-4
-5
-6
-7
-8
n = int(input())
-for _ in range(n):
-    line = input()
-    parts = line.split("+")
-    if len(parts) == 1:
-        print("skipped")
-    else:
-        print(int(parts[0]) + int(parts[1]))
-
 
 
 
 
 
🟢 Herman
 
 Solution in Python 
 
 
 
1
+3
fn main() {
+    println!("Hello World!");
+}
+
 
 
 
 
 
🟢 Help a PhD candidate out!
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
import math
-
-r = int(input())
-print(f"{math.pi*r*r:.6f}")
-print(2 * r * r)
-
 
 
 
 
 
🟢 Hissing Microphone
 
 Solutions in 3 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
#include <iostream>
+5
+6
+7
+8
n = int(input())
+for _ in range(n):
+    line = input()
+    parts = line.split("+")
+    if len(parts) == 1:
+        print("skipped")
+    else:
+        print(int(parts[0]) + int(parts[1]))
+
 
 
 
 
 
🟢 Herman
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
import math
 
-using namespace std;
-
-int main()
-{
-    string a;
-    cin >> a;
-
-    if (a.find("ss") == -1)
-    {
-        cout << "no hiss" << endl;
-    }
-    else
-    {
-        cout << "hiss" << endl;
-    }
-
-    return 0;
-}
-
 
 
 
 1
+r = int(input())
+print(f"{math.pi*r*r:.6f}")
+print(2 * r * r)
+
 
 
 
 
 
🟢 Hissing Microphone
 
 Solutions in 3 languages 
 
 
 
 1
  2
  3
  4
@@ -5257,147 +5249,165 @@
  7
  8
  9
-10
const readline = require("readline");
-const rl = readline.createInterface(process.stdin, process.stdout);
-
-rl.question("", (line) => {
-  if (line.includes("ss")) {
-    console.log("hiss");
-  } else {
-    console.log("no hiss");
-  }
-});
-
 
 
 
1
-2
-3
-4
-5
a = input()
-if "ss" in a:
-    print("hiss")
-else:
-    print("no hiss")
-
 
 
 
 
 
🟢 Hitting the Targets
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
def in_rectangle(x1, y1, x2, y2, x, y):
-    x1, x2 = min(x1, x2), max(x1, x2)
-    y1, y2 = min(y1, y2), max(y1, y2)
-    if x in range(x1, x2 + 1) and y in range(y1, y2 + 1):
-        return True
-    else:
-        return False
-
-
-def in_circle(x0, y0, r, x, y):
-    return (x0 - x) ** 2 + (y0 - y) ** 2 <= r**2
-
-
-m = int(input())
-shapes = []
-for _ in range(m):
-    values = input().split()
-    shapes.append((values[0], *[int(d) for d in values[1:]]))
-
-n = int(input())
-for _ in range(n):
-    total = 0
-    x, y = [int(d) for d in input().split()]
-    for shape in shapes:
-        if shape[0] == "rectangle":
-            total += in_rectangle(*shape[1:], x, y)
-        elif shape[0] == "circle":
-            total += in_circle(*shape[1:], x, y)
-    print(total)
-
 
 
 
 
 
🟢 Hot Hike
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
n = int(input())
-t = [int(d) for d in input().split()]
-order = sorted(range(n - 2), key=lambda k: max(t[k], t[k + 2]))
-d = order[0]
-v = max(t[d], t[d + 2])
-print(d + 1, v)
-
 
 
 
 
 
🟢 Hraðgreining
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
package main
-
-import (
-    "fmt"
-    "strings"
-)
-
-func main() {
-    var s string
-    fmt.Scan(&s)
-    if strings.Contains(s, "COV") {
-        fmt.Println("Veikur!")
-    } else {
-        fmt.Println("Ekki veikur!")
-    }
-}
-
 
 
 
1
print("Veikur!" if "COV" in input() else "Ekki veikur!")
-
 
 
 
 
 
🟢 The Amazing Human Cannonball
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
import math
-
-for _ in range(int(input())):
-    v0, a, x1, h1, h2 = [float(d) for d in input().split()]
-    a = math.radians(a)
-    t = x1 / (v0 * math.cos(a))
-    y = v0 * t * math.sin(a) - 0.5 * 9.81 * (t**2)
-    if y < h1 + 1 or y > h2 - 1:
-        print("Not Safe")
-    else:
-        print("Safe")
-
 
 
 
 
 
🟢 Hvert Skal Mæta?
 
 Solution in Python 
 
 
 
 1
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    string a;
+    cin >> a;
+
+    if (a.find("ss") == -1)
+    {
+        cout << "no hiss" << endl;
+    }
+    else
+    {
+        cout << "hiss" << endl;
+    }
+
+    return 0;
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
const readline = require("readline");
+const rl = readline.createInterface(process.stdin, process.stdout);
+
+rl.question("", (line) => {
+  if (line.includes("ss")) {
+    console.log("hiss");
+  } else {
+    console.log("no hiss");
+  }
+});
+
 
 
 
1
+2
+3
+4
+5
a = input()
+if "ss" in a:
+    print("hiss")
+else:
+    print("no hiss")
+
 
 
 
 
 
🟢 Hitting the Targets
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
def in_rectangle(x1, y1, x2, y2, x, y):
+    x1, x2 = min(x1, x2), max(x1, x2)
+    y1, y2 = min(y1, y2), max(y1, y2)
+    if x in range(x1, x2 + 1) and y in range(y1, y2 + 1):
+        return True
+    else:
+        return False
+
+
+def in_circle(x0, y0, r, x, y):
+    return (x0 - x) ** 2 + (y0 - y) ** 2 <= r**2
+
+
+m = int(input())
+shapes = []
+for _ in range(m):
+    values = input().split()
+    shapes.append((values[0], *[int(d) for d in values[1:]]))
+
+n = int(input())
+for _ in range(n):
+    total = 0
+    x, y = [int(d) for d in input().split()]
+    for shape in shapes:
+        if shape[0] == "rectangle":
+            total += in_rectangle(*shape[1:], x, y)
+        elif shape[0] == "circle":
+            total += in_circle(*shape[1:], x, y)
+    print(total)
+
 
 
 
 
 
🟢 Hot Hike
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
n = int(input())
+t = [int(d) for d in input().split()]
+order = sorted(range(n - 2), key=lambda k: max(t[k], t[k + 2]))
+d = order[0]
+v = max(t[d], t[d + 2])
+print(d + 1, v)
+
 
 
 
 
 
🟢 Hraðgreining
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
package main
+
+import (
+    "fmt"
+    "strings"
+)
+
+func main() {
+    var s string
+    fmt.Scan(&s)
+    if strings.Contains(s, "COV") {
+        fmt.Println("Veikur!")
+    } else {
+        fmt.Println("Ekki veikur!")
+    }
+}
+
 
 
 
1
print("Veikur!" if "COV" in input() else "Ekki veikur!")
+
 
 
 
 
 
🟢 The Amazing Human Cannonball
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -5407,359 +5417,345 @@
  8
  9
 10
-11
-12
-13
-14
-15
mapping = {
-    "Reykjavik": "Reykjavik",
-    "Kopavogur": "Reykjavik",
-    "Hafnarfjordur": "Reykjavik",
-    "Reykjanesbaer": "Reykjavik",
-    "Akureyri": "Akureyri",
-    "Gardabaer": "Reykjavik",
-    "Mosfellsbaer": "Reykjavik",
-    "Arborg": "Reykjavik",
-    "Akranes": "Reykjavik",
-    "Fjardabyggd": "Akureyri",
-    "Mulathing": "Akureyri",
-    "Seltjarnarnes": "Reykjavik",
-}
-print(mapping[input()])
-
 
 
 
 
 
🟢 ICPC Awards
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
n = int(input())
-shown = {}
-for _ in range(n):
-    u, t = input().split()
-    if u not in shown and len(shown.keys()) < 12:
-        print(u, t)
-        shown[u] = True
-
 
 
 
 
 
🟢 Illuminati Spotti
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
n = int(input())
-m = []
+11
import math
+
+for _ in range(int(input())):
+    v0, a, x1, h1, h2 = [float(d) for d in input().split()]
+    a = math.radians(a)
+    t = x1 / (v0 * math.cos(a))
+    y = v0 * t * math.sin(a) - 0.5 * 9.81 * (t**2)
+    if y < h1 + 1 or y > h2 - 1:
+        print("Not Safe")
+    else:
+        print("Safe")
+
 
 
 
 
 
🟢 Hvert Skal Mæta?
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
mapping = {
+    "Reykjavik": "Reykjavik",
+    "Kopavogur": "Reykjavik",
+    "Hafnarfjordur": "Reykjavik",
+    "Reykjanesbaer": "Reykjavik",
+    "Akureyri": "Akureyri",
+    "Gardabaer": "Reykjavik",
+    "Mosfellsbaer": "Reykjavik",
+    "Arborg": "Reykjavik",
+    "Akranes": "Reykjavik",
+    "Fjardabyggd": "Akureyri",
+    "Mulathing": "Akureyri",
+    "Seltjarnarnes": "Reykjavik",
+}
+print(mapping[input()])
+
 
 
 
 
 
🟢 ICPC Awards
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
n = int(input())
+shown = {}
 for _ in range(n):
-    m.append(input().split())
-total = 0
-for i in range(1, n - 1):
-    for j in range(i):
-        for k in range(i + 1, n):
-            if m[i][j] == m[k][j] == m[k][i] == "1":
-                total += 1
-print(total)
-
 
 
 
 
 
🟡 Inheritance
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
from itertools import product
-
-p = input()
-ans = []
-for i in range(len(p)):
-    for t in product("24", repeat=i + 1):
-        if int(p) % int("".join(t)) == 0:
-            ans.append(int("".join(t)))
-print("\n".join([str(d) for d in sorted(ans)]))
-
 
 
 
 
 
🟢 International Dates
 
 Solution in Python 
 
 
 
1
+    u, t = input().split()
+    if u not in shown and len(shown.keys()) < 12:
+        print(u, t)
+        shown[u] = True
+
 
 
 
 
 
🟢 Illuminati Spotti
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
n = int(input())
+m = []
+for _ in range(n):
+    m.append(input().split())
+total = 0
+for i in range(1, n - 1):
+    for j in range(i):
+        for k in range(i + 1, n):
+            if m[i][j] == m[k][j] == m[k][i] == "1":
+                total += 1
+print(total)
+
 
 
 
 
 
🟡 Inheritance
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
 7
-8
aa, bb, _ = [int(d) for d in input().split("/")]
+8
+9
from itertools import product
 
-if aa > 12 and bb <= 12:
-    print("EU")
-elif aa <= 12 and bb > 12:
-    print("US")
-else:
-    print("either")
-
 
 
 
 
 
🟢 IsItHalloween.com
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
package main
+p = input()
+ans = []
+for i in range(len(p)):
+    for t in product("24", repeat=i + 1):
+        if int(p) % int("".join(t)) == 0:
+            ans.append(int("".join(t)))
+print("\n".join([str(d) for d in sorted(ans)]))
+
 
 
 
 
 
🟢 International Dates
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
aa, bb, _ = [int(d) for d in input().split("/")]
 
-import "fmt"
-
-func main() {
-    var m, d string
-    fmt.Scan(&m)
-    fmt.Scan(&d)
-    if (m == "OCT" && d == "31") || (m == "DEC" && d == "25") {
-        fmt.Println("yup")
-    } else {
-        fmt.Println("nope")
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
m, d = input().split()
-if (m == "OCT" and d == "31") or (m == "DEC" and d == "25"):
-    print("yup")
-else:
-    print("nope")
-
 
 
 
 
 
🟢 Jabuke
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
xa, ya = [int(d) for d in input().split()]
-xb, yb = [int(d) for d in input().split()]
-xc, yc = [int(d) for d in input().split()]
-n = int(input())
-area = abs(xa * (yb - yc) + xb * (yc - ya) + xc * (ya - yb)) / 2
-print(f"{area:.1f}")
-
-
-def sign(x1, y1, x2, y2, x3, y3):
-    return (x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3)
-
-
-def in_triangle(x, y, x1, y1, x2, y2, x3, y3):
-    d1 = sign(x, y, x1, y1, x2, y2)
-    d2 = sign(x, y, x2, y2, x3, y3)
-    d3 = sign(x, y, x3, y3, x1, y1)
-
-    has_neg = d1 < 0 or d2 < 0 or d3 < 0
-    has_pos = d1 > 0 or d2 > 0 or d3 > 0
-
-    return not (has_neg and has_pos)
-
-
-total = 0
-for _ in range(n):
-    x, y = [int(d) for d in input().split()]
-    if in_triangle(x, y, xa, ya, xb, yb, xc, yc):
-        total += 1
-print(total)
-
 
 
 
 
 
🟢 Jack-O'-Lantern Juxtaposition
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
numbers = [int(n) for n in input().split()]
-result = 1
-for n in numbers:
-    result *= n
-print(result)
-
 
 
 
 
 
🟢 Janitor Troubles
 
 Solution in Python 
 
 
 
1
+if aa > 12 and bb <= 12:
+    print("EU")
+elif aa <= 12 and bb > 12:
+    print("US")
+else:
+    print("either")
+
 
 
 
 
 
🟢 IsItHalloween.com
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
package main
+
+import "fmt"
+
+func main() {
+    var m, d string
+    fmt.Scan(&m)
+    fmt.Scan(&d)
+    if (m == "OCT" && d == "31") || (m == "DEC" && d == "25") {
+        fmt.Println("yup")
+    } else {
+        fmt.Println("nope")
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
m, d = input().split()
+if (m == "OCT" and d == "31") or (m == "DEC" and d == "25"):
+    print("yup")
+else:
+    print("nope")
+
 
 
 
 
 
🟢 Jabuke
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
xa, ya = [int(d) for d in input().split()]
+xb, yb = [int(d) for d in input().split()]
+xc, yc = [int(d) for d in input().split()]
+n = int(input())
+area = abs(xa * (yb - yc) + xb * (yc - ya) + xc * (ya - yb)) / 2
+print(f"{area:.1f}")
+
+
+def sign(x1, y1, x2, y2, x3, y3):
+    return (x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3)
+
+
+def in_triangle(x, y, x1, y1, x2, y2, x3, y3):
+    d1 = sign(x, y, x1, y1, x2, y2)
+    d2 = sign(x, y, x2, y2, x3, y3)
+    d3 = sign(x, y, x3, y3, x1, y1)
+
+    has_neg = d1 < 0 or d2 < 0 or d3 < 0
+    has_pos = d1 > 0 or d2 > 0 or d3 > 0
+
+    return not (has_neg and has_pos)
+
+
+total = 0
+for _ in range(n):
+    x, y = [int(d) for d in input().split()]
+    if in_triangle(x, y, xa, ya, xb, yb, xc, yc):
+        total += 1
+print(total)
+
 
 
 
 
 
🟢 Jack-O'-Lantern Juxtaposition
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
import math
-
-a, b, c, d = [int(d) for d in input().split()]
-s = (a + b + c + d) / 2
-print(math.sqrt((s - a) * (s - b) * (s - c) * (s - d)))
-
 
 
 
 
 
🟢 Jewelry Box
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
def f(h):
-    a = x - 2 * h
-    b = y - 2 * h
-    return a * b * h
-
-
-for _ in range(int(input())):
-    x, y = [int(d) for d in input().split()]
-    h = (x + y - ((x + y) ** 2 - 3 * x * y) ** 0.5) / 6
-    print(f"{f(h):.11f}")
-
 
 
 
 
 
🟢 Job Expenses
 
 Solution in Python 
 
 
 
1
-2
_ = input()
-print(-sum([int(d) for d in input().split() if "-" in d]))
-
 
 
 
 
 
🟢 Joint Jog Jam
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
import math
-
-
-def dist(x1, y1, x2, y2):
-    return math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)
-
-
-coords = [int(d) for d in input().split()]
-print(max(dist(*coords[:4]), dist(*coords[4:])))
-
 
 
 
 
 
🟢 Judging Moose
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
package main
+5
numbers = [int(n) for n in input().split()]
+result = 1
+for n in numbers:
+    result *= n
+print(result)
+
 
 
 
 
 
🟢 Janitor Troubles
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
import math
+
+a, b, c, d = [int(d) for d in input().split()]
+s = (a + b + c + d) / 2
+print(math.sqrt((s - a) * (s - b) * (s - c) * (s - d)))
+
 
 
 
 
 
🟢 Jewelry Box
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
def f(h):
+    a = x - 2 * h
+    b = y - 2 * h
+    return a * b * h
+
+
+for _ in range(int(input())):
+    x, y = [int(d) for d in input().split()]
+    h = (x + y - ((x + y) ** 2 - 3 * x * y) ** 0.5) / 6
+    print(f"{f(h):.11f}")
+
 
 
 
 
 
🟢 Job Expenses
 
 Solution in Python 
 
 
 
1
+2
_ = input()
+print(-sum([int(d) for d in input().split() if "-" in d]))
+
 
 
 
 
 
🟢 Joint Jog Jam
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
import math
 
-import "fmt"
-
-func main() {
-    var l, r int
-    fmt.Scan(&l)
-    fmt.Scan(&r)
-    if l == 0 && r == 0 {
-        fmt.Println("Not a moose")
-    } else {
-        p := 2 * l
-        if r > l {
-            p = 2 * r
-        }
-        t := "Odd"
-        if l == r {
-            t = "Even"
-        }
-        fmt.Println(t, p)
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
l, r = [int(d) for d in input().split()]
-if not l and not r:
-    print("Not a moose")
-else:
-    p = 2 * max(l, r)
-    print("Odd" if l != r else "Even", p)
-
 
 
 
 
 
🟢 Jumbo Javelin
 
 Solution in Python 
 
 
 
1
+
+def dist(x1, y1, x2, y2):
+    return math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)
+
+
+coords = [int(d) for d in input().split()]
+print(max(dist(*coords[:4]), dist(*coords[4:])))
+
 
 
 
 
 
🟢 Judging Moose
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
package main
+
+import "fmt"
+
+func main() {
+    var l, r int
+    fmt.Scan(&l)
+    fmt.Scan(&r)
+    if l == 0 && r == 0 {
+        fmt.Println("Not a moose")
+    } else {
+        p := 2 * l
+        if r > l {
+            p = 2 * r
+        }
+        t := "Odd"
+        if l == r {
+            t = "Even"
+        }
+        fmt.Println(t, p)
+    }
+}
+
 
 
 
1
 2
 3
 4
 5
-6
n = int(input())
-length = 0
-for _ in range(n):
-    length += int(input())
-length -= n - 1
-print(length)
-
 
 
 
 
 
🟢 Just a Minute
 
 Solution in Python 
 
 
 
1
+6
l, r = [int(d) for d in input().split()]
+if not l and not r:
+    print("Not a moose")
+else:
+    p = 2 * max(l, r)
+    print("Odd" if l != r else "Even", p)
+
 
 
 
 
 
🟢 Jumbo Javelin
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
-7
-8
-9
a, b = [], []
-for _ in range(int(input())):
-    x, y = [int(d) for d in input().split()]
-    a.append(x * 60)
-    b.append(y)
-ans = sum(b) / sum(a)
-if ans <= 1:
-    ans = "measurement error"
-print(ans)
-
 
 
 
 
 
🟡 Running Race
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
l, k, _ = [int(d) for d in input().split()]
-
-record = {}
-for _ in range(l):
-    i, t = input().split()
-    mm, ss = [int(d) for d in t.split(".")]
-    s = mm * 60 + ss
-    if i in record:
-        record[i].append(s)
-    else:
-        record[i] = [s]
-
-delete = [i for i in record if len(record[i]) != k]
-for i in delete:
-    record.pop(i)
-
-sorted_i = sorted(record, key=lambda i: (sum(record[i]), int(i)))
-print("\n".join(sorted_i))
-
 
 
 
 
 
🟢 Karte
 
 Solution in Python 
 
 
 
 1
+6
n = int(input())
+length = 0
+for _ in range(n):
+    length += int(input())
+length -= n - 1
+print(length)
+
 
 
 
 
 
🟢 Just a Minute
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
a, b = [], []
+for _ in range(int(input())):
+    x, y = [int(d) for d in input().split()]
+    a.append(x * 60)
+    b.append(y)
+ans = sum(b) / sum(a)
+if ans <= 1:
+    ans = "measurement error"
+print(ans)
+
 
 
 
 
 
🟡 Running Race
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -5776,33 +5772,25 @@
 15
 16
 17
-18
-19
-20
-21
-22
from collections import Counter
+18
l, k, _ = [int(d) for d in input().split()]
 
-s = input()
-cards = {
-    "P": Counter(),
-    "K": Counter(),
-    "H": Counter(),
-    "T": Counter(),
-}
-duplicated = False
-for i in range(0, len(s), 3):
-    suit = s[i]
-    card = s[i + 1 : i + 3]
-    if cards[suit][card]:
-        duplicated = True
-        break
-    cards[suit][card] += 1
-
-if not duplicated:
-    print(" ".join([str(13 - len(c)) for c in cards.values()]))
-else:
-    print("GRESKA")
-
 
 
 
 
 
🟢 Kemija
 
 Solutions in 2 languages 
 
 
 
 1
+record = {}
+for _ in range(l):
+    i, t = input().split()
+    mm, ss = [int(d) for d in t.split(".")]
+    s = mm * 60 + ss
+    if i in record:
+        record[i].append(s)
+    else:
+        record[i] = [s]
+
+delete = [i for i in record if len(record[i]) != k]
+for i in delete:
+    record.pop(i)
+
+sorted_i = sorted(record, key=lambda i: (sum(record[i]), int(i)))
+print("\n".join(sorted_i))
+
 
 
 
 
 
🟢 Karte
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -5811,125 +5799,125 @@
  7
  8
  9
-10
const readline = require("readline");
-const rl = readline.createInterface(process.stdin, process.stdout);
-
-rl.question("", (line) => {
-  for (let c of "aeiou") {
-    const regex = new RegExp(`${c}p${c}`, "g");
-    line = line.replace(regex, c);
-  }
-  console.log(line);
-});
-
 
 
 
1
-2
-3
-4
-5
-6
s = input()
-
-for c in "aeiou":
-    s = s.replace(f"{c}p{c}", c)
-
-print(s)
-
 
 
 
 
 
🟢 The Key to Cryptography
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
import string
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
from collections import Counter
+
+s = input()
+cards = {
+    "P": Counter(),
+    "K": Counter(),
+    "H": Counter(),
+    "T": Counter(),
+}
+duplicated = False
+for i in range(0, len(s), 3):
+    suit = s[i]
+    card = s[i + 1 : i + 3]
+    if cards[suit][card]:
+        duplicated = True
+        break
+    cards[suit][card] += 1
+
+if not duplicated:
+    print(" ".join([str(13 - len(c)) for c in cards.values()]))
+else:
+    print("GRESKA")
+
 
 
 
 
 
🟢 Kemija
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
const readline = require("readline");
+const rl = readline.createInterface(process.stdin, process.stdout);
+
+rl.question("", (line) => {
+  for (let c of "aeiou") {
+    const regex = new RegExp(`${c}p${c}`, "g");
+    line = line.replace(regex, c);
+  }
+  console.log(line);
+});
+
 
 
 
1
+2
+3
+4
+5
+6
s = input()
 
-uppers = string.ascii_uppercase
-
+for c in "aeiou":
+    s = s.replace(f"{c}p{c}", c)
 
-def decrypt(c, k):
-    index = (uppers.index(c) - uppers.index(k)) % 26
-    return uppers[index]
-
-
-m, w = input(), input()
-
-size_w = len(w)
-size_m = len(m)
-o = []
-for i in range(0, size_m, size_w):
-    if i + size_w < size_m:
-        l = zip(m[i : i + size_w], w)
-    else:
-        l = zip(m[i:], w)
-    t = "".join([decrypt(c, k) for c, k in l])
-    o.append(t)
-    w = t
-print("".join(o))
-
 
 
 
 
 
🟢 Keywords
 
 Solution in Python 
 
 
 
1
-2
-3
-4
keywords = set()
-for _ in range(int(input())):
-    keywords.add(input().lower().replace("-", " "))
-print(len(keywords))
-
 
 
 
 
 
🟢 Kitten on a Tree
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
k = input()
-b = []
-while True:
-    line = input()
-    if line == "-1":
-        break
-    b.append(line.split())
-
-p = [k]
-t = k
-while True:
-    found = False
-    for row in b:
-        if t in row[1:]:
-            p.append(row[0])
-            found = True
-            t = row[0]
-            break
-    if not found:
-        break
-
-print(" ".join(p))
-
 
 
 
 
 
🟢 Kleptography
 
 Solution in Python 
 
 
 
 1
+print(s)
+
 
 
 
 
 
🟢 The Key to Cryptography
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
import string
+
+uppers = string.ascii_uppercase
+
+
+def decrypt(c, k):
+    index = (uppers.index(c) - uppers.index(k)) % 26
+    return uppers[index]
+
+
+m, w = input(), input()
+
+size_w = len(w)
+size_m = len(m)
+o = []
+for i in range(0, size_m, size_w):
+    if i + size_w < size_m:
+        l = zip(m[i : i + size_w], w)
+    else:
+        l = zip(m[i:], w)
+    t = "".join([decrypt(c, k) for c, k in l])
+    o.append(t)
+    w = t
+print("".join(o))
+
 
 
 
 
 
🟢 Keywords
 
 Solution in Python 
 
 
 
1
+2
+3
+4
keywords = set()
+for _ in range(int(input())):
+    keywords.add(input().lower().replace("-", " "))
+print(len(keywords))
+
 
 
 
 
 
🟢 Kitten on a Tree
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -5949,134 +5937,128 @@
 18
 19
 20
-21
from string import ascii_lowercase as l
-
-
-n, m = [int(d) for d in input().split()]
-p = input()
-c = input()
-p = p[::-1]
-c = c[::-1]
-
-ans = ""
-for i in range(0, m, n):
-    if i + n < m:
-        part = c[i : i + n]
-    else:
-        part = c[i:]
-
-    ans += p
-    p = "".join([l[(l.index(a) - l.index(b)) % 26] for a, b in zip(part, p)])
-
-ans += p
-print(ans[::-1][n:])
-
 
 
 
 
 
🟢 Knight Packing
 
 Solution in Python 
 
 
 
1
-2
-3
-4
if int(input()) % 2:
-    print("first")
-else:
-    print("second")
-
 
 
 
 
 
🟢 Knot Knowledge
 
 Solution in Python 
 
 
 
1
+21
+22
k = input()
+b = []
+while True:
+    line = input()
+    if line == "-1":
+        break
+    b.append(line.split())
+
+p = [k]
+t = k
+while True:
+    found = False
+    for row in b:
+        if t in row[1:]:
+            p.append(row[0])
+            found = True
+            t = row[0]
+            break
+    if not found:
+        break
+
+print(" ".join(p))
+
 
 
 
 
 
🟢 Kleptography
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
from string import ascii_lowercase as l
+
+
+n, m = [int(d) for d in input().split()]
+p = input()
+c = input()
+p = p[::-1]
+c = c[::-1]
+
+ans = ""
+for i in range(0, m, n):
+    if i + n < m:
+        part = c[i : i + n]
+    else:
+        part = c[i:]
+
+    ans += p
+    p = "".join([l[(l.index(a) - l.index(b)) % 26] for a, b in zip(part, p)])
+
+ans += p
+print(ans[::-1][n:])
+
 
 
 
 
 
🟢 Knight Packing
 
 Solution in Python 
 
 
 
1
 2
 3
-4
input()
-total = set(input().split())
-known = set(input().split())
-print((total - known).pop())
-
 
 
 
 
 
🟢 Kornislav
 
 Solution in Python 
 
 
 
1
-2
numbers = sorted([int(d) for d in input().split()])
-print(numbers[0] * numbers[2])
-
 
 
 
 
 
🟢 Križaljka
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
a, b = input().split()
-for i in range(len(a)):
-    if a[i] in b:
-        j = b.index(a[i])
-        break
-
-rows = []
-
-for k in range(j):
-    rows.append("." * i + b[k] + "." * (len(a) - i - 1))
-
-rows.append(a)
-
-for k in range(j + 1, len(b)):
-    rows.append("." * i + b[k] + "." * (len(a) - i - 1))
-
-print("\n".join(rows))
-
 
 
 
 
 
🟢 Ladder
 
 Solution in Python 
 
 
 
1
-2
-3
-4
import math
-
-h, v = [int(d) for d in input().split()]
-print(math.ceil(h / math.sin(math.radians(v))))
-
 
 
 
 
 
🟢 Lamps
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
h, p = [int(d) for d in input().split()]
+4
if int(input()) % 2:
+    print("first")
+else:
+    print("second")
+
 
 
 
 
 
🟢 Knot Knowledge
 
 Solution in Python 
 
 
 
1
+2
+3
+4
input()
+total = set(input().split())
+known = set(input().split())
+print((total - known).pop())
+
 
 
 
 
 
🟢 Kornislav
 
 Solution in Python 
 
 
 
1
+2
numbers = sorted([int(d) for d in input().split()])
+print(numbers[0] * numbers[2])
+
 
 
 
 
 
🟢 Križaljka
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
a, b = input().split()
+for i in range(len(a)):
+    if a[i] in b:
+        j = b.index(a[i])
+        break
+
+rows = []
+
+for k in range(j):
+    rows.append("." * i + b[k] + "." * (len(a) - i - 1))
+
+rows.append(a)
+
+for k in range(j + 1, len(b)):
+    rows.append("." * i + b[k] + "." * (len(a) - i - 1))
+
+print("\n".join(rows))
+
 
 
 
 
 
🟢 Ladder
 
 Solution in Python 
 
 
 
1
+2
+3
+4
import math
 
-days = 0
-cost_bulb, cost_lamp = 5, 60
-used_bulb, used_lamp = 0, 0
-
-while True:
-    days += 1
-    cost_bulb += 60 * h * p / 100000
-    cost_lamp += 11 * h * p / 100000
-    used_bulb += h
-    used_lamp += h
-
-    if used_bulb > 1000:
-        cost_bulb += 5
-        used_bulb -= 1000
-
-    if used_lamp > 8000:
-        cost_lamp += 60
-        used_lamp -= 8000
-
-    if cost_bulb > cost_lamp:
-        break
-
-print(days)
-
 
 
 
 
 
🟢 Laptop Sticker
 
 Solutions in 3 languages 
 
 
 
 1
+h, v = [int(d) for d in input().split()]
+print(math.ceil(h / math.sin(math.radians(v))))
+
 
 
 
 
 
🟢 Lamps
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6093,25 +6075,39 @@
 15
 16
 17
-18
#include <iostream>
+18
+19
+20
+21
+22
+23
+24
+25
h, p = [int(d) for d in input().split()]
 
-using namespace std;
-
-int main()
-{
-    int wc, hc, ws, hs;
-    cin >> wc >> hc >> ws >> hs;
-    if (wc - 2 >= ws && hc - 2 >= hs)
-    {
-        cout << 1 << endl;
-    }
-    else
-    {
-        cout << 0 << endl;
-    }
-    return 0;
-}
-
 
 
 
 1
+days = 0
+cost_bulb, cost_lamp = 5, 60
+used_bulb, used_lamp = 0, 0
+
+while True:
+    days += 1
+    cost_bulb += 60 * h * p / 100000
+    cost_lamp += 11 * h * p / 100000
+    used_bulb += h
+    used_lamp += h
+
+    if used_bulb > 1000:
+        cost_bulb += 5
+        used_bulb -= 1000
+
+    if used_lamp > 8000:
+        cost_lamp += 60
+        used_lamp -= 8000
+
+    if cost_bulb > cost_lamp:
+        break
+
+print(days)
+
 
 
 
 
 
🟢 Laptop Sticker
 
 Solutions in 3 languages 
 
 
 
 1
  2
  3
  4
@@ -6128,94 +6124,84 @@
 15
 16
 17
-18
-19
-20
package main
+18
#include <iostream>
 
-import "fmt"
+using namespace std;
 
-func main() {
-    var wc, hc, ws, hs int
-    fmt.Scan(&wc)
-    fmt.Scan(&hc)
-    fmt.Scan(&ws)
-    fmt.Scan(&hs)
-    if wc-2 >= ws && hc-2 >= hs {
-
-        fmt.Println(1)
-
-    } else {
-
-        fmt.Println(0)
-
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
wc, hc, ws, hs = [int(d) for d in input().split()]
-if wc - 2 >= ws and hc - 2 >= hs:
-    print(1)
-else:
-    print(0)
-
 
 
 
 
 
🟢 Last Factorial Digit
 
 Solution in Python 
 
 
 
1
+int main()
+{
+    int wc, hc, ws, hs;
+    cin >> wc >> hc >> ws >> hs;
+    if (wc - 2 >= ws && hc - 2 >= hs)
+    {
+        cout << 1 << endl;
+    }
+    else
+    {
+        cout << 0 << endl;
+    }
+    return 0;
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
package main
+
+import "fmt"
+
+func main() {
+    var wc, hc, ws, hs int
+    fmt.Scan(&wc)
+    fmt.Scan(&hc)
+    fmt.Scan(&ws)
+    fmt.Scan(&hs)
+    if wc-2 >= ws && hc-2 >= hs {
+
+        fmt.Println(1)
+
+    } else {
+
+        fmt.Println(0)
+
+    }
+}
+
 
 
 
1
 2
 3
 4
-5
-6
for _ in range(int(input())):
-    n = int(input())
-    number = 1
-    for i in range(1, n + 1):
-        number *= i
-    print(number % 10)
-
 
 
 
 
 
🟢 Left Beehind
 
 Solutions in 3 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
package main
-
-import "fmt"
-
-func main() {
-    var x, y int
-    for true {
-        fmt.Scan(&x)
-        fmt.Scan(&y)
-        if x == 0 && y == 0 {
-            break
-        }
-        if x+y == 13 {
-            fmt.Println("Never speak again.")
-        } else if x > y {
-            fmt.Println("To the convention.")
-        } else if x == y {
-            fmt.Println("Undecided.")
-        } else {
-            fmt.Println("Left beehind.")
-        }
-    }
-}
-
 
 
 
 1
+5
wc, hc, ws, hs = [int(d) for d in input().split()]
+if wc - 2 >= ws and hc - 2 >= hs:
+    print(1)
+else:
+    print(0)
+
 
 
 
 
 
🟢 Last Factorial Digit
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
for _ in range(int(input())):
+    n = int(input())
+    number = 1
+    for i in range(1, n + 1):
+        number *= i
+    print(number % 10)
+
 
 
 
 
 
🟢 Left Beehind
 
 Solutions in 3 languages 
 
 
 
 1
  2
  3
  4
@@ -6237,26 +6223,26 @@
 20
 21
 22
-23
import java.util.Scanner;
+23
package main
 
-class LeftBeehind {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        while (true) {
-            int x = s.nextInt();
-            int y = s.nextInt();
-            if (x == 0 && y == 0) {
-                break;
-            }
-            if (x + y == 13) {
-                System.out.println("Never speak again.");
-            } else if (x > y) {
-                System.out.println("To the convention.");
-            } else if (x == y) {
-                System.out.println("Undecided.");
-            } else {
-                System.out.println("Left beehind.");
-            }
+import "fmt"
+
+func main() {
+    var x, y int
+    for true {
+        fmt.Scan(&x)
+        fmt.Scan(&y)
+        if x == 0 && y == 0 {
+            break
+        }
+        if x+y == 13 {
+            fmt.Println("Never speak again.")
+        } else if x > y {
+            fmt.Println("To the convention.")
+        } else if x == y {
+            fmt.Println("Undecided.")
+        } else {
+            fmt.Println("Left beehind.")
         }
     }
 }
@@ -6271,54 +6257,74 @@
  9
 10
 11
-12
while True:
-    x, y = [int(d) for d in input().split()]
-    if not x and not y:
-        break
-    if x + y == 13:
-        print("Never speak again.")
-    elif x > y:
-        print("To the convention.")
-    elif x == y:
-        print("Undecided.")
-    else:
-        print("Left beehind.")
-
 
 
 
 
 
🟢 Leggja saman
 
 Solution in Python 
 
 
 
1
-2
-3
m = int(input())
-n = int(input())
-print(m + n)
-
 
 
 
 
 
🟢 License to Launch
 
 Solution in Python 
 
 
 
1
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
import java.util.Scanner;
+
+class LeftBeehind {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        while (true) {
+            int x = s.nextInt();
+            int y = s.nextInt();
+            if (x == 0 && y == 0) {
+                break;
+            }
+            if (x + y == 13) {
+                System.out.println("Never speak again.");
+            } else if (x > y) {
+                System.out.println("To the convention.");
+            } else if (x == y) {
+                System.out.println("Undecided.");
+            } else {
+                System.out.println("Left beehind.");
+            }
+        }
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
while True:
+    x, y = [int(d) for d in input().split()]
+    if not x and not y:
+        break
+    if x + y == 13:
+        print("Never speak again.")
+    elif x > y:
+        print("To the convention.")
+    elif x == y:
+        print("Undecided.")
+    else:
+        print("Left beehind.")
+
 
 
 
 
 
🟢 Leggja saman
 
 Solution in Python 
 
 
 
1
 2
-3
_ = input()
-junks = [int(d) for d in input().split()]
-print(junks.index(min(junks)))
-
 
 
 
 
 
🟢 Line Them Up
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
n = int(input())
-names = []
-for _ in range(n):
-    names.append(input())
-order = []
-for i in range(1, n):
-    order.append(names[i] > names[i - 1])
-if all(order):
-    print("INCREASING")
-elif not any(order):
-    print("DECREASING")
-else:
-    print("NEITHER")
-
 
 
 
 
 
🟡 A List Game
 
 Solution in Python 
 
 
 
 1
+3
m = int(input())
+n = int(input())
+print(m + n)
+
 
 
 
 
 
🟢 License to Launch
 
 Solution in Python 
 
 
 
1
+2
+3
_ = input()
+junks = [int(d) for d in input().split()]
+print(junks.index(min(junks)))
+
 
 
 
 
 
🟢 Line Them Up
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6330,152 +6336,158 @@
 10
 11
 12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
import math
-
-x = int(input())
-
-p = 1
-total = 0
-
-while x % 2 == 0:
-    p = 2
-    x /= 2
-    total += 1
-
-
-for i in range(3, math.ceil(math.sqrt(x)) + 1, 2):
-    while x % i == 0:
-        p = i
-        x /= i
-        total += 1
-if x > 1:
-    total += 1
-
-
-if p == 1:
-    total = 1
-
-
-print(total)
-
 
 
 
 
 
🟢 Locust Locus
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
from math import gcd
+13
n = int(input())
+names = []
+for _ in range(n):
+    names.append(input())
+order = []
+for i in range(1, n):
+    order.append(names[i] > names[i - 1])
+if all(order):
+    print("INCREASING")
+elif not any(order):
+    print("DECREASING")
+else:
+    print("NEITHER")
+
 
 
 
 
 
🟡 A List Game
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
import math
 
-n = int(input())
-l = []
-for _ in range(n):
-    y, c1, c2 = [int(d) for d in input().split()]
-    g = gcd(c1, c2)
-    l.append(y + g * (c1 // g) * (c2 // g))
-print(min(l))
-
 
 
 
 
 
🟢 Logic Functions
 
 Solution in C++ 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
#include "logicfunctions.h"
+x = int(input())
+
+p = 1
+total = 0
+
+while x % 2 == 0:
+    p = 2
+    x /= 2
+    total += 1
+
+
+for i in range(3, math.ceil(math.sqrt(x)) + 1, 2):
+    while x % i == 0:
+        p = i
+        x /= i
+        total += 1
+if x > 1:
+    total += 1
+
+
+if p == 1:
+    total = 1
+
+
+print(total)
+
 
 
 
 
 
🟢 Locust Locus
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
from math import gcd
 
-// 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 = false;
-    }
-    else
-    {
-        ans = true;
-    }
-}
-
-// Compute equivalence
-void equivalence(bool x, bool y, bool &ans)
-{
-    ans = x == y;
-}
-
 
 
 
 
 
🟢 Lost Lineup
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
n = int(input())
-order = [int(d) for d in input().split()]
-d = range(1, n)
-order = dict(zip(d, order))
-ranges = range(1, n + 1)
-result = ["1"]
-for k in sorted(order, key=lambda x: order[x]):
-    result.append(str(ranges[k]))
-print(" ".join(result))
-
 
 
 
 
 
🟢 Luhn's Checksum Algorithm
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
for _ in range(int(input())):
-    n = input()[::-1]
-    checksum = 0
-    for i in range(len(n)):
-        s = int(n[i]) * (i % 2 + 1)
-        if s > 9:
-            s = sum([int(d) for d in str(s)])
-        checksum += s
-
-    print("FAIL" if checksum % 10 else "PASS")
-
 
 
 
 
 
🟢 Magic Trick
 
 Solution in Python 
 
 
 
 1
+n = int(input())
+l = []
+for _ in range(n):
+    y, c1, c2 = [int(d) for d in input().split()]
+    g = gcd(c1, c2)
+    l.append(y + g * (c1 // g) * (c2 // g))
+print(min(l))
+
 
 
 
 
 
🟢 Logic Functions
 
 Solution in C++ 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
#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 = false;
+    }
+    else
+    {
+        ans = true;
+    }
+}
+
+// Compute equivalence
+void equivalence(bool x, bool y, bool &ans)
+{
+    ans = x == y;
+}
+
 
 
 
 
 
🟢 Lost Lineup
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
n = int(input())
+order = [int(d) for d in input().split()]
+d = range(1, n)
+order = dict(zip(d, order))
+ranges = range(1, n + 1)
+result = ["1"]
+for k in sorted(order, key=lambda x: order[x]):
+    result.append(str(ranges[k]))
+print(" ".join(result))
+
 
 
 
 
 
🟢 Luhn's Checksum Algorithm
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6484,69 +6496,39 @@
  7
  8
  9
-10
s = input()
-counter = {}
-guess = 1
-for c in s:
-    if c in counter:
-        guess = 0
-        break
-    else:
-        counter[c] = None
-print(guess)
-
 
 
 
 
 
🟢 Making A Meowth
 
 Solution in Python 
 
 
 
1
-2
n, p, x, y = [int(d) for d in input().split()]
-print(p * x + p // (n - 1) * y)
-
 
 
 
 
 
🟢 Identifying Map Tiles
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
package main
-
-import (
-    "fmt"
-    "math"
-)
-
-func main() {
-    var s string
-    fmt.Scanln(&s)
-    zoom := len(s)
-    var x, y float64
-    for i := 0; i < zoom; i++ {
-        d := math.Pow(2, float64(zoom)-float64(i)-1)
-        if s[i] == '1' {
-            x += d
-        } else if s[i] == '2' {
-            y += d
-        } else if s[i] == '3' {
-            x += d
-            y += d
-        }
-    }
-    fmt.Printf("%d %d %d", zoom, int64(x), int64(y))
-}
-
 
 
 
 1
+10
for _ in range(int(input())):
+    n = input()[::-1]
+    checksum = 0
+    for i in range(len(n)):
+        s = int(n[i]) * (i % 2 + 1)
+        if s > 9:
+            s = sum([int(d) for d in str(s)])
+        checksum += s
+
+    print("FAIL" if checksum % 10 else "PASS")
+
 
 
 
 
 
🟢 Magic Trick
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
s = input()
+counter = {}
+guess = 1
+for c in s:
+    if c in counter:
+        guess = 0
+        break
+    else:
+        counter[c] = None
+print(guess)
+
 
 
 
 
 
🟢 Making A Meowth
 
 Solution in Python 
 
 
 
1
+2
n, p, x, y = [int(d) for d in input().split()]
+print(p * x + p // (n - 1) * y)
+
 
 
 
 
 
🟢 Identifying Map Tiles
 
 Solutions in 2 languages 
 
 
 
 1
  2
  3
  4
@@ -6558,20 +6540,44 @@
 10
 11
 12
-13
s = input()
-x, y = 0, 0
-zoom = len(s)
-for i in range(len(s)):
-    d = 2 ** (zoom - i - 1)
-    if s[i] == "1":
-        x += d
-    elif s[i] == "2":
-        y += d
-    elif s[i] == "3":
-        x += d
-        y += d
-print(f"{zoom} {x} {y}")
-
 
 
 
 
 
🟢 Marko
 
 Solution in Python 
 
 
 
 1
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
package main
+
+import (
+    "fmt"
+    "math"
+)
+
+func main() {
+    var s string
+    fmt.Scanln(&s)
+    zoom := len(s)
+    var x, y float64
+    for i := 0; i < zoom; i++ {
+        d := math.Pow(2, float64(zoom)-float64(i)-1)
+        if s[i] == '1' {
+            x += d
+        } else if s[i] == '2' {
+            y += d
+        } else if s[i] == '3' {
+            x += d
+            y += d
+        }
+    }
+    fmt.Printf("%d %d %d", zoom, int64(x), int64(y))
+}
+
 
 
 
 1
  2
  3
  4
@@ -6583,62 +6589,68 @@
 10
 11
 12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
mapping = {
-    "2": "abc",
-    "3": "def",
-    "4": "ghi",
-    "5": "jkl",
-    "6": "mno",
-    "7": "pqrs",
-    "8": "tuv",
-    "9": "wxyz",
-}
-n = []
-for _ in range(int(input())):
-    w = input()
-    t = ""
-    for c in w:
-        for d, r in mapping.items():
-            if c in r:
-                t += d
-                break
-    n.append(t)
-
-d = input()
-print(sum([d == t for t in n]))
-
 
 
 
 
 
🟢 Mars Window
 
 Solution in Python 
 
 
 
1
-2
y = int(input())
-print("YES" if 26 - ((y - 2018) * 12 - 4) % 26 <= 12 else "NO")
-
 
 
 
 
 
🟢 Math Homework
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
b, d, c, l = [int(d) for d in input().split()]
-solved = False
-for i in range(l // b + 1):
-    for j in range((l - b * i) // d + 1):
-        for k in range((l - b * i - d * j) // c + 1):
-            if b * i + d * j + c * k == l:
-                print(i, j, k)
-                solved = True
-if not solved:
-    print("impossible")
-
 
 
 
 
 
🟢 Mean Words
 
 Solution in Python 
 
 
 
 1
+13
s = input()
+x, y = 0, 0
+zoom = len(s)
+for i in range(len(s)):
+    d = 2 ** (zoom - i - 1)
+    if s[i] == "1":
+        x += d
+    elif s[i] == "2":
+        y += d
+    elif s[i] == "3":
+        x += d
+        y += d
+print(f"{zoom} {x} {y}")
+
 
 
 
 
 
🟢 Marko
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
mapping = {
+    "2": "abc",
+    "3": "def",
+    "4": "ghi",
+    "5": "jkl",
+    "6": "mno",
+    "7": "pqrs",
+    "8": "tuv",
+    "9": "wxyz",
+}
+n = []
+for _ in range(int(input())):
+    w = input()
+    t = ""
+    for c in w:
+        for d, r in mapping.items():
+            if c in r:
+                t += d
+                break
+    n.append(t)
+
+d = input()
+print(sum([d == t for t in n]))
+
 
 
 
 
 
🟢 Mars Window
 
 Solution in Python 
 
 
 
1
+2
y = int(input())
+print("YES" if 26 - ((y - 2018) * 12 - 4) % 26 <= 12 else "NO")
+
 
 
 
 
 
🟢 Math Homework
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6647,17 +6659,17 @@
  7
  8
  9
-10
n = int(input())
-words = []
-for _ in range(n):
-    words.append(input())
-m = max([len(w) for w in words])
-ans = []
-for i in range(m):
-    values = [ord(w[i]) for w in words if len(w) > i]
-    ans.append(sum(values) // len(values))
-print("".join(chr(d) for d in ans))
-
 
 
 
 
 
🟢 Imperial Measurement
 
 Solution in Python 
 
 
 
 1
+10
b, d, c, l = [int(d) for d in input().split()]
+solved = False
+for i in range(l // b + 1):
+    for j in range((l - b * i) // d + 1):
+        for k in range((l - b * i - d * j) // c + 1):
+            if b * i + d * j + c * k == l:
+                print(i, j, k)
+                solved = True
+if not solved:
+    print("impossible")
+
 
 
 
 
 
🟢 Mean Words
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6666,43 +6678,17 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
mapping = {
-    "th": "thou",
-    "in": "inch",
-    "ft": "foot",
-    "yd": "yard",
-    "ch": "chain",
-    "fur": "furlong",
-    "mi": "mile",
-    "lea": "league",
-}
-names = list(mapping.values())
-scale = [1, 1000, 12, 3, 22, 10, 8, 3]
-
-v, a, _, b = input().split()
-v = int(v)
-na, nb = mapping.get(a, a), mapping.get(b, b)
-ia, ib = names.index(na), names.index(nb)
-
-rate = 1
-for s in scale[min(ia, ib) + 1 : max(ia, ib) + 1]:
-    rate *= s
-
-print(v * rate if ia > ib else v / rate)
-
 
 
 
 
 
🟢 Metaprogramming
 
 Solution in Python 
 
 
 
 1
+10
n = int(input())
+words = []
+for _ in range(n):
+    words.append(input())
+m = max([len(w) for w in words])
+ans = []
+for i in range(m):
+    values = [ord(w[i]) for w in words if len(w) > i]
+    ans.append(sum(values) // len(values))
+print("".join(chr(d) for d in ans))
+
 
 
 
 
 
🟢 Imperial Measurement
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6721,80 +6707,80 @@
 17
 18
 19
-20
c = {}
-while True:
-    try:
-        s = input()
-    except:
-        break
-    parts = s.split()
-    if parts[0] == "define":
-        v, n = parts[1:]
-        c[n] = int(v)
-    elif parts[0] == "eval":
-        x, y, z = parts[1:]
-        if x not in c or z not in c:
-            print("undefined")
-        elif y == "=":
-            print("true" if c[x] == c[z] else "false")
-        elif y == ">":
-            print("true" if c[x] > c[z] else "false")
-        elif y == "<":
-            print("true" if c[x] < c[z] else "false")
-
 
 
 
 
 
🟢 Methodic Multiplication
 
 Solution in Python 
 
 
 
1
-2
-3
a, b = input(), input()
-t = a.count("S") * b.count("S")
-print("S(" * t + "0" + ")" * t)
-
 
 
 
 
 
🟢 Metronome
 
 Solution in Python 
 
 
 
1
-2
n = int(input())
-print(f"{n/4:.2f}")
-
 
 
 
 
 
🟢 Mia
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
def score(a, b):
-    roll = set([a, b])
-    if roll == {1, 2}:
-        return (3, None)
-    elif len(roll) == 1:
-        return (2, a)
-    else:
-        a, b = min(a, b), max(b, a)
-        return (1, 10 * b + a)
-
-
-while True:
-    rolls = [int(d) for d in input().split()]
-    if not any(rolls):
-        break
-    score1 = score(*rolls[:2])
-    score2 = score(*rolls[2:])
-    if score1 == score2:
-        print("Tie.")
-    elif score1[0] == score2[0]:
-        print(f"Player {1 if score1[1] > score2[1] else 2} wins.")
-    else:
-        print(f"Player {1 if score1[0] > score2[0] else 2} wins.")
-
 
 
 
 
 
🟢 Missing Numbers
 
 Solution in Python 
 
 
 
 1
+20
+21
+22
+23
mapping = {
+    "th": "thou",
+    "in": "inch",
+    "ft": "foot",
+    "yd": "yard",
+    "ch": "chain",
+    "fur": "furlong",
+    "mi": "mile",
+    "lea": "league",
+}
+names = list(mapping.values())
+scale = [1, 1000, 12, 3, 22, 10, 8, 3]
+
+v, a, _, b = input().split()
+v = int(v)
+na, nb = mapping.get(a, a), mapping.get(b, b)
+ia, ib = names.index(na), names.index(nb)
+
+rate = 1
+for s in scale[min(ia, ib) + 1 : max(ia, ib) + 1]:
+    rate *= s
+
+print(v * rate if ia > ib else v / rate)
+
 
 
 
 
 
🟢 Metaprogramming
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
c = {}
+while True:
+    try:
+        s = input()
+    except:
+        break
+    parts = s.split()
+    if parts[0] == "define":
+        v, n = parts[1:]
+        c[n] = int(v)
+    elif parts[0] == "eval":
+        x, y, z = parts[1:]
+        if x not in c or z not in c:
+            print("undefined")
+        elif y == "=":
+            print("true" if c[x] == c[z] else "false")
+        elif y == ">":
+            print("true" if c[x] > c[z] else "false")
+        elif y == "<":
+            print("true" if c[x] < c[z] else "false")
+
 
 
 
 
 
🟢 Methodic Multiplication
 
 Solution in Python 
 
 
 
1
+2
+3
a, b = input(), input()
+t = a.count("S") * b.count("S")
+print("S(" * t + "0" + ")" * t)
+
 
 
 
 
 
🟢 Metronome
 
 Solution in Python 
 
 
 
1
+2
n = int(input())
+print(f"{n/4:.2f}")
+
 
 
 
 
 
🟢 Mia
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6805,108 +6791,132 @@
  9
 10
 11
-12
numbers = []
-for _ in range(int(input())):
-    numbers.append(int(input()))
-
-is_good_job = True
-for i in range(1, max(numbers) + 1):
-    if i not in numbers:
-        is_good_job = False
-        print(i)
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
def score(a, b):
+    roll = set([a, b])
+    if roll == {1, 2}:
+        return (3, None)
+    elif len(roll) == 1:
+        return (2, a)
+    else:
+        a, b = min(a, b), max(b, a)
+        return (1, 10 * b + a)
 
-if is_good_job:
-    print("good job")
-
 
 
 
 
 
🟢 Mixed Fractions
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
while True:
-    m, n = [int(d) for d in input().split()]
-    if not m and not n:
-        break
-    a = m // n
-    b = m % n
-    print(f"{a} {b} / {n}")
-
 
 
 
 
 
🟢 Mjehuric
 
 Solution in Python 
 
 
 
1
+
+while True:
+    rolls = [int(d) for d in input().split()]
+    if not any(rolls):
+        break
+    score1 = score(*rolls[:2])
+    score2 = score(*rolls[2:])
+    if score1 == score2:
+        print("Tie.")
+    elif score1[0] == score2[0]:
+        print(f"Player {1 if score1[1] > score2[1] else 2} wins.")
+    else:
+        print(f"Player {1 if score1[0] > score2[0] else 2} wins.")
+
 
 
 
 
 
🟢 Missing Numbers
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
numbers = []
+for _ in range(int(input())):
+    numbers.append(int(input()))
+
+is_good_job = True
+for i in range(1, max(numbers) + 1):
+    if i not in numbers:
+        is_good_job = False
+        print(i)
+
+if is_good_job:
+    print("good job")
+
 
 
 
 
 
🟢 Mixed Fractions
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
f = input().split()
-while f != [str(d) for d in range(1, 6)]:
-    for i in range(4):
-        if f[i] > f[i + 1]:
-            f[i], f[i + 1] = f[i + 1], f[i]
-            print(" ".join(f))
-
 
 
 
 
 
🟢 Moderate Pace
 
 Solution in Python 
 
 
 
1
+6
+7
while True:
+    m, n = [int(d) for d in input().split()]
+    if not m and not n:
+        break
+    a = m // n
+    b = m % n
+    print(f"{a} {b} / {n}")
+
 
 
 
 
 
🟢 Mjehuric
 
 Solution in Python 
 
 
 
1
 2
 3
-4
n = int(input())
-distances = [[int(d) for d in input().split()] for _ in range(3)]
-plan = [sorted([d[i] for d in distances])[1] for i in range(n)]
-print(" ".join([str(d) for d in plan]))
-
 
 
 
 
 
🟢 Modulo
 
 Solution in Python 
 
 
 
1
+4
+5
+6
f = input().split()
+while f != [str(d) for d in range(1, 6)]:
+    for i in range(4):
+        if f[i] > f[i + 1]:
+            f[i], f[i + 1] = f[i + 1], f[i]
+            print(" ".join(f))
+
 
 
 
 
 
🟢 Moderate Pace
 
 Solution in Python 
 
 
 
1
 2
 3
-4
n = set()
-for _ in range(10):
-    n.add(int(input()) % 42)
-print(len(n))
-
 
 
 
 
 
🟢 Monopoly
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
n = int(input())
-a = [int(d) for d in input().split()]
-t = 0
-m = 0
-for i in range(1, 7):
-    for j in range(1, 7):
-        t += 1
-        if i + j in a:
-            m += 1
-print(m / t)
-
 
 
 
 
 
🟢 Moscow Dream
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
a, b, c, n = [int(d) for d in input().split()]
-
-if not all(d > 0 for d in [a, b, c]):
-    print("NO")
-else:
-    print("YES" if a + b + c >= n and n >= 3 else "NO")
-
 
 
 
 
 
🟢 Mosquito Multiplication
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
while True:
-    try:
-        m, p, l, e, r, s, n = [int(d) for d in input().split()]
-    except:
-        break
-    for _ in range(n):
-        pp = p
-        p = l // r
-        l = e * m
-        m = pp // s
-    print(m)
-
 
 
 
 
 
🟢 MrCodeFormatGrader
 
 Solution in Python 
 
 
 
 1
+4
n = int(input())
+distances = [[int(d) for d in input().split()] for _ in range(3)]
+plan = [sorted([d[i] for d in distances])[1] for i in range(n)]
+print(" ".join([str(d) for d in plan]))
+
 
 
 
 
 
🟢 Modulo
 
 Solution in Python 
 
 
 
1
+2
+3
+4
n = set()
+for _ in range(10):
+    n.add(int(input()) % 42)
+print(len(n))
+
 
 
 
 
 
🟢 Monopoly
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
n = int(input())
+a = [int(d) for d in input().split()]
+t = 0
+m = 0
+for i in range(1, 7):
+    for j in range(1, 7):
+        t += 1
+        if i + j in a:
+            m += 1
+print(m / t)
+
 
 
 
 
 
🟢 Moscow Dream
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
a, b, c, n = [int(d) for d in input().split()]
+
+if not all(d > 0 for d in [a, b, c]):
+    print("NO")
+else:
+    print("YES" if a + b + c >= n and n >= 3 else "NO")
+
 
 
 
 
 
🟢 Mosquito Multiplication
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6916,48 +6926,18 @@
  8
  9
 10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
def f(numbers):
-    prev = numbers[0]
-    ans = {prev: 1}
-    for i in range(1, len(numbers)):
-        if numbers[i] == prev + ans[prev]:
-            ans[prev] += 1
-        else:
-            prev = numbers[i]
-            ans[prev] = 1
-
-    parts = [
-        f"{key}-{key+value-1}"
-        if value > 1
-        else " ".join([str(d) for d in range(key, key + value)])
-        for key, value in ans.items()
-    ]
-
-    return ", ".join(parts[:-1]) + " and " + parts[-1]
-
-
-c, n = [int(d) for d in input().split()]
-errors = [int(d) for d in input().split()]
-correct = [i for i in range(1, 1 + c) if i not in errors]
-
-print("Errors:", f(errors))
-print("Correct:", f(correct))
-
 
 
 
 
 
🟢 Mult!
 
 Solution in Python 
 
 
 
 1
+11
while True:
+    try:
+        m, p, l, e, r, s, n = [int(d) for d in input().split()]
+    except:
+        break
+    for _ in range(n):
+        pp = p
+        p = l // r
+        l = e * m
+        m = pp // s
+    print(m)
+
 
 
 
 
 
🟢 MrCodeFormatGrader
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6967,18 +6947,48 @@
  8
  9
 10
-11
n = int(input())
-b = None
-for _ in range(n):
-    d = int(input())
-    if not b:
-        b = d
-        continue
-
-    if d % b == 0:
-        print(d)
-        b = None
-
 
 
 
 
 
🟢 Mumble Rap
 
 Solution in Python 
 
 
 
 1
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
def f(numbers):
+    prev = numbers[0]
+    ans = {prev: 1}
+    for i in range(1, len(numbers)):
+        if numbers[i] == prev + ans[prev]:
+            ans[prev] += 1
+        else:
+            prev = numbers[i]
+            ans[prev] = 1
+
+    parts = [
+        f"{key}-{key+value-1}"
+        if value > 1
+        else " ".join([str(d) for d in range(key, key + value)])
+        for key, value in ans.items()
+    ]
+
+    return ", ".join(parts[:-1]) + " and " + parts[-1]
+
+
+c, n = [int(d) for d in input().split()]
+errors = [int(d) for d in input().split()]
+correct = [i for i in range(1, 1 + c) if i not in errors]
+
+print("Errors:", f(errors))
+print("Correct:", f(correct))
+
 
 
 
 
 
🟢 Mult!
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -6988,32 +6998,18 @@
  8
  9
 10
-11
-12
-13
-14
-15
-16
-17
-18
n = int(input())
-s = input()
-a = []
-d = ""
-import string
-
-for i in range(n):
-    if s[i] in string.digits:
-        d += s[i]
-
-    else:
-        if d:
-            a.append(int(d))
-            d = ""
-if d:
-    a.append(int(d))
-
-print(max(a))
-
 
 
 
 
 
🟢 Musical Scales
 
 Solution in Python 
 
 
 
 1
+11
n = int(input())
+b = None
+for _ in range(n):
+    d = int(input())
+    if not b:
+        b = d
+        continue
+
+    if d % b == 0:
+        print(d)
+        b = None
+
 
 
 
 
 
🟢 Mumble Rap
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7026,21 +7022,29 @@
 11
 12
 13
-14
notes = ["A", "A#", "B", "C", "C#", "D", "D#", "E", "F", "F#", "G", "G#"]
-offset = [2, 2, 1, 2, 2, 2]
-majors = {}
-for i in range(len(notes)):
-    name = notes[i]
-    progression = [name]
-    for i in offset:
-        index = (notes.index(progression[-1]) + i) % len(notes)
-        progression.append(notes[index])
-    majors[name] = progression
-
-_ = input()
-scales = set(input().split())
-print(" ".join([n for n in majors if scales < set(majors[n])]) or "none")
-
 
 
 
 
 
🟢 Music Your Way
 
 Solution in Python 
 
 
 
 1
+14
+15
+16
+17
+18
n = int(input())
+s = input()
+a = []
+d = ""
+import string
+
+for i in range(n):
+    if s[i] in string.digits:
+        d += s[i]
+
+    else:
+        if d:
+            a.append(int(d))
+            d = ""
+if d:
+    a.append(int(d))
+
+print(max(a))
+
 
 
 
 
 
🟢 Musical Scales
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7053,21 +7057,21 @@
 11
 12
 13
-14
cols = input().split()
-m = int(input())
-songs = [input().split() for _ in range(m)]
-n = int(input())
-
-for i in range(n):
-    col = input()
-    index = cols.index(col)
-    songs = sorted(songs, key=lambda k: k[index])
-    print(" ".join(cols))
-    for song in songs:
-        print(" ".join(song))
-    if i < n - 1:
-        print()
-
 
 
 
 
 
🟢 Mylla
 
 Solution in Python 
 
 
 
 1
+14
notes = ["A", "A#", "B", "C", "C#", "D", "D#", "E", "F", "F#", "G", "G#"]
+offset = [2, 2, 1, 2, 2, 2]
+majors = {}
+for i in range(len(notes)):
+    name = notes[i]
+    progression = [name]
+    for i in offset:
+        index = (notes.index(progression[-1]) + i) % len(notes)
+        progression.append(notes[index])
+    majors[name] = progression
+
+_ = input()
+scales = set(input().split())
+print(" ".join([n for n in majors if scales < set(majors[n])]) or "none")
+
 
 
 
 
 
🟢 Music Your Way
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7080,41 +7084,21 @@
 11
 12
 13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
board = []
-for _ in range(3):
-    board.append(list(input()))
-
-winner = ""
-for i in range(3):
-    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != "_":
-        winner = board[i][0]
-        break
-    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != "_":
-        winner = board[0][i]
-        break
-
-if board[0][0] == board[1][1] == board[2][2] and board[1][1] != "_":
-    winner = board[1][1]
-elif board[0][2] == board[1][1] == board[2][0] and board[1][1] != "_":
-    winner = board[1][1]
-
-if winner == "O":
-    winner = "Jebb"
-else:
-    winner = "Neibb"
-
-print(winner)
-
 
 
 
 
 
🟢 Nasty Hacks
 
 Solutions in 2 languages 
 
 
 
 1
+14
cols = input().split()
+m = int(input())
+songs = [input().split() for _ in range(m)]
+n = int(input())
+
+for i in range(n):
+    col = input()
+    index = cols.index(col)
+    songs = sorted(songs, key=lambda k: k[index])
+    print(" ".join(cols))
+    for song in songs:
+        print(" ".join(song))
+    if i < n - 1:
+        print()
+
 
 
 
 
 
🟢 Mylla
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7137,77 +7121,97 @@
 21
 22
 23
-24
-25
-26
#include <iostream>
-
-using namespace std;
+24
board = []
+for _ in range(3):
+    board.append(list(input()))
 
-int main()
-{
-    int n, r, e, c;
-    cin >> n;
-
-    for (int i = 0; i < n; i++)
-    {
-        cin >> r >> e >> c;
-        if ((e - c) > r)
-        {
-            cout << "advertise";
-        }
-        else if ((e - c) < r)
-        {
-            cout << "do not advertise";
-        }
-        else
-        {
-            cout << "does not matter";
-        }
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
for _ in range(int(input())):
-    r, e, c = [int(d) for d in input().split()]
-    if e > r + c:
-        print("advertise")
-    elif e < r + c:
-        print("do not advertise")
-    else:
-        print("does not matter")
-
 
 
 
 
 
🟢 No Duplicates
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
words = input().split()
-
-counter = {}
-repeated = False
-for w in words:
-    if w in counter:
-        repeated = True
-        break
-    else:
-        counter[w] = None
-if repeated:
-    print("no")
-else:
-    print("yes")
-
 
 
 
 
 
🟢 No Thanks!
 
 Solution in Python 
 
 
 
 1
+winner = ""
+for i in range(3):
+    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != "_":
+        winner = board[i][0]
+        break
+    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != "_":
+        winner = board[0][i]
+        break
+
+if board[0][0] == board[1][1] == board[2][2] and board[1][1] != "_":
+    winner = board[1][1]
+elif board[0][2] == board[1][1] == board[2][0] and board[1][1] != "_":
+    winner = board[1][1]
+
+if winner == "O":
+    winner = "Jebb"
+else:
+    winner = "Neibb"
+
+print(winner)
+
 
 
 
 
 
🟢 Nasty Hacks
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    int n, r, e, c;
+    cin >> n;
+
+    for (int i = 0; i < n; i++)
+    {
+        cin >> r >> e >> c;
+        if ((e - c) > r)
+        {
+            cout << "advertise";
+        }
+        else if ((e - c) < r)
+        {
+            cout << "do not advertise";
+        }
+        else
+        {
+            cout << "does not matter";
+        }
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
for _ in range(int(input())):
+    r, e, c = [int(d) for d in input().split()]
+    if e > r + c:
+        print("advertise")
+    elif e < r + c:
+        print("do not advertise")
+    else:
+        print("does not matter")
+
 
 
 
 
 
🟢 No Duplicates
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7219,20 +7223,22 @@
 10
 11
 12
-13
n = int(input())
-v = sorted([int(d) for d in input().split()])
-
-prev = v[0]
-ans = {prev: 1}
-for i in range(1, n):
-    if v[i] == prev + ans[prev]:
-        ans[prev] += 1
+13
+14
words = input().split()
+
+counter = {}
+repeated = False
+for w in words:
+    if w in counter:
+        repeated = True
+        break
     else:
-        prev = v[i]
-        ans[prev] = 1
-
-print(sum(ans.keys()))
-
 
 
 
 
 
🟢 N-sum
 
 Solutions in 2 languages 
 
 
 
 1
+        counter[w] = None
+if repeated:
+    print("no")
+else:
+    print("yes")
+
 
 
 
 
 
🟢 No Thanks!
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7244,196 +7250,188 @@
 10
 11
 12
-13
import java.util.Scanner;
-
-class NSum {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int n = s.nextInt();
-        int ans = 0;
-        for (int i = 0; i < n; i++) {
-            ans += s.nextInt();
-        }
-        System.out.println(ans);
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
_ = int(input())
-numbers = []
-for d in input().split():
-    numbers.append(int(d))
-print(sum(numbers))
-
 
 
 
 
 
🟢 Number Fun
 
 Solution in Python 
 
 
 
1
+13
n = int(input())
+v = sorted([int(d) for d in input().split()])
+
+prev = v[0]
+ans = {prev: 1}
+for i in range(1, n):
+    if v[i] == prev + ans[prev]:
+        ans[prev] += 1
+    else:
+        prev = v[i]
+        ans[prev] = 1
+
+print(sum(ans.keys()))
+
 
 
 
 
 
🟢 N-sum
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
import java.util.Scanner;
+
+class NSum {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        int ans = 0;
+        for (int i = 0; i < n; i++) {
+            ans += s.nextInt();
+        }
+        System.out.println(ans);
+    }
+}
+
 
 
 
1
 2
 3
 4
-5
-6
for _ in range(int(input())):
-    a, b, c = [int(d) for d in input().split()]
-    if a + b == c or a * b == c or a - b == c or b - a == c or a / b == c or b / a == c:
-        print("Possible")
-    else:
-        print("Impossible")
-
 
 
 
 
 
🟢 Odd Echo
 
 Solution in Python 
 
 
 
1
+5
_ = int(input())
+numbers = []
+for d in input().split():
+    numbers.append(int(d))
+print(sum(numbers))
+
 
 
 
 
 
🟢 Number Fun
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
n = int(input())
-words = []
-for _ in range(n):
-    words.append(input())
-for i in range(0, n, 2):
-    print(words[i])
-
 
 
 
 
 
🟢 Odd Gnome
 
 Solution in Python 
 
 
 
1
+6
for _ in range(int(input())):
+    a, b, c = [int(d) for d in input().split()]
+    if a + b == c or a * b == c or a - b == c or b - a == c or a / b == c or b / a == c:
+        print("Possible")
+    else:
+        print("Impossible")
+
 
 
 
 
 
🟢 Odd Echo
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
-7
-8
-9
n = int(input())
-for _ in range(n):
-    g = [int(d) for d in input().split()][1:]
-    prev = g[0]
-    for i in range(1, len(g)):
-        if g[i] != prev + 1:
-            break
-        prev = g[i]
-    print(i + 1)
-
 
 
 
 
 
🟢 Oddities
 
 Solution in Python 
 
 
 
1
+6
n = int(input())
+words = []
+for _ in range(n):
+    words.append(input())
+for i in range(0, n, 2):
+    print(words[i])
+
 
 
 
 
 
🟢 Odd Gnome
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
 7
-8
n = int(input())
+8
+9
n = int(input())
 for _ in range(n):
-    x = int(input())
-    if x % 2:
-        res = "odd"
-    else:
-        res = "even"
-    print(f"{x} is {res}")
-
 
 
 
 
 
🟢 Odd Man Out
 
 Solution in Python 
 
 
 
1
+    g = [int(d) for d in input().split()][1:]
+    prev = g[0]
+    for i in range(1, len(g)):
+        if g[i] != prev + 1:
+            break
+        prev = g[i]
+    print(i + 1)
+
 
 
 
 
 
🟢 Oddities
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
from collections import Counter
-
-n = int(input())
-for i in range(n):
-    _ = input()
-    c = Counter(input().split())
-    print(f"Case #{i+1}: {' '.join(v for v in c if c[v]==1)}")
-
 
 
 
 
 
🟢 Off-World Records
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
import java.util.Scanner;
+7
+8
n = int(input())
+for _ in range(n):
+    x = int(input())
+    if x % 2:
+        res = "odd"
+    else:
+        res = "even"
+    print(f"{x} is {res}")
+
 
 
 
 
 
🟢 Odd Man Out
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
from collections import Counter
 
-class OffWorldRecords {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int n = s.nextInt();
-        int c = s.nextInt();
-        int p = s.nextInt();
-        int ans = 0;
-
-        for (int i = 0; i < n; i++) {
-            int h = s.nextInt();
-            if (h > c + p) {
-                ans += 1;
-                p = c;
-                c = h;
-            }
-        }
-        System.out.println(ans);
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
n, c, p = [int(d) for d in input().split()]
-ans = 0
-for _ in range(n):
-    h = int(input())
-    if h > c + p:
-        ans += 1
-        c, p = h, c
-print(ans)
-
 
 
 
 
 
🟢 Reverse
 
 Solution in Python 
 
 
 
1
+n = int(input())
+for i in range(n):
+    _ = input()
+    c = Counter(input().split())
+    print(f"Case #{i+1}: {' '.join(v for v in c if c[v]==1)}")
+
 
 
 
 
 
🟢 Off-World Records
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
import java.util.Scanner;
+
+class OffWorldRecords {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        int c = s.nextInt();
+        int p = s.nextInt();
+        int ans = 0;
+
+        for (int i = 0; i < n; i++) {
+            int h = s.nextInt();
+            if (h > c + p) {
+                ans += 1;
+                p = c;
+                c = h;
+            }
+        }
+        System.out.println(ans);
+    }
+}
+
 
 
 
1
 2
 3
 4
 5
-6
n = int(input())
-numbers = []
+6
+7
+8
n, c, p = [int(d) for d in input().split()]
+ans = 0
 for _ in range(n):
-    numbers.append(int(input()))
-for d in numbers[::-1]:
-    print(d)
-
 
 
 
 
 
🟢 Oktalni
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
import math
-
-mapping = {
-    "000": "0",
-    "001": "1",
-    "010": "2",
-    "011": "3",
-    "100": "4",
-    "101": "5",
-    "110": "6",
-    "111": "7",
-}
-b = input()
-length = 3 * math.ceil(len(b) / 3)
-b = b.zfill(length)
-
-print("".join([mapping[b[i : i + 3]] for i in range(0, length, 3)]))
-
 
 
 
 
 
🟢 One Chicken Per Person!
 
 Solution in Python 
 
 
 
 1
+    h = int(input())
+    if h > c + p:
+        ans += 1
+        c, p = h, c
+print(ans)
+
 
 
 
 
 
🟢 Reverse
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
n = int(input())
+numbers = []
+for _ in range(n):
+    numbers.append(int(input()))
+for d in numbers[::-1]:
+    print(d)
+
 
 
 
 
 
🟢 Oktalni
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7442,117 +7440,125 @@
  7
  8
  9
-10
n, m = [int(d) for d in input().split()]
+10
+11
+12
+13
+14
+15
+16
+17
import math
 
-diff = n - m
-if diff > 0:
-    print(f"Dr. Chaz needs {diff} more piece{'s' if diff >1 else ''} of chicken!")
-else:
-    diff = abs(diff)
-    print(
-        f"Dr. Chaz will have {diff} piece{'s' if diff >1 else ''} of chicken left over!"
-    )
-
 
 
 
 
 
🟢 Ordinals
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
def f(n):
-    if n == 0:
-        return "{}"
-    else:
-        ans = ",".join([f(i) for i in range(n)])
-        return "{" + ans + "}"
-
-
-print(f(int(input())))
-
 
 
 
 
 
🟢 Ornaments
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
import math
-
-while True:
-    r, h, s = [int(d) for d in input().split()]
-    if not r and not h and not s:
-        break
-    l = math.sqrt(h**2 - r**2) * 2
-    a = math.pi - math.acos(r / h)
-    l += 2 * math.pi * r * (a / math.pi)
-    l *= 1 + s / 100
-    print(f"{l:.2f}")
-
 
 
 
 
 
🟢 Östgötska
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
sentence = input()
-words = sentence.split()
-if len([w for w in words if "ae" in w]) / len(words) >= 0.4:
-    print("dae ae ju traeligt va")
-else:
-    print("haer talar vi rikssvenska")
-
 
 
 
 
 
🟢 Overdraft
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
n = int(input())
-s = 0
-b = 0
-for _ in range(n):
-    t = int(input())
-    if t > 0:
-        b += t
-    elif b + t < 0:
-        s -= b + t
-        b = 0
-    else:
-        b += t
-print(s)
-
 
 
 
 
 
🟢 Óvissa
 
 Solution in Python 
 
 
 
1
print(input().count("u"))
-
 
 
 
 
 
🟢 The Owl and the Fox
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
def sd(n):
-    return sum([int(d) for d in str(n)])
-
-
-for _ in range(int(input())):
-    n = int(input())
-    s = sd(n) - 1
-    d = n - 1
-    while True:
-        if sd(d) == s:
-            break
-        d -= 1
-    print(d)
-
 
 
 
 
 
🟢 Pachyderm Peanut Packing
 
 Solution in Python 
 
 
 
 1
+mapping = {
+    "000": "0",
+    "001": "1",
+    "010": "2",
+    "011": "3",
+    "100": "4",
+    "101": "5",
+    "110": "6",
+    "111": "7",
+}
+b = input()
+length = 3 * math.ceil(len(b) / 3)
+b = b.zfill(length)
+
+print("".join([mapping[b[i : i + 3]] for i in range(0, length, 3)]))
+
 
 
 
 
 
🟢 One Chicken Per Person!
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
n, m = [int(d) for d in input().split()]
+
+diff = n - m
+if diff > 0:
+    print(f"Dr. Chaz needs {diff} more piece{'s' if diff >1 else ''} of chicken!")
+else:
+    diff = abs(diff)
+    print(
+        f"Dr. Chaz will have {diff} piece{'s' if diff >1 else ''} of chicken left over!"
+    )
+
 
 
 
 
 
🟢 Ordinals
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
def f(n):
+    if n == 0:
+        return "{}"
+    else:
+        ans = ",".join([f(i) for i in range(n)])
+        return "{" + ans + "}"
+
+
+print(f(int(input())))
+
 
 
 
 
 
🟢 Ornaments
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
import math
+
+while True:
+    r, h, s = [int(d) for d in input().split()]
+    if not r and not h and not s:
+        break
+    l = math.sqrt(h**2 - r**2) * 2
+    a = math.pi - math.acos(r / h)
+    l += 2 * math.pi * r * (a / math.pi)
+    l *= 1 + s / 100
+    print(f"{l:.2f}")
+
 
 
 
 
 
🟢 Östgötska
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
sentence = input()
+words = sentence.split()
+if len([w for w in words if "ae" in w]) / len(words) >= 0.4:
+    print("dae ae ju traeligt va")
+else:
+    print("haer talar vi rikssvenska")
+
 
 
 
 
 
🟢 Overdraft
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
n = int(input())
+s = 0
+b = 0
+for _ in range(n):
+    t = int(input())
+    if t > 0:
+        b += t
+    elif b + t < 0:
+        s -= b + t
+        b = 0
+    else:
+        b += t
+print(s)
+
 
 
 
 
 
🟢 Óvissa
 
 Solution in Python 
 
 
 
1
print(input().count("u"))
+
 
 
 
 
 
🟢 The Owl and the Fox
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7564,60 +7570,20 @@
 10
 11
 12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
def inbox(coords, x, y):
-    if x >= coords[0] and x <= coords[2] and y >= coords[1] and y <= coords[3]:
-        return True
-    return False
-
-
-while True:
-    n = int(input())
-    if not n:
-        break
-    box = {}
-    for i in range(n):
-        desc = input().split()
-        size = desc[-1]
-        coords = [float(d) for d in desc[:-1]]
-        box[i] = (coords, size)
-    m = int(input())
-    for _ in range(m):
-        desc = input().split()
-        size = desc[-1]
-        x, y = [float(d) for d in desc[:-1]]
-        floor = True
-        for i in range(n):
-            coords, box_size = box[i]
-            if inbox(coords, x, y):
-                floor = False
-                break
-        if floor:
-            status = "floor"
-        else:
-            status = "correct" if box_size == size else box_size
-        print(size, status)
-    print()
-
 
 
 
 
 
🟢 Parent Gap
 
 Solution in Python 
 
 
 
 1
+13
def sd(n):
+    return sum([int(d) for d in str(n)])
+
+
+for _ in range(int(input())):
+    n = int(input())
+    s = sd(n) - 1
+    d = n - 1
+    while True:
+        if sd(d) == s:
+            break
+        d -= 1
+    print(d)
+
 
 
 
 
 
🟢 Pachyderm Peanut Packing
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7632,99 +7598,143 @@
 13
 14
 15
-16
from datetime import datetime
-
-year = int(input())
-
-mother = datetime(year, 5, 1).isoweekday()
-father = datetime(year, 6, 1).isoweekday()
-
-x = 7 - mother
-y = 7 - father
-daymother = 1 + x + 7
-dayfather = 1 + y + 14
-
-daymother = datetime(year, 5, daymother)
-dayfather = datetime(year, 6, dayfather)
-
-print(((dayfather - daymother).days) // 7, "weeks")
-
 
 
 
 
 
🟢 Parket
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
import math
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
def inbox(coords, x, y):
+    if x >= coords[0] and x <= coords[2] and y >= coords[1] and y <= coords[3]:
+        return True
+    return False
+
+
+while True:
+    n = int(input())
+    if not n:
+        break
+    box = {}
+    for i in range(n):
+        desc = input().split()
+        size = desc[-1]
+        coords = [float(d) for d in desc[:-1]]
+        box[i] = (coords, size)
+    m = int(input())
+    for _ in range(m):
+        desc = input().split()
+        size = desc[-1]
+        x, y = [float(d) for d in desc[:-1]]
+        floor = True
+        for i in range(n):
+            coords, box_size = box[i]
+            if inbox(coords, x, y):
+                floor = False
+                break
+        if floor:
+            status = "floor"
+        else:
+            status = "correct" if box_size == size else box_size
+        print(size, status)
+    print()
+
 
 
 
 
 
🟢 Parent Gap
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
from datetime import datetime
 
-r, b = [int(d) for d in input().split()]
-w = math.floor((r + b) ** 0.5)
-while w:
-    if (r + b) / w == (r + 4) / 2 - w:
-        print((r + 4) // 2 - w, w)
-        break
-    w -= 1
-
 
 
 
 
 
🟢 Parking
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
a, b, c = [int(d) for d in input().split()]
-t = [0] * 100
-for _ in range(3):
-    start, end = [int(d) - 1 for d in input().split()]
-    for i in range(start, end):
-        t[i] += 1
-
-total = 0
-mapping = {
-    3: c,
-    2: b,
-    1: a,
-}
-for s in t:
-    total += mapping.get(s, 0) * s
-print(total)
-
 
 
 
 
 
🟢 Parking
 
 Solution in Python 
 
 
 
1
-2
-3
-4
for _ in range(int(input())):
-    _ = input()
-    positions = [int(d) for d in input().split()]
-    print(2 * (max(positions) - min(positions)))
-
 
 
 
 
 
🟢 Patuljci
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
d = [int(input()) for _ in range(9)]
-diff = sum(d) - 100
-end = False
-for i in range(8):
-    for j in range(i + 1, 9):
-        if d[i] + d[j] == diff:
-            end = True
-            break
-    if end:
-        break
-print("\n".join([str(d[k]) for k in range(9) if k not in [i, j]]))
-
 
 
 
 
 
🟢 Paul Eigon
 
 Solutions in 2 languages 
 
 
 
 1
+year = int(input())
+
+mother = datetime(year, 5, 1).isoweekday()
+father = datetime(year, 6, 1).isoweekday()
+
+x = 7 - mother
+y = 7 - father
+daymother = 1 + x + 7
+dayfather = 1 + y + 14
+
+daymother = datetime(year, 5, daymother)
+dayfather = datetime(year, 6, dayfather)
+
+print(((dayfather - daymother).days) // 7, "weeks")
+
 
 
 
 
 
🟢 Parket
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
import math
+
+r, b = [int(d) for d in input().split()]
+w = math.floor((r + b) ** 0.5)
+while w:
+    if (r + b) / w == (r + 4) / 2 - w:
+        print((r + 4) // 2 - w, w)
+        break
+    w -= 1
+
 
 
 
 
 
🟢 Parking
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
a, b, c = [int(d) for d in input().split()]
+t = [0] * 100
+for _ in range(3):
+    start, end = [int(d) - 1 for d in input().split()]
+    for i in range(start, end):
+        t[i] += 1
+
+total = 0
+mapping = {
+    3: c,
+    2: b,
+    1: a,
+}
+for s in t:
+    total += mapping.get(s, 0) * s
+print(total)
+
 
 
 
 
 
🟢 Parking
 
 Solution in Python 
 
 
 
1
+2
+3
+4
for _ in range(int(input())):
+    _ = input()
+    positions = [int(d) for d in input().split()]
+    print(2 * (max(positions) - min(positions)))
+
 
 
 
 
 
🟢 Patuljci
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7734,113 +7744,99 @@
  8
  9
 10
-11
-12
-13
-14
-15
package main
-
-import "fmt"
-
-func main() {
-    var n, p, q int
-    fmt.Scan(&n)
-    fmt.Scan(&p)
-    fmt.Scan(&q)
-    if ((p+q)/n)%2 == 0 {
-        fmt.Println("paul")
-    } else {
-        fmt.Println("opponent")
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
n, p, q = [int(d) for d in input().split()]
+11
d = [int(input()) for _ in range(9)]
+diff = sum(d) - 100
+end = False
+for i in range(8):
+    for j in range(i + 1, 9):
+        if d[i] + d[j] == diff:
+            end = True
+            break
+    if end:
+        break
+print("\n".join([str(d[k]) for k in range(9) if k not in [i, j]]))
+
 
 
 
 
 
🟢 Paul Eigon
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
package main
 
-if ((p + q) // n) % 2 == 0:
-    print("paul")
-else:
-    print("opponent")
-
 
 
 
 
 
🟢 Peach Powder Polygon
 
 Solution in Python 
 
 
 
1
-2
n = int(input())
-print("Yes" if n % 4 else "No")
-
 
 
 
 
 
🟢 Pea Soup and Pancakes
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
found = False
-for _ in range(int(input())):
-    k = int(input())
-
-    name = input()
-    items = [input() for _ in range(k)]
-    if "pea soup" in items and "pancakes" in items:
-        found = True
-        print(name)
-        break
-
-if not found:
-    print("Anywhere is fine I guess")
-
 
 
 
 
 
🟢 Peragrams
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
from collections import Counter
-
-s = Counter(input())
-v = [d for d in s.values() if d % 2]
-v = sorted(v)[:-1]
-
-print(len(v))
-
 
 
 
 
 
🟢 Perket
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
from itertools import combinations
+import "fmt"
+
+func main() {
+    var n, p, q int
+    fmt.Scan(&n)
+    fmt.Scan(&p)
+    fmt.Scan(&q)
+    if ((p+q)/n)%2 == 0 {
+        fmt.Println("paul")
+    } else {
+        fmt.Println("opponent")
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
+6
n, p, q = [int(d) for d in input().split()]
+
+if ((p + q) // n) % 2 == 0:
+    print("paul")
+else:
+    print("opponent")
+
 
 
 
 
 
🟢 Peach Powder Polygon
 
 Solution in Python 
 
 
 
1
+2
n = int(input())
+print("Yes" if n % 4 else "No")
+
 
 
 
 
 
🟢 Pea Soup and Pancakes
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
found = False
+for _ in range(int(input())):
+    k = int(input())
+
+    name = input()
+    items = [input() for _ in range(k)]
+    if "pea soup" in items and "pancakes" in items:
+        found = True
+        print(name)
+        break
+
+if not found:
+    print("Anywhere is fine I guess")
+
 
 
 
 
 
🟢 Peragrams
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
from collections import Counter
 
-n = int(input())
-l = [[int(d) for d in input().split()] for _ in range(n)]
-
-c = []
-for i in range(1, n + 1):
-    c.extend(list(combinations(l, i)))
-
-d = []
-for i in c:
-    s, b = 1, 0
-    for x, y in i:
-        s *= x
-        b += y
-    d.append(abs(s - b))
-
-print(min(d))
-
 
 
 
 
 
🟢 Permuted Arithmetic Sequence
 
 Solution in Python 
 
 
 
 1
+s = Counter(input())
+v = [d for d in s.values() if d % 2]
+v = sorted(v)[:-1]
+
+print(len(v))
+
 
 
 
 
 
🟢 Perket
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7853,21 +7849,29 @@
 11
 12
 13
-14
def arithmetic(n):
-    d = [n[i] - n[i + 1] for i in range(len(n) - 1)]
-    return True if len(set(d)) == 1 else False
-
+14
+15
+16
+17
+18
from itertools import combinations
+
+n = int(input())
+l = [[int(d) for d in input().split()] for _ in range(n)]
 
-for _ in range(int(input())):
-    s = input().split()
-    n = [int(d) for d in s[1:]]
-    if arithmetic(n):
-        print("arithmetic")
-    elif arithmetic(sorted(n)):
-        print("permuted arithmetic")
-    else:
-        print("non-arithmetic")
-
 
 
 
 
 
🟢 Pervasive Heart Monitor
 
 Solution in Python 
 
 
 
 1
+c = []
+for i in range(1, n + 1):
+    c.extend(list(combinations(l, i)))
+
+d = []
+for i in c:
+    s, b = 1, 0
+    for x, y in i:
+        s *= x
+        b += y
+    d.append(abs(s - b))
+
+print(min(d))
+
 
 
 
 
 
🟢 Permuted Arithmetic Sequence
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7880,76 +7884,68 @@
 11
 12
 13
-14
-15
while True:
-    try:
-        line = input().split()
-    except:
-        break
-
-    name, rate = [], []
-    for p in line:
-        if p.isalpha():
-            name.append(p)
-        else:
-            rate.append(float(p))
-    name = " ".join(name)
-    rate = sum(rate) / len(rate)
-    print(f"{rate:.6f} {name}")
-
 
 
 
 
 
🟢 Pet
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
winner, max_score = 0, 0
-for i in range(5):
-    score = sum([int(d) for d in input().split()])
-    if score > max_score:
-        max_score = score
-        winner = i + 1
-
-print(winner, max_score)
-
 
 
 
 
 
🟢 Piece of Cake!
 
 Solution in Python 
 
 
 
1
-2
n, h, v = [int(d) for d in input().split()]
-print(4 * max(h * v, (n - h) * (n - v), h * (n - v), v * (n - h)))
-
 
 
 
 
 
🟢 Pig Latin
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
def translate(w):
-    if w[0] in "aeiouy":
-        return w + "yay"
-    else:
-        i = 1
-        while i < len(w):
-            if w[i] in "aeiouy":
-                break
-            i += 1
-        return w[i:] + w[:i] + "ay"
-
-
-while True:
-    try:
-        text = input()
-        print(" ".join([translate(w) for w in text.split()]))
-    except:
-        break
-
 
 
 
 
 
🟡 A Vicious Pikeman (Easy)
 
 Solution in Python 
 
 
 
 1
+14
def arithmetic(n):
+    d = [n[i] - n[i + 1] for i in range(len(n) - 1)]
+    return True if len(set(d)) == 1 else False
+
+
+for _ in range(int(input())):
+    s = input().split()
+    n = [int(d) for d in s[1:]]
+    if arithmetic(n):
+        print("arithmetic")
+    elif arithmetic(sorted(n)):
+        print("permuted arithmetic")
+    else:
+        print("non-arithmetic")
+
 
 
 
 
 
🟢 Pervasive Heart Monitor
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
while True:
+    try:
+        line = input().split()
+    except:
+        break
+
+    name, rate = [], []
+    for p in line:
+        if p.isalpha():
+            name.append(p)
+        else:
+            rate.append(float(p))
+    name = " ".join(name)
+    rate = sum(rate) / len(rate)
+    print(f"{rate:.6f} {name}")
+
 
 
 
 
 
🟢 Pet
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
winner, max_score = 0, 0
+for i in range(5):
+    score = sum([int(d) for d in input().split()])
+    if score > max_score:
+        max_score = score
+        winner = i + 1
+
+print(winner, max_score)
+
 
 
 
 
 
🟢 Piece of Cake!
 
 Solution in Python 
 
 
 
1
+2
n, h, v = [int(d) for d in input().split()]
+print(4 * max(h * v, (n - h) * (n - v), h * (n - v), v * (n - h)))
+
 
 
 
 
 
🟢 Pig Latin
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -7966,267 +7962,207 @@
 15
 16
 17
-18
-19
def f(n, time, l):
-    total_time, penalty = 0, 0
-    for i, t in enumerate(sorted(l)):
-        if total_time + t > time:
-            return i, penalty
-        total_time += t
-        penalty = (penalty + total_time) % 1_000_000_007
-    return n, penalty
-
-
-n, t = [int(d) for d in input().split()]
-a, b, c, t0 = [int(d) for d in input().split()]
-l = [t0]
-for _ in range(n - 1):
-    l.append(((a * l[-1] + b) % c) + 1)
-
-
-n, penalty = f(n, t, l)
-print(n, penalty)
-
 
 
 
 
 
🟢 Pizza Crust
 
 Solution in Python 
 
 
 
1
-2
r, c = [int(d) for d in input().split()]
-print(f"{(r-c)**2 / r**2 * 100:.6f}")
-
 
 
 
 
 
🟢 Pizzubestun
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
n = int(input())
-prices = [int(input().split()[-1]) for _ in range(n)]
-if n % 2:
-    prices.append(0)
-prices = sorted(prices, reverse=True)
-print(sum(prices[i] for i in range(0, len(prices), 2)))
-
 
 
 
 
 
🟢 Planetaris
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
_, a = [int(d) for d in input().split()]
-e = sorted([int(d) + 1 for d in input().split()])
-
-t = 0
-for s in e:
-    if a >= s:
-        t += 1
-        a -= s
-    else:
-        break
-print(t)
-
 
 
 
 
 
🟢 Planina
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
def p(n):
-    if n == 1:
-        return 3
-    else:
-        return p(n - 1) * 2 - 1
-
-
-n = int(input())
-print(p(n) ** 2)
-
 
 
 
 
 
🟢 Planting Trees
 
 Solution in Python 
 
 
 
1
+18
def translate(w):
+    if w[0] in "aeiouy":
+        return w + "yay"
+    else:
+        i = 1
+        while i < len(w):
+            if w[i] in "aeiouy":
+                break
+            i += 1
+        return w[i:] + w[:i] + "ay"
+
+
+while True:
+    try:
+        text = input()
+        print(" ".join([translate(w) for w in text.split()]))
+    except:
+        break
+
 
 
 
 
 
🟡 A Vicious Pikeman (Easy)
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
def f(n, time, l):
+    total_time, penalty = 0, 0
+    for i, t in enumerate(sorted(l)):
+        if total_time + t > time:
+            return i, penalty
+        total_time += t
+        penalty = (penalty + total_time) % 1_000_000_007
+    return n, penalty
+
+
+n, t = [int(d) for d in input().split()]
+a, b, c, t0 = [int(d) for d in input().split()]
+l = [t0]
+for _ in range(n - 1):
+    l.append(((a * l[-1] + b) % c) + 1)
+
+
+n, penalty = f(n, t, l)
+print(n, penalty)
+
 
 
 
 
 
🟢 Pizza Crust
 
 Solution in Python 
 
 
 
1
+2
r, c = [int(d) for d in input().split()]
+print(f"{(r-c)**2 / r**2 * 100:.6f}")
+
 
 
 
 
 
🟢 Pizzubestun
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
n = int(input())
+prices = [int(input().split()[-1]) for _ in range(n)]
+if n % 2:
+    prices.append(0)
+prices = sorted(prices, reverse=True)
+print(sum(prices[i] for i in range(0, len(prices), 2)))
+
 
 
 
 
 
🟢 Planetaris
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
_, a = [int(d) for d in input().split()]
+e = sorted([int(d) + 1 for d in input().split()])
+
+t = 0
+for s in e:
+    if a >= s:
+        t += 1
+        a -= s
+    else:
+        break
+print(t)
+
 
 
 
 
 
🟢 Planina
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
n = int(input())
-t = [int(d) for d in input().split()]
-
-days = [v + d for v, d in zip(sorted(t, reverse=True), range(1, n + 1))]
-print(max(days) + 1)
-
 
 
 
 
 
🟢 Pokechat
 
 Solution in Python 
 
 
 
1
+5
+6
+7
+8
+9
def p(n):
+    if n == 1:
+        return 3
+    else:
+        return p(n - 1) * 2 - 1
+
+
+n = int(input())
+print(p(n) ** 2)
+
 
 
 
 
 
🟢 Planting Trees
 
 Solution in Python 
 
 
 
1
 2
 3
-4
chars = input()
-ids = input()
-ids = [int(ids[i : i + 3]) - 1 for i in range(0, len(ids), 3)]
-print("".join([chars[i] for i in ids]))
-
 
 
 
 
 
🟢 Poker Hand
 
 Solution in Python 
 
 
 
1
+4
+5
n = int(input())
+t = [int(d) for d in input().split()]
+
+days = [v + d for v, d in zip(sorted(t, reverse=True), range(1, n + 1))]
+print(max(days) + 1)
+
 
 
 
 
 
🟢 Pokechat
 
 Solution in Python 
 
 
 
1
 2
 3
-4
from collections import Counter
-
-hands = [h[0] for h in input().split()]
-print(max(Counter(hands).values()))
-
 
 
 
 
 
🟢 Polynomial Multiplication 1
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
from collections import Counter
+4
chars = input()
+ids = input()
+ids = [int(ids[i : i + 3]) - 1 for i in range(0, len(ids), 3)]
+print("".join([chars[i] for i in ids]))
+
 
 
 
 
 
🟢 Poker Hand
 
 Solution in Python 
 
 
 
1
+2
+3
+4
from collections import Counter
 
-for _ in range(int(input())):
-    n = int(input())
-    a = [int(d) for d in input().split()]
-    m = int(input())
-    b = [int(d) for d in input().split()]
-    p = Counter()
-    for i in range(n + 1):
-        for j in range(m + 1):
-            p[i + j] += a[i] * b[j]
-    keys = max([k for k in p.keys() if p[k] != 0])
-    print(keys)
-    print(" ".join([str(p[k]) for k in range(keys + 1)]))
-
 
 
 
 
 
🟢 Popularity Contest
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
n, m = [int(d) for d in input().split()]
-p = [0] * n
-for _ in range(m):
-    a, b = [int(d) - 1 for d in input().split()]
-    p[a] += 1
-    p[b] += 1
-print(" ".join([str(a - b) for a, b in zip(p, range(1, 1 + n))]))
-
 
 
 
 
 
🟢 Pot
 
 Solution in Python 
 
 
 
1
+hands = [h[0] for h in input().split()]
+print(max(Counter(hands).values()))
+
 
 
 
 
 
🟢 Polynomial Multiplication 1
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
from collections import Counter
+
+for _ in range(int(input())):
+    n = int(input())
+    a = [int(d) for d in input().split()]
+    m = int(input())
+    b = [int(d) for d in input().split()]
+    p = Counter()
+    for i in range(n + 1):
+        for j in range(m + 1):
+            p[i + j] += a[i] * b[j]
+    keys = max([k for k in p.keys() if p[k] != 0])
+    print(keys)
+    print(" ".join([str(p[k]) for k in range(keys + 1)]))
+
 
 
 
 
 
🟢 Popularity Contest
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
n = int(input())
-total = 0
-for _ in range(n):
-    line = input()
-    n, p = int(line[:-1]), int(line[-1])
-    total += n**p
-print(total)
-
 
 
 
 
 
🟢 Printing Costs
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
t = """
-    0        !   9        "   6        #  24        $  29        %  22
-&  24        '   3        (  12        )  12        *  17        +  13
-,   7        -   7        .   4        /  10        0  22        1  19
-2  22        3  23        4  21        5  27        6  26        7  16
-8  23        9  26        :   8        ;  11        <  10        =  14
->  10        ?  15        @  32        A  24        B  29        C  20
-D  26        E  26        F  20        G  25        H  25        I  18
-J  18        K  21        L  16        M  28        N  25        O  26
-P  23        Q  31        R  28        S  25        T  16        U  23
-V  19        W  26        X  18        Y  14        Z  22        [  18
-\  10        ]  18        ^   7        _   8        `   3        a  23
-b  25        c  17        d  25        e  23        f  18        g  30
-h  21        i  15        j  20        k  21        l  16        m  22
-n  18        o  20        p  25        q  25        r  13        s  21
-t  17        u  17        v  13        w  19        x  13        y  24
-z  19        {  18        |  12        }  18        ~   9
-"""
-
-m = []
-for row in t.splitlines():
-    if not row:
-        continue
-    values = row.split()
-    if len(values) % 2:
-        values.insert(0, " ")
-
-    for i in range(0, len(values), 2):
-        m.append((values[i], int(values[i + 1])))
-m = dict(m)
-
-while True:
-    try:
-        s = input()
-    except:
-        break
-    print(sum([m[c] for c in s]))
-
 
 
 
 
 
🟢 Provinces and Gold
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
g, s, c = [int(d) for d in input().split()]
-
-buying = 3 * g + 2 * s + 1 * c
-result = []
-
-if buying >= 8:
-    result.append("Province")
-elif buying >= 5:
-    result.append("Duchy")
-elif buying >= 2:
-    result.append("Estate")
-
-if buying >= 6:
-    result.append("Gold")
-elif buying >= 3:
-    result.append("Silver")
-else:
-    result.append("Copper")
-
-print(" or ".join(result))
-
 
 
 
 
 
🟢 Prsteni
 
 Solution in Python 
 
 
 
 1
+7
n, m = [int(d) for d in input().split()]
+p = [0] * n
+for _ in range(m):
+    a, b = [int(d) - 1 for d in input().split()]
+    p[a] += 1
+    p[b] += 1
+print(" ".join([str(a - b) for a, b in zip(p, range(1, 1 + n))]))
+
 
 
 
 
 
🟢 Pot
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
n = int(input())
+total = 0
+for _ in range(n):
+    line = input()
+    n, p = int(line[:-1]), int(line[-1])
+    total += n**p
+print(total)
+
 
 
 
 
 
🟢 Saving Princess Peach
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
n, y = [int(d) for d in input().split()]
+found = []
+for _ in range(y):
+    found.append(int(input()))
+found = set(found)
+for i in range(n):
+    if i not in found:
+        print(i)
+print(f"Mario got {len(found)} of the dangerous obstacles.")
+
 
 
 
 
 
🟢 Printing Costs
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8236,18 +8172,70 @@
  8
  9
 10
-11
import math
-
-_ = input()
-numbers = [int(d) for d in input().split()]
-
-base = numbers.pop(0)
-
-gcd = [math.gcd(base, n) for n in numbers]
-
-for g, n in zip(gcd, numbers):
-    print(f"{int(base/g)}/{int(n/g)}")
-
 
 
 
 
 
🟢 Prva
 
 Solution in Python 
 
 
 
 1
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
t = """
+    0        !   9        "   6        #  24        $  29        %  22
+&  24        '   3        (  12        )  12        *  17        +  13
+,   7        -   7        .   4        /  10        0  22        1  19
+2  22        3  23        4  21        5  27        6  26        7  16
+8  23        9  26        :   8        ;  11        <  10        =  14
+>  10        ?  15        @  32        A  24        B  29        C  20
+D  26        E  26        F  20        G  25        H  25        I  18
+J  18        K  21        L  16        M  28        N  25        O  26
+P  23        Q  31        R  28        S  25        T  16        U  23
+V  19        W  26        X  18        Y  14        Z  22        [  18
+\  10        ]  18        ^   7        _   8        `   3        a  23
+b  25        c  17        d  25        e  23        f  18        g  30
+h  21        i  15        j  20        k  21        l  16        m  22
+n  18        o  20        p  25        q  25        r  13        s  21
+t  17        u  17        v  13        w  19        x  13        y  24
+z  19        {  18        |  12        }  18        ~   9
+"""
+
+m = []
+for row in t.splitlines():
+    if not row:
+        continue
+    values = row.split()
+    if len(values) % 2:
+        values.insert(0, " ")
+
+    for i in range(0, len(values), 2):
+        m.append((values[i], int(values[i + 1])))
+m = dict(m)
+
+while True:
+    try:
+        s = input()
+    except:
+        break
+    print(sum([m[c] for c in s]))
+
 
 
 
 
 
🟢 Provinces and Gold
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8259,20 +8247,34 @@
 10
 11
 12
-13
r, c = [int(d) for d in input().split()]
-puzzle = []
-for _ in range(r):
-    puzzle.append(input())
+13
+14
+15
+16
+17
+18
+19
+20
g, s, c = [int(d) for d in input().split()]
+
+buying = 3 * g + 2 * s + 1 * c
+result = []
 
-words = set()
-for row in puzzle:
-    words.update([w for w in row.split("#") if len(w) > 1])
-for i in range(c):
-    col = "".join([row[i] for row in puzzle])
-    words.update([w for w in col.split("#") if len(w) > 1])
+if buying >= 8:
+    result.append("Province")
+elif buying >= 5:
+    result.append("Duchy")
+elif buying >= 2:
+    result.append("Estate")
 
-print(sorted(words)[0])
-
 
 
 
 
 
🟢 Ptice
 
 Solution in Python 
 
 
 
 1
+if buying >= 6:
+    result.append("Gold")
+elif buying >= 3:
+    result.append("Silver")
+else:
+    result.append("Copper")
+
+print(" or ".join(result))
+
 
 
 
 
 
🟢 Prsteni
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8282,120 +8284,18 @@
  8
  9
 10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
def adrian(n):
-    if n == 0:
-        return ""
-    elif n == 1:
-        return "A"
-    elif n == 2:
-        return "AB"
-    elif n == 3:
-        return "ABC"
-    else:
-        duplicate = n // 3
-        return adrian(3) * duplicate + adrian(n % 3)
-
-
-def bruno(n):
-    if n == 0:
-        return ""
-    elif n == 1:
-        return "B"
-    elif n == 2:
-        return "BA"
-    elif n == 3:
-        return "BAB"
-    elif n == 4:
-        return "BABC"
-    else:
-        duplicate = n // 4
-        return bruno(4) * duplicate + bruno(n % 4)
-
-
-def goran(n):
-    if n == 0:
-        return ""
-    elif n in [1, 2]:
-        return "C" * n
-    elif n in [3, 4]:
-        return "CC" + "A" * (n - 2)
-    elif n in [5, 6]:
-        return "CCAA" + "B" * (n - 4)
-    else:
-        duplicate = n // 6
-        return goran(6) * duplicate + goran(n % 6)
-
-
-def get_score(ans, guess):
-    return sum([a == g for a, g in zip(ans, guess)])
-
-
-n = int(input())
-ans = input()
-
-result = {}
-result["Adrian"] = get_score(ans, adrian(n))
-result["Bruno"] = get_score(ans, bruno(n))
-result["Goran"] = get_score(ans, goran(n))
-
-best = max(result.values())
-print(best)
-
-for name, score in result.items():
-    if score == best:
-        print(name)
-
 
 
 
 
 
🟢 Building Pyramids
 
 Solution in Python 
 
 
 
 1
+11
import math
+
+_ = input()
+numbers = [int(d) for d in input().split()]
+
+base = numbers.pop(0)
+
+gcd = [math.gcd(base, n) for n in numbers]
+
+for g, n in zip(gcd, numbers):
+    print(f"{int(base/g)}/{int(n/g)}")
+
 
 
 
 
 
🟢 Prva
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8406,30 +8306,144 @@
  9
 10
 11
-12
n = int(input())
-
-height = 0
-while True:
-    height += 1
-    blocks = (2 * height - 1) ** 2
-    if blocks > n:
-        height -= 1
-        break
-    n -= blocks
-
-print(height)
-
 
 
 
 
 
🟢 Quality-Adjusted Life-Year
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
qaly = 0
-for _ in range(int(input())):
-    q, y = input().split()
-    q, y = float(q), float(y)
-    qaly += q * y
-print(qaly)
-
 
 
 
 
 
🟢 Quadrant Selection
 
 Solutions in 4 languages 
 
 
 
 1
+12
+13
r, c = [int(d) for d in input().split()]
+puzzle = []
+for _ in range(r):
+    puzzle.append(input())
+
+words = set()
+for row in puzzle:
+    words.update([w for w in row.split("#") if len(w) > 1])
+for i in range(c):
+    col = "".join([row[i] for row in puzzle])
+    words.update([w for w in col.split("#") if len(w) > 1])
+
+print(sorted(words)[0])
+
 
 
 
 
 
🟢 Ptice
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
+49
+50
+51
+52
+53
+54
+55
+56
+57
+58
+59
+60
+61
+62
def adrian(n):
+    if n == 0:
+        return ""
+    elif n == 1:
+        return "A"
+    elif n == 2:
+        return "AB"
+    elif n == 3:
+        return "ABC"
+    else:
+        duplicate = n // 3
+        return adrian(3) * duplicate + adrian(n % 3)
+
+
+def bruno(n):
+    if n == 0:
+        return ""
+    elif n == 1:
+        return "B"
+    elif n == 2:
+        return "BA"
+    elif n == 3:
+        return "BAB"
+    elif n == 4:
+        return "BABC"
+    else:
+        duplicate = n // 4
+        return bruno(4) * duplicate + bruno(n % 4)
+
+
+def goran(n):
+    if n == 0:
+        return ""
+    elif n in [1, 2]:
+        return "C" * n
+    elif n in [3, 4]:
+        return "CC" + "A" * (n - 2)
+    elif n in [5, 6]:
+        return "CCAA" + "B" * (n - 4)
+    else:
+        duplicate = n // 6
+        return goran(6) * duplicate + goran(n % 6)
+
+
+def get_score(ans, guess):
+    return sum([a == g for a, g in zip(ans, guess)])
+
+
+n = int(input())
+ans = input()
+
+result = {}
+result["Adrian"] = get_score(ans, adrian(n))
+result["Bruno"] = get_score(ans, bruno(n))
+result["Goran"] = get_score(ans, goran(n))
+
+best = max(result.values())
+print(best)
+
+for name, score in result.items():
+    if score == best:
+        print(name)
+
 
 
 
 
 
🟢 Building Pyramids
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8440,86 +8454,30 @@
  9
 10
 11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
package main
+12
n = int(input())
 
-import "fmt"
-
-func main() {
-    var x, y int
-    fmt.Scan(&x)
-    fmt.Scan(&y)
-    if x > 0 {
-        if y > 0 {
-            fmt.Println(1)
-        } else {
-            fmt.Println(4)
-        }
-    } else {
-        if y > 0 {
-            fmt.Println(2)
-        } else {
-            fmt.Println(3)
-        }
-    }
-}
-
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
import java.util.Scanner;
-
-class QuadrantSelection {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int x = s.nextInt();
-        int y = s.nextInt();
-
-        if (x > 0) {
-            if (y > 0) {
-                System.out.println(1);
-            } else {
-                System.out.println(4);
-            }
-        } else {
-            if (y > 0) {
-                System.out.println(2);
-            } else {
-                System.out.println(3);
-            }
-        }
-
-    }
-}
-
 
 
 
 1
+height = 0
+while True:
+    height += 1
+    blocks = (2 * height - 1) ** 2
+    if blocks > n:
+        height -= 1
+        break
+    n -= blocks
+
+print(height)
+
 
 
 
 
 
🟢 Quality-Adjusted Life-Year
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
qaly = 0
+for _ in range(int(input())):
+    q, y = input().split()
+    q, y = float(q), float(y)
+    qaly += q * y
+print(qaly)
+
 
 
 
 
 
🟢 Quadrant Selection
 
 Solutions in 4 languages 
 
 
 
 1
  2
  3
  4
@@ -8530,18 +8488,38 @@
  9
 10
 11
-12
x = int(input())
-y = int(input())
-if x > 0:
-    if y > 0:
-        print(1)
-    else:
-        print(4)
-else:
-    if y > 0:
-        print(2)
-    else:
-        print(3)
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
package main
+
+import "fmt"
+
+func main() {
+    var x, y int
+    fmt.Scan(&x)
+    fmt.Scan(&y)
+    if x > 0 {
+        if y > 0 {
+            fmt.Println(1)
+        } else {
+            fmt.Println(4)
+        }
+    } else {
+        if y > 0 {
+            fmt.Println(2)
+        } else {
+            fmt.Println(3)
+        }
+    }
+}
 
 
 
 
 1
  2
  3
@@ -8564,30 +8542,32 @@
 20
 21
 22
-23
fn main() {
-    let mut line1 = String::new();
-    std::io::stdin().read_line(&mut line1).unwrap();
-    let x: i32 = line1.trim().parse().unwrap();
-
-    let mut line2 = String::new();
-    std::io::stdin().read_line(&mut line2).unwrap();
-    let y: i32 = line2.trim().parse().unwrap();
-
-    if x > 0 {
-        if y > 0 {
-            println!("1");
-        } else {
-            println!("4");
-        }
-    } else {
-        if y > 0 {
-            println!("2");
-        } else {
-            println!("3");
+23
+24
import java.util.Scanner;
+
+class QuadrantSelection {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int x = s.nextInt();
+        int y = s.nextInt();
+
+        if (x > 0) {
+            if (y > 0) {
+                System.out.println(1);
+            } else {
+                System.out.println(4);
+            }
+        } else {
+            if (y > 0) {
+                System.out.println(2);
+            } else {
+                System.out.println(3);
+            }
         }
-    }
-}
-
 
 
 
 
 
🟢 Quick Brown Fox
 
 Solution in Python 
 
 
 
 1
+
+    }
+}
+
 
 
 
 1
  2
  3
  4
@@ -8596,17 +8576,21 @@
  7
  8
  9
-10
import string
-
-for _ in range(int(input())):
-    p = set([c for c in input().lower() if c.isalpha()])
-    if len(p) == 26:
-        print("pangram")
-    else:
-        print(
-            f"missing {''.join([c for c in string.ascii_lowercase[:26] if c not in p])}"
-        )
-
 
 
 
 
 
🟢 Quick Estimates
 
 Solutions in 2 languages 
 
 
 
 1
+10
+11
+12
x = int(input())
+y = int(input())
+if x > 0:
+    if y > 0:
+        print(1)
+    else:
+        print(4)
+else:
+    if y > 0:
+        print(2)
+    else:
+        print(3)
+
 
 
 
 1
  2
  3
  4
@@ -8617,22 +8601,60 @@
  9
 10
 11
-12
import java.util.Scanner;
-
-class QuickEstimates {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int n = s.nextInt();
-        for (int i = 0; i < n; i++) {
-            String cost = s.next();
-            System.out.println(cost.length());
-        }
-    }
-}
-
 
 
 
1
-2
for _ in range(int(input())):
-    print(len(input()))
-
 
 
 
 
 
🟢 Quite a Problem
 
 Solution in Python 
 
 
 
 1
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
fn main() {
+    let mut line1 = String::new();
+    std::io::stdin().read_line(&mut line1).unwrap();
+    let x: i32 = line1.trim().parse().unwrap();
+
+    let mut line2 = String::new();
+    std::io::stdin().read_line(&mut line2).unwrap();
+    let y: i32 = line2.trim().parse().unwrap();
+
+    if x > 0 {
+        if y > 0 {
+            println!("1");
+        } else {
+            println!("4");
+        }
+    } else {
+        if y > 0 {
+            println!("2");
+        } else {
+            println!("3");
+        }
+    }
+}
+
 
 
 
 
 
🟢 Quick Brown Fox
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
import string
+
+for _ in range(int(input())):
+    p = set([c for c in input().lower() if c.isalpha()])
+    if len(p) == 26:
+        print("pangram")
+    else:
+        print(
+            f"missing {''.join([c for c in string.ascii_lowercase[:26] if c not in p])}"
+        )
+
 
 
 
 
 
🟢 Quick Estimates
 
 Solutions in 2 languages 
 
 
 
 1
  2
  3
  4
@@ -8641,38 +8663,24 @@
  7
  8
  9
-10
while True:
-    try:
-        line = input()
-    except:
-        break
-
-    if "problem" in line.lower():
-        print("yes")
-    else:
-        print("no")
-
 
 
 
 
 
🟢 R2
 
 Solutions in 4 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
#include <iostream>
-
-using namespace std;
-
-int main()
-{
-    int r1, s;
-    cin >> r1 >> s;
-    cout << 2 * s - r1 << endl;
-    return 0;
-}
-
 
 
 
 1
+10
+11
+12
import java.util.Scanner;
+
+class QuickEstimates {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        for (int i = 0; i < n; i++) {
+            String cost = s.next();
+            System.out.println(cost.length());
+        }
+    }
+}
+
 
 
 
1
+2
for _ in range(int(input())):
+    print(len(input()))
+
 
 
 
 
 
🟢 Quite a Problem
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8681,17 +8689,17 @@
  7
  8
  9
-10
package main
-
-import "fmt"
-
-func main() {
-    var r1, s int
-    fmt.Scan(&r1)
-    fmt.Scan(&s)
-    fmt.Println(2*s - r1)
-}
-
 
 
 
 1
+10
while True:
+    try:
+        line = input()
+    except:
+        break
+
+    if "problem" in line.lower():
+        print("yes")
+    else:
+        print("no")
+
 
 
 
 
 
🟢 R2
 
 Solutions in 4 languages 
 
 
 
 1
  2
  3
  4
@@ -8700,22 +8708,38 @@
  7
  8
  9
-10
import java.util.Scanner;
+10
+11
#include <iostream>
 
-class R2 {
-    public static void main(String[] args) {
-        Scanner scanner = new Scanner(System.in);
-        int r1 = scanner.nextInt();
-        int s = scanner.nextInt();
-        System.out.println(2 * s - r1);
-    }
-}
-
 
 
 
1
-2
-3
r1, s = [int(d) for d in input().split()]
-r2 = 2 * s - r1
-print(r2)
-
 
 
 
 
 
🟢 Racing Around the Alphabet
 
 Solution in Python 
 
 
 
 1
+using namespace std;
+
+int main()
+{
+    int r1, s;
+    cin >> r1 >> s;
+    cout << 2 * s - r1 << endl;
+    return 0;
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
package main
+
+import "fmt"
+
+func main() {
+    var r1, s int
+    fmt.Scan(&r1)
+    fmt.Scan(&s)
+    fmt.Println(2*s - r1)
+}
+
 
 
 
 1
  2
  3
  4
@@ -8724,44 +8748,22 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
import math
+10
import java.util.Scanner;
 
-tokens = dict([(chr(c), c - ord("A") + 1) for c in range(ord("A"), ord("Z") + 1)])
-tokens[" "] = 27
-tokens["'"] = 28
-t = math.pi * 60 / (28 * 15)
-for _ in range(int(input())):
-    m = input()
-    total = 1
-    prev = m[0]
-    for c in m[1:]:
-        dist = abs(tokens[prev] - tokens[c])
-        total += 1 + t * min(dist, 28 - dist)
-        prev = c
-    print(total)
-
 
 
 
 
 
🟢 Ragged Right
 
 Solution in Python 
 
 
 
1
+class R2 {
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        int r1 = scanner.nextInt();
+        int s = scanner.nextInt();
+        System.out.println(2 * s - r1);
+    }
+}
+
 
 
 
1
 2
-3
-4
-5
-6
-7
-8
-9
l = []
-while True:
-    try:
-        s = input()
-    except:
-        break
-    l.append(len(s))
-m = max(l)
-print(sum([(n - m) ** 2 for n in l[:-1]]))
-
 
 
 
 
 
🟢 Railroad
 
 Solutions in 3 languages 
 
 
 
 1
+3
r1, s = [int(d) for d in input().split()]
+r2 = 2 * s - r1
+print(r2)
+
 
 
 
 
 
🟢 Racing Around the Alphabet
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8774,116 +8776,120 @@
 11
 12
 13
-14
package main
+14
+15
import math
 
-import "fmt"
-
-func main() {
-    var x, y int
-    fmt.Scan(&x)
-    fmt.Scan(&y)
-    if y%2 == 1 {
-        fmt.Println("impossible")
-    } else {
-        fmt.Println("possible")
-    }
-}
-
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
import java.util.Scanner;
-
-class Railroad {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int x = s.nextInt();
-        int y = s.nextInt();
-        if (y % 2 == 1) {
-            System.out.println("impossible");
-        } else {
-            System.out.println("possible");
-        }
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
_, y = [int(d) for d in input().split()]
-if y % 2:
-    print("impossible")
-else:
-    print("possible")
-
 
 
 
 
 
🟢 A Rank Problem
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
n, m = [int(d) for d in input().split()]
-ranking = [f"T{i}" for i in range(1, 1 + n)]
-for _ in range(m):
-    i, j = input().split()
-    if ranking.index(i) < ranking.index(j):
-        continue
-    ranking.remove(j)
-    ranking.insert(ranking.index(i) + 1, j)
-print(" ".join(ranking))
-
 
 
 
 
 
🟢 Rating Problems
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
import java.util.Scanner;
-
-class RatingProblems {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int n = s.nextInt();
-        int k = s.nextInt();
-        int score = 0;
-        for (int i = 0; i < k; i++) {
-            score += s.nextInt();
-        }
-        float min = (score - 3 * (n - k)) / (float) n;
-        float max = (score + 3 * (n - k)) / (float) n;
-        System.out.println(min + " " + max);
-    }
-}
-
 
 
 
1
+tokens = dict([(chr(c), c - ord("A") + 1) for c in range(ord("A"), ord("Z") + 1)])
+tokens[" "] = 27
+tokens["'"] = 28
+t = math.pi * 60 / (28 * 15)
+for _ in range(int(input())):
+    m = input()
+    total = 1
+    prev = m[0]
+    for c in m[1:]:
+        dist = abs(tokens[prev] - tokens[c])
+        total += 1 + t * min(dist, 28 - dist)
+        prev = c
+    print(total)
+
 
 
 
 
 
🟢 Ragged Right
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
l = []
+while True:
+    try:
+        s = input()
+    except:
+        break
+    l.append(len(s))
+m = max(l)
+print(sum([(n - m) ** 2 for n in l[:-1]]))
+
 
 
 
 
 
🟢 Railroad
 
 Solutions in 3 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
package main
+
+import "fmt"
+
+func main() {
+    var x, y int
+    fmt.Scan(&x)
+    fmt.Scan(&y)
+    if y%2 == 1 {
+        fmt.Println("impossible")
+    } else {
+        fmt.Println("possible")
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
import java.util.Scanner;
+
+class Railroad {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int x = s.nextInt();
+        int y = s.nextInt();
+        if (y % 2 == 1) {
+            System.out.println("impossible");
+        } else {
+            System.out.println("possible");
+        }
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
_, y = [int(d) for d in input().split()]
+if y % 2:
+    print("impossible")
+else:
+    print("possible")
+
 
 
 
 
 
🟢 A Rank Problem
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
n, k = [int(d) for d in input().split()]
-score = 0
-for _ in range(k):
-    score += int(input())
-
-print((score - 3 * (n - k)) / n, (score + 3 * (n - k)) / n)
-
 
 
 
 
 
🟢 A Rational Sequence 2
 
 Solution in Python 
 
 
 
 1
+6
+7
+8
+9
n, m = [int(d) for d in input().split()]
+ranking = [f"T{i}" for i in range(1, 1 + n)]
+for _ in range(m):
+    i, j = input().split()
+    if ranking.index(i) < ranking.index(j):
+        continue
+    ranking.remove(j)
+    ranking.insert(ranking.index(i) + 1, j)
+print(" ".join(ranking))
+
 
 
 
 
 
🟢 Rating Problems
 
 Solutions in 2 languages 
 
 
 
 1
  2
  3
  4
@@ -8895,53 +8901,37 @@
 10
 11
 12
-13
def f(l, r):
-    if l == r:
-        return 1
-    elif l > r:
-        return 2 * f(l - r, r) + 1
-    else:
-        return 2 * f(l, r - l)
-
-
-for _ in range(int(input())):
-    k, v = input().split()
-    l, r = [int(d) for d in v.split("/")]
-    print(f"{k} {f(l,r)}")
-
 
 
 
 
 
🟢 Scaling Recipes
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
for i in range(int(input())):
-    r, p, d = [int(d) for d in input().split()]
-    recipe = {}
-    main = None
-    for _ in range(r):
-        name, weight, percent = input().split()
-        weight = float(weight)
-        percent = float(percent)
-        if percent == 100.0:
-            main = name
-        recipe[name] = (weight, percent)
-    scale = d / p
-    print(f"Recipe # {i+1}")
-    dw = recipe[main][0] * scale
-    for k in recipe:
-        print(k, f"{recipe[k][1] * dw / 100:.1f}")
-    print("-" * 40)
-
 
 
 
 
 
🟢 Recount
 
 Solution in Python 
 
 
 
 1
+13
+14
+15
+16
import java.util.Scanner;
+
+class RatingProblems {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        int k = s.nextInt();
+        int score = 0;
+        for (int i = 0; i < k; i++) {
+            score += s.nextInt();
+        }
+        float min = (score - 3 * (n - k)) / (float) n;
+        float max = (score + 3 * (n - k)) / (float) n;
+        System.out.println(min + " " + max);
+    }
+}
+
 
 
 
1
+2
+3
+4
+5
+6
n, k = [int(d) for d in input().split()]
+score = 0
+for _ in range(k):
+    score += int(input())
+
+print((score - 3 * (n - k)) / n, (score + 3 * (n - k)) / n)
+
 
 
 
 
 
🟢 A Rational Sequence 2
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8953,25 +8943,53 @@
 10
 11
 12
-13
from collections import Counter
-
-c = Counter()
-while True:
-    try:
-        name = input()
-    except:
-        break
-    c[name] += 1
-
-highest = max(c.values())
-names = [k for k in c if c[k] == highest]
-print("Runoff!" if len(names) > 1 else names.pop())
-
 
 
 
 
 
🟢 Rectangle Area
 
 Solution in Python 
 
 
 
1
-2
-3
x1, y1, x2, y2 = [float(d) for d in input().split()]
-
-print(abs((x1 - x2) * (y1 - y2)))
-
 
 
 
 
 
🟢 Reduced ID Numbers
 
 Solution in Python 
 
 
 
 1
+13
def f(l, r):
+    if l == r:
+        return 1
+    elif l > r:
+        return 2 * f(l - r, r) + 1
+    else:
+        return 2 * f(l, r - l)
+
+
+for _ in range(int(input())):
+    k, v = input().split()
+    l, r = [int(d) for d in v.split("/")]
+    print(f"{k} {f(l,r)}")
+
 
 
 
 
 
🟢 Scaling Recipes
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
for i in range(int(input())):
+    r, p, d = [int(d) for d in input().split()]
+    recipe = {}
+    main = None
+    for _ in range(r):
+        name, weight, percent = input().split()
+        weight = float(weight)
+        percent = float(percent)
+        if percent == 100.0:
+            main = name
+        recipe[name] = (weight, percent)
+    scale = d / p
+    print(f"Recipe # {i+1}")
+    dw = recipe[main][0] * scale
+    for k in recipe:
+        print(k, f"{recipe[k][1] * dw / 100:.1f}")
+    print("-" * 40)
+
 
 
 
 
 
🟢 Recount
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -8983,35 +9001,25 @@
 10
 11
 12
-13
g = int(input())
-ids = []
-for _ in range(g):
-    ids.append(int(input()))
-
-m = 1
-while True:
-    v = [d % m for d in ids]
-    if g == len(set(v)):
-        break
-    m += 1
-
-print(m)
-
 
 
 
 
 
🟢 Relocation
 
 Solution in Python 
 
 
 
1
+13
from collections import Counter
+
+c = Counter()
+while True:
+    try:
+        name = input()
+    except:
+        break
+    c[name] += 1
+
+highest = max(c.values())
+names = [k for k in c if c[k] == highest]
+print("Runoff!" if len(names) > 1 else names.pop())
+
 
 
 
 
 
🟢 Rectangle Area
 
 Solution in Python 
 
 
 
1
 2
-3
-4
-5
-6
-7
-8
n, q = [int(d) for d in input().split()]
-x = [int(d) for d in input().split()]
-for _ in range(q):
-    req = [int(d) for d in input().split()]
-    if req[0] == 1:
-        x[req[1] - 1] = req[2]
-    elif req[0] == 2:
-        print(abs(x[req[1] - 1] - x[req[2] - 1]))
-
 
 
 
 
 
🟢 Restaurant Opening
 
 Solution in Python 
 
 
 
 1
+3
x1, y1, x2, y2 = [float(d) for d in input().split()]
+
+print(abs((x1 - x2) * (y1 - y2)))
+
 
 
 
 
 
🟢 Reduced ID Numbers
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9023,45 +9031,35 @@
 10
 11
 12
-13
-14
-15
-16
-17
-18
from itertools import product
-
-n, m = [int(d) for d in input().split()]
-
-g = []
-for _ in range(n):
-    g.append([int(d) for d in input().split()])
-
-l = list(product(range(n), range(m)))
-
-c = []
-for i, j in l:
-    s = 0
-    for a, b in l:
-        s += g[a][b] * (abs(i - a) + abs(j - b))
-    c.append(s)
-
-print(min(c))
-
 
 
 
 
 
🟢 Reversed Binary Numbers
 
 Solution in Python 
 
 
 
1
+13
g = int(input())
+ids = []
+for _ in range(g):
+    ids.append(int(input()))
+
+m = 1
+while True:
+    v = [d % m for d in ids]
+    if g == len(set(v)):
+        break
+    m += 1
+
+print(m)
+
 
 
 
 
 
🟢 Relocation
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
 7
-8
n = int(input())
-
-b = []
-while n:
-    b.append(n % 2)
-    n //= 2
-
-print(sum([d * (2**p) for d, p in zip(b, reversed(range(len(b))))]))
-
 
 
 
 
 
🟢 Reverse Rot
 
 Solution in Python 
 
 
 
 1
+8
n, q = [int(d) for d in input().split()]
+x = [int(d) for d in input().split()]
+for _ in range(q):
+    req = [int(d) for d in input().split()]
+    if req[0] == 1:
+        x[req[1] - 1] = req[2]
+    elif req[0] == 2:
+        print(abs(x[req[1] - 1] - x[req[2] - 1]))
+
 
 
 
 
 
🟢 Restaurant Opening
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9077,51 +9075,41 @@
 14
 15
 16
-17
import string
+17
+18
from itertools import product
 
-rotations = string.ascii_uppercase + "_."
+n, m = [int(d) for d in input().split()]
 
-
-def rotate(c, n):
-    index = (rotations.index(c) + n) % 28
-    return rotations[index]
-
+g = []
+for _ in range(n):
+    g.append([int(d) for d in input().split()])
+
+l = list(product(range(n), range(m)))
 
-while True:
-    line = input()
-    if line == "0":
-        break
-    n, m = line.split()
-    n = int(n)
-    print("".join([rotate(c, n) for c in m[::-1]]))
-
 
 
 
 
 
🟢 Riječi
 
 Solutions in 3 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
package main
+c = []
+for i, j in l:
+    s = 0
+    for a, b in l:
+        s += g[a][b] * (abs(i - a) + abs(j - b))
+    c.append(s)
+
+print(min(c))
+
 
 
 
 
 
🟢 Reversed Binary Numbers
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
n = int(input())
 
-import "fmt"
-
-func main() {
-    var n int
-    fmt.Scan(&n)
-    a := 1
-    b := 0
-    for i := 0; i < n; i++ {
-        a, b = b, b+a
-    }
-    fmt.Println(a, b)
-}
-
 
 
 
 1
+b = []
+while n:
+    b.append(n % 2)
+    n //= 2
+
+print(sum([d * (2**p) for d, p in zip(b, reversed(range(len(b))))]))
+
 
 
 
 
 
🟢 Reverse Rot
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9137,107 +9125,117 @@
 14
 15
 16
-17
-18
import java.util.Scanner;
+17
import string
 
-class Rijeci {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int k = s.nextInt();
-        int a = 1;
-        int b = 0;
-        for (int i = 0; i < k; i++) {
-            int t = b;
-            b = a + b;
-            a = t;
-
-        }
-
-        System.out.println(a + " " + b);
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
k = int(input())
-a, b = 1, 0
-for _ in range(k):
-    a, b = b, b + a
-
-print(a, b)
-
 
 
 
 
 
🟢 Roaming Romans
 
 Solutions in 2 languages 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
package main
+rotations = string.ascii_uppercase + "_."
+
+
+def rotate(c, n):
+    index = (rotations.index(c) + n) % 28
+    return rotations[index]
+
+
+while True:
+    line = input()
+    if line == "0":
+        break
+    n, m = line.split()
+    n = int(n)
+    print("".join([rotate(c, n) for c in m[::-1]]))
+
 
 
 
 
 
🟢 Riječi
 
 Solutions in 3 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
package main
+
+import "fmt"
+
+func main() {
+    var n int
+    fmt.Scan(&n)
+    a := 1
+    b := 0
+    for i := 0; i < n; i++ {
+        a, b = b, b+a
+    }
+    fmt.Println(a, b)
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
import java.util.Scanner;
 
-import "fmt"
-
-func main() {
-    var x float64
-    fmt.Scan(&x)
-    fmt.Println(int(x*1000*5280/4854 + 0.5))
-}
+class Rijeci {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int k = s.nextInt();
+        int a = 1;
+        int b = 0;
+        for (int i = 0; i < k; i++) {
+            int t = b;
+            b = a + b;
+            a = t;
+
+        }
+
+        System.out.println(a + " " + b);
+    }
+}
 
 
 
 
1
-2
x = float(input())
-print(int(x * 1000 * 5280 / 4854 + 0.5))
-
 
 
 
 
 
🟢 Run-Length Encoding, Run!
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
action, s = input().split()
-if action == "D":
-    print("".join([s[i] * int(s[i + 1]) for i in range(0, len(s), 2)]))
-elif action == "E":
-    parts = []
-    prev, t = s[0], 1
-    for c in s[1:]:
-        if c != prev:
-            parts.append((prev, t))
-            t = 1
-            prev = c
-        else:
-            t += 1
-    parts.append((prev, t))
-
-    print("".join([f"{k}{v}" for k, v in parts]))
-
 
 
 
 
 
🟢 Same Digits (Easy)
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
a, b = [int(d) for d in input().split()]
-pairs = []
-for x in range(a, b + 1):
-    for y in range(x, b + 1):
-        xy = x * y
-        if sorted(str(xy)) == sorted(str(x) + str(y)):
-            pairs.append((x, y, xy))
-print(f"{len(pairs)} digit-preserving pair(s)")
-for x, y, xy in pairs:
-    print(f"x = {x}, y = {y}, xy = {xy}")
-
 
 
 
 
 
🟡 Same Digits (Hard)
 
 Solution in Python 
 
 
 
 1
+2
+3
+4
+5
+6
k = int(input())
+a, b = 1, 0
+for _ in range(k):
+    a, b = b, b + a
+
+print(a, b)
+
 
 
 
 
 
🟢 Roaming Romans
 
 Solutions in 2 languages 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
package main
+
+import "fmt"
+
+func main() {
+    var x float64
+    fmt.Scan(&x)
+    fmt.Println(int(x*1000*5280/4854 + 0.5))
+}
+
 
 
 
1
+2
x = float(input())
+print(int(x * 1000 * 5280 / 4854 + 0.5))
+
 
 
 
 
 
🟢 Run-Length Encoding, Run!
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9251,22 +9249,24 @@
 12
 13
 14
-15
a, b = [int(d) for d in input().split()]
-pairs = []
-for x in range(a, b + 1):
-    for y in range(x, b + 1):
-        xy = x * y
-        if x * y > b:
-            break
-        if sorted(str(xy)) == sorted(str(x) + str(y)):
-            pairs.append((x, y, xy))
-    if x * x > b:
-        break
-
-print(f"{len(pairs)} digit-preserving pair(s)")
-for x, y, xy in pairs:
-    print(f"x = {x}, y = {y}, xy = {xy}")
-
 
 
 
 
 
🟢 Saving Daylight
 
 Solution in Python 
 
 
 
 1
+15
+16
action, s = input().split()
+if action == "D":
+    print("".join([s[i] * int(s[i + 1]) for i in range(0, len(s), 2)]))
+elif action == "E":
+    parts = []
+    prev, t = s[0], 1
+    for c in s[1:]:
+        if c != prev:
+            parts.append((prev, t))
+            t = 1
+            prev = c
+        else:
+            t += 1
+    parts.append((prev, t))
+
+    print("".join([f"{k}{v}" for k, v in parts]))
+
 
 
 
 
 
🟢 Same Digits (Easy)
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9275,50 +9275,46 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
while True:
-    try:
-        s = input().split()
-    except:
-        break
-
-    t1, t2 = s[-2:]
-
-    h1, m1 = [int(d) for d in t1.split(":")]
-    h2, m2 = [int(d) for d in t2.split(":")]
-
-    mins = (h2 - h1) * 60 + (m2 - m1)
-    h = mins // 60
-    m = mins % 60
-
-    ans = s[:-2]
-    ans.extend([str(h), "hours", str(m), "minutes"])
-
-    print(" ".join(ans))
-
 
 
 
 
 
🟢 Saving For Retirement
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
import math
-
-B, Br, Bs, A, As = [int(d) for d in input().split()]
-rate = Bs * (Br - B) / As
-Ar = math.ceil(rate) + A
-if rate.is_integer():
-    Ar += 1
-print(Ar)
-
 
 
 
 
 
🟢 Scaling Recipe
 
 Solution in Python 
 
 
 
 1
+10
a, b = [int(d) for d in input().split()]
+pairs = []
+for x in range(a, b + 1):
+    for y in range(x, b + 1):
+        xy = x * y
+        if sorted(str(xy)) == sorted(str(x) + str(y)):
+            pairs.append((x, y, xy))
+print(f"{len(pairs)} digit-preserving pair(s)")
+for x, y, xy in pairs:
+    print(f"x = {x}, y = {y}, xy = {xy}")
+
 
 
 
 
 
🟡 Same Digits (Hard)
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
a, b = [int(d) for d in input().split()]
+pairs = []
+for x in range(a, b + 1):
+    for y in range(x, b + 1):
+        xy = x * y
+        if x * y > b:
+            break
+        if sorted(str(xy)) == sorted(str(x) + str(y)):
+            pairs.append((x, y, xy))
+    if x * x > b:
+        break
+
+print(f"{len(pairs)} digit-preserving pair(s)")
+for x, y, xy in pairs:
+    print(f"x = {x}, y = {y}, xy = {xy}")
+
 
 
 
 
 
🟢 Saving Daylight
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9335,60 +9331,42 @@
 15
 16
 17
-18
import math
-
-n, x, y = [int(d) for d in input().split()]
-i = [int(input()) for _ in range(n)]
-
-# for python 3.9+ (https://docs.python.org/3.9/library/math.html#math.gcd)
-# s = math.gcd(x, *i)
+18
+19
while True:
+    try:
+        s = input().split()
+    except:
+        break
+
+    t1, t2 = s[-2:]
 
-s = math.gcd(x, i[0])
-for k in range(1, n):
-    s = math.gcd(s, i[k])
-
-x /= s
-i = [v / s for v in i]
+    h1, m1 = [int(d) for d in t1.split(":")]
+    h2, m2 = [int(d) for d in t2.split(":")]
+
+    mins = (h2 - h1) * 60 + (m2 - m1)
+    h = mins // 60
+    m = mins % 60
 
-scale = y / x
-for v in i:
-    print(int(scale * v))
-
 
 
 
 
 
🟢 School Spirit
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
n = int(input())
-s = []
-for _ in range(n):
-    s.append(int(input()))
-
-
-def group_score(s):
-    gs = 0
-    for i in range(len(s)):
-        gs += s[i] * (0.8**i)
-    return 0.2 * gs
-
-
-print(group_score(s))
-new_gs = []
-for i in range(n):
-    new_gs.append(group_score([s[j] for j in range(n) if j != i]))
-print(sum(new_gs) / len(new_gs))
-
 
 
 
 
 
🟢 Secret Message
 
 Solution in Python 
 
 
 
 1
+    ans = s[:-2]
+    ans.extend([str(h), "hours", str(m), "minutes"])
+
+    print(" ".join(ans))
+
 
 
 
 
 
🟢 Saving For Retirement
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
import math
+
+B, Br, Bs, A, As = [int(d) for d in input().split()]
+rate = Bs * (Br - B) / As
+Ar = math.ceil(rate) + A
+if rate.is_integer():
+    Ar += 1
+print(Ar)
+
 
 
 
 
 
🟢 Scaling Recipe
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9400,54 +9378,90 @@
 10
 11
 12
-13
import math
+13
+14
+15
+16
+17
+18
import math
 
-for _ in range(int(input())):
-    m = input()
-    k = math.ceil(len(m) ** 0.5)
-
-    m += "*" * (k * k - len(m))
-    rows = [m[i : i + k] for i in range(0, len(m), k)]
-
-    s = []
-    for i in range(k):
-        s.append("".join([row[i] for row in rows if row[i] != "*"][::-1]))
-    print("".join(s))
-
 
 
 
 
 
🟢 Secure Doors
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
pool = set()
-for _ in range(int(input())):
-    action, name = input().split()
-    if action == "entry":
-        print(name, "entered", "(ANOMALY)" if name in pool else "")
-        pool.add(name)
-    elif action == "exit":
-        print(name, "exited", "(ANOMALY)" if name not in pool else "")
-        pool.discard(name)
-
 
 
 
 
 
🟢 Server
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
_, t = [int(d) for d in input().split()]
-total, used = 0, 0
-for v in [int(d) for d in input().split()]:
-    if used + v <= t:
-        total += 1
-        used += v
-    else:
-        break
-print(total)
-
 
 
 
 
 
🟢 Seven Wonders
 
 Solution in Python 
 
 
 
1
+n, x, y = [int(d) for d in input().split()]
+i = [int(input()) for _ in range(n)]
+
+# for python 3.9+ (https://docs.python.org/3.9/library/math.html#math.gcd)
+# s = math.gcd(x, *i)
+
+s = math.gcd(x, i[0])
+for k in range(1, n):
+    s = math.gcd(s, i[k])
+
+x /= s
+i = [v / s for v in i]
+
+scale = y / x
+for v in i:
+    print(int(scale * v))
+
 
 
 
 
 
🟢 School Spirit
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
n = int(input())
+s = []
+for _ in range(n):
+    s.append(int(input()))
+
+
+def group_score(s):
+    gs = 0
+    for i in range(len(s)):
+        gs += s[i] * (0.8**i)
+    return 0.2 * gs
+
+
+print(group_score(s))
+new_gs = []
+for i in range(n):
+    new_gs.append(group_score([s[j] for j in range(n) if j != i]))
+print(sum(new_gs) / len(new_gs))
+
 
 
 
 
 
🟢 Secret Message
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
import math
+
+for _ in range(int(input())):
+    m = input()
+    k = math.ceil(len(m) ** 0.5)
+
+    m += "*" * (k * k - len(m))
+    rows = [m[i : i + k] for i in range(0, len(m), k)]
+
+    s = []
+    for i in range(k):
+        s.append("".join([row[i] for row in rows if row[i] != "*"][::-1]))
+    print("".join(s))
+
 
 
 
 
 
🟢 Secure Doors
 
 Solution in Python 
 
 
 
1
 2
 3
 4
@@ -9455,76 +9469,74 @@
 6
 7
 8
-9
from collections import Counter
-
-c = Counter(input())
-score = 0
-for value in c.values():
-    score += value**2
-if len(c.values()) == 3:
-    score += 7 * min(c.values())
-print(score)
-
 
 
 
 
 
🟢 Shattered Cake
 
 Solution in Python 
 
 
 
1
+9
pool = set()
+for _ in range(int(input())):
+    action, name = input().split()
+    if action == "entry":
+        print(name, "entered", "(ANOMALY)" if name in pool else "")
+        pool.add(name)
+    elif action == "exit":
+        print(name, "exited", "(ANOMALY)" if name not in pool else "")
+        pool.discard(name)
+
 
 
 
 
 
🟢 Server
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
w, n = int(input()), int(input())
-total = 0
-for _ in range(n):
-    _w, _l = [int(d) for d in input().split()]
-    total += _w * _l
-print(int(total / w))
-
 
 
 
 
 
🟢 Shopaholic
 
 Solution in Python 
 
 
 
1
+6
+7
+8
+9
_, t = [int(d) for d in input().split()]
+total, used = 0, 0
+for v in [int(d) for d in input().split()]:
+    if used + v <= t:
+        total += 1
+        used += v
+    else:
+        break
+print(total)
+
 
 
 
 
 
🟢 Seven Wonders
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
n = int(input())
-c = [int(d) for d in input().split()]
-
-c = sorted(c, reverse=True)
-groups = [c[i : i + 3] if i + 3 < n else c[i:] for i in range(0, n, 3)]
-
-print(sum(g[-1] if len(g) == 3 else 0 for g in groups))
-
 
 
 
 
 
🟢 Shopping List (Easy)
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
n, m = [int(d) for d in input().split()]
-items = []
+7
+8
+9
from collections import Counter
+
+c = Counter(input())
+score = 0
+for value in c.values():
+    score += value**2
+if len(c.values()) == 3:
+    score += 7 * min(c.values())
+print(score)
+
 
 
 
 
 
🟢 Shattered Cake
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
w, n = int(input()), int(input())
+total = 0
 for _ in range(n):
-    items.append(set(input().split()))
-
-ans = items[0]
-ans = ans.intersection(*items[1:])
-
-print(len(ans))
-print("\n".join(sorted(list(ans))))
-
 
 
 
 
 
🟢 Sibice
 
 Solution in Python 
 
 
 
1
+    _w, _l = [int(d) for d in input().split()]
+    total += _w * _l
+print(int(total / w))
+
 
 
 
 
 
🟢 Shopaholic
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
-8
-9
import math
-
-n, w, h = [int(d) for d in input().split()]
-for _ in range(n):
-    line = int(input())
-    if line <= math.sqrt(w**2 + h**2):
-        print("DA")
-    else:
-        print("NE")
-
 
 
 
 
 
🟢 Sideways Sorting
 
 Solution in Python 
 
 
 
 1
+7
n = int(input())
+c = [int(d) for d in input().split()]
+
+c = sorted(c, reverse=True)
+groups = [c[i : i + 3] if i + 3 < n else c[i:] for i in range(0, n, 3)]
+
+print(sum(g[-1] if len(g) == 3 else 0 for g in groups))
+
 
 
 
 
 
🟢 Shopping List (Easy)
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9533,63 +9545,59 @@
  7
  8
  9
-10
-11
-12
-13
while True:
-    r, c = [int(d) for d in input().split()]
-    if not r and not c:
-        break
-    s = []
-    for _ in range(r):
-        s.append(input())
-    items = []
-    for i in range(c):
-        items.append("".join(s[j][i] for j in range(r)))
-    items = sorted(items, key=lambda t: t.lower())
-    for i in range(r):
-        print("".join(items[j][i] for j in range(c)))
-
 
 
 
 
 
🟢 Digit Product
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
def digit_product(x):
-    ans = 1
-    while x:
-        ans *= x % 10 or 1
-        x //= 10
-    return ans
-
-
-x = int(input())
-while True:
-    x = digit_product(x)
-    if x < 10:
-        break
-print(x)
-
 
 
 
 
 
🟡 Simon Says
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
for _ in range(int(input())):
-    command = input()
-    start = "simon says "
-    if command.startswith(start):
-        print(command[len(start) :])
-    else:
-        print()
-
 
 
 
 
 
🟢 Simone
 
 Solution in Python 
 
 
 
 1
+10
n, m = [int(d) for d in input().split()]
+items = []
+for _ in range(n):
+    items.append(set(input().split()))
+
+ans = items[0]
+ans = ans.intersection(*items[1:])
+
+print(len(ans))
+print("\n".join(sorted(list(ans))))
+
 
 
 
 
 
🟢 Sibice
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
import math
+
+n, w, h = [int(d) for d in input().split()]
+for _ in range(n):
+    line = int(input())
+    if line <= math.sqrt(w**2 + h**2):
+        print("DA")
+    else:
+        print("NE")
+
 
 
 
 
 
🟢 Sideways Sorting
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
while True:
+    r, c = [int(d) for d in input().split()]
+    if not r and not c:
+        break
+    s = []
+    for _ in range(r):
+        s.append(input())
+    items = []
+    for i in range(c):
+        items.append("".join(s[j][i] for j in range(r)))
+    items = sorted(items, key=lambda t: t.lower())
+    for i in range(r):
+        print("".join(items[j][i] for j in range(c)))
+
 
 
 
 
 
🟢 Digit Product
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9602,36 +9610,34 @@
 11
 12
 13
-14
-15
-16
-17
from collections import Counter
-
-n, k = [int(d) for d in input().split()]
-
-s = Counter(int(d) for d in input().split())
-
-least = min(s.values())
-if len(s.values()) < k:
-    least = 0
-ans = 0
-c = []
-for i in range(k):
-    if s[i + 1] == least:
-        c.append(str(i + 1))
-        ans += 1
-print(ans)
-print(" ".join(c))
-
 
 
 
 
 
🟢 Simon Says
 
 Solution in Python 
 
 
 
1
+14
def digit_product(x):
+    ans = 1
+    while x:
+        ans *= x % 10 or 1
+        x //= 10
+    return ans
+
+
+x = int(input())
+while True:
+    x = digit_product(x)
+    if x < 10:
+        break
+print(x)
+
 
 
 
 
 
🟡 Simon Says
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
for _ in range(int(input())):
+5
+6
+7
for _ in range(int(input())):
     command = input()
-    start = "Simon says "
+    start = "simon says "
     if command.startswith(start):
         print(command[len(start) :])
-
 
 
 
 
 
🟢 Simple Addition
 
 Solution in Python 
 
 
 
 1
+    else:
+        print()
+
 
 
 
 
 
🟢 Simone
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9647,55 +9653,33 @@
 14
 15
 16
-17
-18
-19
-20
-21
-22
-23
-24
-25
a, b = input(), input()
+17
from collections import Counter
 
-a = a[::-1]
-b = b[::-1]
-i = 0
-ans = ""
-carry = 0
-while i < len(a) or i < len(b):
-    if i < len(a) and i < len(b):
-        s = int(a[i]) + int(b[i]) + carry
-
-    elif i < len(a):
-        s = int(a[i]) + carry
-
-    else:
-        s = int(b[i]) + carry
-    ans += str(s % 10)
-    carry = s // 10
-    i += 1
-if carry:
-    ans += str(carry)
-print(ans[::-1])
-
-# or simply
-# print(int(a) + int(b))
-
 
 
 
 
 
🟢 Simple Factoring
 
 Solution in Python 
 
 
 
1
+n, k = [int(d) for d in input().split()]
+
+s = Counter(int(d) for d in input().split())
+
+least = min(s.values())
+if len(s.values()) < k:
+    least = 0
+ans = 0
+c = []
+for i in range(k):
+    if s[i + 1] == least:
+        c.append(str(i + 1))
+        ans += 1
+print(ans)
+print(" ".join(c))
+
 
 
 
 
 
🟢 Simon Says
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
-6
-7
-8
for _ in range(int(input())):
-    a, b, c = [int(d) for d in input().split()]
-    import math
-
-    if not b**2 - 4 * a * c < 0 and math.sqrt(b**2 - 4 * a * c).is_integer():
-        print("YES")
-    else:
-        print("NO")
-
 
 
 
 
 
🟢 Sith
 
 Solution in Python 
 
 
 
 1
+5
for _ in range(int(input())):
+    command = input()
+    start = "Simon says "
+    if command.startswith(start):
+        print(command[len(start) :])
+
 
 
 
 
 
🟢 Simple Addition
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9704,20 +9688,62 @@
  7
  8
  9
-10
_ = input()
-a = int(input())
-b = int(input())
-diff = int(input())
-if diff <= 0:
-    print("JEDI")
-elif a < b:
-    print("SITH")
-else:
-    print("VEIT EKKI")
-
 
 
 
 
 
🟢 Sjecista
 
 Solution in Python 
 
 
 
1
-2
n = int(input())
-print((n - 3) * (n - 2) * (n - 1) * (n) // 24)
-
 
 
 
 
 
🟢 Skener
 
 Solution in Python 
 
 
 
 1
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
a, b = input(), input()
+
+a = a[::-1]
+b = b[::-1]
+i = 0
+ans = ""
+carry = 0
+while i < len(a) or i < len(b):
+    if i < len(a) and i < len(b):
+        s = int(a[i]) + int(b[i]) + carry
+
+    elif i < len(a):
+        s = int(a[i]) + carry
+
+    else:
+        s = int(b[i]) + carry
+    ans += str(s % 10)
+    carry = s // 10
+    i += 1
+if carry:
+    ans += str(carry)
+print(ans[::-1])
+
+# or simply
+# print(int(a) + int(b))
+
 
 
 
 
 
🟢 Simple Factoring
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
for _ in range(int(input())):
+    a, b, c = [int(d) for d in input().split()]
+    import math
+
+    if not b**2 - 4 * a * c < 0 and math.sqrt(b**2 - 4 * a * c).is_integer():
+        print("YES")
+    else:
+        print("NO")
+
 
 
 
 
 
🟢 Sith
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -9726,161 +9752,103 @@
  7
  8
  9
-10
-11
-12
-13
r, _, zr, zc = [int(d) for d in input().split()]
-matrix = []
-for _ in range(r):
-    matrix.append(input())
-
-ans = []
-
-for row in matrix:
-    for i in range(zr):
-        ans.append(row)
-
-for row in ans:
-    print("".join([col * zc for col in row]))
-
 
 
 
 
 
🟢 Skocimis
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
package main
-
-import "fmt"
-
-func main() {
-    var a, b, c int
-    fmt.Scan(&a)
-    fmt.Scan(&b)
-    fmt.Scan(&c)
-    x := b - a
-    y := c - b
-    ans := x
-    if ans < y {
-        ans = y
-    }
-    ans -= 1
-    fmt.Println(ans)
-}
-
 
 
 
1
-2
a, b, c = [int(d) for d in input().split()]
-print(max(b - a, c - b) - 1)
-
 
 
 
 
 
🟢 Turn It Up!
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
volume = 7
-for _ in range(int(input())):
-    if input() == "Skru op!":
-        volume = min(volume + 1, 10)
-    else:
-        volume = max(volume - 1, 0)
-print(volume)
-
 
 
 
 
 
🟢 Slatkisi
 
 Solution in Python 
 
 
 
1
-2
-3
-4
c, k = [int(d) for d in input().split()]
-d = 10**k
-c = (c // d) * d + (d if (c % d) / d >= 0.5 else 0)
-print(c)
-
 
 
 
 
 
🟢 SMIL
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
import java.util.Scanner;
-
-class SMIL {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        String m = s.nextLine();
-        int size = m.length();
-        int i = 0;
-        while (i < size) {
-            if (m.charAt(i) == ':' || m.charAt(i) == ';') {
-                if (i + 1 < size && m.charAt(i + 1) == ')') {
-                    System.out.println(i);
-                    i += 2;
-                    continue;
-                }
-                if (i + 2 < size && m.charAt(i + 1) == '-' && m.charAt(i + 2) == ')') {
-                    System.out.println(i);
-                    i += 3;
-                    continue;
-                }
-            }
-            i += 1;
-        }
-    }
-}
-
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
s = input()
-
-i = 0
-size = len(s)
-while i < size:
-    if s[i] in [":", ";"]:
-        if i + 1 < size and s[i + 1] == ")":
-            print(i)
-            i += 2
-            continue
-        if i + 2 < size and s[i + 1] == "-" and s[i + 2] == ")":
-            print(i)
-            i += 3
-            continue
-
-    i += 1
-
 
 
 
 
 
🟢 Soda Slurper
 
 Solutions in 2 languages 
 
 
 
 1
+10
_ = input()
+a = int(input())
+b = int(input())
+diff = int(input())
+if diff <= 0:
+    print("JEDI")
+elif a < b:
+    print("SITH")
+else:
+    print("VEIT EKKI")
+
 
 
 
 
 
🟢 Sjecista
 
 Solution in Python 
 
 
 
1
+2
n = int(input())
+print((n - 3) * (n - 2) * (n - 1) * (n) // 24)
+
 
 
 
 
 
🟢 Skener
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
r, _, zr, zc = [int(d) for d in input().split()]
+matrix = []
+for _ in range(r):
+    matrix.append(input())
+
+ans = []
+
+for row in matrix:
+    for i in range(zr):
+        ans.append(row)
+
+for row in ans:
+    print("".join([col * zc for col in row]))
+
 
 
 
 
 
🟢 Skocimis
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
package main
+
+import "fmt"
+
+func main() {
+    var a, b, c int
+    fmt.Scan(&a)
+    fmt.Scan(&b)
+    fmt.Scan(&c)
+    x := b - a
+    y := c - b
+    ans := x
+    if ans < y {
+        ans = y
+    }
+    ans -= 1
+    fmt.Println(ans)
+}
+
 
 
 
1
+2
a, b, c = [int(d) for d in input().split()]
+print(max(b - a, c - b) - 1)
+
 
 
 
 
 
🟢 Turn It Up!
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
volume = 7
+for _ in range(int(input())):
+    if input() == "Skru op!":
+        volume = min(volume + 1, 10)
+    else:
+        volume = max(volume - 1, 0)
+print(volume)
+
 
 
 
 
 
🟢 Slatkisi
 
 Solution in Python 
 
 
 
1
+2
+3
+4
c, k = [int(d) for d in input().split()]
+d = 10**k
+c = (c // d) * d + (d if (c % d) / d >= 0.5 else 0)
+print(c)
+
 
 
 
 
 
🟢 SMIL
 
 Solutions in 2 languages 
 
 
 
 1
  2
  3
  4
@@ -9896,117 +9864,141 @@
 14
 15
 16
-17
package main
+17
+18
+19
+20
+21
+22
+23
+24
+25
import java.util.Scanner;
 
-import "fmt"
-
-func main() {
-    var e, f, c int
-    fmt.Scan(&e)
-    fmt.Scan(&f)
-    fmt.Scan(&c)
-    total := 0
-    s := e + f
-    for s >= c {
-        total += s / c
-        s = s%c + s/c
-    }
-    fmt.Println(total)
-}
-
 
 
 
1
-2
-3
-4
-5
-6
-7
e, f, c = [int(d) for d in input().split()]
-total = 0
-s = e + f
-while s >= c:
-    total += s // c
-    s = s % c + s // c
-print(total)
-
 
 
 
 
 
🟢 Sok
 
 Solution in Python 
 
 
 
1
-2
-3
-4
a, b, c = [int(d) for d in input().split()]
-i, j, k = [int(d) for d in input().split()]
-s = min(a / i, b / j, c / k)
-print(a - i * s, b - j * s, c - k * s)
-
 
 
 
 
 
🟢 Some Sum
 
 Solution in Python 
 
 
 
1
+class SMIL {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        String m = s.nextLine();
+        int size = m.length();
+        int i = 0;
+        while (i < size) {
+            if (m.charAt(i) == ':' || m.charAt(i) == ';') {
+                if (i + 1 < size && m.charAt(i + 1) == ')') {
+                    System.out.println(i);
+                    i += 2;
+                    continue;
+                }
+                if (i + 2 < size && m.charAt(i + 1) == '-' && m.charAt(i + 2) == ')') {
+                    System.out.println(i);
+                    i += 3;
+                    continue;
+                }
+            }
+            i += 1;
+        }
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
s = input()
+
+i = 0
+size = len(s)
+while i < size:
+    if s[i] in [":", ";"]:
+        if i + 1 < size and s[i + 1] == ")":
+            print(i)
+            i += 2
+            continue
+        if i + 2 < size and s[i + 1] == "-" and s[i + 2] == ")":
+            print(i)
+            i += 3
+            continue
+
+    i += 1
+
 
 
 
 
 
🟢 Soda Slurper
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
package main
+
+import "fmt"
+
+func main() {
+    var e, f, c int
+    fmt.Scan(&e)
+    fmt.Scan(&f)
+    fmt.Scan(&c)
+    total := 0
+    s := e + f
+    for s >= c {
+        total += s / c
+        s = s%c + s/c
+    }
+    fmt.Println(total)
+}
+
 
 
 
1
 2
 3
 4
 5
 6
-7
-8
-9
n = int(input())
-if n == 1:
-    print("Either")
-elif n == 2:
-    print("Odd")
-elif n % 2 == 0:
-    print("Even" if (n / 2) % 2 == 0 else "Odd")
-else:
-    print("Either")
-
 
 
 
 
 
🟢 Sort
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
from collections import Counter
-
-n, c = [int(d) for d in input().split()]
-num = [int(d) for d in input().split()]
-
-freq = Counter(num)
-print(
-    " ".join(
-        [
-            str(d)
-            for d in sorted(
-                num, key=lambda k: (freq[k], n - num.index(k)), reverse=True
-            )
-        ]
-    )
-)
-
 
 
 
 
 
🟢 Sort of Sorting
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
first = True
-while True:
-    n = int(input())
-    if not n:
-        break
-    else:
-        if not first:
-            print()
-    first = False
-    names = []
-    for _ in range(n):
-        names.append(input())
-    print("\n".join(sorted(names, key=lambda k: k[:2])))
-
 
 
 
 
 
🟢 Sort Two Numbers
 
 Solutions in 3 languages 
 
 
 
 1
+7
e, f, c = [int(d) for d in input().split()]
+total = 0
+s = e + f
+while s >= c:
+    total += s // c
+    s = s % c + s // c
+print(total)
+
 
 
 
 
 
🟢 Sok
 
 Solution in Python 
 
 
 
1
+2
+3
+4
a, b, c = [int(d) for d in input().split()]
+i, j, k = [int(d) for d in input().split()]
+s = min(a / i, b / j, c / k)
+print(a - i * s, b - j * s, c - k * s)
+
 
 
 
 
 
🟢 Some Sum
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
n = int(input())
+if n == 1:
+    print("Either")
+elif n == 2:
+    print("Odd")
+elif n % 2 == 0:
+    print("Even" if (n / 2) % 2 == 0 else "Odd")
+else:
+    print("Either")
+
 
 
 
 
 
🟢 Sort
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -10021,25 +10013,23 @@
 13
 14
 15
-16
-17
#include <iostream>
+16
from collections import Counter
 
-using namespace std;
-
-int main()
-{
-    int a = 0, b = 0;
-    cin >> a >> b;
-    if (a < b)
-    {
-        cout << a << " " << b;
-    }
-    else
-    {
-        cout << b << " " << a;
-    }
-}
-
 
 
 
 1
+n, c = [int(d) for d in input().split()]
+num = [int(d) for d in input().split()]
+
+freq = Counter(num)
+print(
+    " ".join(
+        [
+            str(d)
+            for d in sorted(
+                num, key=lambda k: (freq[k], n - num.index(k)), reverse=True
+            )
+        ]
+    )
+)
+
 
 
 
 
 
🟢 Sort of Sorting
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -10051,33 +10041,53 @@
 10
 11
 12
-13
-14
package main
-
-import "fmt"
-
-func main() {
-    var a, b int
-    fmt.Scan(&a)
-    fmt.Scan(&b)
-    if a < b {
-        fmt.Printf("%d %d\n", a, b)
-    } else {
-        fmt.Printf("%d %d\n", b, a)
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
line = input()
-a, b = [int(d) for d in line.split()]
-if a < b:
-    print(a, b)
-else:
-    print(b, a)
-
 
 
 
 
 
🟢 Sóttkví
 
 Solutions in 2 languages 
 
 
 
 1
+13
first = True
+while True:
+    n = int(input())
+    if not n:
+        break
+    else:
+        if not first:
+            print()
+    first = False
+    names = []
+    for _ in range(n):
+        names.append(input())
+    print("\n".join(sorted(names, key=lambda k: k[:2])))
+
 
 
 
 
 
🟢 Sort Two Numbers
 
 Solutions in 3 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    int a = 0, b = 0;
+    cin >> a >> b;
+    if (a < b)
+    {
+        cout << a << " " << b;
+    }
+    else
+    {
+        cout << b << " " << a;
+    }
+}
+
 
 
 
 1
  2
  3
  4
@@ -10090,158 +10100,106 @@
 11
 12
 13
-14
-15
-16
-17
-18
-19
import java.util.Scanner;
+14
package main
 
-class Sottkvi {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int n = s.nextInt();
-        int k = s.nextInt();
-        int today = s.nextInt();
-        int ans = 0;
-        for (int i = 0; i < n; i++) {
-            int d = s.nextInt();
-            if (d + 14 - today <= k) {
-                ans += 1;
-            }
-        }
-        System.out.println(ans);
-
-    }
-}
+import "fmt"
+
+func main() {
+    var a, b int
+    fmt.Scan(&a)
+    fmt.Scan(&b)
+    if a < b {
+        fmt.Printf("%d %d\n", a, b)
+    } else {
+        fmt.Printf("%d %d\n", b, a)
+    }
+}
 
 
 
 
1
 2
 3
 4
 5
-6
-7
n, k, today = [int(d) for d in input().split()]
-res = 0
-for _ in range(n):
-    d = int(input())
-    if d + 14 - today <= k:
-        res += 1
-print(res)
-
 
 
 
 
 
🟢 Soylent
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
import math
+6
line = input()
+a, b = [int(d) for d in line.split()]
+if a < b:
+    print(a, b)
+else:
+    print(b, a)
+
 
 
 
 
 
🟢 Sóttkví
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
import java.util.Scanner;
 
-for _ in range(int(input())):
-    n = int(input())
-    print(math.ceil(n / 400))
-
 
 
 
 
 
🟢 Space Race
 
 Solution in Python 
 
 
 
1
+class Sottkvi {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        int k = s.nextInt();
+        int today = s.nextInt();
+        int ans = 0;
+        for (int i = 0; i < n; i++) {
+            int d = s.nextInt();
+            if (d + 14 - today <= k) {
+                ans += 1;
+            }
+        }
+        System.out.println(ans);
+
+    }
+}
+
 
 
 
1
 2
 3
 4
 5
 6
-7
-8
n = int(input())
-_ = input()
-d = {}
-for _ in range(n):
-    entry = input().split()
-    d[entry[0]] = float(entry[-1])
-
-print(min(d, key=lambda k: d[k]))
-
 
 
 
 
 
🟢 Spavanac
 
 Solutions in 3 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
#include <iostream>
+7
n, k, today = [int(d) for d in input().split()]
+res = 0
+for _ in range(n):
+    d = int(input())
+    if d + 14 - today <= k:
+        res += 1
+print(res)
+
 
 
 
 
 
🟢 Soylent
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
import math
 
-using namespace std;
-
-int main()
-{
-    int h, m;
-    cin >> h >> m;
-
-    int mm = m - 45;
-    int borrow = 0;
-    if (mm < 0)
-    {
-        mm += 60;
-        borrow = 1;
-    }
-    int hh = h - borrow;
-    if (hh < 0)
-    {
-        hh += 24;
-    }
-    cout << hh << " " << mm << endl;
-    return 0;
-}
-
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
import java.util.Scanner;
-
-class Spavanac {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int h = s.nextInt();
-        int m = s.nextInt();
-
-        int mm = m - 45;
-        int borrow = 0;
-        if (mm < 0) {
-            mm += 60;
-            borrow = 1;
-        }
-
-        int hh = h - borrow;
-        if (hh < 0) {
-            hh += 24;
-        }
-        System.out.println(hh + " " + mm);
-    }
-}
-
 
 
 
 1
+for _ in range(int(input())):
+    n = int(input())
+    print(math.ceil(n / 400))
+
 
 
 
 
 
🟢 Space Race
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
n = int(input())
+_ = input()
+d = {}
+for _ in range(n):
+    entry = input().split()
+    d[entry[0]] = float(entry[-1])
+
+print(min(d, key=lambda k: d[k]))
+
 
 
 
 
 
🟢 Spavanac
 
 Solutions in 3 languages 
 
 
 
 1
  2
  3
  4
@@ -10254,21 +10212,41 @@
 11
 12
 13
-14
h, m = [int(d) for d in input().split()]
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
#include <iostream>
 
-mm = m - 45
+using namespace std;
 
-borrow = 0
-if mm < 0:
-    mm += 60
-    borrow = 1
+int main()
+{
+    int h, m;
+    cin >> h >> m;
 
-hh = h - borrow
-if hh < 0:
-    hh += 24
-
-print(hh, mm)
-
 
 
 
 
 
🟢 Speeding
 
 Solution in Python 
 
 
 
 1
+    int mm = m - 45;
+    int borrow = 0;
+    if (mm < 0)
+    {
+        mm += 60;
+        borrow = 1;
+    }
+    int hh = h - borrow;
+    if (hh < 0)
+    {
+        hh += 24;
+    }
+    cout << hh << " " << mm << endl;
+    return 0;
+}
+
 
 
 
 1
  2
  3
  4
@@ -10278,18 +10256,40 @@
  8
  9
 10
-11
n = int(input())
-mile, time, max_speed = 0, 0, 0
-for _ in range(n):
-    t, s = [int(d) for d in input().split()]
-    if not t and not s:
-        continue
-    speed = int((s - mile) / (t - time))
-    if speed > max_speed:
-        max_speed = speed
-    mile, time = s, t
-print(max_speed)
-
 
 
 
 
 
🟢 Speed Limit
 
 Solution in Python 
 
 
 
 1
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
import java.util.Scanner;
+
+class Spavanac {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int h = s.nextInt();
+        int m = s.nextInt();
+
+        int mm = m - 45;
+        int borrow = 0;
+        if (mm < 0) {
+            mm += 60;
+            borrow = 1;
+        }
+
+        int hh = h - borrow;
+        if (hh < 0) {
+            hh += 24;
+        }
+        System.out.println(hh + " " + mm);
+    }
+}
+
 
 
 
 1
  2
  3
  4
@@ -10299,18 +10299,24 @@
  8
  9
 10
-11
while True:
-    n = int(input())
-    if n == -1:
-        break
-    miles = 0
-    elapsed = 0
-    for _ in range(n):
-        s, t = [int(d) for d in input().split()]
-        miles += s * (t - elapsed)
-        elapsed = t
-    print(f"{miles} miles")
-
 
 
 
 
 
🟢 Spelling Bee
 
 Solution in Python 
 
 
 
 1
+11
+12
+13
+14
h, m = [int(d) for d in input().split()]
+
+mm = m - 45
+
+borrow = 0
+if mm < 0:
+    mm += 60
+    borrow = 1
+
+hh = h - borrow
+if hh < 0:
+    hh += 24
+
+print(hh, mm)
+
 
 
 
 
 
🟢 Speeding
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -10319,129 +10325,133 @@
  7
  8
  9
-10
hexagon = input()
-c = hexagon[0]
-hexagon = set(list(hexagon))
-n = int(input())
-valid = []
-for _ in range(n):
-    w = input()
-    if c in w and len(w) >= 4 and set(list(w)) <= hexagon:
-        valid.append(w)
-print("\n".join(valid))
-
 
 
 
 
 
🟢 Spritt
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
n, x = [int(d) for d in input().split()]
-for _ in range(n):
-    x -= int(input())
-    if x < 0:
-        print("Neibb")
-        break
-if x >= 0:
-    print("Jebb")
-
 
 
 
 
 
🟢 Square Peg
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
l, r = [int(d) for d in input().split()]
-if 2 * (l / 2) ** 2 <= r**2:
-    print("fits")
-else:
-    print("nope")
-
 
 
 
 
 
🟢 Stafur
 
 Solution in Python 
 
 
 
1
+10
+11
n = int(input())
+mile, time, max_speed = 0, 0, 0
+for _ in range(n):
+    t, s = [int(d) for d in input().split()]
+    if not t and not s:
+        continue
+    speed = int((s - mile) / (t - time))
+    if speed > max_speed:
+        max_speed = speed
+    mile, time = s, t
+print(max_speed)
+
 
 
 
 
 
🟢 Speed Limit
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
while True:
+    n = int(input())
+    if n == -1:
+        break
+    miles = 0
+    elapsed = 0
+    for _ in range(n):
+        s, t = [int(d) for d in input().split()]
+        miles += s * (t - elapsed)
+        elapsed = t
+    print(f"{miles} miles")
+
 
 
 
 
 
🟢 Spelling Bee
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
hexagon = input()
+c = hexagon[0]
+hexagon = set(list(hexagon))
+n = int(input())
+valid = []
+for _ in range(n):
+    w = input()
+    if c in w and len(w) >= 4 and set(list(w)) <= hexagon:
+        valid.append(w)
+print("\n".join(valid))
+
 
 
 
 
 
🟢 Spritt
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
l = input()
-if l in "AEIOU":
-    print("Jebb")
-elif l == "Y":
-    print("Kannski")
-else:
-    print("Neibb")
-
 
 
 
 
 
🟢 Statistics
 
 Solution in Python 
 
 
 
1
+7
+8
n, x = [int(d) for d in input().split()]
+for _ in range(n):
+    x -= int(input())
+    if x < 0:
+        print("Neibb")
+        break
+if x >= 0:
+    print("Jebb")
+
 
 
 
 
 
🟢 Square Peg
 
 Solution in Python 
 
 
 
1
 2
 3
 4
-5
-6
-7
-8
-9
case_num = 0
-while True:
-    try:
-        line = input()
-    except:
-        break
-    case_num += 1
-    numbers = [int(d) for d in line.split()[1:]]
-    print(f"Case {case_num}: {min(numbers)} {max(numbers)} {max(numbers)-min(numbers)}")
-
 
 
 
 
 
🟢 Sticky Keys
 
 Solution in Python 
 
 
 
1
+5
l, r = [int(d) for d in input().split()]
+if 2 * (l / 2) ** 2 <= r**2:
+    print("fits")
+else:
+    print("nope")
+
 
 
 
 
 
🟢 Stafur
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
message = input()
-
-l = [message[0]]
-for i in message[1:]:
-    if i != l[-1]:
-        l.append(i)
-print("".join(l))
-
 
 
 
 
 
🟢 Messy lists
 
 Solution in Python 
 
 
 
1
+7
l = input()
+if l in "AEIOU":
+    print("Jebb")
+elif l == "Y":
+    print("Kannski")
+else:
+    print("Neibb")
+
 
 
 
 
 
🟢 Statistics
 
 Solution in Python 
 
 
 
1
 2
 3
-4
n = int(input())
-a = [int(d) for d in input().split()]
-s = sorted(a)
-print(sum([i != j for i, j in zip(a, s)]))
-
 
 
 
 
 
🟢 Stopwatch
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
n = int(input())
-times = []
-for _ in range(n):
-    times.append(int(input()))
-if n % 2:
-    print("still running")
-else:
-    seconds = 0
-    for i in range(0, n, 2):
-        seconds += times[i + 1] - times[i]
-    print(seconds)
-
 
 
 
 
 
🟢 Streets Ahead
 
 Solution in Python 
 
 
 
1
+4
+5
+6
+7
+8
+9
case_num = 0
+while True:
+    try:
+        line = input()
+    except:
+        break
+    case_num += 1
+    numbers = [int(d) for d in line.split()[1:]]
+    print(f"Case {case_num}: {min(numbers)} {max(numbers)} {max(numbers)-min(numbers)}")
+
 
 
 
 
 
🟢 Sticky Keys
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
message = input()
+
+l = [message[0]]
+for i in message[1:]:
+    if i != l[-1]:
+        l.append(i)
+print("".join(l))
+
 
 
 
 
 
🟢 Messy lists
 
 Solution in Python 
 
 
 
1
 2
 3
-4
-5
-6
-7
-8
-9
n, q = [int(d) for d in input().split()]
-
-s = {}
-for i in range(n):
-    s[input()] = i
-
-for _ in range(q):
-    a, b = input().split()
-    print(abs(s[a] - s[b]) - 1)
-
 
 
 
 
 
🟢 Successful Zoom
 
 Solution in Python 
 
 
 
 1
+4
n = int(input())
+a = [int(d) for d in input().split()]
+s = sorted(a)
+print(sum([i != j for i, j in zip(a, s)]))
+
 
 
 
 
 
🟢 Stopwatch
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -10452,28 +10462,34 @@
  9
 10
 11
n = int(input())
-x = [int(d) for d in input().split()]
-found = False
-for k in range(1, n // 2 + 1):
-    v = [x[i] for i in range(k - 1, n, k)]
-    if all([v[i] < v[i + 1] for i in range(len(v) - 1)]):
-        print(k)
-        found = True
-        break
-if not found:
-    print("ABORT!")
-
 
 
 
 
 
🟢 Sum Kind of Problem
 
 Solution in Python 
 
 
 
1
+times = []
+for _ in range(n):
+    times.append(int(input()))
+if n % 2:
+    print("still running")
+else:
+    seconds = 0
+    for i in range(0, n, 2):
+        seconds += times[i + 1] - times[i]
+    print(seconds)
+
 
 
 
 
 
🟢 Streets Ahead
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
for _ in range(int(input())):
-    k, n = [int(d) for d in input().split()]
-    s1 = sum(range(1, n + 1))
-    s2 = sum(range(1, 2 * n + 1, 2))
-    s3 = sum(range(2, 2 * (n + 1), 2))
-    print(k, s1, s2, s3)
-
 
 
 
 
 
🟢 Sum of the Others
 
 Solution in Python 
 
 
 
 1
+6
+7
+8
+9
n, q = [int(d) for d in input().split()]
+
+s = {}
+for i in range(n):
+    s[input()] = i
+
+for _ in range(q):
+    a, b = input().split()
+    print(abs(s[a] - s[b]) - 1)
+
 
 
 
 
 
🟢 Successful Zoom
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -10482,109 +10498,75 @@
  7
  8
  9
-10
while True:
-    try:
-        n = [int(d) for d in input().split()]
-    except:
-        break
-
-    for i in range(len(n)):
-        if n[i] == sum([n[j] for j in range(len(n)) if j != i]):
-            print(n[i])
-            break
-
 
 
 
 
 
🟢 Sum Squared Digits Function
 
 Solution in Python 
 
 
 
1
+10
+11
n = int(input())
+x = [int(d) for d in input().split()]
+found = False
+for k in range(1, n // 2 + 1):
+    v = [x[i] for i in range(k - 1, n, k)]
+    if all([v[i] < v[i + 1] for i in range(len(v) - 1)]):
+        print(k)
+        found = True
+        break
+if not found:
+    print("ABORT!")
+
 
 
 
 
 
🟢 Sum Kind of Problem
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
-7
for _ in range(int(input())):
-    k, b, n = [int(d) for d in input().split()]
-    ssd = 0
-    while n:
-        ssd += (n % b) ** 2
-        n //= b
-    print(k, ssd)
-
 
 
 
 
 
🟢 Sun and Moon
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
sun_years_ago, sun_cycle = [int(v) for v in input().split()]
-moon_years_ago, moon_cycle = [int(v) for v in input().split()]
-
-for t in range(1, 5001):
-    if (t + sun_years_ago) % sun_cycle == 0 and (t + moon_years_ago) % moon_cycle == 0:
-        print(t)
-        break
-
 
 
 
 
 
🟢 Symmetric Order
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
set_num = 0
-while True:
-    size = int(input())
-    if size == 0:
-        break
-
-    names = []
-    for _ in range(size):
-        names.append(input())
-
-    set_num += 1
-    print(f"SET {set_num}")
-
-    top, bottom = [], []
-    for i in range(1, size, 2):
-        bottom.append(names[i])
-    for i in range(0, size, 2):
-        top.append(names[i])
-    names = top + bottom[::-1]
-    for name in names:
-        print(name)
-
 
 
 
 
 
🟢 Synchronizing Lists
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
while True:
-    n = int(input())
-    if not n:
-        break
-    a, b = [], []
-    for _ in range(n):
-        a.append(int(input()))
-    for _ in range(n):
-        b.append(int(input()))
-    mapping = dict(zip(sorted(a), sorted(b)))
-    for key in a:
-        print(mapping[key])
-    print()
-
 
 
 
 
 
🟢 T9 Spelling
 
 Solution in Python 
 
 
 
 1
+6
for _ in range(int(input())):
+    k, n = [int(d) for d in input().split()]
+    s1 = sum(range(1, n + 1))
+    s2 = sum(range(1, 2 * n + 1, 2))
+    s3 = sum(range(2, 2 * (n + 1), 2))
+    print(k, s1, s2, s3)
+
 
 
 
 
 
🟢 Sum of the Others
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
while True:
+    try:
+        n = [int(d) for d in input().split()]
+    except:
+        break
+
+    for i in range(len(n)):
+        if n[i] == sum([n[j] for j in range(len(n)) if j != i]):
+            print(n[i])
+            break
+
 
 
 
 
 
🟢 Sum Squared Digits Function
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
for _ in range(int(input())):
+    k, b, n = [int(d) for d in input().split()]
+    ssd = 0
+    while n:
+        ssd += (n % b) ** 2
+        n //= b
+    print(k, ssd)
+
 
 
 
 
 
🟢 Sun and Moon
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
sun_years_ago, sun_cycle = [int(v) for v in input().split()]
+moon_years_ago, moon_cycle = [int(v) for v in input().split()]
+
+for t in range(1, 5001):
+    if (t + sun_years_ago) % sun_cycle == 0 and (t + moon_years_ago) % moon_cycle == 0:
+        print(t)
+        break
+
 
 
 
 
 
🟢 Symmetric Order
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -10604,53 +10586,53 @@
 18
 19
 20
-21
-22
-23
-24
-25
n = int(input())
-mapping = {
-    "2": "abc",
-    "3": "def",
-    "4": "ghi",
-    "5": "jkl",
-    "6": "mno",
-    "7": "pqrs",
-    "8": "tuv",
-    "9": "wxyz",
-    "0": " ",
-}
+21
set_num = 0
+while True:
+    size = int(input())
+    if size == 0:
+        break
+
+    names = []
+    for _ in range(size):
+        names.append(input())
+
+    set_num += 1
+    print(f"SET {set_num}")
 
-for i in range(n):
-    ans = []
-    prev = ""
-    for c in input():
-        for d, r in mapping.items():
-            if c in r:
-                if d == prev:
-                    ans.append(" ")
-                ans.append(d * (r.index(c) + 1))
-                prev = d
-                break
-    print(f"Case #{i+1}: {''.join(ans)}")
-
 
 
 
 
 
🟢 Tai's formula
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
n = int(input())
-t1, v1 = [float(d) for d in input().split()]
-total = 0
-for _ in range(n - 1):
-    t2, v2 = [float(d) for d in input().split()]
-    total += (v1 + v2) * (t2 - t1) / 2
-    t1, v1 = t2, v2
-total /= 1000
-print(total)
-
 
 
 
 
 
🟢 Tajna
 
 Solution in Python 
 
 
 
 1
+    top, bottom = [], []
+    for i in range(1, size, 2):
+        bottom.append(names[i])
+    for i in range(0, size, 2):
+        top.append(names[i])
+    names = top + bottom[::-1]
+    for name in names:
+        print(name)
+
 
 
 
 
 
🟢 Synchronizing Lists
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
while True:
+    n = int(input())
+    if not n:
+        break
+    a, b = [], []
+    for _ in range(n):
+        a.append(int(input()))
+    for _ in range(n):
+        b.append(int(input()))
+    mapping = dict(zip(sorted(a), sorted(b)))
+    for key in a:
+        print(mapping[key])
+    print()
+
 
 
 
 
 
🟢 T9 Spelling
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -10660,142 +10642,180 @@
  8
  9
 10
-11
s = input()
-
-l = len(s)
-r = int(l**0.5)
-while l % r:
-    r -= 1
-c = l // r
-
-parts = [s[i : i + r] for i in range(0, l, r)]
-
-print("".join(["".join([row[i] for row in parts]) for i in range(r)]))
-
 
 
 
 
 
🟢 Tarifa
 
 Solution in Python 
 
 
 
1
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
n = int(input())
+mapping = {
+    "2": "abc",
+    "3": "def",
+    "4": "ghi",
+    "5": "jkl",
+    "6": "mno",
+    "7": "pqrs",
+    "8": "tuv",
+    "9": "wxyz",
+    "0": " ",
+}
+
+for i in range(n):
+    ans = []
+    prev = ""
+    for c in input():
+        for d, r in mapping.items():
+            if c in r:
+                if d == prev:
+                    ans.append(" ")
+                ans.append(d * (r.index(c) + 1))
+                prev = d
+                break
+    print(f"Case #{i+1}: {''.join(ans)}")
+
 
 
 
 
 
🟢 Tai's formula
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
-6
x = int(input())
-n = int(input())
-used = 0
-for _ in range(n):
-    used += int(input())
-print(x * (n + 1) - used)
-
 
 
 
 
 
🟡 Temperature Confusion
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
import math
+6
+7
+8
+9
n = int(input())
+t1, v1 = [float(d) for d in input().split()]
+total = 0
+for _ in range(n - 1):
+    t2, v2 = [float(d) for d in input().split()]
+    total += (v1 + v2) * (t2 - t1) / 2
+    t1, v1 = t2, v2
+total /= 1000
+print(total)
+
 
 
 
 
 
🟢 Tajna
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
s = input()
 
-a, b = [int(d) for d in input().split("/")]
-x, y = 5 * a - 160 * b, 9 * b
-gcd = math.gcd(x, y)
-x //= gcd
-y //= gcd
+l = len(s)
+r = int(l**0.5)
+while l % r:
+    r -= 1
+c = l // r
 
-print(f"{x}/{y}")
-
 
 
 
 
 
🟢 Test Drive
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
a, b, c = [int(d) for d in input().split()]
-x, y = b - a, c - b
-if x == y:
-    print("cruised")
-elif x * y < 0:
-    print("turned")
-elif abs(y) > abs(x):
-    print("accelerated")
-else:
-    print("braked")
-
 
 
 
 
 
🟢 Tetration
 
 Solution in Python 
 
 
 
1
+parts = [s[i : i + r] for i in range(0, l, r)]
+
+print("".join(["".join([row[i] for row in parts]) for i in range(r)]))
+
 
 
 
 
 
🟢 Tarifa
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
x = int(input())
+n = int(input())
+used = 0
+for _ in range(n):
+    used += int(input())
+print(x * (n + 1) - used)
+
 
 
 
 
 
🟡 Temperature Confusion
 
 Solution in Python 
 
 
 
1
 2
 3
-4
import math
+4
+5
+6
+7
+8
+9
import math
 
-n = float(input())
-print(f"{math.pow(n,1/n):.6f}")
-
 
 
 
 
 
🟡 Thanos
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
for _ in range(int(input())):
-    p, r, f = [int(d) for d in input().split()]
-    y = 0
-    while p <= f:
-        p *= r
-        y += 1
-    print(y)
-
 
 
 
 
 
🟢 The Grand Adventure
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
mapping = {"b": "$", "t": "|", "j": "*"}
-for _ in range(int(input())):
-    a = input()
-    bag = []
-    early_fail = False
-    for i in a:
-        if i in mapping.values():
-            bag.append(i)
-        elif i in mapping:
-            if not bag or bag.pop() != mapping[i]:
-                print("NO")
-                early_fail = True
-                break
-    if not early_fail:
-        print("YES" if not bag else "NO")
-
 
 
 
 
 
🟢 The Last Problem
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
package main
-
-import (
-    "bufio"
-    "fmt"
-    "os"
-)
-
-func main() {
-    scanner := bufio.NewScanner(os.Stdin)
-    scanner.Scan()
-    s := scanner.Text()
-    fmt.Println("Thank you,", s+",", "and farewell!")
-}
-
 
 
 
1
print(f"Thank you, {input()}, and farewell!")
-
 
 
 
 
 
🟢 This Ain't Your Grandpa's Checkerboard
 
 Solution in Python 
 
 
 
 1
+a, b = [int(d) for d in input().split("/")]
+x, y = 5 * a - 160 * b, 9 * b
+gcd = math.gcd(x, y)
+x //= gcd
+y //= gcd
+
+print(f"{x}/{y}")
+
 
 
 
 
 
🟢 Test Drive
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
a, b, c = [int(d) for d in input().split()]
+x, y = b - a, c - b
+if x == y:
+    print("cruised")
+elif x * y < 0:
+    print("turned")
+elif abs(y) > abs(x):
+    print("accelerated")
+else:
+    print("braked")
+
 
 
 
 
 
🟢 Tetration
 
 Solution in Python 
 
 
 
1
+2
+3
+4
import math
+
+n = float(input())
+print(f"{math.pow(n,1/n):.6f}")
+
 
 
 
 
 
🟡 Thanos
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
for _ in range(int(input())):
+    p, r, f = [int(d) for d in input().split()]
+    y = 0
+    while p <= f:
+        p *= r
+        y += 1
+    print(y)
+
 
 
 
 
 
🟢 The Grand Adventure
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
mapping = {"b": "$", "t": "|", "j": "*"}
+for _ in range(int(input())):
+    a = input()
+    bag = []
+    early_fail = False
+    for i in a:
+        if i in mapping.values():
+            bag.append(i)
+        elif i in mapping:
+            if not bag or bag.pop() != mapping[i]:
+                print("NO")
+                early_fail = True
+                break
+    if not early_fail:
+        print("YES" if not bag else "NO")
+
 
 
 
 
 
🟢 The Last Problem
 
 Solutions in 2 languages 
 
 
 
 1
  2
  3
  4
@@ -10808,216 +10828,200 @@
 11
 12
 13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
n = int(input())
-b = []
-for _ in range(n):
-    b.append(input())
-
-
-def check(b, n):
-    for row in b:
-        if row.count("W") != row.count("B"):
-            return False
-
-        for j in range(0, n - 3):
-            if row[j] == row[j + 1] == row[j + 2]:
-                return False
-
-    for i in range(n):
-        col = ["".join(row[i]) for row in b]
-
-        if col.count("W") != col.count("B"):
-            return False
-
-        for j in range(0, n - 3):
-            if col[j] == col[j + 1] == col[j + 2]:
-                return False
-
-    return True
-
-
-valid = check(b, n)
-print(1 if valid else 0)
-
 
 
 
 
 
🟢 Stuck In A Time Loop
 
 Solutions in 2 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
#include <iostream>
-
-using namespace std;
-
-int main()
-{
-    int a;
-    cin >> a;
-    for (int i = 0; i < a; i++)
-    {
-        cout << i + 1 << " Abracadabra" << endl;
-    }
-}
-
 
 
 
1
-2
-3
n = int(input())
-for i in range(n):
-    print(f"{i+1} Abracadabra")
-
 
 
 
 
 
🟢 Title Cost
 
 Solution in Python 
 
 
 
1
-2
-3
s, c = input().split()
-c = float(c)
-print(min(c, len(s)))
-
 
 
 
 
 
🟢 Töflur
 
 Solution in Python 
 
 
 
1
+14
package main
+
+import (
+    "bufio"
+    "fmt"
+    "os"
+)
+
+func main() {
+    scanner := bufio.NewScanner(os.Stdin)
+    scanner.Scan()
+    s := scanner.Text()
+    fmt.Println("Thank you,", s+",", "and farewell!")
+}
+
 
 
 
1
print(f"Thank you, {input()}, and farewell!")
+
 
 
 
 
 
🟢 This Ain't Your Grandpa's Checkerboard
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
n = int(input())
+b = []
+for _ in range(n):
+    b.append(input())
+
+
+def check(b, n):
+    for row in b:
+        if row.count("W") != row.count("B"):
+            return False
+
+        for j in range(0, n - 3):
+            if row[j] == row[j + 1] == row[j + 2]:
+                return False
+
+    for i in range(n):
+        col = ["".join(row[i]) for row in b]
+
+        if col.count("W") != col.count("B"):
+            return False
+
+        for j in range(0, n - 3):
+            if col[j] == col[j + 1] == col[j + 2]:
+                return False
+
+    return True
+
+
+valid = check(b, n)
+print(1 if valid else 0)
+
 
 
 
 
 
🟢 Stuck In A Time Loop
 
 Solutions in 2 languages 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    int a;
+    cin >> a;
+    for (int i = 0; i < a; i++)
+    {
+        cout << i + 1 << " Abracadabra" << endl;
+    }
+}
+
 
 
 
1
 2
-3
-4
n = int(input())
-a = sorted([int(d) for d in input().split()])
-score = sum([(a[j] - a[j + 1]) ** 2 for j in range(n - 1)])
-print(score)
-
 
 
 
 
 
🟢 Toilet Seat
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
t = input()
-
-
-def u(pos, preference):
-    if pos == preference == "U":
-        return 0
-    elif pos == preference == "D":
-        return 1
-    elif pos == "U" and preference == "D":
-        return 2
-    else:
-        return 1
-
-
-def l(pos, preference):
-    if pos == preference == "U":
-        return 1
-    elif pos == preference == "D":
-        return 0
-    elif pos == "U" and preference == "D":
-        return 1
-    else:
-        return 2
-
-
-def b(pos, preference):
-    if pos == preference:
-        return 0
-    else:
-        return 1
-
-
-pu = [u(pos, preference) for pos, preference in zip(t[0] + "U" * (len(t) - 2), t[1:])]
-pl = [l(pos, preference) for pos, preference in zip(t[0] + "D" * (len(t) - 2), t[1:])]
-pb = [b(pos, preference) for pos, preference in zip(t[0] + t[1:-1], t[1:])]
-
-print(sum(pu))
-print(sum(pl))
-print(sum(pb))
-
 
 
 
 
 
🟢 ToLower
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
p, t = [int(d) for d in input().split()]
-score = 0
-for _ in range(p):
-    solved = True
-    for _ in range(t):
-        s = input()
-        if solved:
-            s = s[0].lower() + s[1:]
-            if s.lower() == s:
-                continue
-        solved = False
-    if solved:
-        score += 1
-print(score)
-
 
 
 
 
 
🟢 Tower Construction
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
-9
_ = input()
-n = 0
-top = 0
-for d in [int(d) for d in input().split()]:
-    if not top or d > top:
-        n += 1
-    top = d
-
-print(n)
-
 
 
 
 
 
🟢 Touchscreen Keyboard
 
 Solution in Python 
 
 
 
 1
+3
n = int(input())
+for i in range(n):
+    print(f"{i+1} Abracadabra")
+
 
 
 
 
 
🟢 Title Cost
 
 Solution in Python 
 
 
 
1
+2
+3
s, c = input().split()
+c = float(c)
+print(min(c, len(s)))
+
 
 
 
 
 
🟢 Töflur
 
 Solution in Python 
 
 
 
1
+2
+3
+4
n = int(input())
+a = sorted([int(d) for d in input().split()])
+score = sum([(a[j] - a[j + 1]) ** 2 for j in range(n - 1)])
+print(score)
+
 
 
 
 
 
🟢 Toilet Seat
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
t = input()
+
+
+def u(pos, preference):
+    if pos == preference == "U":
+        return 0
+    elif pos == preference == "D":
+        return 1
+    elif pos == "U" and preference == "D":
+        return 2
+    else:
+        return 1
+
+
+def l(pos, preference):
+    if pos == preference == "U":
+        return 1
+    elif pos == preference == "D":
+        return 0
+    elif pos == "U" and preference == "D":
+        return 1
+    else:
+        return 2
+
+
+def b(pos, preference):
+    if pos == preference:
+        return 0
+    else:
+        return 1
+
+
+pu = [u(pos, preference) for pos, preference in zip(t[0] + "U" * (len(t) - 2), t[1:])]
+pl = [l(pos, preference) for pos, preference in zip(t[0] + "D" * (len(t) - 2), t[1:])]
+pb = [b(pos, preference) for pos, preference in zip(t[0] + t[1:-1], t[1:])]
+
+print(sum(pu))
+print(sum(pl))
+print(sum(pb))
+
 
 
 
 
 
🟢 ToLower
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11030,90 +11034,38 @@
 11
 12
 13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
k = [
-    "qwertyuiop",
-    "asdfghjkl",
-    "zxcvbnm",
-]
-
-
-def d(a, b):
-    for r1 in range(3):
-        if a in k[r1]:
-            c1 = k[r1].index(a)
-            break
-    for r2 in range(3):
-        if b in k[r2]:
-            c2 = k[r2].index(b)
-            break
-
-    return abs(c1 - c2) + abs(r1 - r2)
-
-
-for _ in range(int(input())):
-    x, n = input().split()
-    n, w = int(n), []
-
-    for _ in range(n):
-        y = input()
-        dist = sum([d(a, b) for a, b in zip(list(x), list(y))])
-        w.append([y, dist])
-
-    print("\n".join([f"{k} {v}" for k, v in sorted(w, key=lambda k: (k[1], k[0]))]))
-
 
 
 
 
 
🟢 Transit Woes
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
s, t, n = [int(d) for d in input().split()]
-ds = [int(d) for d in input().split()]
-bs = [int(d) for d in input().split()]
-cs = [int(d) for d in input().split()]
-
-for i in range(n):
-    s += ds[i]
-    if not s % cs[i]:
-        wait_b = 0
-    else:
-        wait_b = cs[i] - s % cs[i]
-    s += wait_b + bs[i]
-
-s += ds[n]
-
-if s <= t:
-    print("yes")
-else:
-    print("no")
-
 
 
 
 
 
🟢 Tri
 
 Solution in Python 
 
 
 
 1
+14
p, t = [int(d) for d in input().split()]
+score = 0
+for _ in range(p):
+    solved = True
+    for _ in range(t):
+        s = input()
+        if solved:
+            s = s[0].lower() + s[1:]
+            if s.lower() == s:
+                continue
+        solved = False
+    if solved:
+        score += 1
+print(score)
+
 
 
 
 
 
🟢 Tower Construction
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
+9
_ = input()
+n = 0
+top = 0
+for d in [int(d) for d in input().split()]:
+    if not top or d > top:
+        n += 1
+    top = d
+
+print(n)
+
 
 
 
 
 
🟢 Touchscreen Keyboard
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11128,23 +11080,51 @@
 13
 14
 15
-16
from operator import add, sub, truediv, mul
-
-a, b, c = [int(d) for d in input().split()]
-ops = {
-    "+": add,
-    "-": sub,
-    "*": mul,
-    "/": truediv,
-}
-
-for op, func in ops.items():
-    if a == func(b, c):
-        print(f"{a}={b}{op}{c}")
-        break
-    if func(a, b) == c:
-        print(f"{a}{op}{b}={c}")
-
 
 
 
 
 
🟢 Triangle Area
 
 Solutions in 4 languages 
 
 
 
 1
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
k = [
+    "qwertyuiop",
+    "asdfghjkl",
+    "zxcvbnm",
+]
+
+
+def d(a, b):
+    for r1 in range(3):
+        if a in k[r1]:
+            c1 = k[r1].index(a)
+            break
+    for r2 in range(3):
+        if b in k[r2]:
+            c2 = k[r2].index(b)
+            break
+
+    return abs(c1 - c2) + abs(r1 - r2)
+
+
+for _ in range(int(input())):
+    x, n = input().split()
+    n, w = int(n), []
+
+    for _ in range(n):
+        y = input()
+        dist = sum([d(a, b) for a, b in zip(list(x), list(y))])
+        w.append([y, dist])
+
+    print("\n".join([f"{k} {v}" for k, v in sorted(w, key=lambda k: (k[1], k[0]))]))
+
 
 
 
 
 
🟢 Transit Woes
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11154,18 +11134,34 @@
  8
  9
 10
-11
#include <iostream>
-
-using namespace std;
-
-int main()
-{
-    int h, b;
-    cin >> h >> b;
-    cout << float(h) * b / 2 << endl;
-    return 0;
-}
-
 
 
 
 1
+11
+12
+13
+14
+15
+16
+17
+18
+19
s, t, n = [int(d) for d in input().split()]
+ds = [int(d) for d in input().split()]
+bs = [int(d) for d in input().split()]
+cs = [int(d) for d in input().split()]
+
+for i in range(n):
+    s += ds[i]
+    if not s % cs[i]:
+        wait_b = 0
+    else:
+        wait_b = cs[i] - s % cs[i]
+    s += wait_b + bs[i]
+
+s += ds[n]
+
+if s <= t:
+    print("yes")
+else:
+    print("no")
+
 
 
 
 
 
🟢 Tri
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11174,17 +11170,29 @@
  7
  8
  9
-10
package main
+10
+11
+12
+13
+14
+15
+16
from operator import add, sub, truediv, mul
 
-import "fmt"
-
-func main() {
-    var a, b int
-    fmt.Scan(&a)
-    fmt.Scan(&b)
-    fmt.Println(float32(a) * float32(b) / 2)
-}
-
 
 
 
 1
+a, b, c = [int(d) for d in input().split()]
+ops = {
+    "+": add,
+    "-": sub,
+    "*": mul,
+    "/": truediv,
+}
+
+for op, func in ops.items():
+    if a == func(b, c):
+        print(f"{a}={b}{op}{c}")
+        break
+    if func(a, b) == c:
+        print(f"{a}{op}{b}={c}")
+
 
 
 
 
 
🟢 Triangle Area
 
 Solutions in 4 languages 
 
 
 
 1
  2
  3
  4
@@ -11193,20 +11201,38 @@
  7
  8
  9
-10
import java.util.Scanner;
+10
+11
#include <iostream>
 
-class TriangleArea {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        float a = s.nextFloat();
-        int b = s.nextInt();
-        System.out.println(a * b / 2);
-    }
-}
-
 
 
 
1
-2
a, b = [int(d) for d in input().split()]
-print(a * b / 2)
-
 
 
 
 
 
🟢 Trik
 
 Solution in Python 
 
 
 
 1
+using namespace std;
+
+int main()
+{
+    int h, b;
+    cin >> h >> b;
+    cout << float(h) * b / 2 << endl;
+    return 0;
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
package main
+
+import "fmt"
+
+func main() {
+    var a, b int
+    fmt.Scan(&a)
+    fmt.Scan(&b)
+    fmt.Println(float32(a) * float32(b) / 2)
+}
+
 
 
 
 1
  2
  3
  4
@@ -11215,66 +11241,20 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
-16
moves = input()
-ball = [1, 0, 0]
-for move in moves:
-    if move == "A":
-        ball[0], ball[1] = ball[1], ball[0]
-    if move == "B":
-        ball[1], ball[2] = ball[2], ball[1]
-    if move == "C":
-        ball[0], ball[2] = ball[2], ball[0]
-
-if ball[0]:
-    print(1)
-elif ball[1]:
-    print(2)
-else:
-    print(3)
-
 
 
 
 
 
🟢 Triple Texting
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
from collections import Counter
-
-s = input()
-times = 3
-size = len(s) // times
-messages = []
-for i in range(0, len(s), size):
-    messages.append(s[i : i + size])
-
-original = ""
-for i in range(size):
-    chars = [m[i] for m in messages]
-    if len(set(chars)) == 1:
-        original += chars[0]
-    else:
-        c = Counter(chars)
-        original += max(c, key=lambda k: c[k])
-
-print(original)
-
 
 
 
 
 
🟢 Take Two Stones
 
 Solutions in 6 languages 
 
 
 
 1
+10
import java.util.Scanner;
+
+class TriangleArea {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        float a = s.nextFloat();
+        int b = s.nextInt();
+        System.out.println(a * b / 2);
+    }
+}
+
 
 
 
1
+2
a, b = [int(d) for d in input().split()]
+print(a * b / 2)
+
 
 
 
 
 
🟢 Trik
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11286,31 +11266,63 @@
 10
 11
 12
-13
package main
-
-import "fmt"
-
-func main() {
-    var n int
-    fmt.Scan(&n)
-    if n%2 == 1 {
-        fmt.Println("Alice")
-    } else {
-        fmt.Println("Bob")
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
main = do
-    input <- getLine
-    let n = (read input :: Int)
-    if  n `mod` 2  ==  1
-    then putStrLn "Alice"
-        else putStrLn "Bob"
-
 
 
 
 1
+13
+14
+15
+16
moves = input()
+ball = [1, 0, 0]
+for move in moves:
+    if move == "A":
+        ball[0], ball[1] = ball[1], ball[0]
+    if move == "B":
+        ball[1], ball[2] = ball[2], ball[1]
+    if move == "C":
+        ball[0], ball[2] = ball[2], ball[0]
+
+if ball[0]:
+    print(1)
+elif ball[1]:
+    print(2)
+else:
+    print(3)
+
 
 
 
 
 
🟢 Triple Texting
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
from collections import Counter
+
+s = input()
+times = 3
+size = len(s) // times
+messages = []
+for i in range(0, len(s), size):
+    messages.append(s[i : i + size])
+
+original = ""
+for i in range(size):
+    chars = [m[i] for m in messages]
+    if len(set(chars)) == 1:
+        original += chars[0]
+    else:
+        c = Counter(chars)
+        original += max(c, key=lambda k: c[k])
+
+print(original)
+
 
 
 
 
 
🟢 Take Two Stones
 
 Solutions in 6 languages 
 
 
 
 1
  2
  3
  4
@@ -11322,99 +11334,95 @@
 10
 11
 12
-13
import java.util.Scanner;
+13
package main
 
-class TakeTwoStones {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int n = s.nextInt();
-        if (n % 2 == 1) {
-            System.out.println("Alice");
-        } else {
-            System.out.println("Bob");
-        }
+import "fmt"
+
+func main() {
+    var n int
+    fmt.Scan(&n)
+    if n%2 == 1 {
+        fmt.Println("Alice")
+    } else {
+        fmt.Println("Bob")
     }
 }
-
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
const readline = require("readline");
-const rl = readline.createInterface(process.stdin, process.stdout);
-
-rl.question("", (n) => {
-  if (parseInt(n) % 2) {
-    console.log("Alice");
-  } else {
-    console.log("Bob");
-  }
-});
-
 
 
 
1
-2
-3
-4
-5
-6
-7
fun main() {
-    if (readLine()!!.toInt() % 2 == 1) {
-        println("Alice")
-    } else {
-        println("Bob")
-    }
-}
-
 
 
 
1
-2
-3
-4
if int(input()) % 2:
-    print("Alice")
-else:
-    print("Bob")
-
 
 
 
 
 
🟢 Two-sum
 
 Solutions in 4 languages 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
#include <iostream>
-
-using namespace std;
-
-int main()
-{
-    int a, b;
-    cin >> a >> b;
-    cout << a + b << endl;
-    return 0;
-}
-
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
package main
-
-import "fmt"
-
-func main() {
-    var a, b int
-    fmt.Scan(&a)
-    fmt.Scan(&b)
-    fmt.Println(a + b)
-}
-
 
 
 
 1
+
 
 
 
1
+2
+3
+4
+5
+6
main = do
+    input <- getLine
+    let n = (read input :: Int)
+    if  n `mod` 2  ==  1
+    then putStrLn "Alice"
+        else putStrLn "Bob"
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
import java.util.Scanner;
+
+class TakeTwoStones {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        if (n % 2 == 1) {
+            System.out.println("Alice");
+        } else {
+            System.out.println("Bob");
+        }
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
const readline = require("readline");
+const rl = readline.createInterface(process.stdin, process.stdout);
+
+rl.question("", (n) => {
+  if (parseInt(n) % 2) {
+    console.log("Alice");
+  } else {
+    console.log("Bob");
+  }
+});
+
 
 
 
1
+2
+3
+4
+5
+6
+7
fun main() {
+    if (readLine()!!.toInt() % 2 == 1) {
+        println("Alice")
+    } else {
+        println("Bob")
+    }
+}
+
 
 
 
1
+2
+3
+4
if int(input()) % 2:
+    print("Alice")
+else:
+    print("Bob")
+
 
 
 
 
 
🟢 Two-sum
 
 Solutions in 4 languages 
 
 
 
 1
  2
  3
  4
@@ -11423,118 +11431,88 @@
  7
  8
  9
-10
import java.util.Scanner;
+10
+11
#include <iostream>
 
-class TwoSum {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int a = s.nextInt();
-        int b = s.nextInt();
-        System.out.println(a + b);
-    }
-}
-
 
 
 
1
-2
-3
line = input()
-a, b = [int(d) for d in line.split()]
-print(a + b)
-
 
 
 
 
 
🟢 Úllen dúllen doff
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
n = int(input())
-names = input().split()
-if n < 13:
-    i = 13 % n - 1
-else:
-    i = 12
-print(names[i])
-
 
 
 
 
 
🟢 Ultimate Binary Watch
 
 Solution in Python 
 
 
 
1
+using namespace std;
+
+int main()
+{
+    int a, b;
+    cin >> a >> b;
+    cout << a + b << endl;
+    return 0;
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
package main
+
+import "fmt"
+
+func main() {
+    var a, b int
+    fmt.Scan(&a)
+    fmt.Scan(&b)
+    fmt.Println(a + b)
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
import java.util.Scanner;
+
+class TwoSum {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int a = s.nextInt();
+        int b = s.nextInt();
+        System.out.println(a + b);
+    }
+}
+
 
 
 
1
 2
-3
-4
-5
-6
-7
t = [int(d) for d in input()]
-b = [f"{d:b}".zfill(4) for d in t]
-
-for r in range(4):
-    row = ["." if b[i][r] == "0" else "*" for i in range(4)]
-    row.insert(2, " ")
-    print(" ".join(row))
-
 
 
 
 
 
🟢 Undead or Alive
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
s = input()
-
-smiley = ":)" in s
-
-frowny = ":(" in s
-
-if not frowny and smiley:
-    print("alive")
-
-elif frowny and not smiley:
-    print("undead")
-
-elif frowny and smiley:
-    print("double agent")
-
-else:
-    print("machine")
-
 
 
 
 
 
🟢 Unlock Pattern
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
import math
-
+3
line = input()
+a, b = [int(d) for d in line.split()]
+print(a + b)
+
 
 
 
 
 
🟢 Úllen dúllen doff
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
n = int(input())
+names = input().split()
+if n < 13:
+    i = 13 % n - 1
+else:
+    i = 12
+print(names[i])
+
 
 
 
 
 
🟢 Ultimate Binary Watch
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
t = [int(d) for d in input()]
+b = [f"{d:b}".zfill(4) for d in t]
 
-def dist(a, b):
-    return math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)
-
-
-coords = {}
-for i in range(3):
-    n = [int(d) for d in input().split()]
-    for j in range(3):
-        coords[n[j]] = (i, j)
-
-values = [coords[k] for k in sorted(coords)]
-total, prev = 0, 0
-for i in range(1, 9):
-    total += dist(values[i], values[prev])
-    prev = i
-print(total)
-
 
 
 
 
 
🟢 Arrangement
 
 Solution in Python 
 
 
 
 1
+for r in range(4):
+    row = ["." if b[i][r] == "0" else "*" for i in range(4)]
+    row.insert(2, " ")
+    print(" ".join(row))
+
 
 
 
 
 
🟢 Undead or Alive
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11543,17 +11521,31 @@
  7
  8
  9
-10
import math
+10
+11
+12
+13
+14
+15
+16
+17
s = input()
 
-n, m = int(input()), int(input())
+smiley = ":)" in s
 
-k = math.ceil(m / n)
+frowny = ":(" in s
 
-for _ in range(n - (n * k - m)):
-    print("*" * k)
-for _ in range(n * k - m):
-    print("*" * (k - 1))
-
 
 
 
 
 
🟢 UTF-8
 
 Solution in Python 
 
 
 
 1
+if not frowny and smiley:
+    print("alive")
+
+elif frowny and not smiley:
+    print("undead")
+
+elif frowny and smiley:
+    print("double agent")
+
+else:
+    print("machine")
+
 
 
 
 
 
🟢 Unlock Pattern
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11571,56 +11563,26 @@
 16
 17
 18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
n = int(input())
-s = []
-for _ in range(n):
-    s.append(input())
-
-i = 0
-num = 0
-err = False
-t = [0] * 4
-while i < n:
-    a = s[i]
-    if a.startswith("0") and not num:
-        num = 0
-        t[0] += 1
-    elif a.startswith("110") and not num:
-        t[1] += 1
-        num = 1
-    elif a.startswith("1110") and not num:
-        t[2] += 1
-        num = 2
-    elif a.startswith("11110") and not num:
-        t[3] += 1
-        num = 3
-    elif a.startswith("10") and num:
-        num -= 1
-    else:
-        err = True
-        break
-    i += 1
-
-if err or num:
-    print("invalid")
-else:
-    print("\n".join([str(d) for d in t]))
-
 
 
 
 
 
🟢 Vaccine Efficacy
 
 Solution in Python 
 
 
 
 1
+19
import math
+
+
+def dist(a, b):
+    return math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)
+
+
+coords = {}
+for i in range(3):
+    n = [int(d) for d in input().split()]
+    for j in range(3):
+        coords[n[j]] = (i, j)
+
+values = [coords[k] for k in sorted(coords)]
+total, prev = 0, 0
+for i in range(1, 9):
+    total += dist(values[i], values[prev])
+    prev = i
+print(total)
+
 
 
 
 
 
🟢 Arrangement
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11629,139 +11591,17 @@
  7
  8
  9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
participants = int(input())
+10
import math
 
-vaccinated = 0
-control = 0
-infected_control_a = 0
-infected_vaccinated_a = 0
-infected_control_b = 0
-infected_vaccinated_b = 0
-infected_control_c = 0
-infected_vaccinated_c = 0
-
-for p in range(participants):
-    record = input()
-    v, a, b, c = list(record)
-
-    if v == "N":
-        control += 1
-    else:
-        vaccinated += 1
-
-    if a == "Y":
-        if v == "N":
-            infected_control_a += 1
-        else:
-            infected_vaccinated_a += 1
-
-    if b == "Y":
-        if v == "N":
-            infected_control_b += 1
-        else:
-            infected_vaccinated_b += 1
-
-    if c == "Y":
-        if v == "N":
-            infected_control_c += 1
-        else:
-            infected_vaccinated_c += 1
-
-
-def get_vaccine_efficacy(infected_vaccinated, vaccinated, infected_control, control):
-    infection_rate_vaccinated = infected_vaccinated / vaccinated
-    infection_rate_control = infected_control / control
-    return 1 - infection_rate_vaccinated / infection_rate_control
-
-
-vaccine_efficacy = [
-    get_vaccine_efficacy(
-        infected_vaccinated_a,
-        vaccinated,
-        infected_control_a,
-        control,
-    ),
-    get_vaccine_efficacy(
-        infected_vaccinated_b,
-        vaccinated,
-        infected_control_b,
-        control,
-    ),
-    get_vaccine_efficacy(
-        infected_vaccinated_c,
-        vaccinated,
-        infected_control_c,
-        control,
-    ),
-]
-
-for value in vaccine_efficacy:
-    if value <= 0:
-        print("Not Effective")
-    else:
-        print(f"{value*100:.6f}")
-
 
 
 
 
 
🟢 Right-of-Way
 
 Solution in Python 
 
 
 
 1
+n, m = int(input()), int(input())
+
+k = math.ceil(m / n)
+
+for _ in range(n - (n * k - m)):
+    print("*" * k)
+for _ in range(n * k - m):
+    print("*" * (k - 1))
+
 
 
 
 
 
🟢 UTF-8
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11776,23 +11616,59 @@
 13
 14
 15
-16
d = ["North", "East", "South", "West"]
-a, b, c = input().split()
-ia = d.index(a)
-ib = d.index(b)
-ic = d.index(c)
-
-ib = (ib - ia) % 4
-ic = (ic - ia) % 4
-ia -= ia
-
-if ib == 2:
-    print("Yes" if ic == 3 else "No")
-elif ib == 1:
-    print("Yes" if ic in [2, 3] else "No")
-else:
-    print("No")
-
 
 
 
 
 
🟢 Variable Arithmetic
 
 Solution in Python 
 
 
 
 1
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
n = int(input())
+s = []
+for _ in range(n):
+    s.append(input())
+
+i = 0
+num = 0
+err = False
+t = [0] * 4
+while i < n:
+    a = s[i]
+    if a.startswith("0") and not num:
+        num = 0
+        t[0] += 1
+    elif a.startswith("110") and not num:
+        t[1] += 1
+        num = 1
+    elif a.startswith("1110") and not num:
+        t[2] += 1
+        num = 2
+    elif a.startswith("11110") and not num:
+        t[3] += 1
+        num = 3
+    elif a.startswith("10") and num:
+        num -= 1
+    else:
+        err = True
+        break
+    i += 1
+
+if err or num:
+    print("invalid")
+else:
+    print("\n".join([str(d) for d in t]))
+
 
 
 
 
 
🟢 Vaccine Efficacy
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11814,30 +11690,126 @@
 20
 21
 22
-23
context = {}
-while True:
-    s = input()
-    if s == "0":
-        break
-
-    if "=" in s:
-        x, y = [d.strip() for d in s.split("=")]
-        context[x] = int(y)
-    else:
-        v = [d.strip() for d in s.split("+")]
-        t = 0
-        n = []
-        for d in v:
-            if d.isdigit():
-                t += int(d)
-            elif d in context:
-                t += context[d]
-            else:
-                n.append(d)
-        if len(n) < len(v):
-            n = [str(t)] + n
-        print(" + ".join(n))
-
 
 
 
 
 
🟢 Veci
 
 Solution in Python 
 
 
 
 1
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
+49
+50
+51
+52
+53
+54
+55
+56
+57
+58
+59
+60
+61
+62
+63
+64
+65
+66
+67
+68
+69
+70
+71
participants = int(input())
+
+vaccinated = 0
+control = 0
+infected_control_a = 0
+infected_vaccinated_a = 0
+infected_control_b = 0
+infected_vaccinated_b = 0
+infected_control_c = 0
+infected_vaccinated_c = 0
+
+for p in range(participants):
+    record = input()
+    v, a, b, c = list(record)
+
+    if v == "N":
+        control += 1
+    else:
+        vaccinated += 1
+
+    if a == "Y":
+        if v == "N":
+            infected_control_a += 1
+        else:
+            infected_vaccinated_a += 1
+
+    if b == "Y":
+        if v == "N":
+            infected_control_b += 1
+        else:
+            infected_vaccinated_b += 1
+
+    if c == "Y":
+        if v == "N":
+            infected_control_c += 1
+        else:
+            infected_vaccinated_c += 1
+
+
+def get_vaccine_efficacy(infected_vaccinated, vaccinated, infected_control, control):
+    infection_rate_vaccinated = infected_vaccinated / vaccinated
+    infection_rate_control = infected_control / control
+    return 1 - infection_rate_vaccinated / infection_rate_control
+
+
+vaccine_efficacy = [
+    get_vaccine_efficacy(
+        infected_vaccinated_a,
+        vaccinated,
+        infected_control_a,
+        control,
+    ),
+    get_vaccine_efficacy(
+        infected_vaccinated_b,
+        vaccinated,
+        infected_control_b,
+        control,
+    ),
+    get_vaccine_efficacy(
+        infected_vaccinated_c,
+        vaccinated,
+        infected_control_c,
+        control,
+    ),
+]
+
+for value in vaccine_efficacy:
+    if value <= 0:
+        print("Not Effective")
+    else:
+        print(f"{value*100:.6f}")
+
 
 
 
 
 
🟢 Right-of-Way
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11847,18 +11819,28 @@
  8
  9
 10
-11
from itertools import permutations
-
-x = input()
-
-values = sorted(set([int("".join(v)) for v in permutations(x, len(x))]))
+11
+12
+13
+14
+15
+16
d = ["North", "East", "South", "West"]
+a, b, c = input().split()
+ia = d.index(a)
+ib = d.index(b)
+ic = d.index(c)
 
-index = values.index(int(x))
-if index + 1 < len(values):
-    print(values[index + 1])
-else:
-    print(0)
-
 
 
 
 
 
🟡 Vector Functions
 
 Solution in C++ 
 
 
 
 1
+ib = (ib - ia) % 4
+ic = (ic - ia) % 4
+ia -= ia
+
+if ib == 2:
+    print("Yes" if ic == 3 else "No")
+elif ib == 1:
+    print("Yes" if ic in [2, 3] else "No")
+else:
+    print("No")
+
 
 
 
 
 
🟢 Variable Arithmetic
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -11880,89 +11862,51 @@
 20
 21
 22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
#include "vectorfunctions.h"
-#include <algorithm>
-
-void backwards(std::vector<int> &vec)
-{
-    vec = std::vector<int>(vec.rbegin(), vec.rend());
-}
-
-std::vector<int> everyOther(const std::vector<int> &vec)
-{
-    std::vector<int> ans;
-
-    for (int i = 0; i < vec.size(); i += 2)
-        ans.push_back(vec[i]);
-
-    return ans;
-}
-
-int smallest(const std::vector<int> &vec)
-{
-    return *min_element(vec.begin(), vec.end());
-}
-
-int sum(const std::vector<int> &vec)
-{
-    int ans = 0;
-
-    for (auto it = begin(vec); it != end(vec); ++it)
-    {
-        ans += *it;
-    }
-
-    return ans;
-}
-
-int veryOdd(const std::vector<int> &suchVector)
-{
-    int ans = 0;
-    for (int i = 1; i < suchVector.size(); i += 2)
-    {
-        if (suchVector[i] % 2 == 1)
-            ans++;
-    }
-
-    return ans;
-}
-
 
 
 
 
 
🟢 Veður - Lokaðar heiðar
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
v = int(input())
-for _ in range(int(input())):
-    s, k = input().split()
-    if int(k) >= v:
-        print(s, "opin")
-    else:
-        print(s, "lokud")
-
 
 
 
 
 
🟢 Veður - Vindhraði
 
 Solution in Python 
 
 
 
 1
+23
context = {}
+while True:
+    s = input()
+    if s == "0":
+        break
+
+    if "=" in s:
+        x, y = [d.strip() for d in s.split("=")]
+        context[x] = int(y)
+    else:
+        v = [d.strip() for d in s.split("+")]
+        t = 0
+        n = []
+        for d in v:
+            if d.isdigit():
+                t += int(d)
+            elif d in context:
+                t += context[d]
+            else:
+                n.append(d)
+        if len(n) < len(v):
+            n = [str(t)] + n
+        print(" + ".join(n))
+
 
 
 
 
 
🟢 Veci
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
from itertools import permutations
+
+x = input()
+
+values = sorted(set([int("".join(v)) for v in permutations(x, len(x))]))
+
+index = values.index(int(x))
+if index + 1 < len(values):
+    print(values[index + 1])
+else:
+    print(0)
+
 
 
 
 
 
🟡 Vector Functions
 
 Solution in C++ 
 
 
 
 1
  2
  3
  4
@@ -11989,122 +11933,204 @@
 25
 26
 27
-28
k = float(input())
-if k < 0.3:
-    print("logn")
-elif k < 1.6:
-    print("Andvari")
-elif k < 3.4:
-    print("Kul")
-elif k < 5.5:
-    print("Gola")
-elif k < 8.0:
-    print("Stinningsgola")
-elif k < 10.8:
-    print("Kaldi")
-elif k < 13.9:
-    print("Stinningskaldi")
-elif k < 17.2:
-    print("Allhvass vindur")
-elif k < 20.8:
-    print("Hvassvidri")
-elif k < 24.5:
-    print("Stormur")
-elif k < 28.5:
-    print("Rok")
-
-elif k < 32.7:
-    print("Ofsavedur")
-else:
-    print("Farvidri")
-
 
 
 
 
 
🟢 Vefþjónatjón
 
 Solution in Python 
 
 
 
1
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
#include "vectorfunctions.h"
+#include <algorithm>
+
+void backwards(std::vector<int> &vec)
+{
+    vec = std::vector<int>(vec.rbegin(), vec.rend());
+}
+
+std::vector<int> everyOther(const std::vector<int> &vec)
+{
+    std::vector<int> ans;
+
+    for (int i = 0; i < vec.size(); i += 2)
+        ans.push_back(vec[i]);
+
+    return ans;
+}
+
+int smallest(const std::vector<int> &vec)
+{
+    return *min_element(vec.begin(), vec.end());
+}
+
+int sum(const std::vector<int> &vec)
+{
+    int ans = 0;
+
+    for (auto it = begin(vec); it != end(vec); ++it)
+    {
+        ans += *it;
+    }
+
+    return ans;
+}
+
+int veryOdd(const std::vector<int> &suchVector)
+{
+    int ans = 0;
+    for (int i = 1; i < suchVector.size(); i += 2)
+    {
+        if (suchVector[i] % 2 == 1)
+            ans++;
+    }
+
+    return ans;
+}
+
 
 
 
 
 
🟢 Veður - Lokaðar heiðar
 
 Solution in Python 
 
 
 
1
 2
 3
 4
 5
 6
-7
n = int(input())
-parts = [0, 0, 0]
-for _ in range(n):
-    for i, value in enumerate(input().split()):
-        if value == "J":
-            parts[i] += 1
-print(min(parts))
-
 
 
 
 
 
🟢 Velkomin!
 
 Solution in Python 
 
 
 
1
print("VELKOMIN!")
-
 
 
 
 
 
🟢 Who wins?
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
board = []
-for _ in range(3):
-    board.append(input().split())
-
-winner = ""
-for i in range(3):
-    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != "_":
-        winner = board[i][0]
-        break
-    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != "_":
-        winner = board[0][i]
-        break
-
-if board[0][0] == board[1][1] == board[2][2] and board[1][1] != "_":
-    winner = board[1][1]
-elif board[0][2] == board[1][1] == board[2][0] and board[1][1] != "_":
-    winner = board[1][1]
-
-if not winner:
-    winner = "ingen"
-elif winner == "X":
-    winner = "Johan"
-else:
-    winner = "Abdullah"
-
-print(f"{winner} har vunnit")
-
 
 
 
 
 
🟢 Video Speedup
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
n, p, k = [int(d) for d in input().split()]
-i = [int(d) for d in input().split()]
-
-start, total = 0, 0
-speed = 1
-for ti in i:
-    total += speed * (ti - start)
-    start = ti
-    speed += p / 100
-total += speed * (k - start)
-print(f"{total:.3f}")
-
 
 
 
 
 
🟢 Viðsnúningur
 
 Solution in Python 
 
 
 
1
print(input()[::-1])
-
 
 
 
 
  
 Solution in Python 
 
 
 
 1
+7
v = int(input())
+for _ in range(int(input())):
+    s, k = input().split()
+    if int(k) >= v:
+        print(s, "opin")
+    else:
+        print(s, "lokud")
+
 
 
 
 
 
🟢 Veður - Vindhraði
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
k = float(input())
+if k < 0.3:
+    print("logn")
+elif k < 1.6:
+    print("Andvari")
+elif k < 3.4:
+    print("Kul")
+elif k < 5.5:
+    print("Gola")
+elif k < 8.0:
+    print("Stinningsgola")
+elif k < 10.8:
+    print("Kaldi")
+elif k < 13.9:
+    print("Stinningskaldi")
+elif k < 17.2:
+    print("Allhvass vindur")
+elif k < 20.8:
+    print("Hvassvidri")
+elif k < 24.5:
+    print("Stormur")
+elif k < 28.5:
+    print("Rok")
+
+elif k < 32.7:
+    print("Ofsavedur")
+else:
+    print("Farvidri")
+
 
 
 
 
 
🟢 Vefþjónatjón
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
n = int(input())
+parts = [0, 0, 0]
+for _ in range(n):
+    for i, value in enumerate(input().split()):
+        if value == "J":
+            parts[i] += 1
+print(min(parts))
+
 
 
 
 
 
🟢 Velkomin!
 
 Solution in Python 
 
 
 
1
print("VELKOMIN!")
+
 
 
 
 
 
🟢 Who wins?
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
board = []
+for _ in range(3):
+    board.append(input().split())
+
+winner = ""
+for i in range(3):
+    if board[i][0] == board[i][1] == board[i][2] and board[i][0] != "_":
+        winner = board[i][0]
+        break
+    elif board[0][i] == board[1][i] == board[2][i] and board[0][i] != "_":
+        winner = board[0][i]
+        break
+
+if board[0][0] == board[1][1] == board[2][2] and board[1][1] != "_":
+    winner = board[1][1]
+elif board[0][2] == board[1][1] == board[2][0] and board[1][1] != "_":
+    winner = board[1][1]
+
+if not winner:
+    winner = "ingen"
+elif winner == "X":
+    winner = "Johan"
+else:
+    winner = "Abdullah"
+
+print(f"{winner} har vunnit")
+
 
 
 
 
 
🟢 Video Speedup
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12114,55 +12140,19 @@
  8
  9
 10
-11
-12
-13
-14
for _ in range(int(input())):
-    n = int(input())
-    votes = [int(input()) for _ in range(n)]
-    largest = max(votes)
-    if votes.count(largest) > 1:
-        print("no winner")
-    else:
-        total = sum(votes)
-        winner = votes.index(largest)
-        print(
-            "majority" if votes[winner] > total / 2 else "minority",
-            "winner",
-            winner + 1,
-        )
-
 
 
 
 
 
🟢 Warehouse
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
for _ in range(int(input())):
-    n = int(input())
-    warehouse = {}
-    for _ in range(n):
-        s = input().split()
-        name, quantity = s[0], int(s[1])
-        if name not in warehouse:
-            warehouse[name] = quantity
-        else:
-            warehouse[name] += quantity
-    print(len(warehouse))
-    names = sorted(warehouse)
-    for name in sorted(
-        warehouse, key=lambda k: (warehouse[k], -names.index(k)), reverse=True
-    ):
-        print(name, warehouse[name])
-
 
 
 
 
 
🟢 Weak Vertices
 
 Solution in Python 
 
 
 
 1
+11
n, p, k = [int(d) for d in input().split()]
+i = [int(d) for d in input().split()]
+
+start, total = 0, 0
+speed = 1
+for ti in i:
+    total += speed * (ti - start)
+    start = ti
+    speed += p / 100
+total += speed * (k - start)
+print(f"{total:.3f}")
+
 
 
 
 
 
🟢 Viðsnúningur
 
 Solution in Python 
 
 
 
1
print(input()[::-1])
+
 
 
 
 
  
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12175,51 +12165,21 @@
 11
 12
 13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
from itertools import combinations
-
-while True:
-    n = int(input())
-    if n == -1:
-        break
-    graph = {}
-    for i in range(n):
-        graph[str(i)] = [str(v) for v, e in zip(range(n), input().split()) if e == "1"]
-
-    # listing the weak vertices ordered from least to greatest
-    # I guess it means vertex number, not the weakness
-    # keys = sorted(graph, key=lambda x: len(graph[x]), reverse=True)
-
-    keys = graph.keys()
-
-    result = []
-
-    for key in keys:
-        has_triangle = False
-        for a, b in combinations(graph[key], 2):
-            if a in graph[b] and b in graph[a]:
-                has_triangle = True
-                break
-
-        if not has_triangle:
-            result.append(key)
-
-    print(" ".join(result))
-
 
 
 
 
 
🟡 WERTYU
 
 Solution in Python 
 
 
 
 1
+14
for _ in range(int(input())):
+    n = int(input())
+    votes = [int(input()) for _ in range(n)]
+    largest = max(votes)
+    if votes.count(largest) > 1:
+        print("no winner")
+    else:
+        total = sum(votes)
+        winner = votes.index(largest)
+        print(
+            "majority" if votes[winner] > total / 2 else "minority",
+            "winner",
+            winner + 1,
+        )
+
 
 
 
 
 
🟢 Warehouse
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12234,105 +12194,23 @@
 13
 14
 15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
mapping = {
-    # row 1
-    "1": "`",
-    "2": "1",
-    "3": "2",
-    "4": "3",
-    "5": "4",
-    "6": "5",
-    "7": "6",
-    "8": "7",
-    "9": "8",
-    "0": "9",
-    "-": "0",
-    "=": "-",
-    # row 2
-    "W": "Q",
-    "E": "W",
-    "R": "E",
-    "T": "R",
-    "Y": "T",
-    "U": "Y",
-    "I": "U",
-    "O": "I",
-    "P": "O",
-    "[": "P",
-    "]": "[",
-    "\\": "]",
-    # row 3
-    "S": "A",
-    "D": "S",
-    "F": "D",
-    "G": "F",
-    "H": "G",
-    "J": "H",
-    "K": "J",
-    "L": "K",
-    ";": "L",
-    "'": ";",
-    # row 4
-    "X": "Z",
-    "C": "X",
-    "V": "C",
-    "B": "V",
-    "N": "B",
-    "M": "N",
-    ",": "M",
-    ".": ",",
-    "/": ".",
-    " ": " ",
-}
-
-while True:
-    try:
-        s = input()
-    except:
-        break
-    print("".join([mapping[c] for c in s]))
-
 
 
 
 
 
🟢 What does the fox say?
 
 Solution in Python 
 
 
 
 1
+16
for _ in range(int(input())):
+    n = int(input())
+    warehouse = {}
+    for _ in range(n):
+        s = input().split()
+        name, quantity = s[0], int(s[1])
+        if name not in warehouse:
+            warehouse[name] = quantity
+        else:
+            warehouse[name] += quantity
+    print(len(warehouse))
+    names = sorted(warehouse)
+    for name in sorted(
+        warehouse, key=lambda k: (warehouse[k], -names.index(k)), reverse=True
+    ):
+        print(name, warehouse[name])
+
 
 
 
 
 
🟢 Weak Vertices
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12341,17 +12219,55 @@
  7
  8
  9
-10
for _ in range(int(input())):
-    words = input().split()
-    others = set()
-    while True:
-        line = input()
-        if line == "what does the fox say?":
-            break
-        w = line.split()[-1]
-        others.add(w)
-    print(" ".join(w for w in words if w not in others))
-
 
 
 
 
 
🟢 Which is Greater?
 
 Solutions in 5 languages 
 
 
 
 1
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
from itertools import combinations
+
+while True:
+    n = int(input())
+    if n == -1:
+        break
+    graph = {}
+    for i in range(n):
+        graph[str(i)] = [str(v) for v, e in zip(range(n), input().split()) if e == "1"]
+
+    # listing the weak vertices ordered from least to greatest
+    # I guess it means vertex number, not the weakness
+    # keys = sorted(graph, key=lambda x: len(graph[x]), reverse=True)
+
+    keys = graph.keys()
+
+    result = []
+
+    for key in keys:
+        has_triangle = False
+        for a, b in combinations(graph[key], 2):
+            if a in graph[b] and b in graph[a]:
+                has_triangle = True
+                break
+
+        if not has_triangle:
+            result.append(key)
+
+    print(" ".join(result))
+
 
 
 
 
 
🟡 WERTYU
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12362,19 +12278,109 @@
  9
 10
 11
-12
#include <iostream>
-
-using namespace std;
-
-int main()
-{
-    int a, b;
-    cin >> a >> b;
-    int ans = (a > b) ? 1 : 0;
-    cout << ans << endl;
-    return 0;
-}
-
 
 
 
 1
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
+49
+50
+51
+52
+53
+54
+55
+56
+57
mapping = {
+    # row 1
+    "1": "`",
+    "2": "1",
+    "3": "2",
+    "4": "3",
+    "5": "4",
+    "6": "5",
+    "7": "6",
+    "8": "7",
+    "9": "8",
+    "0": "9",
+    "-": "0",
+    "=": "-",
+    # row 2
+    "W": "Q",
+    "E": "W",
+    "R": "E",
+    "T": "R",
+    "Y": "T",
+    "U": "Y",
+    "I": "U",
+    "O": "I",
+    "P": "O",
+    "[": "P",
+    "]": "[",
+    "\\": "]",
+    # row 3
+    "S": "A",
+    "D": "S",
+    "F": "D",
+    "G": "F",
+    "H": "G",
+    "J": "H",
+    "K": "J",
+    "L": "K",
+    ";": "L",
+    "'": ";",
+    # row 4
+    "X": "Z",
+    "C": "X",
+    "V": "C",
+    "B": "V",
+    "N": "B",
+    "M": "N",
+    ",": "M",
+    ".": ",",
+    "/": ".",
+    " ": " ",
+}
+
+while True:
+    try:
+        s = input()
+    except:
+        break
+    print("".join([mapping[c] for c in s]))
+
 
 
 
 
 
🟢 What does the fox say?
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12383,25 +12389,17 @@
  7
  8
  9
-10
-11
-12
-13
-14
package main
-
-import "fmt"
-
-func main() {
-    var a, b int
-    fmt.Scan(&a)
-    fmt.Scan(&b)
-    if a > b {
-        fmt.Println(1)
-    } else {
-        fmt.Println(0)
-    }
-}
-
 
 
 
 1
+10
for _ in range(int(input())):
+    words = input().split()
+    others = set()
+    while True:
+        line = input()
+        if line == "what does the fox say?":
+            break
+        w = line.split()[-1]
+        others.add(w)
+    print(" ".join(w for w in words if w not in others))
+
 
 
 
 
 
🟢 Which is Greater?
 
 Solutions in 5 languages 
 
 
 
 1
  2
  3
  4
@@ -12412,22 +12410,18 @@
  9
 10
 11
-12
-13
-14
import java.util.Scanner;
+12
#include <iostream>
 
-class WhichisGreater {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int a = s.nextInt();
-        int b = s.nextInt();
-        if (a>b){
-            System.out.println(1);
-        }else{
-            System.out.println(0);
-        }
-    }
-}
+using namespace std;
+
+int main()
+{
+    int a, b;
+    cin >> a >> b;
+    int ans = (a > b) ? 1 : 0;
+    cout << ans << endl;
+    return 0;
+}
 
 
 
 
 1
  2
  3
@@ -12441,139 +12435,99 @@
 11
 12
 13
-14
const readline = require("readline");
-const rl = readline.createInterface(process.stdin, process.stdout);
-
-rl.question("", (line) => {
-  [a, b] = line
-    .trim()
-    .split(" ")
-    .map((e) => parseInt(e));
-  if (a > b) {
-    console.log(1);
-  } else {
-    console.log(0);
-  }
-});
-
 
 
 
1
-2
-3
-4
-5
a, b = [int(d) for d in input().split()]
-if a > b:
-    print(1)
-else:
-    print(0)
-
 
 
 
 
 
🟡 Wizard of Odds
 
 Solution in Python 
 
 
 
1
-2
-3
-4
-5
-6
-7
-8
import math
-
-n, k = [int(d) for d in input().split()]
-ans = math.log(n, 2) <= k
-if ans:
-    print("Your wish is granted!")
-else:
-    print("You will become a flying monkey!")
-
 
 
 
 
 
🟡 Words for Numbers
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
mapping = {
-    0: "zero",
-    1: "one",
-    2: "two",
-    3: "three",
-    4: "four",
-    5: "five",
-    6: "six",
-    7: "seven",
-    8: "eight",
-    9: "nine",
-    10: "ten",
-    11: "eleven",
-    12: "twelve",
-}
-
-
-def f(d):
-    if d < 13:
-        return mapping[d]
-
-    ones = d % 10
-    if d < 20:
-        return {3: "thir", 5: "fif", 8: "eigh"}.get(ones, mapping[ones]) + "teen"
-
-    tens = d // 10
-    return (
-        {2: "twen", 3: "thir", 4: "for", 5: "fif", 8: "eigh"}.get(tens, mapping[tens])
-        + "ty"
-        + ("-" + mapping[ones] if ones else "")
-    )
-
-
-def t(w):
-    if w.isdigit():
-        return f(int(w))
-    else:
-        return w
-
-
-while True:
-    try:
-        words = input()
-    except:
-        break
-    print(" ".join([t(w) for w in words.split()]))
-
 
 
 
 
 
🟢 Yin and Yang Stones
 
 Solution in Python 
 
 
 
1
-2
s = input()
-print(1 if s.count("W") == s.count("B") else 0)
-
 
 
 
 
 
🟢 Yoda
 
 Solution in Python 
 
 
 
 1
+14
package main
+
+import "fmt"
+
+func main() {
+    var a, b int
+    fmt.Scan(&a)
+    fmt.Scan(&b)
+    if a > b {
+        fmt.Println(1)
+    } else {
+        fmt.Println(0)
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
import java.util.Scanner;
+
+class WhichisGreater {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int a = s.nextInt();
+        int b = s.nextInt();
+        if (a>b){
+            System.out.println(1);
+        }else{
+            System.out.println(0);
+        }
+    }
+}
+
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
const readline = require("readline");
+const rl = readline.createInterface(process.stdin, process.stdout);
+
+rl.question("", (line) => {
+  [a, b] = line
+    .trim()
+    .split(" ")
+    .map((e) => parseInt(e));
+  if (a > b) {
+    console.log(1);
+  } else {
+    console.log(0);
+  }
+});
+
 
 
 
1
+2
+3
+4
+5
a, b = [int(d) for d in input().split()]
+if a > b:
+    print(1)
+else:
+    print(0)
+
 
 
 
 
 
🟡 Wizard of Odds
 
 Solution in Python 
 
 
 
1
+2
+3
+4
+5
+6
+7
+8
import math
+
+n, k = [int(d) for d in input().split()]
+ans = math.log(n, 2) <= k
+if ans:
+    print("Your wish is granted!")
+else:
+    print("You will become a flying monkey!")
+
 
 
 
 
 
🟡 Words for Numbers
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12591,49 +12545,83 @@
 16
 17
 18
-19
a, b = input(), input()
-size = max(len(a), len(b))
-
-a = [int(d) for d in a.zfill(size)]
-b = [int(d) for d in b.zfill(size)]
-
-ans_a = [d1 for d1, d2 in zip(a, b) if d1 >= d2]
-ans_b = [d2 for d1, d2 in zip(a, b) if d2 >= d1]
-
-
-def f(ans):
-    if not ans:
-        return "YODA"
-    else:
-        return int("".join([str(d) for d in ans]))
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
mapping = {
+    0: "zero",
+    1: "one",
+    2: "two",
+    3: "three",
+    4: "four",
+    5: "five",
+    6: "six",
+    7: "seven",
+    8: "eight",
+    9: "nine",
+    10: "ten",
+    11: "eleven",
+    12: "twelve",
+}
 
 
-print(f(ans_a))
-print(f(ans_b))
-
 
 
 
 
 
🟢 Zamka
 
 Solution in Python 
 
 
 
 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
-10
-11
-12
l, d, x = input(), input(), input()
-l, d, x = int(l), int(d), int(x)
-
-for i in range(l, d + 1):
-    if sum([int(d) for d in str(i)]) == x:
-        print(i)
-        break
-
-for i in range(d, l - 1, -1):
-    if sum([int(d) for d in str(i)]) == x:
-        print(i)
-        break
-
 
 
 
 
 
🟢 Stand on Zanzibar
 
 Solutions in 2 languages 
 
 
 
 1
+def f(d):
+    if d < 13:
+        return mapping[d]
+
+    ones = d % 10
+    if d < 20:
+        return {3: "thir", 5: "fif", 8: "eigh"}.get(ones, mapping[ones]) + "teen"
+
+    tens = d // 10
+    return (
+        {2: "twen", 3: "thir", 4: "for", 5: "fif", 8: "eigh"}.get(tens, mapping[tens])
+        + "ty"
+        + ("-" + mapping[ones] if ones else "")
+    )
+
+
+def t(w):
+    if w.isdigit():
+        return f(int(w))
+    else:
+        return w
+
+
+while True:
+    try:
+        words = input()
+    except:
+        break
+    print(" ".join([t(w) for w in words.split()]))
+
 
 
 
 
 
🟢 Yin and Yang Stones
 
 Solution in Python 
 
 
 
1
+2
s = input()
+print(1 if s.count("W") == s.count("B") else 0)
+
 
 
 
 
 
🟢 Yoda
 
 Solution in Python 
 
 
 
 1
  2
  3
  4
@@ -12651,43 +12639,49 @@
 16
 17
 18
-19
-20
-21
-22
import java.util.Scanner;
-
-class StandOnZanzibar {
-    public static void main(String[] args) {
-        Scanner s = new Scanner(System.in);
-        int t = s.nextInt();
-        for (int i = 0; i < t; i++) {
-            int total = 0;
-            int n = 0;
-            int init = 1;
-            while (true) {
-                n = s.nextInt();
-                if (n == 0) {
-                    break;
-                }
-                total += Math.max(n - 2 * init, 0);
-                init = n;
-            }
-            System.out.println(total);
-        }
-    }
-}
-
 
 
 
1
-2
-3
-4
-5
-6
for _ in range(int(input())):
-    numbers = [int(d) for d in input().split()[:-1]]
-    total = 0
-    for i in range(1, len(numbers)):
-        total += max(numbers[i] - 2 * numbers[i - 1], 0)
-    print(total)
-
 
 
 
 
 
🟢 Un-bear-able Zoo
 
 Solution in Python 
 
 
 
 1
+19
a, b = input(), input()
+size = max(len(a), len(b))
+
+a = [int(d) for d in a.zfill(size)]
+b = [int(d) for d in b.zfill(size)]
+
+ans_a = [d1 for d1, d2 in zip(a, b) if d1 >= d2]
+ans_b = [d2 for d1, d2 in zip(a, b) if d2 >= d1]
+
+
+def f(ans):
+    if not ans:
+        return "YODA"
+    else:
+        return int("".join([str(d) for d in ans]))
+
+
+print(f(ans_a))
+print(f(ans_b))
+
 
 
 
 
 
🟢 Zamka
 
 Solution in Python 
 
 
 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
l, d, x = input(), input(), input()
+l, d, x = int(l), int(d), int(x)
+
+for i in range(l, d + 1):
+    if sum([int(d) for d in str(i)]) == x:
+        print(i)
+        break
+
+for i in range(d, l - 1, -1):
+    if sum([int(d) for d in str(i)]) == x:
+        print(i)
+        break
+
 
 
 
 
 
🟢 Stand on Zanzibar
 
 Solutions in 2 languages 
 
 
 
 1
  2
  3
  4
@@ -12700,23 +12694,77 @@
 11
 12
 13
-14
from collections import Counter
+14
+15
+16
+17
+18
+19
+20
+21
+22
import java.util.Scanner;
 
-lc = 0
-while True:
-    n = int(input())
-    if not n:
-        break
-    lc += 1
-    l = Counter()
-    for _ in range(n):
-        animal = input().lower().split()
-        l[animal[-1]] += 1
-    print(f"List {lc}:")
-    print("\n".join([f"{k} | {l[k]}" for k in sorted(l)]))
-
 
 
 
 
 
🟢 Zoom
 
 Solution in Python 
 
 
 
1
+class StandOnZanzibar {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        int t = s.nextInt();
+        for (int i = 0; i < t; i++) {
+            int total = 0;
+            int n = 0;
+            int init = 1;
+            while (true) {
+                n = s.nextInt();
+                if (n == 0) {
+                    break;
+                }
+                total += Math.max(n - 2 * init, 0);
+                init = n;
+            }
+            System.out.println(total);
+        }
+    }
+}
+
 
 
 
1
 2
-3
n, k = [int(d) for d in input().split()]
-x = [int(d) for d in input().split()]
-print(" ".join([str(x[i]) for i in range(k - 1, n, k)]))
-
 
 
 
 
 
 
  Last update: 2023-10-03 
 Created: 2023-09-28  
 
 
 
  
  
 
 
 
      
\ No newline at end of file
+3
+4
+5
+6
for _ in range(int(input())):
+    numbers = [int(d) for d in input().split()[:-1]]
+    total = 0
+    for i in range(1, len(numbers)):
+        total += max(numbers[i] - 2 * numbers[i - 1], 0)
+    print(total)
+

🟢 Un-bear-able Zoo

Solution in Python 
 1
+ 2
+ 3
+ 4
+ 5
+ 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
from collections import Counter
+
+lc = 0
+while True:
+    n = int(input())
+    if not n:
+        break
+    lc += 1
+    l = Counter()
+    for _ in range(n):
+        animal = input().lower().split()
+        l[animal[-1]] += 1
+    print(f"List {lc}:")
+    print("\n".join([f"{k} | {l[k]}" for k in sorted(l)]))
+

🟢 Zoom

Solution in Python 
1
+2
+3
n, k = [int(d) for d in input().split()]
+x = [int(d) for d in input().split()]
+print(" ".join([str(x[i]) for i in range(k - 1, n, k)]))
+
Last update: 2023-10-04
Created: 2023-09-28
\ No newline at end of file diff --git a/summary-by-initial.png b/summary-by-initial.png index 0ea528ebeb38ff20671a586caec94e7d6299e7fd..1a9bb3868cc35e612344501528ac209a2701e744 100644 GIT binary patch literal 11421 zcmd^l2UL^kx^C1_M;&k+MMvs5Vgm(HIs#)wL_tc3bP?$#w15NxDk?TWK|tw9CnS-Q zfV8Nn2uP8V00AP>2^~Ucf%E<|bN1fr-d*lpd!4h+y4MvILizvy`@Z*S@B84gu9m=N z;ms%%Nvm0m0BSzZ~c%1!P3 zZ2dL0xSgKAW_Pl~AZRA|F0{co-Ju zLl0;6+`>#q5Gx6&>su~AU8@wuGMj-5L*2I}HC`L#05 zS`vglOE;5f@xXa&s$=uHx;Q1wsZ+OoCb}&sm)4{E(ssGuvo?Q+kWjk+_-id*w?9QPJ1gt_wr$&LK7VeJSeXnltvVCXQyjrOJgRwN-?^bhMP8R z8uv>{Nf~L*4EOZ%B6eof_8WM3QJf=DI>cG+Ho^`-@Op&vsrn3F1wtCgN{@9=Yi+t?tOB#=##lNL zs@_A%@M9#4Qbu`Maq$&DKfi~M9uY%))}Vf~vFAMMAFo()vmkI=V^wiEfvZbw=b3>z z{BU~AY?F?x_F{kS_5Hf>Syd82<_T)P#vy`YvyG>>9+Hx}u=m_!hx;q=TlU&W2blZy zN14)GUNki|%?_o8=bR1^#IGz2D&S`wc&d>H^o&hRUbxZuK4L1KXPB1$r2PE+9Y6nk zWugu_CRGfA#zo}?Rcq!uA(~TVRj6Y!8HM`olJKYo-~+1S*8uo8^?UgE&B1pYQK+L2 zC)c1*kN>}ZJ6}jc+^=t&il|`tAw@;l+Ojh9?Ck8#TecWpzWgL2BEsm(l`9i}RN>sy za2?rlqm5g|z4aslCU5z-clokOQPLQv;imMO>T3OyCvTk#6E&d-AiGi5;BzY}>DRq` z_2R6IjM83v4LW^!c~s0aVf5)2y4YIU5`SACXVfuDD|B%HZppq z>NA@4B~{D$_p?eeD;jCbv$=5oygNliM1=VK`Op0W1IDH5F}3O6zFiC7ghIuay4(%d zAS@m{e%#Q+#3WY1IeKoqi)h6k!AKoC^t5^S8J$jtV>PV5ecQG@naw6+ip_r(*2~mX z&g>aDCB0WUHZgC5Hl&Mz z=QcK877`Mwrn=uHbxeBL2xm#7P?sYk*>q>MpvVcR`+vwd|A2`8Uw^ybaQ?ZXYpkeX z2teIXBF55^+|ptM2z%(@!SmYM+ERxP&rlu_!T8QBjdPc(C!))4c?@9dNcqMs{di(9uC4uzY#CR&{lGrfcTW!-w*|u08V?+nUharV{`VLzISlXp0_qD43Zgcv`sF2AuliQ z;e!YIZf<03!dlc#uiHsow?91E<;VD7HK{7HjG}cc*s%Kop7CtpJFz;;IUg+L)YW;={44rku!^4{e1aNv^zI@^4Tfn3G z0Km}Px)31Gwr@zBo|%bEN=owd^pqzodM_+29QyUwQ(EETtxxxAofrYs5!$`mq+hYQ zsmaL5s1Nye&hmA@>-Gjll?)JPxzA`@kK6=}ac4Lqx*MFciAE%hP6ftJ+% zYbjy+71ym@yW__nFIUYWBn9;H-NubXvm!U~8Ph_Clvl5g@|OQ@8F9y0MJpwsfkLCl zw(C02bb2*pYe(+CaN$A(aQU@sFYW5%P1u#7q0ZG;*?E*;ZL1DjW#lp{9o8d zH*i&O)23_>iwYLN+&`CUtxE)r`kf(m^sA*AT(Mq}!dSWVvsj{yn;#cZ(@#j8>_1AqDj(VH7VPK%rVR|5z44 zend?9^Ts!C+N2Lq`0d-bLOj=rH$6S=nVyjWMR)P!$&;{mAb70Hl|VZS%Yu#q{)vTR zMb2ip#^U*P8-8eFn9FGiC&D3rY>i?=Yz<6$y&6C}0E z@!Y29BWAPVLCdF8&xJMtC*%4)Z3|D808o4Q_;Id}|C%*x;I3Y=RR9s51ynR>ojrTk zTqfpk+0FK^B{|4B3Qr_z&H1EdY8ty?t9UN3dDOFK4xkKb>gyT6-2a-}Qcj0>*B&Vv z`ua8)um;T=@1ok(2@8lSUyhjldzIS$ODLj8s*UHLtNFTx)~;K(PQm8m4|UJwDl;=K z`%ci0z4xiRskvgc&U-EDx7K;LUH@mk>c5iC5YOiBKar$QF;1* zmR<#H2ZMs^kHSbPD_;Sj#<;(2Z=o|&CLC8&TN?%B0~ou0{rW?P4r#-Q;daQwDJg@B zjgJ?F(nJ&qp4a7zuo8cfNk_!Je?sX*g_$&l+|rb;6BQYm3Z^wwR3*P#1P~-NGASXd zAV2>^VEyOMMjQr-isKkt_;%r>q@cTo;`hxGCy_)#%6pNoiH!(Fqn5!${zwX?HRs;I~FwUN2`s2mtrFHAxu za-b3C;!J*huB!wWiCDCSr6nTNpg8B;nKPe;y^UWd%+7k>y?3u96U=i74UC@fE!B{4 zAb-N*aHeV5jXb@-wPs6&>IgFy;Oe!~)h5aeiN>U+MJ}fmK!mpp9!pFeZ=@9_I;Fg* zf8|Qnr%#`xiiCdrG5O}rn4D6U2K_H=Zat{CY6aFmnH;XV0EVf);=O{!CrGN`Yl8BIc7wlh!82B+hpm zHaLBJygOFT=3GMDsouh)$G`a04Vf{EB^vzdEcr=TOT(oLsG9|X>@h%}e`LjSn#FW) z71T9TSoEfWintXo>SsRohkW!>-$cHX)h5*CegBjqi#yg&e!;S7zUhx8Nk7-O9z(78 zd-VOw+~nV^?|$D55!4EcZ?~XMW2`do+Y4uHM;#5``|sJ$Z>1JD&y6b8Hn}pFIrj=T z41I?xt9tq`lOW)bTr0XIVkf{~fkKUzwHnXs%s;HYJXwj@kys@x`Ocm1#=6T(D;AL* zj31lS2a*z3$2-6VqGf_cvNI9Q20?=vcz^J6cYoTx9c^hj?o|NfHdR1~%me%6Jo)u4 zTBhKzPJ`xZnRvkDNdXBB^N86IB1H<6UTusl6T+2^>=NV>mgR{vdA<{tP*M9NC5s24 zf^zhdG-~SVNDV2#Tzk=!B8;zULPXmA```brL?Np1d~FV|@uWwO9&rlxK^;Y_^s>hy z5);YvRsMv1iNIHS(~~00SJai&P|?+-4yC~k@rl(40~aPrnb*Rpk^!F@xQ2CFbVmAL|NS8dLS`yH75kGqts~ zJ#_TwtN&D_lV9jTK_=1YG0%|76v)nu;P+(dg(7&>yqn&!{!LJ33ifazbtQ)#>Z2(> z_c4xEWwuZ%$?NUG=F-qha}zlgdB5H)>3P)uck{wO&b>Jlq+;i!UD#Nxtu|jcd3*BI zzpLW@Y4Sop-i1OfD=l=zv0O;2=M40Cy>ZQ7+L9TwaNYmt-qhT{&f|VGYN{N zjf};Z?rlAR0bhrMX;setRw6u`!Q)nKIiY0-82sYNg(I}8u;(|@m!?v7G1_xn)iqW$ zsmF~w#MLGT0xc=Ezn8dC@ZIp;$L)sRZILy)dNp}*b~qKn38j|HP=MPUpG@Xmul@-M z1q?GTexbRtT2i&P?%Tf~&fjSPInb^SXM`mKPJm@xY))E9W4V=HLSjL?hD6d#y_z1- zfb;zxr0fhP4#Y#<8-Y_ogG}?cL_q$@lVqUBW`^&7*5AX2lG+dgt1iwo&^`(tl=0D& z$up7Gz9r5j3o}kwYzgnMp;gIfWLLD<@vEt}8e#nAhN{rkMAOxRtu`^MeXKT_IPL+a z_>9M>jb^()$&V4eq)aR4zmMr?<^&xxHly3bEGYYAZ>8?j2(@r4s3u{Y&zQEOtIORNYR35fNxswm59&;{oyMmuuTM}%7Q`Kb zB-9pHIY(-92)4vTF=h8R5!b;lf3aC1@Ve|RaINS}lBR9V4jn)>#h?T-8NMI;v;*4ejj9|Xub zI5n=ghD`C-wF<5skO(9)(Yto;lsa~7x{&*aNBt^C0WPP8ZU5;fgG?)PLd$VQn?GN3 z!(51yEnAsOn=)5cRz_NhF$}T=ClLdYKH!rSFnmP_uvzHE;DFI%j!lyL4jdpth*dI@ zL!4cnX&~n2UM%YJF+2SONGRc_8#YNGTHcpU$PAGPyaI_eWW2ADAa&a|eSeQ5YuB!o zx2<{BtdS$9-_Z8B?#~yFLg{;T7)yQt3M5M+plAyUwR#rZc*-uz8!7c%o#?|~K)nZy z+=5K?x4j;#d>%pt5ot(bc-+3e5FG?6uPb1t4hi!TKC&VHfRMMPz`jAX74yvoG`H}B z3Hqv~OpJ~zi`J^d4oC&-fhYJ8B?)uw_KUFU3U;5LtA^4+8f7Ds% zh)v8y#gcCC$56wI7azkjAm|N}gfQO|LS?8X=!QyYT7up)`t7%ykohUNv>gp!dfFnX zq=dN?r`Y;r&uJGPfkP^)>2d!AFE-mMK^51O8m^JkTjji}`y|p?Ofcl#yLa*qjlU44 zs}CqJ63h)-XFu%?Z&4ipPv+5)4{{G;)Gj=SM4eN=_WpkJfW5svbX$fX%Aqnat-R!u z!A`kqR2pchhxhL{zPYtd0o#27B7-*a1aJg`{L`Kj65cMB` zbOqs0rny%rgof!!W%C*lBY_j$NB{%t2|3-qpr9ZsmTkFx|Ha0wn#-4Mx?WjV=J0*n zUs(r>3Tj1BnC%7j(#pzhHkt>I96^I|Z2=ky$4Of$SrNGC(DIi41q^!TqX_ok(W93e zPRu;kV`aM%fMOtY^!sd85#Sf)>r2)HP00ju(~C=b@nX33lK4JH{vuac(d9Yxk^0<~ z3j-EBDI?HX0!s^(q-Un+HE@yY(r&;8%^5|Fq6Cj*%+Jr8RwY45TjD!0UZD+HW4tlN zatu9@i8ylPX6dyfpeh}{y?@}ut|&*e36WA^YDROJ%At{$vM5yU6kY|Lx>*8Jwck%h z&`JPdp+Ckn@7i4usa70WEW3h$R7!WyDnXq;+uV_76M~#^2?+}96Xj!~nlBj%O}QK< zF**5-&qVMBfhN!|RDYgZmsf*2zVE5l>}<0hD@XmtWHQtn)VQXAm}=q2*c$Fu@e^6l zc(R0=7oQm~=XDEnQd3i@H>R%f1DbZtLJP_n3@yljsT{0T!g85(CPY_V#$yl#AkoB! zsw(GqcQy&DdS_u$DETWK3Y`I$%vA9jaHx59NQ2uA7FXE0Vr9|U!sCMwelWpT9yek{ zSe~i^ZPeOV9SIIb3NGt!8IENl?WFEO zFz=2OKP|Beut46vK3>X-rLfQ|v6=<&g`t$s#Ucn~wYtcJ_CVvUbsL>>XKW?7>9n`= z%a=UwiE0G2MO?SFw`Y;za<5uxu4cr-!or#{Mn+oNdx&-NE9Sp#ac;@dXKdFyVePyO z!HDzxWRLjF20>8=Bn8x^iYU6gk~9H1IPJ6y5v#Pkd`qp{>T$awx31jvTXq%?%9dAq1g!Dv_P_T(Vs%@7HI`zSIUUEj-OTmh>$~} zD|C<4=7Wb7b{Rbxyuk!o0tJDK!w13_pw&`XuQqXl6Q(wvMVo_4H-?;t+h!B)_nFd( z1t>tfxFf=5=i`gG{(zJ+mrW>R22pn((gH)?DG zL18;JkW*nDPEM4~=u#<$ z+5$cYSD?Y!0;Mt=Ltj1%+KhK)C-4x`%c_pp*IF^aUtUJCD`-?T+a#px#EbxxA|0I^ zF*OYhOJvhl%iOwDxf5(FfK{)CRahc`lfl+KIIGT}RX%<+uc{D=zstQ+KtRxWXvu6H&O$RHG7<++ z;S8}Ne(J+6?r>%jUUbvcM+o7Ol0&W@u0HpCOk6i!IR!ccpddaom_ca}*?fAk2TJXg zLibc}74F;nO+ZZe&sbPYjrp&^PMm;tEkYMvq?f+DFoQG_EWGLz@Lz9j zbW-P8!*0SX18fRT+<(0D_4x7NjRL}HFJJ!J-`CgTXclcd4A|BTt0;f<4T|DqOfu~k zw0isYErRaRhfQAYza%`Dg#G+nZt-jI*4a8G_D~$Q;tPlw2hI<}kxS%wDcNmAXFl*I zXWFO}vK`<>4N8^Z4?ncn##m%PD`L1}X?zABZ|F~-`Y7UTPM^kgr0eVoU)W{te#>8k z#}1-1ds%rv1t!tyP))|K%U}*d6-E%?=SrQ5#Z#uRL-*D+QE> zV1}TGo7dgGc<&k$L{plcCf{iL0o@klPinFwo)U4*}j3zWin%~{s;(B)m^vpqM zEkOob(i^5$2-R!hS-sD)RmQUH3N&*J@%R#EFM6|}AVRU?{-bh2J9Z4gi8Fn5^%jgK z;6R}LzGWPnRk!a$_XnJ($Il=mAVSi{4vontA(1tPy^4DA!o)R{qQ-`mDD<1Lus#%&+_RWxhKJc~!nktx}G^wik+FC+;>;H$$+;Opmd2;@r2gn9rxY|M+nPVg^Q;-;5;xrwo|! zNCpid%mF<>0YeR~+OvS=jURSd<-$z>?>7*-wS0VN&}?o?9u&qw*B6np85du?1Yx>C zBvTau%z=g^3JfgZsVm6FV4y;|gPN-*fZ9~T%gJ?HPk<{jFXzv(V3lcT7Mvp9in?2; zGH7tlOoJwcDg)jC(PXe=dTRI{5=<>zinh%Ljf4!hnP$2-*_BYv*N&(*V2u?#i?904++dY^qAa zl|#kU7{+7O1dJ}+AUC@L(hQ%Z+aa(54E(pjY8&3rm(ySr4M8c8-uO99xONm~d+>D= zRI7X39hhVb@fkJf-NWYzb9C0Ck%|uv8=&Sp-U2XY#aX>zXkaiq5Qoi4OFIJ{l9Hj9 zk6I{Jbkiy~;C^UNX2LwpYi9VvhX&r>g#fZy@VOu1*(-7f&6PMh>H@CqH_&M?wWJ*! z=9|MIm+Hdtf&ixgjbVvgz)1+*yK~2AfyV*GO&i~>FCn!`?#M%A*~ID!Wv8rVZhe9p zOT1t@r_!<3LLEQbsJSu~Zp!(aCgpgA*I)XR!%!|%x89eJWDKAa1ec0RN}>R; zbAXE#x@T)+2!$GR6ZdYE%a=@ga^Cko^*^cfyYF^R(w4ZT(2oK}og z>+yyYy;JnIAQ+H=y_;UF*)pt&Jtrq8NAoQ-1pA=i*z~^l!n1qFz-J&iFm#8A(@n)6 z`yl0IhKZ@Uh`oK1w*OM>(5;Q)jlo+r+OE=PAY@0nAF?or5K0-mC+ZJ<ivm@EG9Bo1w&aP%K=-p5#bGO z+CFd9hV!Twpv#TP=Gl+{m@>Ho0{c#!DC_X*DDfVC3Fjn1F$mD6Wd7SDSFURZ)P7V% z#7l4utt@sL7-mY?Vap&s7g69)5!=!OXvo6M>PW{V2N{3m2ec}GISGi;69y)8dFO8qs?4+p2#p5 zJTXmHy3htzUo~*K7|$Cg?bC^NfU<=^K4$0PE6K1!?>Ouref=+v5*Q?1xH9wYk!(%B z=OLI@<1i_hz`zPHDe~@Lf1|pxjP*`TogwvZSijy8_7ILiKYxQT`F3MR z1);R+X#^0xV|}~|GJNtB0gnfMfNFwbs%aoEA-WXVjfs#c9X%E*uHHcmA1d=ZojuIc z1c*WmQwePQZ1sU8q;~P3w7I}Y{scb{N5||X?moU}_9z17L92n35ze=z2|5!RJcw@$ z-F(!!#8U6%FX{KM74yWZKWItHh5hifnOi z?%^?T1>o1o;6j8%M9etV%N3)k72|Bg*Ih~=KUG-=4I~nMg-byghyL7^2nsQnWYSXeQ};utoF&5`ytRWV*QiCyfGx-YwfpCJW(Y^tOQXroMS z?-<=L9h6Nw^scAzgxZ`%Hiw0!Q&oM(UBH_#0qJvQd`8K1h|p`kuI3;b(_>T1$Ya(P1Vkpr9%ku8)Bo_!>Woi@RAsK{G&Q+7JgL+h4aZ@(&{d z*BH?12;>mb$Bs2!xO9n%%tE0_vS8SkiYSyALl1u(YVa{woNU8PT|{{{cuSufWfkd# zpP0T62j6?BaStdikf9?~re(7q7~c%mx|~)A4WBhPN5IWpfmWFTobEAyS$R8zt&bf) z-tVo747Va#79zw+MZcix<)I(sFzZ&_vjL&~>gsAd$T5-SQvG^6;2oq}2wlV0ue`Nu nNB*1v+zA2N|K(`lip1tUia{nt_hn(M5T$)q_YC>e)!Y981>C;r literal 11409 zcmdsdcU+U{wr=brZe`m>1%a_5(nbL(La-wuAiWu|p+F#!k|3eP(NV^ND2OOk=`BG@ z5;_hjC<~xv(|$P zCI;&zq$E%%)Oy3Sr_52P<#H(0ve+M1!#lZk8{^@Jw$Eu>9}E0-AK%Mf&M4!{J~!R* zKJKnpej+-1dAs6qYATv4hm?MD@$tFot)r^y@sAIv;Jt3BvL${9hKsDddDhMwg_69C z{9Tr&pX!Q2DJ~kGI&OI@hR+GKwInPqO|T9u->;dn>$f|uFKwwW?9b5^9zLQLMY;24 zS`)4@>h?8f`M4^waqoxOb@mUfC0;~PBVGjAWSwu=gm3D~`kb$BxU%>e`%1~zg~h?@ zti-O*m%k*oPkCavMfcU>g>xlqxIe2hW7K-zD%Ea6p>FRot|zWQp}s`k8()S(J>DGv z&zblGtpDACiZv+I&kz5%x8w6T?}iQ@Jor2^GWFfNW7<2PV(m*jzs>N)vJr5Bqbzr*|I2<*1Cs} z9&O#Y@heFt`vGO#b9&HBz+;)_(%q!QL!@@?(=5ZWvre0W5Lc;EQ_wOIvv*#pvp;rzYn^;g_`}^;|!?qwh*l@Pp zPfRD!Y8~*U$=#*?y!+C)3(-eBeEK77hGAtsoO1F~P(PQesG?F&Q_<404HQkAnV6VF zuzhr552~mT9pC`wYOQByhcmM;a`9Q1V(ZQO&o{*ScBjKC&V@}*P3<#$^X3hX0RK?u zO(LVBGQNDd#H#p|fR&( z083znMMpbuJ(i(vd&g788|fYn7-EMrj#otFXWU&Qc`mG?qGGS%s#U9SS0yAQE(&Ao znM@|ZOF{nCa@5Vmysc>Dc=Y^d3Mlj69;vpxIl0Ery!wgE)*pXNA@JG?M^#l++FmF- zY}vfoLXy86b-Sv*Et&4iAw*IO2c+s=9y&>$t(40r@T^P6E7p;|-rKfU9N<^i_bFU3 zm>8Pj&8?>zc~n+bYPhwe-5-RQR6k6wsJ61fByUx;KCo}!X-WNsw>rd;v>Wk()^MSxrB6z zYfp-Dt_J#AMZxOfl_*rpwkQ8_a{QB=`ET%c?pCxcX>gbJ&JB!xIy#*MvY%gJSa^7A z5dphu<;nxQb{&T}5p=7gP%b6za&rX>leL7|@yo2q#rd(~(PAF8INz=Hpt4ih#g2}S zn%dgt!Nx=$4WO{0V6I(de8SAuwtWZh(Zh%8R5NFgruZRs!6Omal}?e_tu55{J?pljDFBXPft&3PGe)^!^e*; zA*X0;@BcNY2Afku49tQ@J`<2r;)fqDoH%g@Ft>!i8Sq?w zcqf|f!A|j;8c6pSj^cP@MLZRXJ?&g=q^b>(NC%!(Cr!I#OT)f%gLUqOHZ_@t$Q-p+ zEt^eHDH%V(5&_uP#p^qn>WlMNZ`hgUSV~gR)58EIH9^esC?G@{ZnY`|?3I_tw!gg$ z%{zp1>c?A0SIXR%+;r5)X2bGk3G8GRTxL|8* z8^JzrXlMozi2YPoN13_{LWYZWz!(2TO8smxk?-Z;%cC$3>gd=vrx;tDI`wOm1{UEb z1qkb~{QsFyR=8#+(=;e3h~SP;#1VRh!KF*DiwL{{I`#CUAKf@bG;E-`d05K%R|(b> zdxZlB&Tf`Bu{?kNF+h_88H31&+L^VfG{1pYH(HVmH}BiK_v4VyK{VRYd*E~W7;N&f zJ^i4&blAo*8UGLrVcruCbhnfHA7fur;ST7@1bF@W^-lnU3j6n;!M0_2a-19;seOIdXgH4j zvSrK8ojrTu`0?YVns9$9Rfn&Mf%7v_+TJO2d=C}G#s%P{mXFW&2!>MQ&xMWtdr3IB z+I1%cj|rN%I&}M?3O=`5*8jY#t1H4_oeX^T+!Po4DQusV*3H*@krc!f6I&q#TN(Hs z5l;%fX-`0NdqD!(7x|=vlmYFO$Y(QnvlG2YR)#!y^2GYuwInYuuMEzU<{?W@&m1;{ zNxc*ONx<1ADyA6u0w4)+vdf2uTZ=|=YxBLiCV!{3-jgR!M#RTE@n_5}ECiwCg-T*C zH_v10ObdE&i;dXXY6W3A>X;Z9Hqj_jrL)jG6^JWg?dJUl4jnR!51g@!l|K7#bBzwz zUdWtzCh6qlbo%sZ!!VLyIN5_uABtaENUeIjBN1d7D6t0qpuzFuzkr;~;KTvdEi5dI z_#!m2FI%6Rn2>M+=%th-FweVQmyhGa92NyBd4xic#%X)loOX#hp@3m2a5H;GAm`Eone2cSR&0Oi>p z10Ntd-uTx_gsg<492${tzg||?Hf;K{8Z*r>d_NrhQ`padfRcgFubO`ffo!h&WIg** zpBxk-oS&b^&WvG{)bjNgoQ`@6p6NBu$;m9HKIg3p-vufuUjQfVzGWhnk<|w-ZR)t-GWUo*i;ANx>o|4YnQxOVj%Yn;~l}BS7^X3#%J{_Tt5U zL#dxH-DZoXr+qkHwaQ^hH{$%x7)Pm_fy9A5`_|j5aiczlCm{(2R{ zOzO~;Un?prL9ga}^`B#aC(?9R5}gJTFav}sgnlz(b!0k$mi*YULC)FPdAKn#_&PHV z(=YzJ1yktFbpx5`)|hY)&fUtk;F*cDWUYiP4R4bHKnI+6zCB6BPyrQMWc@3|= zvxZGj31u}jT%cSmG)L@~QXUd2Bmt?udQm(Nbe3IEpv5Wz|3fg;Y@n^JEzsTyWoXi{ zpcwNHql5>{hXDs;$fst=rzl88MTN?I0qmtckVVe92x+)D5lW8XAGz(6bQ!OE1G}&k z5;xn^$>Or(#+EjPxwBAOOD#OM%H_+K!;y=zp+x{l@TlDeChpA$V5=6 z-)lAsm^^=XL7YSWZJn1ZrW?7sA|)YLG+Oj!L^2e zStEM^45%|9QdaSS2qx7KXJ^MNCAUgT^F)3%&lSRw-oHQPeC?Xca7+3@Ma5^$2>;3TT|AmtKGdcL2*?~i$f((O}L>nA>os0&DiUND3*SIr!uct7LKq}-d~ zmhC^3G;>@F`=^=s4bJ49AHTV96}`$S$UluY^G05h9hc21^}sNu;zeE79_^e)Dti?Z zm#61D*q3>c5vt4Rw)TjAkh4UIEv=d9TGSK>Zz=t;;`KkGAtx!1RLg9^{Tv1}gpT8M zUa)}BJ(G02qB_^PR^7Q~i*Y;}bCfu8AyifmF-!LtJW+q|gOG^p)A5PvW>X%MyqJe8 z6<8ydVboDys!G9^<;u2iU++o*qzXA(8h?{C(tZeGO9cf5Dggm}piB_1_1njMbozaC zF#6lJZZ!-8;2?~o#=FKS@TC8Jq_R_g3=;X4N>*92pvtzxu z*Hr#-YnDy@g9P2Q+yt0CVd%PJ_LKK@xm^Wa1&llk$#eJNv$Z|(#mUzmw8G&!Dm>Xntt{LVY@#yTMF9Mg+sAZyI zwJOtiG$-smC|&sDC94DlFYWrhyr6UsP_IxqeiIdf+|^$gzYA=u99-#HHT&(`mD8tA z9njRYfzpG{ol1!-d=>q-S0XTh zY2@+5A1v?fz=FfG=dOkFv00Uh9{$H=Ud?|N0X&8d^TfYefCv!`w;CaS5+xHv3RJj= zL)+7gL_o^%ZsM!M&JQePUaZoxu*zKB!u7;SI&RynZuG&w%uI)q`% z)Hw!NB4Dx_0xH9Xk~C_4UD_Q-JDSE@1pPg$5=^l$K`# z+HeVhPZ*`~*&`UsIU@MsT zkgA3~|1BjQId#;^X%_Sc`n<>PbE zd-hZ&O8PxdS}%PB*-eP@$jYw`H4%z>8F@-ZVB|gw4b|^0)Ak-ngM$OiQT4}-UH{MCv}h<*$TMRh$wJak_Nu}BI}}e2#A#d zGY^c=43FjY&UqD`*^1t@Y14G0ft>5tihCmHVobL=;9Y?sX^WE^c51x_X*^Ua>~0P> zMW;i=D5$AfK#S>|iOG!1C{oLVo!a^K@?CJ?+=b|CAO9+Y4zLA_u9f54LkX58oi##$X{I9V@ZuUw4K?Dk2F-DWja?cuyyH_pEb9MgsUuQ5*Eh z%s?A;<~l!eXm=qvVJe7G5I$$9M!vB*O*pfS;aXE|24 z?jZwe`IbZj$+|c_wsmaf*9&kX#CiZ_S=crP9=%1XNh`G8Qb8@**!kCKuwrtYkj;it zFdSmWX-UMg=i;Ffx?UfXjyNWjlKL(0ep!Ji$UxChDqXf34qqMLU2-ssnnrDBd| z=I7_v@Y_<7lHP+;`xd>l;EnzK@=)8=P`&HeMbKf`zK_pvyw#Gj?gDrc6PmOpE`P6` z!IPa6E{jkFDQao8SK^kA-eBN3S>P-dwy8Rnv=4We79$U7Zf&JHFzUmumCk;9MCTcV%6ee@`Xe0coT6uEZ)L)HS)ompYjdIhDCIu7>*Re~ zxGy7UVZwkR2$qziBiziJVdJyuGhifHL-i^6xF@uLlHG-GYHG@$fMY|6h>98(`GI`2 zhVrwOhPA;0Qcwj@C1WT|?b-}>uRd)6&Wy1j7E?64Z&kJ(89wZL+*6rIU9z-LusI2yOTb_uQ&CnA6MiQQ1Dmvs^y-F?5H>3Sb{&ihLRiJbUv2aG7O? z3syt2v2w0fyR#x*ynu@4GA^S1zFBkR z;{y_mqmO)Iu^2PI6Q*Gwczi|=b;j>t`tKV)EP<}KFD6nJp{ImYRyZMmKaxK7bay)% z(+^B=4zz7*K7PC@ofk0Y6|3uK4%fX(^RBL{azhR+o|WyCy==wmH1g6SRiH1P4u@3w z*0_s+KOcR>I8=A?H|uOi3NO37>^L{0CEwKo>BS-(Ov7tf%0sPRR#rxu=QCR2Y)+p! z<2Kmvh9u(>f<5{qzZ^XUtH^ZY!X?rCh5N{ys z_ns&zZyMLqlxze7;yRC~4;@1d_x7KmC(sc!23CQN-((WR6Q@lR0D7!^DTqes9!cyT z?OC7P_^TwW6e(!{ncX^alaXfg{Ah7@o3|W*fP8K478w}~w~)(>AJb90_3`O02o!T7 zkr+#NwtLYXD8x{pYYvX>blP>$JJj*5+qb7Nx=BV*e_Dj^Uq8>(#C2(vLXjzg$U?%C z2U_MW;r?`bpp8mIyP|Fs-_KAf;sVNS46!9yIoL{h$&c zO(TYQH@LuS*RIuwdmtw*ohgZ)Jtl7wbHUK?0U}ofV?9oYPnDaS3%&8Oh~^>phVh*1 zby9j0?>Cdc($sKic)dD0^&rcMTuLqYCgFhR#b&A=AR--gQD3+z(pp0PFR^y*L;)S7 z=hBq^(jM4YWq=%OEqJKN<;$1%ak;5L5g0}5tOn;u%zzmmj*ND-dP8zb3Q5-~88{#O zpuuMbvSwhbnZ)U)18gbC%Nqc=Q0ev2f%)i}vHJ}!6~WU}+H%l?BtgeT9q15nGyMiL z4q`QpUd4{ZGvo9+iwK!KG9DT`Qfk*94>05L*rTasFW1ZHSYEAqoIa7nwDsBa$Ojqk`k{ouiaB0-x&#M7r=CUjGUXmI{@1jR6S!0#%wh;#}nr0fYIe61_n zBqKw?QVY+l`%&rXwD-%-0?)*-urRkQY4ERrpYlD}M-ZAr`nWJ)(gNAR@{_Z(vjfny zxEqIUDfRco1WbHD8n8fh((ZA?x{I^D_60ZJ5XZXtjkDf@RUfEOFbt}a=N`e3h1>k8 zuMp9uU|Aq%2?6SoNrxz+iv25oU3>2Q`4(id0gJ)msECI9@Mv4S=X8Yy!dXhS<{)vA za|0zfR3(j{9@Gzq)ZyCy)x+}ZNzvR&3i#(d@C_Ou7JX`!87;H=_v>SiBJy&Ish`~( zFvVrE9&DE1A}gx`@h~?#dq7#)IJbAc8nwzg>SG@LsJvzC z)@0CUEN{+OIx?r1AK#oc1rzZdf#ZRuI$A9O zZMle{U4>q!sAoy+1b(b#>``C3-i>~%V5D6Et`P$2$XpGr4XJd2;>{q$F@ZO3+<+jn zLj)fvT`Z?+U*yFEFt33r4ualxVBlI|yRZuls`!~kQG2=cx4EXlis~Vi;*rA<5fN7Y z#X))@K+B?(L zencE;_pB1ZM8qJ-L|QAu^{DTtCG=TA$l2k^;ehJ8I=Nad4L?CZ)$#?eeaE_`juNwo zqh09`+9cf@5SA@4yM%x%AZ;r&=rUz^b!dCJdEb+|PEy9RvoM3Aar4VDW&8ZIa^!`a znX#Vi{@O_11NpeL2|431#19FVHywsyt2SUoYN@}_4SGb-C$26qv$A0fDrLg1jXa_es!_eced!gC=P5RK$9-TAhHuZVsR00ss9 zE~AqKOLYNeL3r{$;3t^s9Yj^luA6sZYQt?l_ry`?KqW$JISp0{oc{{Ig91}lE+8>P z3sX$JMKKsBu@giq91a(v!PH+W`NKx1U9Mc+KQM3*Y805>vPMea_N$?-I{0J9ZX>-o zsFgu67ql_&q;CPLfx~x#t@b%;-ULX7R1Pq^rM3y36t8-S37s`)njsMg_Qam4b4}Sn z0!5f9XiH=a>iQi|9}?m3@nKuhRQ*u_=t3+6J_&@j0CtfS;O7a>CU0(^I3Rrl zP=^2=1#lmb>byD4EK&W^I}}vnqmRoa<4WqDgM|te;2@}V=;lR2!{d2GL^3F=Hhbyq z+iz82k0U1xgGSItsY|SW3#~in>(|}DF-4j{$WjIe2klJ);JCN>Hw6LWS2h z79>2%sGT#>1X;^tl#4wggdQEaAHuGQx%x}#1RP#fI-<{h`HB^kOlnaLiBDtccAvqh z(kM^TjXX>PyCML8gc(72LqkJao2=H&cR&jHCr+NE zz%+y%OeD2|hN6s>&DZxXYI<~DGt3~Cr`Lcfu54)S<1@WOd`pCP97>7C0L%30bsYam4Clk^}Hlz;7 z->beR8T@@3?&`wq1eNs*j2B@WULS7*(czKFwdg2pY0Fi@cH}x+!$cQy6pBhppP|a8 zLl;XgL-74zXJ+QSbkL46@BFTU*aMPk0v;pN9S(hiz#$F32}UNmz^D9}s}v%uXOFNX z)IE3dII__R X?HG>IF^tFF^I@9}y)pO5u?k^C3@BLgVzyh23q1Oid>ep$ue zANoJ^>AtenRZ~9Bqx^(Gk#?d4k$P8q{Cn=ng6W?wY_vnZ>|42sZtDRlWdp+_ z8H5Ws9PW^dn&a$CZ_m{H7mPQyhOrQKa8`#mVVf^4QGGOg;Y) z4!6UgqM|~7;>2Cnru}gIp;Oy7tir;=2ae!yLca=*b>5A8;jQsYersQF#>PWdmy5`&KKS(5j_cvZdt*)+C^B=_FCON!V zG}jl#1QzSI^ZW8mM=ZQ8Ez|4=3$GD#jkrcCoZ?odJMo$7Nx5rGOiVrH4tG@4)MCb} zy;`Gq5WMBmk46!Tf1b)X!KJ?HEbyh8)CZXQtk3Z;)@~%95;X2JPJaEGZ?S&Au4avR zr{|sWQJb#R#}|!DZ+R|`3;M3l(b2sUuHVsq$s)zs8Y_r?@F1xsh&xR78<@vbOa$D~ z*3ogx)WhLErjKb|4Gjs2EO!`DwYJV`SRNcSL{#v2H$$^BTRncAjBur!H^V}1xx1J4 z5%lmoJ3F}!|1>o4@bjzCu*>_6OvFV+al-o3(Bg2BURBephjaAvqWrhlo5yQ?OY*`Z zA{c3DX_uCkTnrbcr+MKYL~)~rQ2$#0vH9EaBFbjoQ!$CLuvaF!FMTwB{P;21$cUIn zPqoJ3A0Iflprq9~|x3?cA^xxkfs%y`am6L01ZEgJy z#kZW#axgkp@J`F8AZn}qyKvo|1k5SmHw0x+>yX29#x60aVzgxButZ2-X^)b~~oXTkr+TYN$9$^%^*cirG z5legK($yO;S@;{DGn|C-WD>W3O?B{~%H6xEAt9x<{i+0m0-;*pjaZxB3`E7xuO|Gg zggPfD=jYyD(YQBI1tvx>shjtNMIW@CkdTm=8LcWwOG~@;=uu@`f<&irimG-(VY@JM1d;46!?fD9Nd87e7pa&cKT{C&LmK|AwM9pYb| zsDPMBd(2wODR6Nq4wpL!z}6P~Za5khTZUdVt1&!(`*mb>9<;Dfdj`QrV*gsvy+%v& z>P$~Mo{?Yc-P2sdqU#^rXJ9dJMzF=$_7hZ~n5hmOYMD+!gyx6KQ0T<4l$4Z^khT;B z^BWOtf^kBo^t7}Q^{XQ92vHts8_Ez zu+l#(;do0^GZMXZTmUhuy;Onz_x_lYOl6UMq{-&+RE@cy zX9+b6+sUQ)_pw*lmcQbo%{~)Ye*k z45ScooxH`bpZglxthvyl0c*bll$6R!X?i*O+O<9&Gh@{iw-dzGV7079D_x)@uhAaH z;R=ySz|ERRT2KpIj6xfOmKqu9PoF-|$@zb8CZB*hzpcrVPI;6=@o#J| zPYIbAlGo=2P+pCWF@0FcIM0EBYc7ZKgAU*VNmarF*Wj~CgTMHo`z5KM+wQVp>~jh2 zq+kQW5&j?kFe1D+DXdze`FpaoxcIfxLN>`{)uxxMQ-ekKX-2qtdGSh0PfrP(nP4S@ zH9a>sx1_z>`kax?NO|6=3%a-b{Qa%^vb3U-lLI#L;5odnL&L7mkMMAEUSFRZ;!2Qk ziY+a@V$)BEfwgHEJ})AoEp9(}&W@P-YJQ{wX$6c+*U3~TlEcG~VHZuy$Y@y@tF~&6 z;wgT#bT9sr#r1_Uc%8~C353}s`7LNGjO;K9i;O%0B^FK3qx$tZgFqTSP6&v3^|w~G ze%>3P4LpFG-`>`APrj)PM){jtTcIIeceYlnR)2T9&h+p=!6RSSeYLfrD3z*=Zm zm!@3;K`%!Y+J#$M+E_{H-TU|H`gz9sl5}*3X=&rq(zvDkHvc#vozeU{fP~114;2;F zsM-+hoik9jh^VO5=McJ{G?kOtMkN^`A)lL?!h(Z?H#avW?MeS9gZ+1I>Mf?g1s-*- z@8!Lrr1bTzVzA{vzG;E)Z%&KCM#zy1Wc>dwfhbWYP=i9b-@pS!JESGDw*q}{Xp$TOM69wdE!^SYV_ z@}c9*xAu0ntbpT*#pp*WW|8&;iLki1INbuXUB_Vn#pMu|q#qc=GYIH^g+@;U^+bG4 z2fe^=SeOc{*@_-Gs9-(rJpzCGROP* z`B?&5xbBkIs%`%Q-6R9oavZJX@R;p;1)^uWoRq1Sa2`ZkEYv*y_U&-2u`w|tB{ejh z@vt-5b@LBmff2gj`q0DT`%N@VlFr|fDqs~S`4^=8uY-b0Q%ex9FwG>0xc$1#B;lCo z{=4g%l2WXY>4kuRfMU;iYYCgw8b{P=P`V}Vn3*FEy1d_M~C zcTCw0mdPwK=f0+Tio77mB6?P{xy{Rm_@zd&)|mJ3Biqs({AIgn&8#6odd z?dMXq)gON|ybH-oSJR~15sg@%T{0+9e6 zcjQP^jzIy&^JVSCygNLiqB_j5Y6(-|3K(O48p#e6n8%&uRX0>fk@q)VUz|XMp`TF^ ztCp`JbX=2V17;}P62G-PWwo=pq)pJ}pBXHA9}=RQqpxOM;V9UtuwR3*c27@_8gSPm**=cR9Akr=cU{P-Nng?RVYZ6)>h&AixQ5bk&h{<%+dgsr``l=;$b>^+iBVn^@DpyB_`j7g1C6C68c5gPx(653QrG zPd%j@QG6p^{nVt}y~*=o9PXp$DtIC;RFmN^3Q5$6L6oxArwol?5a#{WnIa4#BAQly z^Xivyrk}aRz$yhBvp?qOT^ki*{S)8MBai$^B~uJ$6vr@e+KOQoCh|2H6)E9G&=^K@ zsxaZYNOY5tgRUichWx0bJT6^XU6|6!HI&_AW5&X&AM7=q1(9hx& z|LTo#U+BHbljw1#b5yhaIqB$Srb|*K4_-ix8w==Wr7Ax^)eX{irXxv4OipgBnPHqA zHc(eVL1C=Y<^3KAL-Hi5VG9b_9V8g~hUq$`MZ+OUb@TW)t!^ zI9|SdsSovMT5A0YHDW%CFq-?lB@jr&yxw=pVYXmnK2%qeg4qLp7gML~Lw6fZAp8Cf zL&fQPKiT&+_4+~K2!fsfbJWw^AOC63yW{KEF7Tyt0XvleYyAe&ew)r~%ga4$q=6j5 z2lv+zp`qO%t!!T~i{-9Qu0<}-WTx1DdUCK#JxSWQ(pko0zBe0HPS6$MorFWo3?y}c{iT}?R67I8o*~DV7ve?&s9zFVVgXN-x%{s(wg;u6&;-ho7;;%J}X4|^UDjg_$)s|;oZjsLcnq}?{Kb>=sYOr zg~6f*^v_v&diZL`#TAXl#>N?tWA5;f=v5YbDi0FT1}$WfWCoWs_I>*G>ofifRnw*L zF*76ML%|8yIrIQ)JuQ6S7;LU-rSn^OIDNE>RYkf5O?lywPrPk#- zgHWV>g@urBVXO+2u|X<8Qqh`|ZbTjE*u~NIQD^VkMf$ zochPA5d^RkO_a;5-|1@L_RyvdLLu@H|S%mz|WmI6Vh7 zXq6j*;Pd12;rafYxI@&`qy(or8;5G=@7H0Y>S$ObHDL!9bEDkGQm+M-dd?4%$Gj$N z3e0M+T)Cnf6cki;{n-&_goR~pZdo@b(A7XaSvDJVcv;6M!g!6@Rp?kTZtl;sdtvYh z;QN?%k8d~7D)jknElaT!g1^uGq(e=^(glXw7HmT}jj`8HP(aM|^zUK>42Vr^zPBap z2U8XHcS;^ScwlR2__}U=*pBcT?N`p9zj2bDz7!OMzEk9EdoRm+ z(Zh_}`1VjSJEAqTO&Q1@B7ZW7{MnC>Da9^b>f%WA16VSy^Ydnv_p4OA>LCWH1JS;C ze-GKHAFlCsYfn+A_aqV32J-G?5+pQc#H_nMTC}|?Iib1mPrT^EQV2No2QvJdk|QHi z;p+Vr<30i-Znux~%Xls5YG`Qe0#NF%t&ep>v3A{f!Ccjct5k5Sc3f|b6DEN_F1_FM za=6mvejd0M$FUE3TwGjb0IJ>@$b1Ds>;2zE$dzm-W_mLLJyJ-CJ1My-BS60xAoze) z4B{3Q74;bV;4wQtpI2tv-$TPHZ4KVG)VR!6=rV&0>7m8;`aH35>W#PqLC$Bj3q<_v zw@*QN5b}^qgks3rz>lt4}ztLLh^3xq; z#2bKA(+}?5;9Cqicpy~3`V11M0qp%jxaUsC`y6ow&LP(8=;(-nE5XNHu<}pX>qPeM zzmRC1Wk>cmgZ1-GhOB4?*Eg0RhI2f4YJ27l@P!?eTB-NSFQOI0oE-nBPoK!MIR(<0 zzkR>K!ZNe4jjN;JwrJ}R<_h@ah%x3)t?|r3u~Va<>fIr^MQ~{J+}0- z$?n+^hEix$a+f0Q3~*wx=?DLfg)#D%vrg929Z4_bx<*4s+RxjJRu*AA1Y)0*TO1y> zR*NZEL2woUEA0{lpOwJ9J{=9Ir_o>_#|kZiPD5t9y+(Q{hYWn~4cy=AL`ornpn1Cu zlGXU_^@9SHCUt&BPy%{uD=WPq5J;dha%+9ow4Iz5?I&u~yk`6OF~0Z$^aL)g??H)C zLHaJIeZ}9=Y;r!<(Cu`YGOia$rm%Y3r_Y4g>i~a7|&_)D&I%=2MTcp1IEqk3U>c zcWu9(8cgnLc4o4+xw(08ax})rAk9m`GOOooAyVGUX*3WJCS0+32kcQAYfxZjitH@i zBuzsuge|?e)3^y%3swFylT*U z^N<&K6sc4z2GiJpbSYIq&l3#^4Z*ZBCI^S8sG=1L19pA#Osb0I_jgvXroea<7;1KT zs?`I6L=2Q6BB&Vuib*Tb$kvcoyZ`z2iHOj&^G0} zEtDEDwGP@2(_$V!OCUS6?S7|R1`lFeGUN_+@y4aDj1q0_)NOld5+Rm1rfjXCP2h#pOjC`H((g1>FyYq@yJ& zBI4fuMhsg1?&R@b#dQmm)HHoinxtH#l2xz~#@X6D0CT_D}}pJ*Lj`dw;cNSvu8GNd6Q*kUZC23NK$8?96ag{Z~#Bm5`;ieeg$b09m-#?b(>Zf zG^s4aULEK)Np~rQD|IInP#%xH7SLPI<@;YGN6S2iimfoEhEL?bOw`pT%X(|0DC+V3pJ#8PqTb1P&UJxTG}<7}4437QH#dKO4n4UxTxO?^ zB$J5CqKt#Fjy+kO6vau3imsbl$% zjS1vm5ra{C7^84Lc*x%0zpdq*zXj@NXF z%s`B62hZO(FkoPiZ!%Lj28D^yG#LTnd{Et2o#PcIvvNplqXl-T6#fI&#vs_~Cguv) zNduj4-d=*JCC{KB8R&~!qjVRYgWk#_%)$%?18wXj#!79_jP&#w$UNL3w!2~O{4&rrESGVjc=744jwB=pqpQNg zLi;#(^D5VL5CV7h_crP$2Ben;tmIAzgXo2P#0Apr9EJ-Z`>t?u{xkdw@W*w~rpo6Q zL|}ywv}#p2O(f6XeG?xaFBlGT>sJ+9X(F?nPbt75$#=0f6QHyrHbvS)74|YG&$z5O z!}bIHw%snWi0t3NRP_6s5#>IibD6%^L0WP{>m-7IkdK!vt;IyDIEE@y`SI(Wg3Rq1b5Zr#Xb$|SL6>~Smro+Cl zDYQE@W9~pO8EOf(kjSk;4Z)zo#KX<4_hGX44cMdUOCN_AyxJ;2=~V$Y$b{!q_P;nQ z!IF_E{}pyN9VB?Wr`h;kvLw_1vA}%d4Q`hP<8)O9FrzJ=L0K5G?5|hUkBO&c{i=02>)oEmfyEcqU^^k; z?(&-OH^96nAWw_i25}2iT-nvf2Z-~Gj!j5_45dMx>aVfl`f<#OUC<*)hO-ydd(ADr zfL*kmsPi{(d3$wMNQYk5)#3fVYEM!qgpk)UDGd zl%5BJYz)A5S9>))mM5Ey-zgo=gNbT+@@bS#vv29F70?L)yp6MSVOdFs&)tN}_y3mP z+x$6Pu!WE1e1x>zsZ@`=^C#SEF7si6UQk z>iDNKU@A2Oc8z6t7xVA{Zw+OEA|fJJfL|B|jicwkq~xE{jzUo}h&8E?ok<0`+yi3( zYmAOes$6GDq#O|Cdi@D<{P~i#p1^A4iuzqOJty^SVbGN2y?WHNY<&=nC&5#myinuy zl2s-H@Wj|4^(sY@yuVNRTAZ*s5j=-vV)2!vgsY>Yj(bc2K=s}*mau{;qAPjT#s*mtWsjsiNI9*qqmcWiS!$@HYBzkPXE;+RQftzdDMkjdg$*SpO)U?{OdB7ZT z5EKUO2gdR%STY`L0_C{C1*-#sh^N?fN|la|-OQ$|7~BI2f# zebuonlk(89NLCroTVP@#V!r{oV3MihOGp&1!O$5C0H2@Y=fome(EndSG3Pnh5_2*C zR_rh$KF#1mD@*?Uez`+t@fH-6J-8ldL90Bl#wetapqEV3T&G&pb47v^St7%WU=CO| zWNT0K-UPD8G}skc+0nNNz2jgwu*ycc#IFPeVPWrsn_E>yOYFZ2EJ8t;G6`iga=(4F$z5|Ce^7MIUa7F&g( zPcL&(0`j7S%VLznAgz8}mZ3VzDCCZEh;&f`A)>1y=P9v_fmJk*3X3Sw4$(_T!Dkj* zcXMJHGkW++95Pg97x($|=a7)EP|TJ9*VtGNcrR0SYZ8rup)Qu(gC%VN^ionPeny9S zX;!)c%WFe9J&b$2{S8zwYGCfK2hx)V=J49kJ@MiWZ(zRpyr7^UBqW+o>-u^1L_TOr z57#n84V>}Q;NaHo_cx(95H84$xqvB(bn}e$V5?wQuEYk!;SK2%4@`bo zsvu&LO!rJdmAqEEaiay~eIsOY$pK^=DUaFcL3?q2-K@wg0!Xs2plQ;qI^#a7gCBzg-m+LLDf&wt#aKBOIg$*Jhv9+I> zsIR{QrWLA(2O1O3LrA&(x&;ki0~p2W>UJ7m)zhdFPy4ys69gGH=!P&jCP~Jt1u`yds2_*Tdf`+DC@@7f|5Yt)MC(33tOth+ ztRSg_k(>}PYljf~N7fc*bpV3%yy}UOa1j-NjdZBu9s~y8!OpJp!(vQQu4yog!NUkS zQP1<`pv))mEJ9H33^1uVeDo-4j_m3wDM4Ds2S{JIZUsX^6yq-}F2>rvcecX;romAd zM?i3G2{XZB(5Jy`v|Y_lY8s4!%opMc>d2}N;t6%jEdm7cKDDws0;gPH*qj?iH?%k_ z?Y(U2|09&Q6exqdyD=e?=ZN#-C0$(y27vLQUKwc7*~P^IbHAl$4dwNFoq2Hwau+0C zL`mx>)2}OXeAsJHQB$`<)M^Q@M-050(0(51wOqT5028##aCQZ=SYdM^tW@B4cw=Mc z=CjV%);q~*D(EDrk5>{CembC{&V$>Df`|JG(EuN(gu=Ffer_Z%x+(&et$-vY0$H2I64jqVj3!)OM)nF9ZfV&4WMgQW_GXxaYVd2o{0 zkOL#plEWLifP+@xYP2C7PoD3)~X&<+C zb|8;&hl2f^&%OKi%iw1E5zU|8OY`sU_j!+N*C~o1qKm-} z1VL)S@95|#)GK~b(~}?91{LbDa2wLAp<3UHkkK7kSTOB9 zh!|R6l);A`BY^C{2J%?|n&!4P_hx5=lM^GKcp0z!EJ6*Wgv6xy!@SNOw39M}@+~qj zDIZC1H}&8>C>!E9k1Iz4f}T8?1UC`~`o)-pVItR!@JIkZEsTJ`&&NPWsdD4S->vLz zP`MYeK_P5?>%{(^*S}?oKd>-N>Ggct^Y@X1CL?bUF}q3f8mXtiT)}P#{xJojHxAQs z08O@np!6rw?|yp18MUi_I)4E+LL^}4kvHTj=@1Kc2vJuGz)=CAd61($Rc;TfoWDPT zb6vV$BG`pN1fbAsDsZ^xio>w(-ckf&d6X+(`qw1lvUc_}g(vpIDNjT$8Ot7Eblwa! zKlRVEqs!Zi^{rr`|8sl>=8rH*mdU<{^Li3^;G>o0abA!oSe%0$i~%?{9GM%f(!tIH zgq;?Q`uq6V7MP`QIMr=s0K`k@*yFqc;deanyOZZ{M?!&xeQi(p-X1S{bGQt#Kj=zIn41zM-r%3F;q%Fe8|DJbm^I>kmt)ksb(My|<>~ ztPntD08s`~m66l>O-TxqqZ9`Nivq|qyrJRY(U3hiV_bv5EKCKlHpE`l?9umw@v`2< zFjUsZsLOkIZNLi7Nx;BDZB=rgSb+f$e0#*ue0In6#Ycf5~tXO@6MaJ{? z5rzxgupW$buYd%aLCaZ!b|%((;3|a;ejmdQ)W>1elip1_XPmElKPg@~X<%IYs8dMbsjXP<8CL#|z zSehZGZfIl0<%hvuJ~C2lfjdtI(aJ~OWb;;nQ63N6j3}o4TJ_i@Yxp&ayEVD@RiU1F zcegjNQ;MxwTJI;}tkh{pnY8r&IUE@b_pE$+2T^RnP6>cVhy!HlX^x?&WRz^A{FrVj zH`WVBK3u%K;(!IDEBJ6#FWI1EdF(VW5rK6@)SEZ6lLXwPxccA$XDJ9_V9;|Bgjy}8 zl;Dg~qA7i#$rpY$oR9#_gpQoz`!*+n8>RfO!!=)0VZ!_K1Zr@AlW}DqH*2JQDAy=q R3_irED61>wU%&h0e*p|OHNyY^ delta 10927 zcmZvCbzD{3x9?VrW5EGMq+38rKtNgr1CS8dbQtueyBCTI7$9sy8U#c(rF4UVlr(G_ zq(oX`)A7bSzxVF_{qDPe9X|(HYpyxR_|}+nZqTy1gSq~J~eMUTt4t$sq9DStzDMNeXSeoq#cS5%^c#bPj+ z)8oJ955s@$ZsHFeV?#nJ3Qm=tjfshI+TZo$(MSvGvk|k1Cc|L%4`U;7y}62+8tLC! z7TR|17z!uH%OS>x44qK6-ayjOIhN}XL@OYh;;ZvuxLuk}~B z=T)w@N@-NM*#=I9g@xriPTbO~aLbwR`y}6*Bqx|4>6%ZpFg3k1SZvEFDvEVm8sS%t zMg$@`m7^M-o;bT$NsYm5y25i!Cbwt6en!?oQ+G?%x0DQQ(h68H1tW;kvdqH4RP8so9<^@;2o=cm75YgpzW3W1~$htA4-0 z7gqY`e)GL+R{ir3ZH?Pci1Y`A5-*9-R(d`j+@`0I4C+g zS}V_3COY;gl$c(K>hd`r4Fzjr_RPm@hp{gjl^%|`Ej)o-&U*g^t%!M0TwI*X;*g$( zh6abUwBfIoIE$RNXu%|(?U@W=(}urKoIDx+<=H9a(Q03_mC433qmvkn!#y!9)`BKX zQ&CZId|`nEGYHI3Z?&l9?s)S4Kb*f7f^HgwZSj26&ntEfr;4y{XA-uyeQAFY- z_v&<8^gt2rC9KoK(^FAh{f*ChzXfr7a?&(7DCiCBRI@yV3`c^Ld(_jXM*1m}qlNY*pMrvhJsc z!oJ%sGo9%#Be?I~(9SjFF)DYVqzp^F9ja7h-Gi3gVKTC*f;L&a+rmKO*6K8RrV0w@ z`E*&}ccPS|1%d+u>rJ*36cv&GZ@=8T7#@B5kNxUl487ji(C`MW&DZqe9NgS@pn^F0 z`BiSn%jehRL~o*p1gw(;9RIF|oz947{KawchR z3YoPx9$tu7)6dTVQ+PGmFeo@>AD>DO509YG(9o~z&@xoa%z|ue%gf8;|0?>>yD`Ey zE32wW7w= zmU?gRU@-p9Wz%aXn3$L}GBr3UDXrR(F6*}fEv7E!@u6Wq{GA|NAUQh`DYjbDk zWl&H}O^wfLi#Yi~l5bR~Z`>fX(m6G?w)iNhJHu`xljEEsBAQUFD4>M@-{LP??ECb{ zX?+p6pRYZNzf zjVdnk>f}Z&43;!cCm{kOBO}81YcaGEPHE?OweMC|R+{#Gd_Z;X9LM9wkJ;Ed30U4t zC%Y>i!Uh_Pmd;Z~CM95U2S*p+MVkJf4${ z?ZyilK>@TB(3Yp7qGBkP@Lta@v>ntwNqvc^3O|52!2(Of8y?w~6K7^5q zl9JVXeLf7(<&M67Y@v0JlHE}01KYE-v^@0Ub`eFm-lh;nDP(eYYqc{|lMCm2>(+Dh zp#W@V8;isFE;AZ>`KG~l-(F_j&_`h@Rs~B^P4b!PIa4geocF#PRXZeUsRIl5Q+ZW%2?O7m;7tpbNI{)Qxr`Xz(mo(mD*z9~>r@@Qwj z4GO|L{l$wkj(rWZ-|#C$h7!{QOtL{0t#eQc!rxAn9^PJI^>Fjx?nG?_IJl1&dlO9c@JL z&&e4tCHZY<&JUGoDn$#}@^5TxME}nYF&O;!?lAE5@_LbxF`W>Bc85A}jTZKw$M~!S z+YA<~G(`(8eXRcXP62BF-#Z2Qk5-8*MvtHEwhT8VC1t+Tl#*VJUlr8UH#!j%@Q7usw8uWS(ArffF$ZKPfzw5mUN~W~pcJaXB z?aCm!6gUD8neFdxK|^Khi3Co))S(fKvPkmPR!}hi@s`!j&aSh}*#ZT!KYtuz#O)J{ zY^!~?CcD(+B2ml%(l{qzsJp$sz>DWntFDMbmphT08!*micpM6>*LgHI0AAxDSn%nj z`62xMbL>bw@I8=96M!ENU>H?g%f&fjjX{LjzF$p| zyqyIWYRfAtfQ!uNw;I;??d8(JV^>1pSy1_RKp{;ol#Es{Yy+G$0#TVkNm89X%l_;X zO%$wLQB}3L7!^hgvWSmvu}weQ|2yGhfXzsy-umJ&?-_crbCh8c&c7PYs!6jR zZ1>irX=Q4-cQAmyqnVt&5Yd&PhC=+)=g;+3PET9pybKMcF)=X-BrPs3 zYGmsQ;o=Nb{*5B+qCoGSo}eo5_;0mTCsDxx=Rh%qSYHEGLqi#clKRw%6DNq0Aa%+- zmfwBdUR!f1bDDZl)RH4DBU9Jh-2AWhGd#mR)f`O&zlKVjB0e4-#fJ|cqUflg@Z`yp zNuV$)dU~8~f$gAJq&`P>| za9J8jpq0j8t|=_CB>U_vlyp{lI?qjqvEP0Xgi@ecV>su^O0ytJ*`_~hA3Kp|u_wsM zqgvv`l^-8Inmv8b=g;Tk!Y;qnQ6*PeR;D=Jnqam*-(S}L&w2G}VH1oLR5>|0gMl*u z3eD+5JMVW3b73PZ9%gJfx}CsaCJAyyBbOs)DF-tlkt6IS0bhTn&x#U$~D)FNaB=CASL)Ph{7GKmwj4c{0=OuoOO zoyg9|)LzZom>r*|a;lTl_K8ScKs-~EFxkC&4SmUktees;lsbB zF*yPo6pi1ZVI?bbO2;!_P$P4mR>eDBxJy=I?~bp%aN)>H!Rk`{&;>@C%GHqh(HavF z*%SFmz7_7HzB;n|n~(5+)3O|i6~(3Duh3qW0N)WMV5HBh^&$D@i*p?y5oUmzugJ&@ zH&Tx%?Lppi{ltC_mFxQ*c`|jpTYfH-ypxd( zIJmgxyqBsnfFHY&-3ev_A@1U-x4&F;nw4=m@E75EP%*$2?U^ z?1sC|3xEcVNN{}aZW08gYh_%&S`)JDE0>?ECP?<^pQoY8fM35yK|!%Mo0W$bq8H>S zwjJyq9W|N$5tB+Fz&f=6(tM{A+~e=f`i4bBr15HJx8tAE3y`5$T}01AUFwiRAo%Sr z*ADgr|y_+7@nJj2T~*c^d&!{G}UuF?U;d>xy9 z`}TtGV%c<|>l~4ehQ@+_6iyC*l(B{aeqSFvh*6-DG+h0vO=)Qy{ z=w{>s?7Dt=dO|;4i8>=~&bx76-?s1Lb$mC|6}l|#oK8UF*RNi=xLK)|c&?foeZ2oz zKrjCro{jku6{rnS2?@Q8rBVBY#jUk2H7wqk`2r7VwnsllUv!}(HIV75L+zME63}X~ z{pd)FdtHxBfBwx=)R)rWa4PXh%vof{mAZHp7G+`k(OiOfecIZ>ppJ4BUuKf;dJI0R zC5D<;`?s3hp6Q;?pP$!lL7}O}2-oSak9aRx;hR{*|DrMRNr9d1!k=JeJ(3zKtAQ6_ zrA5H*5?h^tCu8LhzXTDBkmt{yS!JjuxU|HIdj0xA>kB~S3W%lZJu$+|?6>)#n8yu@ zR0lvBmtkYU9GGgoUos}Qa{Kdq-qRfTiPT!*l&h7Ml_X%GilXADsPv4Cx#wr-3*mdV zznxXP`s3F>G?mA};S}sw_T@{N}i@%yuFJN-gwcML&Q3+}gq6qxJ{&>j6kWK!Q;sfl7U`33M=+Edo(O zwbj7KFkVM1_n-#*?V4SxYRKfg%Y$YA3S)lJ%G#0v|hg)PV+tf6|>xkq>9B7B_avx zxW|>^HZW<);VhXnFsxR2##L+JUt?oq39yj^$=Askg-wI-Syj$(C|ywZDtGR*hjS|H zS6wHFt2y`8C&mc#i*ms?W}yIao?l-#!$UPuI+N@;c{gaKz&9)VJ4?8&l_}TFKV#&F zdV0Qn|E^!qxW6-s99XaZY7s^DcL#C|#En3M5k{obd*PLVLbqFQTq`?e(Hh?YnqSu_ zZk^E^OcXp_Yt(Bl$EHn4G;MyMNEw_mX(CikyJyh-wxD6DI=!g%qz2i~{T~bE{jg)% zP)wbm-K{6Szb*p%S`JhSN8SxBF&$Hkj1q3WrqhRfD9aaER2!H$*LelW_p`%?hocoS zyRcw;Cj7^bAKh@OSwLJw0#;ed<##ezZjf>5mev1V{c5;jtxJI|at)dhm=YKq3~BM~*f-A2RDQcUh1uxuM~3Gz=hgzEpCJDGfnyXj6hxQ0VBHl`gG6y^;i4nfa4WEbc1)yhDseJ z{dPT6l$1IJjLI#+(qz904+~477qe*x%D@3JklIt^iK};Ij+VMF8PAPoW@g3$2!krk zuU0vjmOJ?LJ%1iC={*e@_#?Y&{=JMmh)(0RJ`JCo(&w*_@E09s7sb~|Tag|qQNr`*0{m6SM*Vza$`w_#5@o^V8 zAnStu?A}g4%3=d~rBEiBD|~!Eg1Q(bB3)m2Xaf%up$Bat3~)7@U#i|w4J2nIfU>@F zG5!M;qQ2ifXkW9?o-PL#AxE#^JzC$X@7`tG4^7mE>cq9YZsrj6m-zf(gA5EVkU z(f7cY_$J(S;1h2Wak$Jm!)zq~JPI7L3N5YPf`VH{r%xM{}RCpL!+vGZ(w2NJHobJksUWty;hz#^$jXr8?{-$w@^Z(gNAwf`USrx@^pp8;Hzj0-06t9kIYHBK}_Awa>Q41qg74mn` z++7Suyels+U+}s{xOKYE5l>wnAj_F;sksS2D+)j~Mn9c%+@`DMZJ)_B@JN;|&@2(uk@agj z(L!}3<;FnjZ3^4b>MAe<_<>v_DU=ct=T z8-tf>4vbN8if$-W=5N>-w222GWx!&Gt9>g_bp;0+kxI5Wa|NXplW~qX+vNJNjJv<=Mv}s;8L)aRCMDR&>J*`uLWD zg6^O+saum=ieHC<2Sr!#2(utC@)_@nh=>$C>j1GJ-5U_43DG#JCww=C-ATYD#1+j9 zRg`{;uvywfEft-INX`MWw}jxJQC*>*v<1WVT-4wlFqt|iZgb{b-}nQ8(fc;po$O=B zkI$tk;$0x@C3rdCRe}yIeDL-8_E;eEECgOX<^_5Irbc!B1r{XuUqq!J zNM+NB&2CmppzEanNV#+k(`m$t*%DwodYYpJ=U@kWT3S?+Jb%&V=;S4S#aQSJ360JI z?y18NDA19*q}*}h`PYc9qj8MPLvA}KM&{;TN)J+Ho<-YL`uLJYChHe+w zs}Ir9I>qz~RV1PTvRwkbUCeq@bm{eA1J3RY&*#sdQF&VBF!rPx#)*?P?sP)(2@zSFplMQF|m~Xfy3hjk*WBL3>q?5PJq0FD+Q%oYRC5R!ng5V9a4R}zLFV2*ynD&y71s+=MJN9FP1qbGl_ z&2$yy)c9=WL(3A!BGPAuj*S0uTW$LTUEBnD4L6RM9frn+a2ivfRUa1g!>r9nLE+Y` z3#_o0Ov0|-C z!|a)SIDXx3MNTS-V%2Q#`!4GAfq+R>8za}7iv{u;8X6o*|1yC{8KqG$BHknt$+gjW z$^8+8THEdN6fHWW;Z22D$RHEN2MV#1K{MfVgha_8 z7RFBrNgaW4yAz&6xSg!rB@@3Pe31-|AXr3lj_`ph#dnBYJ_SL;Kg0NZvzPeOSE7+E zh>0L_1oVcA=0bzMV`u2@v?a<+HF70I00$_-2m@7*psM-U!uemltqk~*pscDI1x0nW z;`Gq*n!WY7%I(>#d@qu5pE1;E{rIsq$(Fv|)2b&c!JLX4%lulC=|J?k_ z(f|k&4q;&p@T{DPiHR$a+BCy)elssnOu6w)0SoMS^SxS&!uu3kkXX@l0EJF~Lv$*5npxHm9k7Esj#?b9u$bdvjh|F`im#j_ z3Q_|wgh!kB>1}T;3Bt9H&O$5AMi`eD?L*Y8QEa1^sr%`jNK+L%R8BPTjWRSwx+4DK zN{^0-VzdBsl4)za1l8Yvv!HQZ&`^AxMy??u0kduO#F-Ph8tE_4djV*-fhSz~a!T+{ zj($p<{ zrDbF&gJvseKJE~h{~Qk!!A9`JlkgDqrbeb=Sw2!|+3|%n-mt<=Ao zSCm6EqL<_`egX|`{SNjvRI})7hZ`l|_;#i#!mJycqm>!Hy|Xh1k?i8fg}j=50?>XJ zh<_aThF6I>&J{C7>t0xUW0y7vN*4x-NHEDMw;PtUZBKsuJTPz$hDbSZjGdrBMmEZq zqO%bZU5L9T=A9g9R(vR$;4|2O)AH>{W&6S3h_bXpQ9*2(qm@G#pPAtS=NC;OyLoM( z(2BjlqAdypRJi!hC-X@pIOs+|!KoJUQFNZH3=$&^Kno2qD9g6`O(3we87NeQ=^p>6 z-%ieCTapRf$YDghbncG*`gIYkEMC@ky8-HphfQ2J`ado^l0zieFdJdE=Hv^;HfgGrUWDM#plke9eWRI98>@!*Fa`L zJf}@sTk8&$+wXf&kv&>!SM`&E8Pj`~o<0k_P?6VN5FUBZC_TWduI}!=Fo4OzmtR#S z`}FV`{*(mg5j080Uy-oy zl*#tYd=W(u6f?nRxsE2^y5|y1ot$He53y17xvDGJsj@PN*}yFJ6}>nRzLnG90{GG8 zTEid58*p^uc6?BjD|Iv`K@BZ!t3Xx)FdcgXWvm2O8p>T32C&9{TV_^6rJr2SD(Xo4 zCjnL&dyE}LTk{p8l=hQ=fSXToVxLJe4of2-nbA=lCj=kpC`iKLr~g+kZ)5g&Om6-D z79&h4IXF2Rq4RG}{+ccWlvrs)_BD-tmT#idO{i5xI9C*CpsSRhBQQe)@@ay8x`~}C z>NPG{{Bif{<1BBM(a-DmMgYnB1#A}yQanGeyWoz0+*_rGs{}O%`xV*xMNRtRC?*O$ ze7Xy0rvU`i4|lRAo1@i)g@q0G?}Ml@1NU2u9{v9QMon{~jCZ^dl|wI6sit&^ybkxz z0V0xX#M_%^5{(*>X2=6r+T;!@eL&Hn(1hCpD} z%o=4O|Hux1$WwyME$@PMgrT`23LZ29hHpR%8JV}n|JU7skt*-H(a}*wYO>O^aPdum z9d{MIpaFT4B7|e;-M9gBz_Wj@pTWT8icOz7dSSv7B4bWr;Z8j>vQjei?^tnHW5B7P zgETg$RdWyLUq8a!5V&&#*_@3nGfXyNniCB+O0UYxHIWW?So*KOxG{!JlZ|+EE{k46 zfJ+#7SWYu!Xr{ZH%PT|9ZNYH;rN|a;EV#-gREn{jZqez?{WMx;)=n~rb`!R7ZG zG)X-#V8{(YalYT47YeIaAYej^4$%WtHY{_h^Rgqx?NO>?dT(4ibUz#Byozk>>}K5` z?m5kN^Pn&bBSa$rFitRD;SjJ~zo?eThjK005q)E1&lNps7%>m`r<0W`!}orNevUtV z;qo<*Cj#K0o#46zs%zk?LjyM8WXvePXqsHfS71ZlB)>{iiec`yr3~3tSEmmhpg6B=+1fnPx;1oZ2>;= zO&h6T^o#dg{nZF0UUnE`h~R~;h=A)ATslWtN*uqO z_iu&^l}=kLW?PWPqvbLV8g4!uGbyaPjB(IwY;4p>zIMnW`p{1%7WD4T#N}gf(cnTL g{?{=!n)rj`>~Xpj_hXoy;71t6o2m-AH|{_AKeRtA`~Uy|