diff --git "a/references/solutions.jsonl" "b/references/solutions.jsonl"
--- "a/references/solutions.jsonl"
+++ "b/references/solutions.jsonl"
@@ -1,1000 +1,350 @@
-{"id":"smolscript-python-0003","reference_solution":"def solve(n: int) -> int:\n n = (-5 if n < -5 else (5 if n > 5 else n))\n n = (10 - n)\n return n\n"}
-{"id":"smolscript-python-0004","reference_solution":"def solve(s: str) -> str:\n s = s.lower()\n s = s.strip(' ')\n return s\n"}
-{"id":"smolscript-python-0006","reference_solution":"def solve(s: str) -> str:\n s = s[len(s)//2:]\n s = s[:len(s)//2]\n return s\n"}
-{"id":"smolscript-python-0007","reference_solution":"def solve(n: int) -> int:\n n = (n if n > 0 else 0)\n n = (10 - n)\n return n\n"}
-{"id":"smolscript-python-0008","reference_solution":"def solve(s: str) -> str:\n s = s.lower()\n s = s[:len(s)//2]\n return s\n"}
-{"id":"smolscript-python-0011","reference_solution":"def solve(n: int) -> int:\n n = (10 - n)\n n = (n if n > 0 else 0)\n return n\n"}
{"id":"smolscript-python-0015","reference_solution":"def solve(n: int) -> int:\n n = (n * 2)\n n = (abs(n) % 10)\n return n\n"}
-{"id":"smolscript-python-0020","reference_solution":"def solve(s: str) -> str:\n s = __import__('re').sub(' +', ' ', s)\n s = ''.join(c for c in s if c.lower() not in 'aeiou')\n return s\n"}
{"id":"smolscript-python-0023","reference_solution":"def solve(n: int) -> int:\n n = (n * n)\n n = (abs(n) % 10)\n return n\n"}
{"id":"smolscript-python-0024","reference_solution":"def solve(s: str) -> str:\n s = ''.join(c for c in s if c.lower() not in 'aeiou')\n s = s.swapcase()\n return s\n"}
{"id":"smolscript-python-0025","reference_solution":"def solve(n: int) -> int:\n n = (abs(n) % 10)\n n = (-n)\n return n\n"}
-{"id":"smolscript-python-0027","reference_solution":"def solve(n: int) -> int:\n n = ((abs(n) // 10) % 10)\n n = (-n)\n return n\n"}
{"id":"smolscript-python-0028","reference_solution":"def solve(s: str) -> str:\n s = s[:len(s)//2]\n s = ''.join(c for c in s if ('a' <= c <= 'z') or ('A' <= c <= 'Z'))\n return s\n"}
-{"id":"smolscript-python-0030","reference_solution":"def solve(s: str) -> str:\n s = s.strip(' ')\n s = s.strip(' ')\n return s\n"}
{"id":"smolscript-python-0033","reference_solution":"def solve(n: int) -> int:\n n = (-n)\n n = (1 if n > 0 else (-1 if n < 0 else 0))\n return n\n"}
-{"id":"smolscript-python-0035","reference_solution":"def solve(n: int) -> int:\n n = (n if n > 0 else 0)\n n = (n * n)\n return n\n"}
-{"id":"smolscript-python-0036","reference_solution":"def solve(s: str) -> str:\n s = s[len(s)//2:]\n s = __import__('re').sub(' +', ' ', s)\n return s\n"}
{"id":"smolscript-python-0038","reference_solution":"def solve(s: str) -> str:\n s = s.upper()\n s = ''.join(c for c in s if '0' <= c <= '9')\n return s\n"}
-{"id":"smolscript-python-0039","reference_solution":"def solve(n: int) -> int:\n n = (n * 2)\n n = ((abs(n) // 10) % 10)\n return n\n"}
{"id":"smolscript-python-0041","reference_solution":"def solve(n: int) -> int:\n n = (n if n > 0 else 0)\n n = (abs(n) % 10)\n return n\n"}
-{"id":"smolscript-python-0044","reference_solution":"def solve(s: str) -> str:\n s = s.upper()\n s = s.strip(' ')\n return s\n"}
-{"id":"smolscript-python-0047","reference_solution":"def solve(n: int) -> int:\n n = (1 if n % 2 == 0 else 0)\n n = (n * 2)\n return n\n"}
-{"id":"smolscript-python-0048","reference_solution":"def solve(s: str) -> str:\n s = s.replace(' ', '')\n s = s.swapcase()\n return s\n"}
-{"id":"smolscript-python-0050","reference_solution":"def solve(s: str) -> str:\n s = s[len(s)//2:]\n s = s.strip(' ')\n return s\n"}
{"id":"smolscript-python-0054","reference_solution":"def solve(s: str) -> str:\n s = s[:len(s)//2]\n s = ''.join(c for c in s if c.lower() not in 'aeiou')\n return s\n"}
{"id":"smolscript-python-0056","reference_solution":"def solve(s: str) -> str:\n s = s[:len(s)//2]\n s = s[len(s)//2:]\n return s\n"}
-{"id":"smolscript-python-0058","reference_solution":"def solve(s: str) -> str:\n s = s[len(s)//2:]\n s = s.replace(' ', '')\n return s\n"}
-{"id":"smolscript-python-0059","reference_solution":"def solve(n: int) -> int:\n n = (10 - n)\n n = (1 if n > 0 else (-1 if n < 0 else 0))\n return n\n"}
-{"id":"smolscript-python-0061","reference_solution":"def solve(n: int) -> int:\n n = (1 if n % 2 == 0 else 0)\n n = (-n)\n return n\n"}
-{"id":"smolscript-python-0066","reference_solution":"def solve(s: str) -> str:\n s = s[::-1]\n s = s.swapcase()\n return s\n"}
-{"id":"smolscript-python-0067","reference_solution":"def solve(n: int) -> int:\n n = (1 if n < 0 else 0)\n n = (10 - n)\n return n\n"}
{"id":"smolscript-python-0068","reference_solution":"def solve(s: str) -> str:\n s = s.upper()\n s = __import__('re').sub(' +', ' ', s)\n return s\n"}
{"id":"smolscript-python-0069","reference_solution":"def solve(n: int) -> int:\n n = (1 if n % 2 == 0 else 0)\n n = (10 - n)\n return n\n"}
-{"id":"smolscript-python-0070","reference_solution":"def solve(s: str) -> str:\n s = s.strip(' ')\n s = __import__('re').sub(' +', ' ', s)\n return s\n"}
-{"id":"smolscript-python-0073","reference_solution":"def solve(n: int) -> int:\n n = (-n)\n n = (n + 1)\n return n\n"}
-{"id":"smolscript-python-0074","reference_solution":"def solve(s: str) -> str:\n s = s.lower()\n s = s[::-1]\n return s\n"}
{"id":"smolscript-python-0075","reference_solution":"def solve(n: int) -> int:\n n = (10 - n)\n n = (-5 if n < -5 else (5 if n > 5 else n))\n return n\n"}
{"id":"smolscript-python-0076","reference_solution":"def solve(s: str) -> str:\n s = s[len(s)//2:]\n s = ''.join(c for c in s if ('a' <= c <= 'z') or ('A' <= c <= 'Z'))\n return s\n"}
-{"id":"smolscript-python-0078","reference_solution":"def solve(s: str) -> str:\n s = ''.join(c for c in s if c.lower() not in 'aeiou')\n s = __import__('re').sub(' +', ' ', s)\n return s\n"}
-{"id":"smolscript-python-0080","reference_solution":"def solve(s: str) -> str:\n s = s[::-1]\n s = s[::-1]\n return s\n"}
-{"id":"smolscript-python-0081","reference_solution":"def solve(n: int) -> int:\n n = ((abs(n) // 10) % 10)\n n = (n * n)\n return n\n"}
{"id":"smolscript-python-0082","reference_solution":"def solve(s: str) -> str:\n s = s.strip(' ')\n s = s[:len(s)//2]\n return s\n"}
-{"id":"smolscript-python-0084","reference_solution":"def solve(s: str) -> str:\n s = s[len(s)//2:]\n s = s.swapcase()\n return s\n"}
-{"id":"smolscript-python-0087","reference_solution":"def solve(n: int) -> int:\n n = (n + 1)\n n = (1 if n < 0 else 0)\n return n\n"}
-{"id":"smolscript-python-0091","reference_solution":"def solve(n: int) -> int:\n n = ((abs(n) // 10) % 10)\n n = (10 - n)\n return n\n"}
-{"id":"smolscript-python-0092","reference_solution":"def solve(s: str) -> str:\n s = ''.join(c for c in s if ('a' <= c <= 'z') or ('A' <= c <= 'Z'))\n s = s.swapcase()\n return s\n"}
-{"id":"smolscript-python-0095","reference_solution":"def solve(n: int) -> int:\n n = (n + 1)\n n = (n if n > 0 else 0)\n return n\n"}
{"id":"smolscript-python-0098","reference_solution":"def solve(s: str) -> str:\n s = ''.join(c for c in s if ('a' <= c <= 'z') or ('A' <= c <= 'Z'))\n s = ''.join(c for c in s if '0' <= c <= '9')\n return s\n"}
-{"id":"smolscript-python-0099","reference_solution":"def solve(n: int) -> int:\n n = (n * 2)\n n = (n + 1)\n return n\n"}
{"id":"smolscript-python-0101","reference_solution":"def solve(n: int) -> int:\n n = (1 if n < 0 else 0)\n n = (n * 2)\n return n\n"}
-{"id":"smolscript-python-0104","reference_solution":"def solve(s: str) -> str:\n s = s.replace(' ', '')\n s = s[:len(s)//2]\n return s\n"}
{"id":"smolscript-python-0107","reference_solution":"def solve(n: int) -> int:\n n = ((abs(n) // 10) % 10)\n n = (1 if n > 0 else (-1 if n < 0 else 0))\n return n\n"}
{"id":"smolscript-python-0108","reference_solution":"def solve(s: str) -> str:\n s = s[:len(s)//2]\n s = s.strip(' ')\n return s\n"}
{"id":"smolscript-python-0113","reference_solution":"def solve(n: int) -> int:\n n = (-5 if n < -5 else (5 if n > 5 else n))\n n = (-5 if n < -5 else (5 if n > 5 else n))\n return n\n"}
{"id":"smolscript-python-0114","reference_solution":"def solve(s: str) -> str:\n s = s.lower()\n s = s.replace(' ', '')\n return s\n"}
-{"id":"smolscript-python-0115","reference_solution":"def solve(n: int) -> int:\n n = (10 - n)\n n = (n * 2)\n return n\n"}
-{"id":"smolscript-python-0119","reference_solution":"def solve(n: int) -> int:\n n = (-n)\n n = (10 - n)\n return n\n"}
-{"id":"smolscript-python-0123","reference_solution":"def solve(n: int) -> int:\n n = ((abs(n) // 10) % 10)\n n = (-5 if n < -5 else (5 if n > 5 else n))\n return n\n"}
-{"id":"smolscript-python-0126","reference_solution":"def solve(s: str) -> str:\n s = s[:len(s)//2]\n s = __import__('re').sub(' +', ' ', s)\n return s\n"}
-{"id":"smolscript-python-0130","reference_solution":"def solve(s: str) -> str:\n s = s.lower()\n s = ''.join(c for c in s if c.lower() not in 'aeiou')\n return s\n"}
{"id":"smolscript-python-0131","reference_solution":"def solve(n: int) -> int:\n n = abs(n)\n n = (-n)\n return n\n"}
-{"id":"smolscript-python-0132","reference_solution":"def solve(s: str) -> str:\n s = s[::-1]\n s = s.replace(' ', '')\n return s\n"}
-{"id":"smolscript-python-0133","reference_solution":"def solve(n: int) -> int:\n n = (1 if n > 0 else (-1 if n < 0 else 0))\n n = (n * 2)\n return n\n"}
{"id":"smolscript-python-0134","reference_solution":"def solve(s: str) -> str:\n s = s[len(s)//2:]\n s = s[len(s)//2:]\n return s\n"}
{"id":"smolscript-python-0135","reference_solution":"def solve(n: int) -> int:\n n = (10 - n)\n n = (abs(n) % 10)\n return n\n"}
-{"id":"smolscript-python-0136","reference_solution":"def solve(s: str) -> str:\n s = s.lower()\n s = __import__('re').sub(' +', ' ', s)\n return s\n"}
-{"id":"smolscript-python-0137","reference_solution":"def solve(n: int) -> int:\n n = (-5 if n < -5 else (5 if n > 5 else n))\n n = (1 if n % 2 == 0 else 0)\n return n\n"}
-{"id":"smolscript-python-0138","reference_solution":"def solve(s: str) -> str:\n s = __import__('re').sub(' +', ' ', s)\n s = s[len(s)//2:]\n return s\n"}
-{"id":"smolscript-python-0139","reference_solution":"def solve(n: int) -> int:\n n = (n if n > 0 else 0)\n n = (1 if n % 2 == 0 else 0)\n return n\n"}
{"id":"smolscript-python-0141","reference_solution":"def solve(n: int) -> int:\n n = (-5 if n < -5 else (5 if n > 5 else n))\n n = (n * n)\n return n\n"}
-{"id":"smolscript-python-0143","reference_solution":"def solve(n: int) -> int:\n n = (n * 2)\n n = (1 if n > 0 else (-1 if n < 0 else 0))\n return n\n"}
-{"id":"smolscript-python-0145","reference_solution":"def solve(n: int) -> int:\n n = ((abs(n) // 10) % 10)\n n = (1 if n % 2 == 0 else 0)\n return n\n"}
-{"id":"smolscript-python-0147","reference_solution":"def solve(n: int) -> int:\n n = (n * 2)\n n = (n if n > 0 else 0)\n return n\n"}
-{"id":"smolscript-python-0148","reference_solution":"def solve(n: int) -> int:\n n = (n * 2)\n n = (1 if n < 0 else 0)\n return n\n"}
{"id":"smolscript-python-0149","reference_solution":"def solve(n: int) -> int:\n n = (10 - n)\n n = (-n)\n return n\n"}
-{"id":"smolscript-python-0152","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x<0]\n return len(set(a))\n"}
{"id":"smolscript-python-0153","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==1]\n return a[-1] if a else 0\n"}
-{"id":"smolscript-python-0155","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x!=0]\n counts = {}\n for x in a: counts[x] = counts.get(x, 0) + 1\n return max(counts.values(), default=0)\n"}
-{"id":"smolscript-python-0156","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if True]\n counts = {}\n for x in a: counts[x] = counts.get(x, 0) + 1\n return max(counts.values(), default=0)\n"}
-{"id":"smolscript-python-0158","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x!=0]\n return a[-1] if a else 0\n"}
-{"id":"smolscript-python-0159","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==0]\n result = 1\n for x in a: result *= x\n return result\n"}
{"id":"smolscript-python-0160","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x!=0]\n return len(a)\n"}
-{"id":"smolscript-python-0161","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x<0]\n return len(a)\n"}
-{"id":"smolscript-python-0167","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==0]\n return len(a)\n"}
-{"id":"smolscript-python-0168","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x%2!=0]\n return len(set(a))\n"}
-{"id":"smolscript-python-0169","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x!=0]\n result = 1\n for x in a: result *= x\n return result\n"}
{"id":"smolscript-python-0174","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x<0]\n return min(a, default=0)\n"}
{"id":"smolscript-python-0176","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==1]\n return len(set(a))\n"}
{"id":"smolscript-python-0177","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x%2!=0]\n return len(a)\n"}
-{"id":"smolscript-python-0179","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x>0]\n return len(a)\n"}
-{"id":"smolscript-python-0181","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==1]\n result = 1\n for x in a: result *= x\n return result\n"}
{"id":"smolscript-python-0183","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==1]\n counts = {}\n for x in a: counts[x] = counts.get(x, 0) + 1\n return max(counts.values(), default=0)\n"}
{"id":"smolscript-python-0184","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x%2==0]\n return a[-1] if a else 0\n"}
{"id":"smolscript-python-0188","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==1]\n return sum(a)\n"}
-{"id":"smolscript-python-0190","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x>0]\n return len(set(a))\n"}
-{"id":"smolscript-python-0192","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==0]\n return a[-1] if a else 0\n"}
-{"id":"smolscript-python-0193","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if abs(x)>3]\n return max(a)-min(a) if a else 0\n"}
{"id":"smolscript-python-0194","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if abs(x)>3]\n return len(set(a))\n"}
-{"id":"smolscript-python-0196","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==0]\n return len(set(a))\n"}
-{"id":"smolscript-python-0197","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if True]\n return max(a, default=0)\n"}
-{"id":"smolscript-python-0199","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x%2==0]\n return min(a, default=0)\n"}
-{"id":"smolscript-python-0200","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x%2!=0]\n counts = {}\n for x in a: counts[x] = counts.get(x, 0) + 1\n return max(counts.values(), default=0)\n"}
-{"id":"smolscript-python-0203","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x%2!=0]\n return max(a)-min(a) if a else 0\n"}
-{"id":"smolscript-python-0205","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if abs(x)<=3]\n return a[0] if a else 0\n"}
-{"id":"smolscript-python-0208","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if abs(x)<=3]\n return min(a, default=0)\n"}
{"id":"smolscript-python-0209","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x>0]\n return max(a, default=0)\n"}
{"id":"smolscript-python-0213","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x!=0]\n return max(a, default=0)\n"}
-{"id":"smolscript-python-0215","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x<0]\n return max(a)-min(a) if a else 0\n"}
-{"id":"smolscript-python-0217","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x>0]\n return a[0] if a else 0\n"}
-{"id":"smolscript-python-0218","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if i%2==0]\n return max(a)-min(a) if a else 0\n"}
{"id":"smolscript-python-0219","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if abs(x)>3]\n return sum(a)\n"}
{"id":"smolscript-python-0222","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if x%2==0]\n return len(set(a))\n"}
-{"id":"smolscript-python-0223","reference_solution":"def solve(values: list[int]) -> int:\n a = [x for i, x in enumerate(values) if abs(x)<=3]\n return len(set(a))\n"}
{"id":"smolscript-python-0226","reference_solution":"def solve(values: list[int]) -> int:\n a = [(x * 2) for i, x in enumerate(values) if i%2==1]\n return max(a)-min(a) if a else 0\n"}
{"id":"smolscript-python-0229","reference_solution":"def solve(values: list[int]) -> int:\n a = [abs(x) for i, x in enumerate(values) if x%2!=0]\n counts = {}\n for x in a: counts[x] = counts.get(x, 0) + 1\n return max(counts.values(), default=0)\n"}
-{"id":"smolscript-python-0230","reference_solution":"def solve(values: list[int]) -> int:\n a = [(1 if x > 0 else (-1 if x < 0 else 0)) for i, x in enumerate(values) if True]\n return max(a)-min(a) if a else 0\n"}
-{"id":"smolscript-python-0231","reference_solution":"def solve(values: list[int]) -> int:\n a = [(-x) for i, x in enumerate(values) if x>0]\n return a[0] if a else 0\n"}
-{"id":"smolscript-python-0232","reference_solution":"def solve(values: list[int]) -> int:\n a = [(1 if x > 0 else (-1 if x < 0 else 0)) for i, x in enumerate(values) if x<0]\n return min(a, default=0)\n"}
{"id":"smolscript-python-0236","reference_solution":"def solve(values: list[int]) -> int:\n a = [(x * x) for i, x in enumerate(values) if x>0]\n return a[0] if a else 0\n"}
{"id":"smolscript-python-0237","reference_solution":"def solve(values: list[int]) -> int:\n a = [(1 if x > 0 else (-1 if x < 0 else 0)) for i, x in enumerate(values) if True]\n return max(a, default=0)\n"}
{"id":"smolscript-python-0238","reference_solution":"def solve(values: list[int]) -> int:\n a = [(-x) for i, x in enumerate(values) if i%2==0]\n return sum(a)\n"}
-{"id":"smolscript-python-0242","reference_solution":"def solve(values: list[int]) -> int:\n a = [(x + 1) for i, x in enumerate(values) if x<0]\n return max(a, default=0)\n"}
-{"id":"smolscript-python-0243","reference_solution":"def solve(values: list[int]) -> int:\n a = [(x * 2) for i, x in enumerate(values) if x>0]\n return max(a, default=0)\n"}
-{"id":"smolscript-python-0245","reference_solution":"def solve(values: list[int]) -> int:\n a = [abs(x) for i, x in enumerate(values) if x!=0]\n counts = {}\n for x in a: counts[x] = counts.get(x, 0) + 1\n return max(counts.values(), default=0)\n"}
-{"id":"smolscript-python-0246","reference_solution":"def solve(values: list[int]) -> int:\n a = [abs(x) for i, x in enumerate(values) if abs(x)<=3]\n return sum(a)\n"}
-{"id":"smolscript-javascript-0001","reference_solution":"function solve(n) {\n n = ((n < 0) ? 1 : 0);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0002","reference_solution":"function solve(s) {\n s = s.toUpperCase();\n s = s.toLowerCase();\n return s;\n}\n"}
-{"id":"smolscript-javascript-0004","reference_solution":"function solve(s) {\n s = s.toLowerCase();\n s = s.replace(/^ +| +$/g, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0009","reference_solution":"function solve(n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = (n * 2);\n return n;\n}\n"}
{"id":"smolscript-javascript-0010","reference_solution":"function solve(s) {\n s = s.replace(/ +/g, ' ');\n s = s.slice(0, Math.floor(s.length/2));\n return s;\n}\n"}
{"id":"smolscript-javascript-0012","reference_solution":"function solve(s) {\n s = s.toUpperCase();\n s = s.split('').reverse().join('');\n return s;\n}\n"}
{"id":"smolscript-javascript-0014","reference_solution":"function solve(s) {\n s = s.slice(Math.floor(s.length/2));\n s = s.replace(/[aeiou]/gi, '');\n return s;\n}\n"}
{"id":"smolscript-javascript-0015","reference_solution":"function solve(n) {\n n = (n * 2);\n n = (Math.abs(n) % 10);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0016","reference_solution":"function solve(s) {\n s = s.replace(/ +/g, ' ');\n s = s.replace(/ +/g, ' ');\n return s;\n}\n"}
{"id":"smolscript-javascript-0017","reference_solution":"function solve(n) {\n n = Math.abs(n);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0018","reference_solution":"function solve(s) {\n s = s.replace(/ /g, '');\n s = s.slice(Math.floor(s.length/2));\n return s;\n}\n"}
-{"id":"smolscript-javascript-0021","reference_solution":"function solve(n) {\n n = ((n % 2 == 0) ? 1 : 0);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0024","reference_solution":"function solve(s) {\n s = s.replace(/[aeiou]/gi, '');\n s = s.replace(/[a-zA-Z]/g, c => c === c.toUpperCase() ? c.toLowerCase() : c.toUpperCase());\n return s;\n}\n"}
-{"id":"smolscript-javascript-0025","reference_solution":"function solve(n) {\n n = (Math.abs(n) % 10);\n n = (-n);\n return n;\n}\n"}
{"id":"smolscript-javascript-0027","reference_solution":"function solve(n) {\n n = (Math.floor(Math.abs(n) / 10) % 10);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0029","reference_solution":"function solve(n) {\n n = (n + 1);\n n = (10 - n);\n return n;\n}\n"}
{"id":"smolscript-javascript-0030","reference_solution":"function solve(s) {\n s = s.replace(/^ +| +$/g, '');\n s = s.replace(/^ +| +$/g, '');\n return s;\n}\n"}
{"id":"smolscript-javascript-0031","reference_solution":"function solve(n) {\n n = (n + 1);\n n = ((n % 2 == 0) ? 1 : 0);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0035","reference_solution":"function solve(n) {\n n = ((n > 0) ? n : 0);\n n = (n * n);\n return n;\n}\n"}
{"id":"smolscript-javascript-0036","reference_solution":"function solve(s) {\n s = s.slice(Math.floor(s.length/2));\n s = s.replace(/ +/g, ' ');\n return s;\n}\n"}
{"id":"smolscript-javascript-0037","reference_solution":"function solve(n) {\n n = (10 - n);\n n = ((n < 0) ? 1 : 0);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0038","reference_solution":"function solve(s) {\n s = s.toUpperCase();\n s = s.replace(/[^0-9]/g, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0039","reference_solution":"function solve(n) {\n n = (n * 2);\n n = (Math.floor(Math.abs(n) / 10) % 10);\n return n;\n}\n"}
{"id":"smolscript-javascript-0040","reference_solution":"function solve(s) {\n s = s.replace(/^ +| +$/g, '');\n s = s.replace(/ /g, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0042","reference_solution":"function solve(s) {\n s = s.toLowerCase();\n s = s.slice(Math.floor(s.length/2));\n return s;\n}\n"}
-{"id":"smolscript-javascript-0043","reference_solution":"function solve(n) {\n n = (n + 1);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
{"id":"smolscript-javascript-0044","reference_solution":"function solve(s) {\n s = s.toUpperCase();\n s = s.replace(/^ +| +$/g, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0047","reference_solution":"function solve(n) {\n n = ((n % 2 == 0) ? 1 : 0);\n n = (n * 2);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0049","reference_solution":"function solve(n) {\n n = ((n > 0) ? n : 0);\n n = Math.abs(n);\n return n;\n}\n"}
{"id":"smolscript-javascript-0051","reference_solution":"function solve(n) {\n n = (Math.abs(n) % 10);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
{"id":"smolscript-javascript-0052","reference_solution":"function solve(s) {\n s = s.replace(/[aeiou]/gi, '');\n s = s.replace(/^ +| +$/g, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0054","reference_solution":"function solve(s) {\n s = s.slice(0, Math.floor(s.length/2));\n s = s.replace(/[aeiou]/gi, '');\n return s;\n}\n"}
{"id":"smolscript-javascript-0055","reference_solution":"function solve(n) {\n n = (-n);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0056","reference_solution":"function solve(s) {\n s = s.slice(0, Math.floor(s.length/2));\n s = s.slice(Math.floor(s.length/2));\n return s;\n}\n"}
-{"id":"smolscript-javascript-0059","reference_solution":"function solve(n) {\n n = (10 - n);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
-{"id":"smolscript-javascript-0060","reference_solution":"function solve(s) {\n s = s.slice(Math.floor(s.length/2));\n s = s.replace(/[^0-9]/g, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0063","reference_solution":"function solve(n) {\n n = (-n);\n n = ((n % 2 == 0) ? 1 : 0);\n return n;\n}\n"}
{"id":"smolscript-javascript-0065","reference_solution":"function solve(n) {\n n = (n * 2);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0066","reference_solution":"function solve(s) {\n s = s.split('').reverse().join('');\n s = s.replace(/[a-zA-Z]/g, c => c === c.toUpperCase() ? c.toLowerCase() : c.toUpperCase());\n return s;\n}\n"}
-{"id":"smolscript-javascript-0067","reference_solution":"function solve(n) {\n n = ((n < 0) ? 1 : 0);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0074","reference_solution":"function solve(s) {\n s = s.toLowerCase();\n s = s.split('').reverse().join('');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0077","reference_solution":"function solve(n) {\n n = ((n < 0) ? 1 : 0);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0078","reference_solution":"function solve(s) {\n s = s.replace(/[aeiou]/gi, '');\n s = s.replace(/ +/g, ' ');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0081","reference_solution":"function solve(n) {\n n = (Math.floor(Math.abs(n) / 10) % 10);\n n = (n * n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0082","reference_solution":"function solve(s) {\n s = s.replace(/^ +| +$/g, '');\n s = s.slice(0, Math.floor(s.length/2));\n return s;\n}\n"}
-{"id":"smolscript-javascript-0088","reference_solution":"function solve(s) {\n s = s.replace(/[a-zA-Z]/g, c => c === c.toUpperCase() ? c.toLowerCase() : c.toUpperCase());\n s = s.replace(/ +/g, ' ');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0093","reference_solution":"function solve(n) {\n n = Math.abs(n);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0094","reference_solution":"function solve(s) {\n s = s.toUpperCase();\n s = s.replace(/[aeiou]/gi, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0095","reference_solution":"function solve(n) {\n n = (n + 1);\n n = ((n > 0) ? n : 0);\n return n;\n}\n"}
{"id":"smolscript-javascript-0096","reference_solution":"function solve(s) {\n s = s.slice(0, Math.floor(s.length/2));\n s = s.split('').reverse().join('');\n return s;\n}\n"}
{"id":"smolscript-javascript-0097","reference_solution":"function solve(n) {\n n = (n * 2);\n n = (n * n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0099","reference_solution":"function solve(n) {\n n = (n * 2);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0101","reference_solution":"function solve(n) {\n n = ((n < 0) ? 1 : 0);\n n = (n * 2);\n return n;\n}\n"}
{"id":"smolscript-javascript-0102","reference_solution":"function solve(s) {\n s = s.split('').reverse().join('');\n s = s.slice(Math.floor(s.length/2));\n return s;\n}\n"}
-{"id":"smolscript-javascript-0103","reference_solution":"function solve(n) {\n n = (n + 1);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
-{"id":"smolscript-javascript-0106","reference_solution":"function solve(s) {\n s = s.replace(/[aeiou]/gi, '');\n s = s.replace(/[aeiou]/gi, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0108","reference_solution":"function solve(s) {\n s = s.slice(0, Math.floor(s.length/2));\n s = s.replace(/^ +| +$/g, '');\n return s;\n}\n"}
{"id":"smolscript-javascript-0111","reference_solution":"function solve(n) {\n n = Math.abs(n);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
-{"id":"smolscript-javascript-0114","reference_solution":"function solve(s) {\n s = s.toLowerCase();\n s = s.replace(/ /g, '');\n return s;\n}\n"}
{"id":"smolscript-javascript-0116","reference_solution":"function solve(s) {\n s = s.replace(/^ +| +$/g, '');\n s = s.replace(/[^a-zA-Z]/g, '');\n return s;\n}\n"}
{"id":"smolscript-javascript-0118","reference_solution":"function solve(s) {\n s = s.toUpperCase();\n s = s.slice(0, Math.floor(s.length/2));\n return s;\n}\n"}
-{"id":"smolscript-javascript-0119","reference_solution":"function solve(n) {\n n = (-n);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0122","reference_solution":"function solve(s) {\n s = s.replace(/[^a-zA-Z]/g, '');\n s = s.slice(0, Math.floor(s.length/2));\n return s;\n}\n"}
{"id":"smolscript-javascript-0123","reference_solution":"function solve(n) {\n n = (Math.floor(Math.abs(n) / 10) % 10);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
{"id":"smolscript-javascript-0124","reference_solution":"function solve(s) {\n s = s.replace(/[^a-zA-Z]/g, '');\n s = s.replace(/[aeiou]/gi, '');\n return s;\n}\n"}
{"id":"smolscript-javascript-0125","reference_solution":"function solve(n) {\n n = (n + 1);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0131","reference_solution":"function solve(n) {\n n = Math.abs(n);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0132","reference_solution":"function solve(s) {\n s = s.split('').reverse().join('');\n s = s.replace(/ /g, '');\n return s;\n}\n"}
-{"id":"smolscript-javascript-0135","reference_solution":"function solve(n) {\n n = (10 - n);\n n = (Math.abs(n) % 10);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0138","reference_solution":"function solve(s) {\n s = s.replace(/ +/g, ' ');\n s = s.slice(Math.floor(s.length/2));\n return s;\n}\n"}
{"id":"smolscript-javascript-0144","reference_solution":"function solve(n) {\n n = (10 - n);\n n = Math.abs(n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0145","reference_solution":"function solve(n) {\n n = (Math.floor(Math.abs(n) / 10) % 10);\n n = ((n % 2 == 0) ? 1 : 0);\n return n;\n}\n"}
{"id":"smolscript-javascript-0146","reference_solution":"function solve(n) {\n n = (-n);\n n = (Math.abs(n) % 10);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0149","reference_solution":"function solve(n) {\n n = (10 - n);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0150","reference_solution":"function solve(n) {\n n = (n + 1);\n n = (n * n);\n return n;\n}\n"}
-{"id":"smolscript-javascript-0151","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x%2!=0).map(x => x);\n return a.length ? Math.min(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0152","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x<0).map(x => x);\n return new Set(a).size;\n}\n"}
{"id":"smolscript-javascript-0153","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => i%2==1).map(x => x);\n return a.length ? a[a.length-1] : 0;\n}\n"}
{"id":"smolscript-javascript-0154","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => Math.abs(x)<=3).map(x => x);\n return a.reduce((s,x)=>s+x,0);\n}\n"}
-{"id":"smolscript-javascript-0156","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => true).map(x => x);\n const counts = new Map();\n for (const x of a) counts.set(x, (counts.get(x)||0)+1);\n return Math.max(0,...counts.values());\n}\n"}
-{"id":"smolscript-javascript-0157","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x>0).map(x => x);\n return a.reduce((s,x)=>s*x,1);\n}\n"}
-{"id":"smolscript-javascript-0159","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => i%2==0).map(x => x);\n return a.reduce((s,x)=>s*x,1);\n}\n"}
-{"id":"smolscript-javascript-0161","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x<0).map(x => x);\n return a.length;\n}\n"}
{"id":"smolscript-javascript-0163","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x%2==0).map(x => x);\n return a.reduce((s,x)=>s+x,0);\n}\n"}
{"id":"smolscript-javascript-0164","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => true).map(x => x);\n return a.length ? a[a.length-1] : 0;\n}\n"}
-{"id":"smolscript-javascript-0165","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => true).map(x => x);\n return a.length ? Math.min(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0166","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x>0).map(x => x);\n return a.length ? Math.max(...a)-Math.min(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0167","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => i%2==0).map(x => x);\n return a.length;\n}\n"}
{"id":"smolscript-javascript-0168","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x%2!=0).map(x => x);\n return new Set(a).size;\n}\n"}
{"id":"smolscript-javascript-0169","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x!=0).map(x => x);\n return a.reduce((s,x)=>s*x,1);\n}\n"}
{"id":"smolscript-javascript-0170","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => Math.abs(x)<=3).map(x => x);\n const counts = new Map();\n for (const x of a) counts.set(x, (counts.get(x)||0)+1);\n return Math.max(0,...counts.values());\n}\n"}
-{"id":"smolscript-javascript-0171","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => Math.abs(x)>3).map(x => x);\n return a.length ? Math.min(...a) : 0;\n}\n"}
{"id":"smolscript-javascript-0177","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x%2!=0).map(x => x);\n return a.length;\n}\n"}
{"id":"smolscript-javascript-0178","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => true).map(x => x);\n return a.length;\n}\n"}
-{"id":"smolscript-javascript-0179","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x>0).map(x => x);\n return a.length;\n}\n"}
-{"id":"smolscript-javascript-0182","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x%2!=0).map(x => x);\n return a.reduce((s,x)=>s+x,0);\n}\n"}
-{"id":"smolscript-javascript-0185","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => i%2==0).map(x => x);\n return a.length ? Math.min(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0187","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x%2==0).map(x => x);\n const counts = new Map();\n for (const x of a) counts.set(x, (counts.get(x)||0)+1);\n return Math.max(0,...counts.values());\n}\n"}
{"id":"smolscript-javascript-0188","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => i%2==1).map(x => x);\n return a.reduce((s,x)=>s+x,0);\n}\n"}
-{"id":"smolscript-javascript-0194","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => Math.abs(x)>3).map(x => x);\n return new Set(a).size;\n}\n"}
-{"id":"smolscript-javascript-0199","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x%2==0).map(x => x);\n return a.length ? Math.min(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0201","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x>0).map(x => x);\n return a.reduce((s,x)=>s+x,0);\n}\n"}
-{"id":"smolscript-javascript-0204","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x<0).map(x => x);\n return a.reduce((s,x)=>s*x,1);\n}\n"}
-{"id":"smolscript-javascript-0209","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x>0).map(x => x);\n return a.length ? Math.max(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0210","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => i%2==0).map(x => x);\n const counts = new Map();\n for (const x of a) counts.set(x, (counts.get(x)||0)+1);\n return Math.max(0,...counts.values());\n}\n"}
-{"id":"smolscript-javascript-0213","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => Math.abs(x)<=3).map(x => ((x > 0) ? 1 : ((x < 0) ? -1 : 0)));\n return new Set(a).size;\n}\n"}
-{"id":"smolscript-javascript-0216","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x>0).map(x => (-x));\n return a.length ? a[0] : 0;\n}\n"}
{"id":"smolscript-javascript-0217","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x<0).map(x => ((x > 0) ? 1 : ((x < 0) ? -1 : 0)));\n return a.length ? Math.min(...a) : 0;\n}\n"}
{"id":"smolscript-javascript-0219","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => Math.abs(x)>3).map(x => Math.abs(x));\n return a.length ? Math.max(...a)-Math.min(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0220","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => true).map(x => (x + 1));\n return a.length ? a[0] : 0;\n}\n"}
{"id":"smolscript-javascript-0223","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => i%2==0).map(x => (-x));\n return a.reduce((s,x)=>s+x,0);\n}\n"}
-{"id":"smolscript-javascript-0226","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => Math.abs(x)<=3).map(x => Math.abs(x));\n return a.length ? Math.max(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0227","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x<0).map(x => (x + 1));\n return a.length ? Math.max(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0228","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => x>0).map(x => (x * 2));\n return a.length ? Math.max(...a) : 0;\n}\n"}
-{"id":"smolscript-javascript-0229","reference_solution":"function solve(values) {\n const a = values.filter((x,i) => true).map(x => (x * x));\n const counts = new Map();\n for (const x of a) counts.set(x, (counts.get(x)||0)+1);\n return Math.max(0,...counts.values());\n}\n"}
{"id":"smolscript-javascript-0232","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n document.querySelector('#action').addEventListener('click', () => { o.textContent=String(Number(o.textContent)+1); });\n}\n"}
{"id":"smolscript-javascript-0234","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n document.querySelector('#action').addEventListener('click', () => { o.textContent=i.value; });\n}\n"}
-{"id":"smolscript-javascript-0235","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n document.querySelector('#action').addEventListener('click', () => { o.textContent=i.value.toUpperCase(); });\n}\n"}
-{"id":"smolscript-javascript-0240","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n document.querySelector('#action').addEventListener('click', () => { o.classList.toggle('active'); });\n}\n"}
-{"id":"smolscript-javascript-0241","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n document.querySelector('#action').addEventListener('click', () => { const li=document.createElement('li'); li.textContent=i.value; document.querySelector('#items').appendChild(li); });\n}\n"}
-{"id":"smolscript-javascript-0242","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n document.querySelector('#action').addEventListener('click', () => { document.querySelector('#check').checked=true; });\n}\n"}
{"id":"smolscript-javascript-0243","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n document.querySelector('#action').addEventListener('click', () => { o.title=i.value; });\n}\n"}
-{"id":"smolscript-javascript-0246","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n i.addEventListener('input', () => { o.textContent=i.value; });\n}\n"}
{"id":"smolscript-javascript-0247","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n i.addEventListener('input', () => { o.textContent=i.value.toUpperCase(); });\n}\n"}
-{"id":"smolscript-javascript-0250","reference_solution":"function setup() {\n const i=document.querySelector('#input'), o=document.querySelector('#output');\n i.addEventListener('input', () => { i.disabled=true; });\n}\n"}
{"id":"smolscript-html-0003","reference_solution":"
Welcome
"}
{"id":"smolscript-html-0004","reference_solution":"Welcome
"}
-{"id":"smolscript-html-0007","reference_solution":"Hello reader
"}
-{"id":"smolscript-html-0008","reference_solution":"Hello reader
"}
-{"id":"smolscript-html-0015","reference_solution":"Help"}
-{"id":"smolscript-html-0017","reference_solution":"Help"}
-{"id":"smolscript-html-0019","reference_solution":""}
{"id":"smolscript-html-0020","reference_solution":""}
-{"id":"smolscript-html-0022","reference_solution":""}
-{"id":"smolscript-html-0023","reference_solution":""}
-{"id":"smolscript-html-0025","reference_solution":"
"}
{"id":"smolscript-html-0027","reference_solution":"
"}
-{"id":"smolscript-html-0028","reference_solution":"
"}
{"id":"smolscript-html-0031","reference_solution":""}
-{"id":"smolscript-html-0034","reference_solution":""}
-{"id":"smolscript-html-0035","reference_solution":""}
{"id":"smolscript-html-0036","reference_solution":""}
-{"id":"smolscript-html-0037","reference_solution":""}
-{"id":"smolscript-html-0038","reference_solution":""}
-{"id":"smolscript-html-0039","reference_solution":""}
-{"id":"smolscript-html-0040","reference_solution":""}
{"id":"smolscript-html-0042","reference_solution":""}
{"id":"smolscript-html-0045","reference_solution":""}
{"id":"smolscript-html-0047","reference_solution":""}
-{"id":"smolscript-html-0048","reference_solution":""}
{"id":"smolscript-html-0049","reference_solution":""}
-{"id":"smolscript-html-0050","reference_solution":""}
{"id":"smolscript-html-0054","reference_solution":""}
-{"id":"smolscript-html-0059","reference_solution":"- Open
- Close
"}
-{"id":"smolscript-html-0061","reference_solution":""}
-{"id":"smolscript-html-0062","reference_solution":""}
-{"id":"smolscript-html-0065","reference_solution":""}
{"id":"smolscript-html-0067","reference_solution":"News
Today
"}
-{"id":"smolscript-html-0069","reference_solution":"News
Today
"}
-{"id":"smolscript-html-0074","reference_solution":""}
-{"id":"smolscript-html-0075","reference_solution":""}
-{"id":"smolscript-html-0076","reference_solution":""}
-{"id":"smolscript-html-0079","reference_solution":"Be kind
"}
-{"id":"smolscript-html-0080","reference_solution":"Be kind
"}
{"id":"smolscript-html-0082","reference_solution":"Be kind
"}
-{"id":"smolscript-html-0088","reference_solution":"x = 1
"}
{"id":"smolscript-html-0089","reference_solution":"x = 1
"}
-{"id":"smolscript-html-0091","reference_solution":"More
Details
"}
-{"id":"smolscript-html-0093","reference_solution":"More
Details
"}
{"id":"smolscript-html-0094","reference_solution":"More
Details
"}
{"id":"smolscript-html-0095","reference_solution":"More
Details
"}
-{"id":"smolscript-html-0096","reference_solution":"More
Details
"}
{"id":"smolscript-html-0097","reference_solution":""}
-{"id":"smolscript-html-0098","reference_solution":""}
{"id":"smolscript-html-0100","reference_solution":""}
-{"id":"smolscript-html-0101","reference_solution":""}
-{"id":"smolscript-html-0106","reference_solution":""}
-{"id":"smolscript-html-0107","reference_solution":""}
-{"id":"smolscript-html-0110","reference_solution":""}
-{"id":"smolscript-html-0112","reference_solution":""}
{"id":"smolscript-html-0114","reference_solution":""}
{"id":"smolscript-html-0116","reference_solution":""}
{"id":"smolscript-html-0118","reference_solution":""}
-{"id":"smolscript-html-0119","reference_solution":""}
-{"id":"smolscript-html-0120","reference_solution":""}
-{"id":"smolscript-html-0121","reference_solution":""}
-{"id":"smolscript-html-0122","reference_solution":""}
{"id":"smolscript-html-0123","reference_solution":""}
-{"id":"smolscript-html-0125","reference_solution":""}
-{"id":"smolscript-html-0127","reference_solution":""}
{"id":"smolscript-html-0129","reference_solution":""}
{"id":"smolscript-html-0130","reference_solution":"
"}
-{"id":"smolscript-html-0132","reference_solution":""}
-{"id":"smolscript-html-0133","reference_solution":""}
-{"id":"smolscript-html-0135","reference_solution":"
Be kind
"}
-{"id":"smolscript-html-0141","reference_solution":""}
-{"id":"smolscript-html-0142","reference_solution":""}
{"id":"smolscript-html-0143","reference_solution":""}
{"id":"smolscript-html-0146","reference_solution":""}
-{"id":"smolscript-html-0150","reference_solution":""}
-{"id":"smolscript-html-0152","reference_solution":""}
-{"id":"smolscript-html-0159","reference_solution":""}
{"id":"smolscript-html-0160","reference_solution":""}
-{"id":"smolscript-html-0161","reference_solution":""}
-{"id":"smolscript-html-0163","reference_solution":""}
{"id":"smolscript-html-0164","reference_solution":""}
{"id":"smolscript-html-0165","reference_solution":""}
{"id":"smolscript-html-0166","reference_solution":""}
-{"id":"smolscript-html-0167","reference_solution":""}
{"id":"smolscript-html-0169","reference_solution":""}
{"id":"smolscript-html-0170","reference_solution":""}
-{"id":"smolscript-html-0171","reference_solution":""}
-{"id":"smolscript-html-0176","reference_solution":""}
-{"id":"smolscript-html-0178","reference_solution":""}
-{"id":"smolscript-html-0179","reference_solution":""}
-{"id":"smolscript-html-0182","reference_solution":""}
{"id":"smolscript-html-0184","reference_solution":""}
-{"id":"smolscript-html-0186","reference_solution":""}
{"id":"smolscript-html-0188","reference_solution":""}
-{"id":"smolscript-html-0190","reference_solution":""}
-{"id":"smolscript-html-0192","reference_solution":""}
{"id":"smolscript-html-0195","reference_solution":""}
-{"id":"smolscript-html-0198","reference_solution":""}
-{"id":"smolscript-html-0199","reference_solution":""}
-{"id":"smolscript-html-0200","reference_solution":""}
-{"id":"smolscript-css-0006","reference_solution":"#scope > .target { background-color: rgb(240, 220, 200); }"}
-{"id":"smolscript-css-0007","reference_solution":".target { font-size: 20px; }"}
-{"id":"smolscript-css-0009","reference_solution":"#scope > .target { font-size: 20px; }"}
{"id":"smolscript-css-0010","reference_solution":".target { font-weight: 700; }"}
-{"id":"smolscript-css-0011","reference_solution":"#target { font-weight: 700; }"}
{"id":"smolscript-css-0012","reference_solution":"#scope > .target { font-weight: 700; }"}
{"id":"smolscript-css-0013","reference_solution":".target { font-style: italic; }"}
-{"id":"smolscript-css-0015","reference_solution":"#scope > .target { font-style: italic; }"}
-{"id":"smolscript-css-0019","reference_solution":".target { text-transform: uppercase; }"}
-{"id":"smolscript-css-0020","reference_solution":"#target { text-transform: uppercase; }"}
{"id":"smolscript-css-0021","reference_solution":"#scope > .target { text-transform: uppercase; }"}
-{"id":"smolscript-css-0023","reference_solution":"#target { letter-spacing: 2px; }"}
{"id":"smolscript-css-0026","reference_solution":"#target { word-spacing: 4px; }"}
-{"id":"smolscript-css-0027","reference_solution":"#scope > .target { word-spacing: 4px; }"}
-{"id":"smolscript-css-0028","reference_solution":".target { line-height: 28px; }"}
{"id":"smolscript-css-0030","reference_solution":"#scope > .target { line-height: 28px; }"}
-{"id":"smolscript-css-0035","reference_solution":"#target { white-space: pre; }"}
-{"id":"smolscript-css-0037","reference_solution":".target { padding-top: 8px; }"}
-{"id":"smolscript-css-0039","reference_solution":"#scope > .target { padding-top: 8px; }"}
{"id":"smolscript-css-0041","reference_solution":"#target { padding-right: 10px; }"}
-{"id":"smolscript-css-0042","reference_solution":"#scope > .target { padding-right: 10px; }"}
-{"id":"smolscript-css-0043","reference_solution":".target { padding-bottom: 12px; }"}
-{"id":"smolscript-css-0044","reference_solution":"#target { padding-bottom: 12px; }"}
{"id":"smolscript-css-0046","reference_solution":".target { padding-left: 14px; }"}
-{"id":"smolscript-css-0047","reference_solution":"#target { padding-left: 14px; }"}
-{"id":"smolscript-css-0049","reference_solution":".target { margin-top: 6px; }"}
-{"id":"smolscript-css-0050","reference_solution":"#target { margin-top: 6px; }"}
{"id":"smolscript-css-0054","reference_solution":"#scope > .target { margin-right: 8px; }"}
-{"id":"smolscript-css-0055","reference_solution":".target { margin-bottom: 10px; }"}
{"id":"smolscript-css-0056","reference_solution":"#target { margin-bottom: 10px; }"}
{"id":"smolscript-css-0058","reference_solution":".target { margin-left: 12px; }"}
{"id":"smolscript-css-0060","reference_solution":"#scope > .target { margin-left: 12px; }"}
-{"id":"smolscript-css-0061","reference_solution":".target { border-top-width: 3px; }"}
{"id":"smolscript-css-0062","reference_solution":"#target { border-top-width: 3px; }"}
-{"id":"smolscript-css-0063","reference_solution":"#scope > .target { border-top-width: 3px; }"}
-{"id":"smolscript-css-0066","reference_solution":"#scope > .target { border-bottom-color: rgb(0, 80, 120); }"}
{"id":"smolscript-css-0067","reference_solution":".target { border-radius: 6px; }"}
-{"id":"smolscript-css-0068","reference_solution":"#target { border-radius: 6px; }"}
-{"id":"smolscript-css-0071","reference_solution":"#target { opacity: 0.5; }"}
{"id":"smolscript-css-0072","reference_solution":"#scope > .target { opacity: 0.5; }"}
-{"id":"smolscript-css-0073","reference_solution":".target { width: 120px; }"}
-{"id":"smolscript-css-0074","reference_solution":"#target { width: 120px; }"}
-{"id":"smolscript-css-0076","reference_solution":".target { height: 60px; }"}
-{"id":"smolscript-css-0079","reference_solution":".target { min-width: 90px; }"}
-{"id":"smolscript-css-0086","reference_solution":"#target { box-sizing: border-box; }"}
-{"id":"smolscript-css-0091","reference_solution":".target { flex-direction: column; display: flex; }"}
{"id":"smolscript-css-0095","reference_solution":"#target { justify-content: center; display: flex; }"}
{"id":"smolscript-css-0096","reference_solution":"#scope > .target { justify-content: center; display: flex; }"}
-{"id":"smolscript-css-0102","reference_solution":"#scope > .target { gap: 8px; display: flex; }"}
-{"id":"smolscript-css-0103","reference_solution":".target { position: relative; }"}
{"id":"smolscript-css-0106","reference_solution":".target { top: 5px; position: relative; }"}
{"id":"smolscript-css-0108","reference_solution":"#scope > .target { top: 5px; position: relative; }"}
-{"id":"smolscript-css-0109","reference_solution":".target { overflow-x: hidden; }"}
-{"id":"smolscript-css-0110","reference_solution":"#target { overflow-x: hidden; }"}
{"id":"smolscript-css-0111","reference_solution":"#scope > .target { overflow-x: hidden; }"}
-{"id":"smolscript-css-0112","reference_solution":".target { visibility: hidden; }"}
{"id":"smolscript-css-0113","reference_solution":"#target { visibility: hidden; }"}
-{"id":"smolscript-css-0114","reference_solution":"#scope > .target { visibility: hidden; }"}
-{"id":"smolscript-css-0115","reference_solution":".target { cursor: pointer; }"}
-{"id":"smolscript-css-0120","reference_solution":"#scope > .target { list-style-type: square; }"}
{"id":"smolscript-css-0122","reference_solution":"#scope > .target { color: rgb(10, 20, 30); letter-spacing: 2px; }"}
-{"id":"smolscript-css-0123","reference_solution":"#scope > .target { color: rgb(10, 20, 30); white-space: pre; }"}
{"id":"smolscript-css-0124","reference_solution":"#scope > .target { background-color: rgb(240, 220, 200); text-align: center; }"}
{"id":"smolscript-css-0127","reference_solution":"#scope > .target { font-size: 20px; text-transform: uppercase; }"}
-{"id":"smolscript-css-0133","reference_solution":"#scope > .target { font-style: italic; word-spacing: 4px; }"}
-{"id":"smolscript-css-0135","reference_solution":"#scope > .target { font-style: italic; padding-left: 14px; }"}
{"id":"smolscript-css-0136","reference_solution":"#scope > .target { text-align: center; line-height: 28px; }"}
{"id":"smolscript-css-0138","reference_solution":"#scope > .target { text-align: center; margin-top: 6px; }"}
-{"id":"smolscript-css-0140","reference_solution":"#scope > .target { text-transform: uppercase; padding-right: 10px; }"}
-{"id":"smolscript-css-0143","reference_solution":"#scope > .target { letter-spacing: 2px; padding-bottom: 12px; }"}
-{"id":"smolscript-css-0146","reference_solution":"#scope > .target { word-spacing: 4px; padding-left: 14px; }"}
-{"id":"smolscript-css-0147","reference_solution":"#scope > .target { word-spacing: 4px; margin-left: 12px; }"}
-{"id":"smolscript-css-0149","reference_solution":"#scope > .target { line-height: 28px; margin-top: 6px; }"}
-{"id":"smolscript-css-0153","reference_solution":"#scope > .target { text-indent: 12px; background-color: rgb(240, 220, 200); }"}
-{"id":"smolscript-css-0156","reference_solution":"#scope > .target { white-space: pre; font-size: 20px; }"}
{"id":"smolscript-css-0157","reference_solution":"#scope > .target { padding-top: 8px; margin-top: 6px; }"}
-{"id":"smolscript-css-0158","reference_solution":"#scope > .target { padding-top: 8px; margin-left: 12px; }"}
-{"id":"smolscript-css-0159","reference_solution":"#scope > .target { padding-top: 8px; font-weight: 700; }"}
-{"id":"smolscript-css-0160","reference_solution":"#scope > .target { padding-right: 10px; margin-right: 8px; }"}
-{"id":"smolscript-css-0163","reference_solution":"#scope > .target { padding-bottom: 12px; margin-bottom: 10px; }"}
{"id":"smolscript-css-0165","reference_solution":"#scope > .target { padding-bottom: 12px; text-align: center; }"}
{"id":"smolscript-css-0166","reference_solution":"#scope > .target { padding-left: 14px; margin-left: 12px; }"}
-{"id":"smolscript-css-0168","reference_solution":"#scope > .target { padding-left: 14px; text-transform: uppercase; }"}
-{"id":"smolscript-css-0169","reference_solution":"#scope > .target { margin-top: 6px; color: rgb(10, 20, 30); }"}
-{"id":"smolscript-css-0170","reference_solution":"#scope > .target { margin-top: 6px; font-weight: 700; }"}
-{"id":"smolscript-css-0171","reference_solution":"#scope > .target { margin-top: 6px; letter-spacing: 2px; }"}
-{"id":"smolscript-css-0173","reference_solution":"#scope > .target { margin-right: 8px; font-style: italic; }"}
{"id":"smolscript-css-0176","reference_solution":"#scope > .target { margin-bottom: 10px; text-align: center; }"}
-{"id":"smolscript-css-0178","reference_solution":"#scope > .target { margin-left: 12px; font-weight: 700; }"}
{"id":"smolscript-css-0179","reference_solution":"#scope > .target { margin-left: 12px; text-transform: uppercase; }"}
{"id":"smolscript-css-0181","reference_solution":"@media (max-width: 600px) { #target { color: rgb(10, 20, 30); } }"}
{"id":"smolscript-css-0187","reference_solution":"@media (max-width: 600px) { #target { text-transform: uppercase; } }"}
{"id":"smolscript-css-0189","reference_solution":"@media (max-width: 600px) { #target { word-spacing: 4px; } }"}
-{"id":"smolscript-css-0190","reference_solution":"@media (max-width: 600px) { #target { line-height: 28px; } }"}
-{"id":"smolscript-css-0191","reference_solution":"@media (max-width: 600px) { #target { text-indent: 12px; } }"}
-{"id":"smolscript-css-0195","reference_solution":"@media (max-width: 600px) { #target { padding-bottom: 12px; } }"}
-{"id":"smolscript-css-0196","reference_solution":"@media (max-width: 600px) { #target { padding-left: 14px; } }"}
{"id":"smolscript-css-0197","reference_solution":"@media (max-width: 600px) { #target { margin-top: 6px; } }"}
-{"id":"smolscript-css-0199","reference_solution":"@media (max-width: 600px) { #target { margin-bottom: 10px; } }"}
-{"id":"smolscript-css-0200","reference_solution":"@media (max-width: 600px) { #target { margin-left: 12px; } }"}
-{"id":"smolscript-cpp-0001","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (n + 1);\n return n;\n}\n"}
{"id":"smolscript-cpp-0003","reference_solution":"long long solve(long long n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0007","reference_solution":"long long solve(long long n) {\n n = ((n > 0) ? n : 0);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0008","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'A' && c <= 'Z') ? char(c+32) : c; } s=t; }\n s=s.substr(0,s.size()/2);\n return s;\n}\n"}
-{"id":"smolscript-cpp-0012","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : c; } s=t; }\n std::reverse(s.begin(), s.end());\n return s;\n}\n"}
-{"id":"smolscript-cpp-0013","reference_solution":"long long solve(long long n) {\n n = (-n);\n n = (n * n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0018","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (c != ' ') t += c; } s=t; }\n s=s.substr(s.size()/2);\n return s;\n}\n"}
-{"id":"smolscript-cpp-0020","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (c != ' ' || t.empty() || t.back() != ' ') t += c; } s=t; }\n { std::string t; for (char c : s) { if (std::string(\"aeiouAEIOU\").find(c) == std::string::npos) t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0022","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : c; } s=t; }\n s=s.substr(s.size()/2);\n return s;\n}\n"}
-{"id":"smolscript-cpp-0023","reference_solution":"long long solve(long long n) {\n n = (n * n);\n n = (std::abs(n) % 10);\n return n;\n}\n"}
{"id":"smolscript-cpp-0025","reference_solution":"long long solve(long long n) {\n n = (std::abs(n) % 10);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0029","reference_solution":"long long solve(long long n) {\n n = (n + 1);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0032","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (c >= '0' && c <= '9') t += c; } s=t; }\n s=s.substr(0,s.size()/2);\n return s;\n}\n"}
-{"id":"smolscript-cpp-0033","reference_solution":"long long solve(long long n) {\n n = (-n);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
-{"id":"smolscript-cpp-0035","reference_solution":"long long solve(long long n) {\n n = ((n > 0) ? n : 0);\n n = (n * n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0037","reference_solution":"long long solve(long long n) {\n n = (10 - n);\n n = ((n < 0) ? 1 : 0);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0038","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : c; } s=t; }\n { std::string t; for (char c : s) { if (c >= '0' && c <= '9') t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0040","reference_solution":"std::string solve(std::string s) {\n { auto a=s.find_first_not_of(' '); auto b=s.find_last_not_of(' '); s=a==std::string::npos ? \"\" : s.substr(a,b-a+1); }\n { std::string t; for (char c : s) { if (c != ' ') t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0044","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : c; } s=t; }\n { auto a=s.find_first_not_of(' '); auto b=s.find_last_not_of(' '); s=a==std::string::npos ? \"\" : s.substr(a,b-a+1); }\n return s;\n}\n"}
{"id":"smolscript-cpp-0046","reference_solution":"std::string solve(std::string s) {\n s=s.substr(0,s.size()/2);\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : ((c >= 'A' && c <= 'Z') ? char(c+32) : c); } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0048","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (c != ' ') t += c; } s=t; }\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : ((c >= 'A' && c <= 'Z') ? char(c+32) : c); } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0049","reference_solution":"long long solve(long long n) {\n n = ((n > 0) ? n : 0);\n n = std::abs(n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0050","reference_solution":"std::string solve(std::string s) {\n s=s.substr(s.size()/2);\n { auto a=s.find_first_not_of(' '); auto b=s.find_last_not_of(' '); s=a==std::string::npos ? \"\" : s.substr(a,b-a+1); }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0053","reference_solution":"long long solve(long long n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = (n + 1);\n return n;\n}\n"}
{"id":"smolscript-cpp-0054","reference_solution":"std::string solve(std::string s) {\n s=s.substr(0,s.size()/2);\n { std::string t; for (char c : s) { if (std::string(\"aeiouAEIOU\").find(c) == std::string::npos) t += c; } s=t; }\n return s;\n}\n"}
{"id":"smolscript-cpp-0058","reference_solution":"std::string solve(std::string s) {\n s=s.substr(s.size()/2);\n { std::string t; for (char c : s) { if (c != ' ') t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0059","reference_solution":"long long solve(long long n) {\n n = (10 - n);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
{"id":"smolscript-cpp-0060","reference_solution":"std::string solve(std::string s) {\n s=s.substr(s.size()/2);\n { std::string t; for (char c : s) { if (c >= '0' && c <= '9') t += c; } s=t; }\n return s;\n}\n"}
{"id":"smolscript-cpp-0061","reference_solution":"long long solve(long long n) {\n n = ((n % 2 == 0) ? 1 : 0);\n n = (-n);\n return n;\n}\n"}
{"id":"smolscript-cpp-0062","reference_solution":"std::string solve(std::string s) {\n std::reverse(s.begin(), s.end());\n { auto a=s.find_first_not_of(' '); auto b=s.find_last_not_of(' '); s=a==std::string::npos ? \"\" : s.substr(a,b-a+1); }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0064","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (c >= '0' && c <= '9') t += c; } s=t; }\n s=s.substr(s.size()/2);\n return s;\n}\n"}
{"id":"smolscript-cpp-0065","reference_solution":"long long solve(long long n) {\n n = (n * 2);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0067","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0072","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (std::string(\"aeiouAEIOU\").find(c) == std::string::npos) t += c; } s=t; }\n s=s.substr(s.size()/2);\n return s;\n}\n"}
-{"id":"smolscript-cpp-0073","reference_solution":"long long solve(long long n) {\n n = (-n);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0074","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'A' && c <= 'Z') ? char(c+32) : c; } s=t; }\n std::reverse(s.begin(), s.end());\n return s;\n}\n"}
{"id":"smolscript-cpp-0077","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0078","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (std::string(\"aeiouAEIOU\").find(c) == std::string::npos) t += c; } s=t; }\n { std::string t; for (char c : s) { if (c != ' ' || t.empty() || t.back() != ' ') t += c; } s=t; }\n return s;\n}\n"}
{"id":"smolscript-cpp-0079","reference_solution":"long long solve(long long n) {\n n = (n * n);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
-{"id":"smolscript-cpp-0080","reference_solution":"std::string solve(std::string s) {\n std::reverse(s.begin(), s.end());\n std::reverse(s.begin(), s.end());\n return s;\n}\n"}
-{"id":"smolscript-cpp-0081","reference_solution":"long long solve(long long n) {\n n = ((std::abs(n) / 10) % 10);\n n = (n * n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0082","reference_solution":"std::string solve(std::string s) {\n { auto a=s.find_first_not_of(' '); auto b=s.find_last_not_of(' '); s=a==std::string::npos ? \"\" : s.substr(a,b-a+1); }\n s=s.substr(0,s.size()/2);\n return s;\n}\n"}
{"id":"smolscript-cpp-0084","reference_solution":"std::string solve(std::string s) {\n s=s.substr(s.size()/2);\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : ((c >= 'A' && c <= 'Z') ? char(c+32) : c); } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0085","reference_solution":"long long solve(long long n) {\n n = (n * 2);\n n = std::abs(n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0086","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : c; } s=t; }\n { std::string t; for (char c : s) { if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0087","reference_solution":"long long solve(long long n) {\n n = (n + 1);\n n = ((n < 0) ? 1 : 0);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0089","reference_solution":"long long solve(long long n) {\n n = (std::abs(n) % 10);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
{"id":"smolscript-cpp-0090","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if (std::string(\"aeiouAEIOU\").find(c) == std::string::npos) t += c; } s=t; }\n { std::string t; for (char c : s) { if (c != ' ') t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0093","reference_solution":"long long solve(long long n) {\n n = std::abs(n);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0094","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : c; } s=t; }\n { std::string t; for (char c : s) { if (std::string(\"aeiouAEIOU\").find(c) == std::string::npos) t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0095","reference_solution":"long long solve(long long n) {\n n = (n + 1);\n n = ((n > 0) ? n : 0);\n return n;\n}\n"}
{"id":"smolscript-cpp-0096","reference_solution":"std::string solve(std::string s) {\n s=s.substr(0,s.size()/2);\n std::reverse(s.begin(), s.end());\n return s;\n}\n"}
{"id":"smolscript-cpp-0097","reference_solution":"long long solve(long long n) {\n n = (n * 2);\n n = (n * n);\n return n;\n}\n"}
{"id":"smolscript-cpp-0098","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) t += c; } s=t; }\n { std::string t; for (char c : s) { if (c >= '0' && c <= '9') t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0099","reference_solution":"long long solve(long long n) {\n n = (n * 2);\n n = (n + 1);\n return n;\n}\n"}
{"id":"smolscript-cpp-0100","reference_solution":"std::string solve(std::string s) {\n std::reverse(s.begin(), s.end());\n { std::string t; for (char c : s) { if (c >= '0' && c <= '9') t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0101","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (n * 2);\n return n;\n}\n"}
{"id":"smolscript-cpp-0107","reference_solution":"long long solve(long long n) {\n n = ((std::abs(n) / 10) % 10);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
{"id":"smolscript-cpp-0108","reference_solution":"std::string solve(std::string s) {\n s=s.substr(0,s.size()/2);\n { auto a=s.find_first_not_of(' '); auto b=s.find_last_not_of(' '); s=a==std::string::npos ? \"\" : s.substr(a,b-a+1); }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0111","reference_solution":"long long solve(long long n) {\n n = std::abs(n);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
{"id":"smolscript-cpp-0113","reference_solution":"long long solve(long long n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
{"id":"smolscript-cpp-0115","reference_solution":"long long solve(long long n) {\n n = (10 - n);\n n = (n * 2);\n return n;\n}\n"}
-{"id":"smolscript-cpp-0118","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { t += (c >= 'a' && c <= 'z') ? char(c-32) : c; } s=t; }\n s=s.substr(0,s.size()/2);\n return s;\n}\n"}
{"id":"smolscript-cpp-0121","reference_solution":"long long solve(long long n) {\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n n = (10 - n);\n return n;\n}\n"}
{"id":"smolscript-cpp-0122","reference_solution":"std::string solve(std::string s) {\n { std::string t; for (char c : s) { if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) t += c; } s=t; }\n s=s.substr(0,s.size()/2);\n return s;\n}\n"}
-{"id":"smolscript-cpp-0126","reference_solution":"std::string solve(std::string s) {\n s=s.substr(0,s.size()/2);\n { std::string t; for (char c : s) { if (c != ' ' || t.empty() || t.back() != ' ') t += c; } s=t; }\n return s;\n}\n"}
-{"id":"smolscript-cpp-0132","reference_solution":"std::string solve(std::string s) {\n std::reverse(s.begin(), s.end());\n { std::string t; for (char c : s) { if (c != ' ') t += c; } s=t; }\n return s;\n}\n"}
{"id":"smolscript-cpp-0135","reference_solution":"long long solve(long long n) {\n n = (10 - n);\n n = (std::abs(n) % 10);\n return n;\n}\n"}
{"id":"smolscript-cpp-0136","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
{"id":"smolscript-cpp-0137","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-cpp-0142","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i0) a.push_back(x); }\n int size=(int)a.size();\n long long result=1;\n for(int i=0;i& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i3) a.push_back(x); }\n int size=(int)a.size();\n if(size==0) return 0;\n return a[0];\n}\n"}
{"id":"smolscript-cpp-0149","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
{"id":"smolscript-cpp-0151","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i0) a.push_back(x); }\n int size=(int)a.size();\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-cpp-0153","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;iresult) result=count; }\n return result;\n}\n"}
{"id":"smolscript-cpp-0156","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i3) a.push_back(x); }\n int size=(int)a.size();\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
-{"id":"smolscript-cpp-0157","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
{"id":"smolscript-cpp-0160","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
-{"id":"smolscript-cpp-0164","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i0) a.push_back(x); }\n int size=(int)a.size();\n return size;\n}\n"}
-{"id":"smolscript-cpp-0165","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
{"id":"smolscript-cpp-0168","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-cpp-0169","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i0) a.push_back(x); }\n int size=(int)a.size();\n long long result=0;\n for(int i=0;i& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
-{"id":"smolscript-cpp-0177","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i3) a.push_back(x); }\n int size=(int)a.size();\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-cpp-0181","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
-{"id":"smolscript-cpp-0186","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i0) a.push_back(x); }\n int size=(int)a.size();\n long long result=0;\n for(int i=0;i& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i0) a.push_back(x); }\n int size=(int)a.size();\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
-{"id":"smolscript-cpp-0197","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-cpp-0199","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i0) a.push_back(x); }\n int size=(int)a.size();\n long long result=0;\n for(int i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-cpp-0201","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-cpp-0205","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-cpp-0210","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i 0) ? 1 : ((x < 0) ? -1 : 0))); }\n int size=(int)a.size();\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
-{"id":"smolscript-cpp-0212","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i3) a.push_back(std::abs(x)); }\n int size=(int)a.size();\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
{"id":"smolscript-cpp-0213","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;i 0) ? 1 : ((x < 0) ? -1 : 0))); }\n int size=(int)a.size();\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
-{"id":"smolscript-cpp-0216","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;i& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
{"id":"smolscript-cpp-0220","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
{"id":"smolscript-cpp-0222","reference_solution":"long long solve(const std::vector& values) {\n std::vector a;\n for(size_t i=0;iresult) result=count; }\n return result;\n}\n"}
{"id":"smolscript-c-0001","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-c-0002","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='A' && c<='Z' ? c+32 : c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0008","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='A' && c<='Z' ? c+32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i 5) ? 5 : n));\n return n;\n}\n"}
-{"id":"smolscript-c-0022","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0023","reference_solution":"long long solve(long long n) {\n n = (n * n);\n n = (llabs(n) % 10);\n return n;\n}\n"}
{"id":"smolscript-c-0024","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : (c>='A' && c<='Z' ? c+32 : c); } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0025","reference_solution":"long long solve(long long n) {\n n = (llabs(n) % 10);\n n = (-n);\n return n;\n}\n"}
-{"id":"smolscript-c-0026","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z') || (c>='A' && c<='Z')) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0030","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; int a=0,b=len; while(aa && s[b-1]==' ') b--; for(int i=0;i=a && ia && s[b-1]==' ') b--; for(int i=0;i=a && i='0' && c<='9') t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='0' && c<='9') t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0039","reference_solution":"long long solve(long long n) {\n n = (n * 2);\n n = ((llabs(n) / 10) % 10);\n return n;\n}\n"}
-{"id":"smolscript-c-0041","reference_solution":"long long solve(long long n) {\n n = ((n > 0) ? n : 0);\n n = (llabs(n) % 10);\n return n;\n}\n"}
-{"id":"smolscript-c-0044","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; int a=0,b=len; while(aa && s[b-1]==' ') b--; for(int i=0;i=a && i 0) ? n : 0);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-c-0051","reference_solution":"long long solve(long long n) {\n n = (llabs(n) % 10);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
{"id":"smolscript-c-0057","reference_solution":"long long solve(long long n) {\n n = ((llabs(n) / 10) % 10);\n n = (n * 2);\n return n;\n}\n"}
-{"id":"smolscript-c-0058","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='0' && c<='9') t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0062","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;ia && s[b-1]==' ') b--; for(int i=0;i=a && i='a' && c<='z' ? c-32 : (c>='A' && c<='Z' ? c+32 : c); } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0067","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (10 - n);\n return n;\n}\n"}
{"id":"smolscript-c-0068","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
{"id":"smolscript-c-0073","reference_solution":"long long solve(long long n) {\n n = (-n);\n n = (n + 1);\n return n;\n}\n"}
{"id":"smolscript-c-0075","reference_solution":"long long solve(long long n) {\n n = (10 - n);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
{"id":"smolscript-c-0077","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (-n);\n return n;\n}\n"}
{"id":"smolscript-c-0078","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z') || (c>='A' && c<='Z')) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
{"id":"smolscript-c-0089","reference_solution":"long long solve(long long n) {\n n = (llabs(n) % 10);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
{"id":"smolscript-c-0091","reference_solution":"long long solve(long long n) {\n n = ((llabs(n) / 10) % 10);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-c-0092","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z') || (c>='A' && c<='Z')) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : (c>='A' && c<='Z' ? c+32 : c); } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
{"id":"smolscript-c-0096","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z') || (c>='A' && c<='Z')) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='0' && c<='9') t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0099","reference_solution":"long long solve(long long n) {\n n = (n * 2);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-c-0100","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='0' && c<='9') t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
{"id":"smolscript-c-0101","reference_solution":"long long solve(long long n) {\n n = ((n < 0) ? 1 : 0);\n n = (n * 2);\n return n;\n}\n"}
-{"id":"smolscript-c-0102","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0103","reference_solution":"long long solve(long long n) {\n n = (n + 1);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n"}
-{"id":"smolscript-c-0105","reference_solution":"long long solve(long long n) {\n n = (n + 1);\n n = ((llabs(n) / 10) % 10);\n return n;\n}\n"}
-{"id":"smolscript-c-0107","reference_solution":"long long solve(long long n) {\n n = ((llabs(n) / 10) % 10);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n"}
{"id":"smolscript-c-0108","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;ia && s[b-1]==' ') b--; for(int i=0;i=a && i='A' && c<='Z' ? c+32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;ia && s[b-1]==' ') b--; for(int i=0;i=a && i='a' && c<='z') || (c>='A' && c<='Z')) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
{"id":"smolscript-c-0117","reference_solution":"long long solve(long long n) {\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n n = ((n % 2 == 0) ? 1 : 0);\n return n;\n}\n"}
-{"id":"smolscript-c-0118","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z' ? c-32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i 5) ? 5 : n));\n return n;\n}\n"}
-{"id":"smolscript-c-0124","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z') || (c>='A' && c<='Z')) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i='a' && c<='z') || (c>='A' && c<='Z')) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
{"id":"smolscript-c-0130","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i='A' && c<='Z' ? c+32 : c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i 0) ? 1 : ((n < 0) ? -1 : 0));\n n = (n * 2);\n return n;\n}\n"}
{"id":"smolscript-c-0134","reference_solution":"const char *solve(const char *input) {\n static char s[512]; char t[512]; strcpy(s,input);\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n { int len=(int)strlen(s), j=0; for(int i=0;i=len/2) t[j++]=c; } t[j]=0; strcpy(s,t); }\n return s;\n}\n"}
-{"id":"smolscript-c-0139","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-c-0143","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i3) a[size++]=x; }\n if(size==0) return 0;\n return a[0];\n}\n"}
{"id":"smolscript-c-0148","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i0) a[size++]=x; }\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-c-0153","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-c-0156","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i3) a[size++]=x; }\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
-{"id":"smolscript-c-0161","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-c-0169","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i0) a[size++]=x; }\n long long result=0;\n for(int i=0;i3) a[size++]=x; }\n long long result=0;\n for(int i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
-{"id":"smolscript-c-0183","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-c-0185","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-c-0187","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-c-0193","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
{"id":"smolscript-c-0194","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i0) a[size++]=x; }\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
-{"id":"smolscript-c-0198","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
-{"id":"smolscript-c-0202","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i0) a[size++]=x; }\n if(size==0) return 0;\n return a[0];\n}\n"}
-{"id":"smolscript-c-0203","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-c-0204","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-c-0205","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;iresult) result=count; }\n return result;\n}\n"}
-{"id":"smolscript-c-0208","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i 0) ? 1 : ((x < 0) ? -1 : 0)); }\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi-lo;\n}\n"}
-{"id":"smolscript-c-0210","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i 0) ? 1 : ((x < 0) ? -1 : 0)); }\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return lo;\n}\n"}
-{"id":"smolscript-c-0214","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i0) a[size++]=(x * x); }\n if(size==0) return 0;\n return a[0];\n}\n"}
-{"id":"smolscript-c-0215","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i 0) ? 1 : ((x < 0) ? -1 : 0)); }\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
{"id":"smolscript-c-0217","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i 0) ? 1 : ((x < 0) ? -1 : 0)); }\n long long result=0;\n for(int i=0;i0) a[size++]=(x * 2); }\n if(size==0) return 0;\n long long lo=a[0],hi=a[0];\n for(int i=0;ihi) hi=a[i]; }\n return hi;\n}\n"}
{"id":"smolscript-c-0223","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;iresult) result=count; }\n return result;\n}\n"}
{"id":"smolscript-c-0224","reference_solution":"long long solve(const long long *values, int length) {\n long long a[64]; int size=0;\n for(int i=0;i 0) and n or 0)\n return n\nend\n"}
{"id":"smolscript-lua-0015","reference_solution":"function solve(n)\n n = (n * 2)\n n = (math.abs(n) % 10)\n return n\nend\n"}
{"id":"smolscript-lua-0016","reference_solution":"function solve(s)\n s = (s:gsub(\" +\", \" \"))\n s = (s:gsub(\" +\", \" \"))\n return s\nend\n"}
{"id":"smolscript-lua-0019","reference_solution":"function solve(n)\n n = (-n)\n n = ((n < -5) and -5 or ((n > 5) and 5 or n))\n return n\nend\n"}
-{"id":"smolscript-lua-0020","reference_solution":"function solve(s)\n s = (s:gsub(\" +\", \" \"))\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0024","reference_solution":"function solve(s)\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n s = (s:gsub(\"%a\", function(c) if c == c:upper() then return c:lower() else return c:upper() end end))\n return s\nend\n"}
-{"id":"smolscript-lua-0026","reference_solution":"function solve(s)\n s = (s:gsub(\"[^a-zA-Z]\", \"\"))\n s = s:sub(math.floor(#s/2)+1)\n return s\nend\n"}
-{"id":"smolscript-lua-0027","reference_solution":"function solve(n)\n n = (math.floor(math.abs(n) / 10) % 10)\n n = (-n)\n return n\nend\n"}
-{"id":"smolscript-lua-0030","reference_solution":"function solve(s)\n s = (s:gsub(\"^ +\", \"\"):gsub(\" +$\", \"\"))\n s = (s:gsub(\"^ +\", \"\"):gsub(\" +$\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0036","reference_solution":"function solve(s)\n s = s:sub(math.floor(#s/2)+1)\n s = (s:gsub(\" +\", \" \"))\n return s\nend\n"}
-{"id":"smolscript-lua-0037","reference_solution":"function solve(n)\n n = (10 - n)\n n = ((n < 0) and 1 or 0)\n return n\nend\n"}
{"id":"smolscript-lua-0039","reference_solution":"function solve(n)\n n = (n * 2)\n n = (math.floor(math.abs(n) / 10) % 10)\n return n\nend\n"}
{"id":"smolscript-lua-0042","reference_solution":"function solve(s)\n s = string.lower(s)\n s = s:sub(math.floor(#s/2)+1)\n return s\nend\n"}
-{"id":"smolscript-lua-0045","reference_solution":"function solve(n)\n n = ((n > 0) and n or 0)\n n = (n + 1)\n return n\nend\n"}
-{"id":"smolscript-lua-0046","reference_solution":"function solve(s)\n s = s:sub(1, math.floor(#s/2))\n s = (s:gsub(\"%a\", function(c) if c == c:upper() then return c:lower() else return c:upper() end end))\n return s\nend\n"}
-{"id":"smolscript-lua-0053","reference_solution":"function solve(n)\n n = ((n < -5) and -5 or ((n > 5) and 5 or n))\n n = (n + 1)\n return n\nend\n"}
-{"id":"smolscript-lua-0054","reference_solution":"function solve(s)\n s = s:sub(1, math.floor(#s/2))\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0055","reference_solution":"function solve(n)\n n = (-n)\n n = (-n)\n return n\nend\n"}
{"id":"smolscript-lua-0056","reference_solution":"function solve(s)\n s = s:sub(1, math.floor(#s/2))\n s = s:sub(math.floor(#s/2)+1)\n return s\nend\n"}
-{"id":"smolscript-lua-0057","reference_solution":"function solve(n)\n n = (math.floor(math.abs(n) / 10) % 10)\n n = (n * 2)\n return n\nend\n"}
-{"id":"smolscript-lua-0061","reference_solution":"function solve(n)\n n = ((n % 2 == 0) and 1 or 0)\n n = (-n)\n return n\nend\n"}
-{"id":"smolscript-lua-0062","reference_solution":"function solve(s)\n s = string.reverse(s)\n s = (s:gsub(\"^ +\", \"\"):gsub(\" +$\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0063","reference_solution":"function solve(n)\n n = (-n)\n n = ((n % 2 == 0) and 1 or 0)\n return n\nend\n"}
{"id":"smolscript-lua-0064","reference_solution":"function solve(s)\n s = (s:gsub(\"[^0-9]\", \"\"))\n s = s:sub(math.floor(#s/2)+1)\n return s\nend\n"}
-{"id":"smolscript-lua-0065","reference_solution":"function solve(n)\n n = (n * 2)\n n = (10 - n)\n return n\nend\n"}
-{"id":"smolscript-lua-0067","reference_solution":"function solve(n)\n n = ((n < 0) and 1 or 0)\n n = (10 - n)\n return n\nend\n"}
-{"id":"smolscript-lua-0069","reference_solution":"function solve(n)\n n = ((n % 2 == 0) and 1 or 0)\n n = (10 - n)\n return n\nend\n"}
{"id":"smolscript-lua-0070","reference_solution":"function solve(s)\n s = (s:gsub(\"^ +\", \"\"):gsub(\" +$\", \"\"))\n s = (s:gsub(\" +\", \" \"))\n return s\nend\n"}
-{"id":"smolscript-lua-0072","reference_solution":"function solve(s)\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n s = s:sub(math.floor(#s/2)+1)\n return s\nend\n"}
{"id":"smolscript-lua-0073","reference_solution":"function solve(n)\n n = (-n)\n n = (n + 1)\n return n\nend\n"}
-{"id":"smolscript-lua-0075","reference_solution":"function solve(n)\n n = (10 - n)\n n = ((n < -5) and -5 or ((n > 5) and 5 or n))\n return n\nend\n"}
{"id":"smolscript-lua-0077","reference_solution":"function solve(n)\n n = ((n < 0) and 1 or 0)\n n = (-n)\n return n\nend\n"}
{"id":"smolscript-lua-0078","reference_solution":"function solve(s)\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n s = (s:gsub(\" +\", \" \"))\n return s\nend\n"}
{"id":"smolscript-lua-0079","reference_solution":"function solve(n)\n n = (n * n)\n n = ((n < -5) and -5 or ((n > 5) and 5 or n))\n return n\nend\n"}
{"id":"smolscript-lua-0080","reference_solution":"function solve(s)\n s = string.reverse(s)\n s = string.reverse(s)\n return s\nend\n"}
-{"id":"smolscript-lua-0081","reference_solution":"function solve(n)\n n = (math.floor(math.abs(n) / 10) % 10)\n n = (n * n)\n return n\nend\n"}
-{"id":"smolscript-lua-0082","reference_solution":"function solve(s)\n s = (s:gsub(\"^ +\", \"\"):gsub(\" +$\", \"\"))\n s = s:sub(1, math.floor(#s/2))\n return s\nend\n"}
{"id":"smolscript-lua-0084","reference_solution":"function solve(s)\n s = s:sub(math.floor(#s/2)+1)\n s = (s:gsub(\"%a\", function(c) if c == c:upper() then return c:lower() else return c:upper() end end))\n return s\nend\n"}
-{"id":"smolscript-lua-0086","reference_solution":"function solve(s)\n s = string.upper(s)\n s = (s:gsub(\"[^a-zA-Z]\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0089","reference_solution":"function solve(n)\n n = (math.abs(n) % 10)\n n = ((n > 0) and 1 or ((n < 0) and -1 or 0))\n return n\nend\n"}
{"id":"smolscript-lua-0090","reference_solution":"function solve(s)\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n s = (s:gsub(\" \", \"\"))\n return s\nend\n"}
{"id":"smolscript-lua-0095","reference_solution":"function solve(n)\n n = (n + 1)\n n = ((n > 0) and n or 0)\n return n\nend\n"}
{"id":"smolscript-lua-0097","reference_solution":"function solve(n)\n n = (n * 2)\n n = (n * n)\n return n\nend\n"}
-{"id":"smolscript-lua-0099","reference_solution":"function solve(n)\n n = (n * 2)\n n = (n + 1)\n return n\nend\n"}
-{"id":"smolscript-lua-0100","reference_solution":"function solve(s)\n s = string.reverse(s)\n s = (s:gsub(\"[^0-9]\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0105","reference_solution":"function solve(n)\n n = (n + 1)\n n = (math.floor(math.abs(n) / 10) % 10)\n return n\nend\n"}
-{"id":"smolscript-lua-0106","reference_solution":"function solve(s)\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n s = (s:gsub(\"[aeiouAEIOU]\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0107","reference_solution":"function solve(n)\n n = (math.floor(math.abs(n) / 10) % 10)\n n = ((n > 0) and 1 or ((n < 0) and -1 or 0))\n return n\nend\n"}
-{"id":"smolscript-lua-0112","reference_solution":"function solve(s)\n s = string.lower(s)\n s = (s:gsub(\"[^a-zA-Z]\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0114","reference_solution":"function solve(s)\n s = string.lower(s)\n s = (s:gsub(\" \", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0116","reference_solution":"function solve(s)\n s = (s:gsub(\"^ +\", \"\"):gsub(\" +$\", \"\"))\n s = (s:gsub(\"[^a-zA-Z]\", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0117","reference_solution":"function solve(n)\n n = ((n > 0) and 1 or ((n < 0) and -1 or 0))\n n = ((n % 2 == 0) and 1 or 0)\n return n\nend\n"}
-{"id":"smolscript-lua-0118","reference_solution":"function solve(s)\n s = string.upper(s)\n s = s:sub(1, math.floor(#s/2))\n return s\nend\n"}
-{"id":"smolscript-lua-0119","reference_solution":"function solve(n)\n n = (-n)\n n = (10 - n)\n return n\nend\n"}
-{"id":"smolscript-lua-0120","reference_solution":"function solve(s)\n s = string.upper(s)\n s = (s:gsub(\" \", \"\"))\n return s\nend\n"}
-{"id":"smolscript-lua-0122","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x<0 then a[#a+1]=x end end\n local counts = {}; local result = 0\n for _,x in ipairs(a) do counts[x]=(counts[x] or 0)+1 end\n for _ in pairs(counts) do result=result+1 end\n return result\nend\n"}
-{"id":"smolscript-lua-0123","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==1 then a[#a+1]=x end end\n if #a==0 then return 0 end\n return a[#a]\nend\n"}
{"id":"smolscript-lua-0125","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x~=0 then a[#a+1]=x end end\n local counts = {}; local result = 0\n for _,x in ipairs(a) do counts[x]=(counts[x] or 0)+1 end\n for _,n in pairs(counts) do result=math.max(result,n) end\n return result\nend\n"}
{"id":"smolscript-lua-0127","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x>0 then a[#a+1]=x end end\n local result = 1\n for _,x in ipairs(a) do result=result * x end\n return result\nend\n"}
-{"id":"smolscript-lua-0128","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x~=0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n return a[#a]\nend\n"}
{"id":"smolscript-lua-0129","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==0 then a[#a+1]=x end end\n local result = 1\n for _,x in ipairs(a) do result=result * x end\n return result\nend\n"}
-{"id":"smolscript-lua-0130","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x~=0 then a[#a+1]=x end end\n return #a\nend\n"}
-{"id":"smolscript-lua-0135","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if true then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return lo\nend\n"}
{"id":"smolscript-lua-0139","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x~=0 then a[#a+1]=x end end\n local result = 1\n for _,x in ipairs(a) do result=result * x end\n return result\nend\n"}
-{"id":"smolscript-lua-0140","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if math.abs(x)<=3 then a[#a+1]=x end end\n local counts = {}; local result = 0\n for _,x in ipairs(a) do counts[x]=(counts[x] or 0)+1 end\n for _,n in pairs(counts) do result=math.max(result,n) end\n return result\nend\n"}
-{"id":"smolscript-lua-0141","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if math.abs(x)>3 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return lo\nend\n"}
-{"id":"smolscript-lua-0142","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x%2~=0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi\nend\n"}
{"id":"smolscript-lua-0143","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==1 then a[#a+1]=x end end\n return #a\nend\n"}
-{"id":"smolscript-lua-0144","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x<0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return lo\nend\n"}
{"id":"smolscript-lua-0145","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x~=0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return lo\nend\n"}
{"id":"smolscript-lua-0151","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==1 then a[#a+1]=x end end\n local result = 1\n for _,x in ipairs(a) do result=result * x end\n return result\nend\n"}
-{"id":"smolscript-lua-0152","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x%2~=0 then a[#a+1]=x end end\n local result = 0\n for _,x in ipairs(a) do result=result + x end\n return result\nend\n"}
-{"id":"smolscript-lua-0153","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==1 then a[#a+1]=x end end\n local counts = {}; local result = 0\n for _,x in ipairs(a) do counts[x]=(counts[x] or 0)+1 end\n for _,n in pairs(counts) do result=math.max(result,n) end\n return result\nend\n"}
-{"id":"smolscript-lua-0155","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return lo\nend\n"}
{"id":"smolscript-lua-0158","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==1 then a[#a+1]=x end end\n local result = 0\n for _,x in ipairs(a) do result=result + x end\n return result\nend\n"}
{"id":"smolscript-lua-0159","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x%2==0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi-lo\nend\n"}
-{"id":"smolscript-lua-0162","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n return a[#a]\nend\n"}
-{"id":"smolscript-lua-0164","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if math.abs(x)>3 then a[#a+1]=x end end\n local counts = {}; local result = 0\n for _,x in ipairs(a) do counts[x]=(counts[x] or 0)+1 end\n for _ in pairs(counts) do result=result+1 end\n return result\nend\n"}
-{"id":"smolscript-lua-0165","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x<0 then a[#a+1]=x end end\n local result = 0\n for _,x in ipairs(a) do result=result + x end\n return result\nend\n"}
{"id":"smolscript-lua-0167","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if true then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi\nend\n"}
-{"id":"smolscript-lua-0168","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x~=0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi-lo\nend\n"}
-{"id":"smolscript-lua-0169","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x%2==0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return lo\nend\n"}
{"id":"smolscript-lua-0173","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x%2~=0 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi-lo\nend\n"}
-{"id":"smolscript-lua-0174","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x<0 then a[#a+1]=x end end\n local result = 1\n for _,x in ipairs(a) do result=result * x end\n return result\nend\n"}
-{"id":"smolscript-lua-0177","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if math.abs(x)<=3 then a[#a+1]=x end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi-lo\nend\n"}
{"id":"smolscript-lua-0181","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==1 then a[#a+1]=(x * 2) end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi-lo\nend\n"}
{"id":"smolscript-lua-0183","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if math.abs(x)<=3 then a[#a+1]=((x > 0) and 1 or ((x < 0) and -1 or 0)) end end\n local counts = {}; local result = 0\n for _,x in ipairs(a) do counts[x]=(counts[x] or 0)+1 end\n for _ in pairs(counts) do result=result+1 end\n return result\nend\n"}
-{"id":"smolscript-lua-0186","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x>0 then a[#a+1]=(-x) end end\n if #a==0 then return 0 end\n return a[1]\nend\n"}
-{"id":"smolscript-lua-0188","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==0 then a[#a+1]=(x * 2) end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi\nend\n"}
-{"id":"smolscript-lua-0191","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x>0 then a[#a+1]=(x * x) end end\n if #a==0 then return 0 end\n return a[1]\nend\n"}
-{"id":"smolscript-lua-0192","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if true then a[#a+1]=((x > 0) and 1 or ((x < 0) and -1 or 0)) end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi\nend\n"}
-{"id":"smolscript-lua-0193","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if i%2==0 then a[#a+1]=(-x) end end\n local result = 0\n for _,x in ipairs(a) do result=result + x end\n return result\nend\n"}
-{"id":"smolscript-lua-0195","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if x<0 then a[#a+1]=(-x) end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi\nend\n"}
{"id":"smolscript-lua-0196","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if math.abs(x)<=3 then a[#a+1]=math.abs(x) end end\n if #a==0 then return 0 end\n local lo,hi=a[1],a[1]\n for _,x in ipairs(a) do lo=math.min(lo,x); hi=math.max(hi,x) end\n return hi\nend\n"}
-{"id":"smolscript-lua-0199","reference_solution":"function solve(values)\n local a = {}\n for k,x in ipairs(values) do local i=k-1; if true then a[#a+1]=(x * x) end end\n local counts = {}; local result = 0\n for _,x in ipairs(a) do counts[x]=(counts[x] or 0)+1 end\n for _,n in pairs(counts) do result=math.max(result,n) end\n return result\nend\n"}
{"id":"smolscript-csharp-0003","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = (10 - n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0004","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToLowerInvariant();\n s = s.Trim(' ');\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0005","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (10 - n);\n n = (n * n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0006","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(s.Length/2);\n s = s.Substring(0, s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0007","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n > 0) ? n : 0);\n n = (10 - n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0008","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToLowerInvariant();\n s = s.Substring(0, s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0009","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = (n * 2);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0010","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = System.Text.RegularExpressions.Regex.Replace(s, \" +\", \" \");\n s = s.Substring(0, s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0012","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToUpperInvariant();\n s = new string(s.Reverse().ToArray());\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0013","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (-n);\n n = (n * n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0018","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Replace(\" \", \"\");\n s = s.Substring(s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0019","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (-n);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0021","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n % 2 == 0) ? 1 : 0);\n n = (n + 1);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0023","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n * n);\n n = (Math.Abs(n) % 10);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0024","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Where(c => !\"aeiouAEIOU\".Contains(c)).ToArray());\n s = new string(s.Select(c => char.IsUpper(c) ? char.ToLowerInvariant(c) : char.ToUpperInvariant(c)).ToArray());\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0025","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (Math.Abs(n) % 10);\n n = (-n);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0028","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(0, s.Length/2);\n s = new string(s.Where(c => (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')).ToArray());\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0032","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Where(c => c >= '0' && c <= '9').ToArray());\n s = s.Substring(0, s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0033","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (-n);\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0034","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Where(c => !\"aeiouAEIOU\".Contains(c)).ToArray());\n s = s.Substring(0, s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0039","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n * 2);\n n = ((Math.Abs(n) / 10) % 10);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0040","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Trim(' ');\n s = s.Replace(\" \", \"\");\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0041","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n > 0) ? n : 0);\n n = (Math.Abs(n) % 10);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0042","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToLowerInvariant();\n s = s.Substring(s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0047","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n % 2 == 0) ? 1 : 0);\n n = (n * 2);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0051","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (Math.Abs(n) % 10);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0052","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Where(c => !\"aeiouAEIOU\".Contains(c)).ToArray());\n s = s.Trim(' ');\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0053","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = (n + 1);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0056","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(0, s.Length/2);\n s = s.Substring(s.Length/2);\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0057","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((Math.Abs(n) / 10) % 10);\n n = (n * 2);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0065","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n * 2);\n n = (10 - n);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0068","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToUpperInvariant();\n s = System.Text.RegularExpressions.Regex.Replace(s, \" +\", \" \");\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0070","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Trim(' ');\n s = System.Text.RegularExpressions.Regex.Replace(s, \" +\", \" \");\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0073","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (-n);\n n = (n + 1);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0075","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (10 - n);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0076","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(s.Length/2);\n s = new string(s.Where(c => (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')).ToArray());\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0078","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Where(c => !\"aeiouAEIOU\".Contains(c)).ToArray());\n s = System.Text.RegularExpressions.Regex.Replace(s, \" +\", \" \");\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0080","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Reverse().ToArray());\n s = new string(s.Reverse().ToArray());\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0081","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((Math.Abs(n) / 10) % 10);\n n = (n * n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0082","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Trim(' ');\n s = s.Substring(0, s.Length/2);\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0084","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(s.Length/2);\n s = new string(s.Select(c => char.IsUpper(c) ? char.ToLowerInvariant(c) : char.ToUpperInvariant(c)).ToArray());\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0085","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n * 2);\n n = Math.Abs(n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0086","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToUpperInvariant();\n s = new string(s.Where(c => (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')).ToArray());\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0087","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n + 1);\n n = ((n < 0) ? 1 : 0);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0090","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Where(c => !\"aeiouAEIOU\".Contains(c)).ToArray());\n s = s.Replace(\" \", \"\");\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0093","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = Math.Abs(n);\n n = (10 - n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0097","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n * 2);\n n = (n * n);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0099","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n * 2);\n n = (n + 1);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0101","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n < 0) ? 1 : 0);\n n = (n * 2);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0103","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n + 1);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0105","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n + 1);\n n = ((Math.Abs(n) / 10) % 10);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0108","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(0, s.Length/2);\n s = s.Trim(' ');\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0112","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToLowerInvariant();\n s = new string(s.Where(c => (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')).ToArray());\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0113","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0114","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToLowerInvariant();\n s = s.Replace(\" \", \"\");\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0116","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Trim(' ');\n s = new string(s.Where(c => (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')).ToArray());\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0117","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((n > 0) ? 1 : ((n < 0) ? -1 : 0));\n n = ((n % 2 == 0) ? 1 : 0);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0119","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (-n);\n n = (10 - n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0120","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.ToUpperInvariant();\n s = s.Replace(\" \", \"\");\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0122","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Where(c => (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')).ToArray());\n s = s.Substring(0, s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0123","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = ((Math.Abs(n) / 10) % 10);\n n = ((n < -5) ? -5 : ((n > 5) ? 5 : n));\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0125","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (n + 1);\n n = (-n);\n return n;\n}\n}\n"}
-{"id":"smolscript-csharp-0126","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(0, s.Length/2);\n s = System.Text.RegularExpressions.Regex.Replace(s, \" +\", \" \");\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0128","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Reverse().ToArray());\n s = new string(s.Where(c => (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')).ToArray());\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0129","reference_solution":"public class Solution {\npublic static long Solve(long n) {\n n = (Math.Abs(n) % 10);\n n = (n * 2);\n return n;\n}\n}\n"}
{"id":"smolscript-csharp-0132","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = new string(s.Reverse().ToArray());\n s = s.Replace(\" \", \"\");\n return s;\n}\n}\n"}
{"id":"smolscript-csharp-0134","reference_solution":"public class Solution {\npublic static string Solve(string s) {\n s = s.Substring(s.Length/2);\n s = s.Substring(s.Length/2);\n return s;\n}\n}\n"}
-{"id":"smolscript-csharp-0136","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2!=0).Select(x => x).ToList();\n return a.Count>0 ? a.Min() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0139","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)<=3).Select(x => x).ToList();\n return a.Sum();\n}\n}\n"}
{"id":"smolscript-csharp-0143","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x!=0).Select(x => x).ToList();\n return a.Count>0 ? a[a.Count-1] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0145","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x!=0).Select(x => x).ToList();\n return a.Count;\n}\n}\n"}
-{"id":"smolscript-csharp-0146","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x<0).Select(x => x).ToList();\n return a.Count;\n}\n}\n"}
-{"id":"smolscript-csharp-0148","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2==0).Select(x => x).ToList();\n return a.Sum();\n}\n}\n"}
{"id":"smolscript-csharp-0149","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => true).Select(x => x).ToList();\n return a.Count>0 ? a[a.Count-1] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0155","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)<=3).Select(x => x).ToList();\n return a.Count>0 ? a.GroupBy(x=>x).Max(g=>g.Count()) : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0156","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)>3).Select(x => x).ToList();\n return a.Count>0 ? a.Min() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0157","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2!=0).Select(x => x).ToList();\n return a.Count>0 ? a.Max() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0158","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==1).Select(x => x).ToList();\n return a.Count;\n}\n}\n"}
-{"id":"smolscript-csharp-0159","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x<0).Select(x => x).ToList();\n return a.Count>0 ? a.Min() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0165","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==1).Select(x => x).ToList();\n return a.Count>0 ? a.Max()-a.Min() : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0166","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==1).Select(x => x).ToList();\n return a.Aggregate(1L,(s,x)=>s*x);\n}\n}\n"}
-{"id":"smolscript-csharp-0167","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2!=0).Select(x => x).ToList();\n return a.Sum();\n}\n}\n"}
-{"id":"smolscript-csharp-0169","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2==0).Select(x => x).ToList();\n return a.Count>0 ? a[a.Count-1] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0172","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2==0).Select(x => x).ToList();\n return a.Count>0 ? a.GroupBy(x=>x).Max(g=>g.Count()) : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0173","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==1).Select(x => x).ToList();\n return a.Sum();\n}\n}\n"}
-{"id":"smolscript-csharp-0174","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2==0).Select(x => x).ToList();\n return a.Count>0 ? a.Max()-a.Min() : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0175","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x>0).Select(x => x).ToList();\n return a.Distinct().Count();\n}\n}\n"}
{"id":"smolscript-csharp-0176","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)<=3).Select(x => x).ToList();\n return a.Count>0 ? a.Max() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0178","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)>3).Select(x => x).ToList();\n return a.Count>0 ? a.Max()-a.Min() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0179","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)>3).Select(x => x).ToList();\n return a.Distinct().Count();\n}\n}\n"}
-{"id":"smolscript-csharp-0180","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x<0).Select(x => x).ToList();\n return a.Sum();\n}\n}\n"}
{"id":"smolscript-csharp-0181","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==0).Select(x => x).ToList();\n return a.Distinct().Count();\n}\n}\n"}
{"id":"smolscript-csharp-0182","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => true).Select(x => x).ToList();\n return a.Count>0 ? a.Max() : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0185","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x%2!=0).Select(x => x).ToList();\n return a.Count>0 ? a.GroupBy(x=>x).Max(g=>g.Count()) : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0187","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => true).Select(x => x).ToList();\n return a.Count>0 ? a[0] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0190","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)<=3).Select(x => x).ToList();\n return a.Count>0 ? a[0] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0192","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)<=3).Select(x => x).ToList();\n return a.Count>0 ? a.Max()-a.Min() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0195","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==0).Select(x => x).ToList();\n return a.Count>0 ? a.GroupBy(x=>x).Max(g=>g.Count()) : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0197","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => true).Select(x => x).ToList();\n return a.Count>0 ? a.Max()-a.Min() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0201","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x<0).Select(x => x).ToList();\n return a.Count>0 ? a[0] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0202","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x>0).Select(x => x).ToList();\n return a.Count>0 ? a[0] : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0204","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x!=0).Select(x => (x * x)).ToList();\n return a.Sum();\n}\n}\n"}
{"id":"smolscript-csharp-0205","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => Math.Abs(x)<=3).Select(x => ((x > 0) ? 1 : ((x < 0) ? -1 : 0))).ToList();\n return a.Distinct().Count();\n}\n}\n"}
-{"id":"smolscript-csharp-0209","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x<0).Select(x => ((x > 0) ? 1 : ((x < 0) ? -1 : 0))).ToList();\n return a.Count>0 ? a.Min() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0210","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==0).Select(x => (x * 2)).ToList();\n return a.Count>0 ? a.Max() : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0212","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => true).Select(x => (x + 1)).ToList();\n return a.Count>0 ? a[0] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0213","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x>0).Select(x => (x * x)).ToList();\n return a.Count>0 ? a[0] : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0215","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => i%2==0).Select(x => (-x)).ToList();\n return a.Sum();\n}\n}\n"}
{"id":"smolscript-csharp-0216","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x!=0).Select(x => ((x > 0) ? 1 : ((x < 0) ? -1 : 0))).ToList();\n return a.Sum();\n}\n}\n"}
-{"id":"smolscript-csharp-0217","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x<0).Select(x => (-x)).ToList();\n return a.Count>0 ? a.Max() : 0;\n}\n}\n"}
{"id":"smolscript-csharp-0222","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x!=0).Select(x => Math.Abs(x)).ToList();\n return a.Count>0 ? a.GroupBy(x=>x).Max(g=>g.Count()) : 0;\n}\n}\n"}
-{"id":"smolscript-csharp-0224","reference_solution":"public class Solution {\npublic static long Solve(long[] values) {\n var a = values.Where((x,i) => x<0).Select(x => Math.Abs(x)).ToList();\n return a.Count>0 ? a.GroupBy(x=>x).Max(g=>g.Count()) : 0;\n}\n}\n"}
{"id":"smolscript-rust-0002","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_uppercase();\n s = s.to_ascii_lowercase();\n return s;\n}\n"}
{"id":"smolscript-rust-0003","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n < -5 { -5 } else { (if n > 5 { 5 } else { n }) });\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-rust-0005","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (10 - n);\n n = (n * n);\n return n;\n}\n"}
{"id":"smolscript-rust-0006","reference_solution":"fn solve(mut s: String) -> String {\n s = s[s.len()/2..].to_string();\n s = s[..s.len()/2].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0007","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n > 0 { n } else { 0 });\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-rust-0008","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_lowercase();\n s = s[..s.len()/2].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0014","reference_solution":"fn solve(mut s: String) -> String {\n s = s[s.len()/2..].to_string();\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n return s;\n}\n"}
{"id":"smolscript-rust-0015","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n * 2);\n n = ((n).abs() % 10);\n return n;\n}\n"}
-{"id":"smolscript-rust-0016","reference_solution":"fn solve(mut s: String) -> String {\n s = { let mut t=String::new(); for c in s.chars() { if c != ' ' || !t.ends_with(' ') { t.push(c); } } t };\n s = { let mut t=String::new(); for c in s.chars() { if c != ' ' || !t.ends_with(' ') { t.push(c); } } t };\n return s;\n}\n"}
{"id":"smolscript-rust-0017","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n).abs();\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-rust-0019","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (-n);\n n = (if n < -5 { -5 } else { (if n > 5 { 5 } else { n }) });\n return n;\n}\n"}
-{"id":"smolscript-rust-0021","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n % 2 == 0 { 1 } else { 0 });\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-rust-0022","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_uppercase();\n s = s[s.len()/2..].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0023","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n * n);\n n = ((n).abs() % 10);\n return n;\n}\n"}
{"id":"smolscript-rust-0029","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n + 1);\n n = (10 - n);\n return n;\n}\n"}
{"id":"smolscript-rust-0030","reference_solution":"fn solve(mut s: String) -> String {\n s = s.trim_matches(' ').to_string();\n s = s.trim_matches(' ').to_string();\n return s;\n}\n"}
{"id":"smolscript-rust-0031","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n + 1);\n n = (if n % 2 == 0 { 1 } else { 0 });\n return n;\n}\n"}
-{"id":"smolscript-rust-0032","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| c.is_ascii_digit()).collect();\n s = s[..s.len()/2].to_string();\n return s;\n}\n"}
{"id":"smolscript-rust-0033","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (-n);\n n = (if n > 0 { 1 } else { (if n < 0 { -1 } else { 0 }) });\n return n;\n}\n"}
-{"id":"smolscript-rust-0034","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n s = s[..s.len()/2].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0040","reference_solution":"fn solve(mut s: String) -> String {\n s = s.trim_matches(' ').to_string();\n s = s.replace(' ', \"\");\n return s;\n}\n"}
-{"id":"smolscript-rust-0041","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n > 0 { n } else { 0 });\n n = ((n).abs() % 10);\n return n;\n}\n"}
-{"id":"smolscript-rust-0044","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_uppercase();\n s = s.trim_matches(' ').to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0045","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n > 0 { n } else { 0 });\n n = (n + 1);\n return n;\n}\n"}
{"id":"smolscript-rust-0046","reference_solution":"fn solve(mut s: String) -> String {\n s = s[..s.len()/2].to_string();\n s = s.chars().map(|c| if c.is_ascii_uppercase() { c.to_ascii_lowercase() } else { c.to_ascii_uppercase() }).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0047","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n % 2 == 0 { 1 } else { 0 });\n n = (n * 2);\n return n;\n}\n"}
-{"id":"smolscript-rust-0050","reference_solution":"fn solve(mut s: String) -> String {\n s = s[s.len()/2..].to_string();\n s = s.trim_matches(' ').to_string();\n return s;\n}\n"}
{"id":"smolscript-rust-0051","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = ((n).abs() % 10);\n n = (if n < -5 { -5 } else { (if n > 5 { 5 } else { n }) });\n return n;\n}\n"}
-{"id":"smolscript-rust-0052","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n s = s.trim_matches(' ').to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0054","reference_solution":"fn solve(mut s: String) -> String {\n s = s[..s.len()/2].to_string();\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0055","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (-n);\n n = (-n);\n return n;\n}\n"}
{"id":"smolscript-rust-0056","reference_solution":"fn solve(mut s: String) -> String {\n s = s[..s.len()/2].to_string();\n s = s[s.len()/2..].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0057","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (((n).abs() / 10) % 10);\n n = (n * 2);\n return n;\n}\n"}
-{"id":"smolscript-rust-0059","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (10 - n);\n n = (if n > 0 { 1 } else { (if n < 0 { -1 } else { 0 }) });\n return n;\n}\n"}
{"id":"smolscript-rust-0060","reference_solution":"fn solve(mut s: String) -> String {\n s = s[s.len()/2..].to_string();\n s = s.chars().filter(|c| c.is_ascii_digit()).collect();\n return s;\n}\n"}
{"id":"smolscript-rust-0063","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (-n);\n n = (if n % 2 == 0 { 1 } else { 0 });\n return n;\n}\n"}
-{"id":"smolscript-rust-0065","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n * 2);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-rust-0069","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n % 2 == 0 { 1 } else { 0 });\n n = (10 - n);\n return n;\n}\n"}
{"id":"smolscript-rust-0070","reference_solution":"fn solve(mut s: String) -> String {\n s = s.trim_matches(' ').to_string();\n s = { let mut t=String::new(); for c in s.chars() { if c != ' ' || !t.ends_with(' ') { t.push(c); } } t };\n return s;\n}\n"}
-{"id":"smolscript-rust-0071","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (10 - n);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-rust-0073","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (-n);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-rust-0078","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n s = { let mut t=String::new(); for c in s.chars() { if c != ' ' || !t.ends_with(' ') { t.push(c); } } t };\n return s;\n}\n"}
-{"id":"smolscript-rust-0082","reference_solution":"fn solve(mut s: String) -> String {\n s = s.trim_matches(' ').to_string();\n s = s[..s.len()/2].to_string();\n return s;\n}\n"}
{"id":"smolscript-rust-0083","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n * n);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-rust-0087","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n + 1);\n n = (if n < 0 { 1 } else { 0 });\n return n;\n}\n"}
-{"id":"smolscript-rust-0089","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = ((n).abs() % 10);\n n = (if n > 0 { 1 } else { (if n < 0 { -1 } else { 0 }) });\n return n;\n}\n"}
-{"id":"smolscript-rust-0090","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n s = s.replace(' ', \"\");\n return s;\n}\n"}
{"id":"smolscript-rust-0091","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (((n).abs() / 10) % 10);\n n = (10 - n);\n return n;\n}\n"}
-{"id":"smolscript-rust-0092","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| c.is_ascii_alphabetic()).collect();\n s = s.chars().map(|c| if c.is_ascii_uppercase() { c.to_ascii_lowercase() } else { c.to_ascii_uppercase() }).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0094","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_uppercase();\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0096","reference_solution":"fn solve(mut s: String) -> String {\n s = s[..s.len()/2].to_string();\n s = s.chars().rev().collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0098","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| c.is_ascii_alphabetic()).collect();\n s = s.chars().filter(|c| c.is_ascii_digit()).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0099","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n * 2);\n n = (n + 1);\n return n;\n}\n"}
-{"id":"smolscript-rust-0101","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n < 0 { 1 } else { 0 });\n n = (n * 2);\n return n;\n}\n"}
-{"id":"smolscript-rust-0102","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().rev().collect();\n s = s[s.len()/2..].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0105","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (n + 1);\n n = (((n).abs() / 10) % 10);\n return n;\n}\n"}
{"id":"smolscript-rust-0106","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n s = s.chars().filter(|c| !\"aeiouAEIOU\".contains(*c)).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0112","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_lowercase();\n s = s.chars().filter(|c| c.is_ascii_alphabetic()).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0113","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n < -5 { -5 } else { (if n > 5 { 5 } else { n }) });\n n = (if n < -5 { -5 } else { (if n > 5 { 5 } else { n }) });\n return n;\n}\n"}
{"id":"smolscript-rust-0115","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (10 - n);\n n = (n * 2);\n return n;\n}\n"}
{"id":"smolscript-rust-0116","reference_solution":"fn solve(mut s: String) -> String {\n s = s.trim_matches(' ').to_string();\n s = s.chars().filter(|c| c.is_ascii_alphabetic()).collect();\n return s;\n}\n"}
-{"id":"smolscript-rust-0118","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_uppercase();\n s = s[..s.len()/2].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0120","reference_solution":"fn solve(mut s: String) -> String {\n s = s.to_ascii_uppercase();\n s = s.replace(' ', \"\");\n return s;\n}\n"}
-{"id":"smolscript-rust-0121","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n > 0 { 1 } else { (if n < 0 { -1 } else { 0 }) });\n n = (10 - n);\n return n;\n}\n"}
{"id":"smolscript-rust-0132","reference_solution":"fn solve(mut s: String) -> String {\n s = s.chars().rev().collect();\n s = s.replace(' ', \"\");\n return s;\n}\n"}
{"id":"smolscript-rust-0133","reference_solution":"fn solve(mut n: i64) -> i64 {\n n = (if n > 0 { 1 } else { (if n < 0 { -1 } else { 0 }) });\n n = (n * 2);\n return n;\n}\n"}
{"id":"smolscript-rust-0134","reference_solution":"fn solve(mut s: String) -> String {\n s = s[s.len()/2..].to_string();\n s = s[s.len()/2..].to_string();\n return s;\n}\n"}
-{"id":"smolscript-rust-0136","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x%2!=0 { a.push(x); } }\n return *a.iter().min().unwrap_or(&0);\n}\n"}
{"id":"smolscript-rust-0138","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if i%2==1 { a.push(x); } }\n return *a.last().unwrap_or(&0);\n}\n"}
-{"id":"smolscript-rust-0140","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x!=0 { a.push(x); } }\n return { let mut counts=std::collections::HashMap::new(); for x in a { *counts.entry(x).or_insert(0i64)+=1; } *counts.values().max().unwrap_or(&0) };\n}\n"}
-{"id":"smolscript-rust-0142","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x>0 { a.push(x); } }\n return a.iter().product();\n}\n"}
-{"id":"smolscript-rust-0143","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x!=0 { a.push(x); } }\n return *a.last().unwrap_or(&0);\n}\n"}
-{"id":"smolscript-rust-0146","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x<0 { a.push(x); } }\n return a.len() as i64;\n}\n"}
{"id":"smolscript-rust-0148","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x%2==0 { a.push(x); } }\n return a.iter().sum();\n}\n"}
-{"id":"smolscript-rust-0150","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if true { a.push(x); } }\n return *a.iter().min().unwrap_or(&0);\n}\n"}
-{"id":"smolscript-rust-0151","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x>0 { a.push(x); } }\n return a.iter().max().unwrap_or(&0)-a.iter().min().unwrap_or(&0);\n}\n"}
{"id":"smolscript-rust-0152","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if i%2==0 { a.push(x); } }\n return a.len() as i64;\n}\n"}
-{"id":"smolscript-rust-0155","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if (x).abs()<=3 { a.push(x); } }\n return { let mut counts=std::collections::HashMap::new(); for x in a { *counts.entry(x).or_insert(0i64)+=1; } *counts.values().max().unwrap_or(&0) };\n}\n"}
-{"id":"smolscript-rust-0156","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if (x).abs()>3 { a.push(x); } }\n return *a.iter().min().unwrap_or(&0);\n}\n"}
{"id":"smolscript-rust-0158","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if i%2==1 { a.push(x); } }\n return a.len() as i64;\n}\n"}
-{"id":"smolscript-rust-0159","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x<0 { a.push(x); } }\n return *a.iter().min().unwrap_or(&0);\n}\n"}
{"id":"smolscript-rust-0160","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x!=0 { a.push(x); } }\n return *a.iter().min().unwrap_or(&0);\n}\n"}
-{"id":"smolscript-rust-0162","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x%2!=0 { a.push(x); } }\n return a.len() as i64;\n}\n"}
-{"id":"smolscript-rust-0164","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x>0 { a.push(x); } }\n return a.len() as i64;\n}\n"}
{"id":"smolscript-rust-0165","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if i%2==1 { a.push(x); } }\n return a.iter().max().unwrap_or(&0)-a.iter().min().unwrap_or(&0);\n}\n"}
-{"id":"smolscript-rust-0167","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x%2!=0 { a.push(x); } }\n return a.iter().sum();\n}\n"}
-{"id":"smolscript-rust-0171","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec = Vec::new();\n for (i, &x) in values.iter().enumerate() { if x<0 { a.push(x); } }\n return *a.last().unwrap_or(&0);\n}\n"}
-{"id":"smolscript-rust-0172","reference_solution":"fn solve(values: Vec) -> i64 {\n let mut a: Vec