problem_id
stringlengths 32
32
| name
stringclasses 1
value | problem
stringlengths 200
14k
| solutions
stringlengths 12
1.12M
| test_cases
stringlengths 37
74M
| difficulty
stringclasses 3
values | language
stringclasses 1
value | source
stringclasses 7
values | num_solutions
int64 12
1.12M
| starter_code
stringlengths 0
956
|
|---|---|---|---|---|---|---|---|---|---|
49ec61bde76bb3007d125da3a90119cc | UNKNOWN | You work in the best consumer electronics corporation, and your boss wants to find out which three products generate the most revenue.
Given 3 lists of the same length like these:
* products: `["Computer", "Cell Phones", "Vacuum Cleaner"]`
* amounts: `[3, 24, 8]`
* prices: `[199, 299, 399]`
return the three product names with the highest revenue (`amount * price`).
**Note**: if multiple products have the same revenue, order them according to their original positions in the input list. | ["def top3(*args):\n return [item[0] for item in sorted(zip(*args), key=lambda x: x[1]*x[2], reverse=True)[:3]]", "import heapq\n\ndef top3(products, amounts, prices):\n items = zip(products, amounts, prices)\n return [product for product, _, _ in heapq.nlargest(3, items, key=lambda item: item[1] * item[2])]", "def top3(products, amounts, prices):\n comparison={}\n topList=[]\n for i in range(len(products)):\n comparison[products[i]] = amounts[i]*prices[i]\n [topList.append(k) for k, v in sorted(comparison.items(), key=lambda x: x[1],reverse=True)]\n return topList[:3]", "top3 = lambda x,y,z: [d[0] for d in sorted(list(zip(x,y,z)), key=lambda w: -w[1]*w[2])[:3]]", "import pandas as pd\ndef top3(products, amounts, prices):\n df = pd.DataFrame({\n 'Product' : products,\n 'Amount' : amounts,\n 'Price' : prices})\n df['Revenue']=df['Amount']*df['Price']\n df.sort_values(by=['Revenue'], ascending=False,inplace=True)\n product_sort = df['Product'].values.tolist()\n return product_sort[0:3]", "def top3(products, amounts, prices):\n result = {products[i]:amounts[i]*prices[i] for i in range(len(products))}\n result = list(sorted(result.items(), key = lambda x: x[1], reverse = True))\n return [i[0] for i in result[:3]]", "def top3(products, amounts, prices):\n productObjects = []\n for p in range(0, len(products)):\n productObjects.append(Product(products[p], amounts[p], prices[p], p))\n top3Products = sorted(productObjects, key = lambda x: x.Revenue, reverse = True)[:3]\n if len(list(p.Revenue for p in top3Products)) != len(list(p.Revenue for p in top3Products)):\n return [x for _,x in zip(products, names)]\n return [p.Name for p in top3Products]\n \nclass Product():\n def __init__(self, name, amount, price, defaultIndex):\n self.Name = name\n self.Revenue = amount * price\n self.DefaultIndex = defaultIndex", "def top3(products, amounts, prices):\n catalog = {n:amounts[i] * prices[i] for i,n in enumerate(products)}\n return sorted(catalog, key=catalog.get, reverse=True)[:3]", "def top3(products, amounts, prices):\n info = {}\n \n for index in range(len(products)):\n info[products[index]] = amounts[index] * prices[index]\n \n return sorted(info, key = lambda n: info[n], reverse = True)[:3]\n", "from operator import itemgetter\n\ndef top3(products, amounts, prices):\n zipped = zip(products, amounts, prices)\n revenues = list((product, amount * price) for product, amount, price in zipped)\n revenues.sort(key = itemgetter(1), reverse=True)\n return [product for product, revenue in revenues][:3]"] | {"fn_name": "top3", "inputs": [[["Computer", "Cell Phones", "Vacuum Cleaner"], [3, 24, 8], [199, 299, 399]], [["Cell Phones", "Vacuum Cleaner", "Computer", "Autos", "Gold", "Fishing Rods", "Lego", " Speakers"], [5, 25, 2, 7, 10, 3, 2, 24], [51, 225, 22, 47, 510, 83, 82, 124]], [["Cell Phones", "Vacuum Cleaner", "Computer", "Autos", "Gold", "Fishing Rods", "Lego", " Speakers"], [0, 12, 24, 17, 19, 23, 120, 8], [9, 24, 29, 31, 51, 8, 120, 14]], [["Speakers", "Games", "Radios", "Drones", "Scooter"], [1, 1, 1, 1, 1], [10, 10, 10, 10, 10]]], "outputs": [[["Cell Phones", "Vacuum Cleaner", "Computer"]], [["Vacuum Cleaner", "Gold", " Speakers"]], [["Lego", "Gold", "Computer"]], [["Speakers", "Games", "Radios"]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,708 |
def top3(products, amounts, prices):
|
b62192cc26894fe4545b345a24ea1fba | UNKNOWN | ### What is simplifying a square root?
If you have a number, like 80, for example, you would start by finding the greatest perfect square divisible by 80. In this case, that's 16. Find the square root of 16, and multiply it by 80 / 16. Answer = 4 √5.
##### The above example:
### Task:
Your job is to write two functions, `simplify`, and `desimplify`, that simplify and desimplify square roots, respectively. (Desimplify isn't a word, but I couldn't come up with a better way to put it.) `simplify` will take an integer and return a string like "x sqrt y", and `desimplify` will take a string like "x sqrt y" and return an integer. For `simplify`, if a square root cannot be simplified, return "sqrt y".
_Do not modify the input._
### Some examples:
```python
simplify(1) #=> "1"
simplify(2) #=> "sqrt 2"
simplify(3) #=> "sqrt 3"
simplify(8) #=> "2 sqrt 2"
simplify(15) #=> "sqrt 15"
simplify(16) #=> "4"
simplify(18) #=> "3 sqrt 2"
simplify(20) #=> "2 sqrt 5"
simplify(24) #=> "2 sqrt 6"
simplify(32) #=> "4 sqrt 2"
desimplify("1") #=> 1
desimplify("sqrt 2") #=> 2
desimplify("sqrt 3") #=> 3
desimplify("2 sqrt 2") #=> 8
desimplify("sqrt 15") #=> 15
desimplify("4") #=> 16
desimplify("3 sqrt 2") #=> 18
desimplify("2 sqrt 5") #=> 20
desimplify("2 sqrt 6") #=> 24
desimplify("4 sqrt 2") #=> 32
```
Also check out my other creations — [Square Roots: Approximation](https://www.codewars.com/kata/square-roots-approximation), [Square and Cubic Factors](https://www.codewars.com/kata/square-and-cubic-factors), [Keep the Order](https://www.codewars.com/kata/keep-the-order), [Naming Files](https://www.codewars.com/kata/naming-files), [Elections: Weighted Average](https://www.codewars.com/kata/elections-weighted-average), [Identify Case](https://www.codewars.com/kata/identify-case), [Split Without Loss](https://www.codewars.com/kata/split-without-loss), [Adding Fractions](https://www.codewars.com/kata/adding-fractions),
[Random Integers](https://www.codewars.com/kata/random-integers), [Implement String#transpose](https://www.codewars.com/kata/implement-string-number-transpose), [Implement Array#transpose!](https://www.codewars.com/kata/implement-array-number-transpose), [Arrays and Procs #1](https://www.codewars.com/kata/arrays-and-procs-number-1), and [Arrays and Procs #2](https://www.codewars.com/kata/arrays-and-procs-number-2). | ["def simplify(n):\n for d in range(int(n ** .5), 0, -1):\n if not n % d ** 2: break\n if d*d == n: return '%d' % d\n elif d == 1: return 'sqrt %d' % n\n else: return '%d sqrt %d' % (d, n // d ** 2)\n\ndef desimplify(s):\n x, _, y = s.partition('sqrt')\n return int(x or '1') ** 2 * int(y or '1')", "def simplify(n):\n sq = next(k for k in range(int(n**0.5), 0, -1) if n % (k*k) == 0)\n rt = n // (sq * sq)\n return str(sq) if rt == 1 else f\"{sq if sq > 1 else ''} sqrt {rt}\".strip()\n\ndef desimplify(s):\n rt, _, sq = (int(n.replace(\"sqrt\", \"\") or 1) for n in s.partition(\"sqrt\"))\n return rt * rt * sq", "def simplify(n):\n div, sq, root = 2, 1, 1\n while div <= n:\n r = 0\n while n % div == 0:\n n //= div\n r += 1\n sq *= div ** (r // 2)\n root *= div ** (r % 2)\n div += 1 + (div != 2)\n return (\n f'{sq}' if root == 1 else\n f'sqrt {root}' if sq == 1 else\n f'{sq} sqrt {root}'\n )\n \ndef desimplify(s):\n xs = ([int(x.strip() or 0) for x in s.split('sqrt')] + [0])[:2]\n return (xs[0] ** 2 * xs[1]) or (xs[0] ** 2 + xs[1])", "def simplify(n):\n d = max(m for m in range(1, int(n**0.5)+1) if m*m <= n and n % (m*m) == 0)\n r = n // (d*d)\n return str(d) if r == 1 else \"sqrt {}\".format(r) if d == 1 else \"{} sqrt {}\".format(d, r)\n\ndef desimplify(s):\n d, r = s.split(\"sqrt\") if \"sqrt\" in s else (s, \"1\")\n d = d if d else \"1\"\n return int(d)*int(d)*int(r)", "from math import sqrt\ndef simplify(n):\n li = [i for i in range(2,n) if n%i==0 and sqrt(i)==int(sqrt(i))]\n return (f\"{int(sqrt(li[-1]))} sqrt {n // li[-1]}\" if li else f\"sqrt {n}\") if sqrt(n) != int(sqrt(n)) else f\"{int(sqrt(n))}\"\ndef desimplify(s):\n s = s.split()\n try : return int(pow(int(s[0]), 2)) * (int(s[-1]) if len(s)>1 else 1)\n except : return int(s[1])", "def simplify(n):\n if (n ** 0.5) % 1 == 0: \n return f\"{int(n**0.5)}\"\n d = 1\n r = n\n for i in range(n//2, 1,-1):\n if n % i == 0 and (i**0.5) % 1 == 0:\n r = n // i\n d = int(i**0.5)\n break\n return f\"{d} sqrt {r}\" if d > 1 else f\"sqrt {r}\"\n\ndef desimplify(s):\n if s.find(\"sqrt\") == -1: \n return int(s) ** 2\n elif s.count(\" \") == 1:\n return int(s[s.index(\" \")+1: ])\n else:\n n1 = int(s[:s.index(\" \")])\n n2 = int(s[s.rindex(\" \")+1: ])\n return n1**2 * n2\n", "def simplify(n):\n\n for i in range(int(n**.5),1,-1):\n if not n%(i*i):\n s = f'{i} sqrt {n//(i*i)} '\n break\n else:\n s = f' sqrt {n} '\n\n return s.replace(' sqrt 1 ','').strip() or '1'\n\ndef desimplify(s):\n s = s.split()\n if len(s)==3:\n a,b = map(int,(s[0],s[-1]))\n return a*a*b\n if len(s)==1:\n return int(s[-1])**2\n return int(s[-1])", "import re\nfrom collections import Counter\n\ndef prime_factor(n):\n if n == 1:\n return Counter([1])\n factors = Counter()\n for i in range(2, int(n ** 0.5) + 1):\n while n % i == 0:\n factors[i] += 1\n n //= i\n if n != 1:\n factors[n] = 1\n return factors\n\n\ndef simplify(n):\n a, b = 1, 1\n for k, v in prime_factor(n).items():\n while v >= 2:\n a *= k\n v -= 2\n b = b * k if v else b\n if a == 1:\n return f'sqrt {b}' if b > 1 else '1'\n if b == 1:\n return str(a)\n return f'{a} sqrt {b}'\n\n\ndef desimplify(s):\n res = re.match(r'(\\d+ ?)?(sqrt (\\d+))?', s)\n a, b = res.group(1), res.group(3)\n ans = int(a)**2 if a else 1\n return ans * int(b) if b else ans", "import re\n\ndef simplify(n: int) -> str:\n def inner(n):\n for i in range(2, n):\n div, mod = divmod(n, i * i)\n if not mod:\n sq1, sq2 = inner(div)\n return (i * sq1, sq2)\n if not div:\n break\n return (1, n)\n a, b = inner(n)\n if b == 1:\n return f'{a}'\n elif a != 1:\n return f'{a} sqrt {b}'\n else:\n return f'sqrt {b}'\n\ndef desimplify(s: str) -> int:\n m = re.match(r'(?P<INT>\\d+)?(?: )?(?:sqrt (?P<SQRT>\\d+))?', s)\n x, y = m.groups()\n return int(x or '1') ** 2 * int(y or '1')"] | {"fn_name": "simplify", "inputs": [[1], [2], [3], [8], [15], [16], [18], [20], [24], [32], [4], [7], [9], [10], [12], [13], [14], [50], [80], [200]], "outputs": [["1"], ["sqrt 2"], ["sqrt 3"], ["2 sqrt 2"], ["sqrt 15"], ["4"], ["3 sqrt 2"], ["2 sqrt 5"], ["2 sqrt 6"], ["4 sqrt 2"], ["2"], ["sqrt 7"], ["3"], ["sqrt 10"], ["2 sqrt 3"], ["sqrt 13"], ["sqrt 14"], ["5 sqrt 2"], ["4 sqrt 5"], ["10 sqrt 2"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 4,411 |
def simplify(n):
|
75b02dd6b6b68b325fa9f1d7d496b50a | UNKNOWN | Complete the function that returns an array of length `n`, starting with the given number `x` and the squares of the previous number. If `n` is negative or zero, return an empty array/list.
## Examples
```
2, 5 --> [2, 4, 16, 256, 65536]
3, 3 --> [3, 9, 81]
``` | ["def squares(x,n):\n return [x**(2**i) for i in range(n)]", "from itertools import accumulate, repeat\ndef squares(x, n):\n return list(accumulate(repeat(x, n), lambda a, _: a * a))", "def squares(x, n):\n result = [x] if n > 0 else []\n for i in range(0, n-1):\n result.append(result[-1]**2)\n return result", "def squares(x, n):\n r = [x]\n return [r[-2] for i in range(n) if not r.append(r[-1]**2)]", "from typing import List\n\ndef squares(x: int, n: int) -> List[int]:\n \"\"\" Get an array of length `n`, starting with the given number `x` and the squares of the previous number. \"\"\"\n result = [x]\n for _ in range(1, n):\n result.append(pow(result[-1], 2))\n return result if n > 0 else []", "def squares(x, n):\n return [x**(2**k) for k in range(n)]", "def squares(x, n):\n fun = lambda x,n: x if n <= 1 else fun(x, n-1) ** 2\n return [fun(x, i) for i in range(1, n+1)]\n \n \n \n", "def squares(x, n):\n if n < 0:\n return []\n return [] if n == 0 else [x] + squares(x**2, n-1)", "def squares(x, n):\n return [pow(x, pow(2, i)) for i in range(n)]", "def squares(x, n):\n mx = [x]\n while len(mx)<n:\n mx.append(mx[-1]**2)\n return mx if n>0 else []"] | {"fn_name": "squares", "inputs": [[2, 5], [3, 3], [5, 3], [10, 4], [2, 0], [2, -4]], "outputs": [[[2, 4, 16, 256, 65536]], [[3, 9, 81]], [[5, 25, 625]], [[10, 100, 10000, 100000000]], [[]], [[]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,261 |
def squares(x, n):
|
ebf166c1ab3b52fb3a6ae39af851abfc | UNKNOWN | You get a "text" and have to shift the vowels by "n" positions to the right.
(Negative value for n should shift to the left.)
"Position" means the vowel's position if taken as one item in a list of all vowels within the string.
A shift by 1 would mean, that every vowel shifts to the place of the next vowel.
Shifting over the edges of the text should continue at the other edge.
Example:
text = "This is a test!"
n = 1
output = "Thes is i tast!"
text = "This is a test!"
n = 3
output = "This as e tist!"
If text is null or empty return exactly this value.
Vowels are "a,e,i,o,u".
Have fun coding it and please don't forget to vote and rank this kata! :-)
I have created other katas. Have a look if you like coding and challenges. | ["import re\nfrom collections import deque\n\ndef vowel_shift(text,n):\n try:\n tokens = re.split(r'([aeiouAEIOU])', text)\n if len(tokens) > 1:\n vowels = deque(tokens[1::2])\n vowels.rotate(n)\n tokens[1::2] = vowels\n return ''.join(tokens)\n except TypeError:\n return None", "def vowel_shift(text,n):\n if text in (None, \"\"):\n return text\n \n vwl = [x for x in text if x in \"aeiouAEIOU\"]\n \n if len(vwl) == 0:\n return text\n\n n %= len(vwl)\n vwl = list(vwl[-n:] + vwl[:-n])\n\n return \"\".join([x if x not in \"aeiouAEIOU\" else vwl.pop(0) for x in text])", "import re\ndef vowel_shift(text,n):\n if not text: return text\n vowels = [v for v in text if v in 'aeiouAEIOU']\n n = n % len(vowels) if len(vowels) else n\n shifted_vowels = vowels[-n:] + vowels[:-n]\n return re.sub('[aeiouAEIOU]', lambda _: shifted_vowels.pop(0), text)", "import re\ndef vowel_shift(s,n):\n vow = re.sub(r'[^aeiouAEIOU]',\"\",s or \"\")\n if not s or n == 0 or not vow: return s\n n %= len(vow)\n vow = iter(vow[-n:] + vow[:-n])\n return \"\".join(i if i not in \"aeiouAEIOU\" else next(vow) for i in s)", "is_vowel = lambda c: c in \"aeiouAEIOU\"\n\ndef vowel_shift(text, n):\n if not text or not n:\n return text\n vowels = [c for c in text if is_vowel(c)]\n n = -n % (len(vowels) or 1)\n vowels = iter(vowels[n:] + vowels[:n])\n return \"\".join(c if not is_vowel(c) else next(vowels) for c in text)\n", "from itertools import chain\nvowel = set(\"aeiouAEIOU\").__contains__\n\ndef vowel_shift(text, n):\n if not (text and n): return text\n L = list(filter(vowel, text))\n if not L: return text\n n %= len(L)\n it = chain(L[-n:], L[:-n])\n return ''.join(next(it) if vowel(c) else c for c in text)", "from itertools import cycle, islice\n\ndef vowel_shift(text, n):\n chrs = [c for c in text or '' if c.lower() in 'aeiou']\n if text and chrs:\n it = islice(cycle(chrs), -n % len(chrs), None)\n text = ''.join(next(it) if c.lower() in 'aeiou' else c for c in text)\n return text", "import re\n\ndef vowel_shift(text, n):\n if not text:\n return text\n vowels = [c for c in text if c in \"AEIOUaeiou\"]\n if not vowels:\n return text\n vowels = iter(vowels[-n % len(vowels):] + vowels)\n return re.sub('[AEIOUaeiou]', lambda m: next(vowels), text)", "from re import split\ndef vowel_shift(text, n):\n if text == None:\n return None\n parts = split(r\"([aeiouAEIOU])\", text)\n return \"\".join(parts[i if i % 2 == 0 else (i - 2*n) % (len(parts) - 1)] for i in range(len(parts)))", "def vowel_shift(text, n):\n if text is None or text is '':\n return text\n text = [n for n in text]\n vowels = []\n for x in range(len(text)):\n if text[x].lower() in 'aeuoi':\n vowels.append(text[x])\n text[x] = None\n if len(vowels) == 0:\n return ''.join(text)\n while n != 0:\n if n > 0:\n vowels.insert(0, vowels.pop(-1))\n n -= 1\n else:\n vowels.insert(len(vowels) - 1, vowels.pop(0))\n n += 1\n while len(vowels) != 0:\n text[text.index(None)] = vowels.pop(0)\n return ''.join(text)"] | {"fn_name": "vowel_shift", "inputs": [[null, 0], ["", 0], ["This is a test!", 0], ["This is a test!", 1], ["This is a test!", 3], ["This is a test!", 4], ["This is a test!", -1], ["This is a test!", -5], ["Brrrr", 99], ["AEIOUaeiou", 1]], "outputs": [[null], [""], ["This is a test!"], ["Thes is i tast!"], ["This as e tist!"], ["This is a test!"], ["This as e tist!"], ["This as e tist!"], ["Brrrr"], ["uAEIOUaeio"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,348 |
def vowel_shift(text, n):
|
a58e87abe3fb4be80dfeb5c552942e07 | UNKNOWN | An Arithmetic Progression is defined as one in which there is a constant difference between the consecutive terms of a given series of numbers. You are provided with consecutive elements of an Arithmetic Progression. There is however one hitch: exactly one term from the original series is missing from the set of numbers which have been given to you. The rest of the given series is the same as the original AP. Find the missing term.
You have to write a function that receives a list, list size will always be at least 3 numbers. The missing term will never be the first or last one.
## Example
```python
find_missing([1, 3, 5, 9, 11]) == 7
```
PS: This is a sample question of the facebook engineer challenge on interviewstreet.
I found it quite fun to solve on paper using math, derive the algo that way.
Have fun! | ["def find_missing(sequence):\n t = sequence\n return (t[0] + t[-1]) * (len(t) + 1) / 2 - sum(t)\n", "def find_missing(sequence):\n interval = (sequence[-1] - sequence[0])/len(sequence)\n for previous, item in enumerate(sequence[1:]):\n if item - sequence[previous] != interval:\n return item - interval\n", "def find_missing(sequence):\n return (sequence[-1] + sequence[0]) * (len(sequence) + 1) / 2 - sum(sequence)\n", "def find_missing(nums):\n a, b, c = nums[:3]\n diff = min(b - a, c - b, key=abs)\n for d in nums:\n if d != a:\n return a\n a += diff\n", "def find_missing(sequence):\n totalGap=sequence[len(sequence)-1]-sequence[0]\n eachGap = totalGap/len(sequence)\n for i in range(len(sequence)-1):\n if sequence[i]+eachGap != sequence[i+1]:\n return sequence[i]+eachGap", "def find_missing(s):\n return (len(s)+1)*(s[0]+s[len(s)-1])/2-sum(s) \n \n\n", "def find_missing(se):\n step = (se[-1] - se[0])/len(se)\n ls = [se[0] + i*step for i in range(0, len(se)+1)]\n \n return sum(ls) - sum(se)", "def find_missing(sequence):\n \"\"\"Identify the missing element in an arithmetic expression\n following a constant rule\n \"\"\"\n # A linear list of differences between each element in sequence.\n dif = [sequence[x + 1] - sequence[x] for x in range(len(sequence) - 1)]\n\n # An array of individual elements and their frequency in dif; [[element, frequency],]\n dif_freq = [[x, dif.count(x)] for x in set(dif)]\n\n # Sorting by ascending frequency\n sorted_dif_freq = sorted(dif_freq, key=lambda x: x[1])\n\n outlier = sorted_dif_freq[0][0]\n constant = sorted_dif_freq[-1][0]\n\n return sequence[dif.index(outlier)] + constant\n", "def find_missing(sequence):\n s = set(sequence)\n m1, m2 = min(s), max(s)\n for i in range(m1, m2 + 1, (m2 - m1) // len(s)):\n if i not in s:\n return i", "find_missing=lambda s:(s[0]+s[-1])*(len(s)+1)/2-sum(s)"] | {"fn_name": "find_missing", "inputs": [[[1, 2, 3, 4, 6, 7, 8, 9]]], "outputs": [[5]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,035 |
def find_missing(sequence):
|
157ce11f56fab0ca550873dd8111f7c6 | UNKNOWN | Complete the function ```caffeineBuzz```, which takes a non-zero integer as it's one argument.
If the integer is divisible by 3, return the string ```"Java"```.
If the integer is divisible by 3 and divisible by 4, return the string ```"Coffee"```
If the integer is one of the above and is even, add ```"Script"``` to the end of the string.
Otherwise, return the string ```"mocha_missing!"```
```python
caffeineBuzz(1) => "mocha_missing!"
caffeineBuzz(3) => "Java"
caffeineBuzz(6) => "JavaScript"
caffeineBuzz(12) => "CoffeeScript"
``` | ["def caffeineBuzz(n):\n if n%12 == 0:\n return \"CoffeeScript\"\n elif n%6 == 0:\n return \"JavaScript\"\n elif n%3 == 0:\n return \"Java\"\n else:\n return \"mocha_missing!\"", "def caffeineBuzz(n):\n result = \"mocha_missing!\"\n if not n % 3:\n if not n % 4:\n result = \"Coffee\"\n else:\n result = \"Java\"\n \n if not n % 2:\n result = ''.join((result, \"Script\"))\n \n return result", "def caffeineBuzz(n):\n\n if n % 12 == 0:\n return \"CoffeeScript\"\n elif n % 6 == 0:\n return \"JavaScript\"\n elif n % 3 == 0:\n return \"Java\"\n \n return \"mocha_missing!\"", "def caffeineBuzz(n):\n a = [\"mocha_missing!\"] * 12\n a[::3] = [\"Java\"] * 4\n a[::6] = [\"CoffeeScript\", \"JavaScript\"]\n return a[n % 12]", "def caffeineBuzz(n):\n return 'CoffeeScript' if n % 12 == 0 else 'JavaScript' if n % 6 == 0 else 'Java' if n % 3 == 0 else 'mocha_missing!' \n", "def caffeineBuzz(n):\n return ['mocha_missing!','Java','JavaScript','CoffeeScript'][sum([n%3==0,n%4==0,n%2==0])]", "caffeineBuzz = lambda n: a[n % 12]\na = 4 * ([\"Java\"] + [\"mocha_missing!\"] * 2)\na[::6] = [\"CoffeeScript\", \"JavaScript\"]", "def caffeineBuzz(n):\n return [\"mocha_missing!\", \"Java\", \"Coffee\"][(n%12==0) + (n%3==0)] + \"Script\"*(n&1==0)", "def caffeineBuzz(n):\n coffe = 'mocha_missing!'\n if n%3 == 0:\n coffe = 'Coffee' if n%4==0 else 'Java'\n coffe = coffe + ('Script' if n%2==0 else '')\n return coffe", "import unittest\n\nJAVA = 'Java'\nCOFFEE = 'Coffee'\nSCRIPT = 'Script'\nMOCHA_MISSING = 'mocha_missing!'\n\n\ndef caffeineBuzz(n):\n if n % 3 == 0:\n language = JAVA\n if n % 4 == 0:\n language = COFFEE\n if n % 2 == 0:\n language += SCRIPT\n elif n % 2 == 0:\n language += SCRIPT\n return language\n else:\n return MOCHA_MISSING\n\n\n\nclass TestCaffeineBuzz(unittest.TestCase):\n def test_should_return_java_when_given_n_is_divisible_by_3(self):\n n = 3\n actual = caffeineBuzz(n)\n self.assertEqual(actual, 'Java')\n\n def test_should_return_coffee_script_when_given_n_is_divisible_by_3_or_divisible_by_and_divisible_by_4_and_divisible_by_2(self):\n n = 12\n actual = caffeineBuzz(n)\n self.assertEqual(actual, 'CoffeeScript')\n\n def test_should_return_coffee_script_when_given_n_is_divisible_by_3_or_divisible_by_and_not_divisible_by_4_and_divisible_by_2(self):\n n = 6\n actual = caffeineBuzz(n)\n self.assertEqual(actual, 'JavaScript')\n\n def test_should_return_moch_missing_when_given_n_is_1(self):\n n = 1\n actual = caffeineBuzz(n)\n self.assertEqual(actual, 'mocha_missing!')\n"] | {"fn_name": "caffeineBuzz", "inputs": [[1], [3], [6], [12]], "outputs": [["mocha_missing!"], ["Java"], ["JavaScript"], ["CoffeeScript"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,884 |
def caffeineBuzz(n):
|
50e47495cf4b57a4ab41dc2bea28fc1f | UNKNOWN | A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. Examples of numerical palindromes are:
2332
110011
54322345
For a given number ```num```, return its closest numerical palindrome which can either be smaller or larger than ```num```. If there are 2 possible values, the larger value should be returned. If ```num``` is a numerical palindrome itself, return it.
For this kata, single digit numbers will NOT be considered numerical palindromes.
Also, you know the drill - be sure to return "Not valid" if the input is not an integer or is less than 0.
```
palindrome(8) => 11
palindrome(281) => 282
palindrome(1029) => 1001
palindrome(1221) => 1221
palindrome("1221") => "Not valid"
```
```Haskell
In Haskell the function should return a Maybe Int with Nothing for cases where the argument is less than zero.
```
Other Kata in this Series:
Numerical Palindrome #1
Numerical Palindrome #1.5
Numerical Palindrome #2
Numerical Palindrome #3
Numerical Palindrome #3.5
Numerical Palindrome #4
Numerical Palindrome #5 | ["def palindrome(num):\n if type(num) is not int or num < 0:\n return \"Not valid\"\n else:\n c =0\n for i in range(num,num**2):\n if is_pal(i):\n return i\n elif is_pal(i-c):\n return i-c\n else:\n c +=2\n \ndef is_pal(n):\n return n > 10 and n == int(str(n)[::-1])", "def palindrome(num):\n is_palindrome = lambda chunk: int(chunk) > 9 and chunk == chunk[::-1]\n if not isinstance(num, int) or num < 0: return 'Not valid'\n i = 0\n while(True):\n if is_palindrome(str(num + i)): return num + i\n if is_palindrome(str(num - i)): return num - i\n i += 1\n", "def palindrome(num):\n \n if not isinstance(num, int) or num < 0:\n return \"Not valid\"\n \n if num > 9 and str(num) == str(num)[::-1]:\n return num\n\n num_down = num\n num_up = num\n \n d = {}\n while not d:\n num_down -= 1\n num_up += 1\n\n if str(num_down) == str(num_down)[::-1] and num_down > 9:\n d['?'] = num_down\n \n if str(num_up) == str(num_up)[::-1] and num_up > 9:\n d['?'] = num_up\n\n return d.get('?', num)", "def palindrome(num):\n if not isinstance(num, int) or num < 0: return 'Not valid'\n n = 1\n num = max(num, 11)\n minus, plus = num, num\n f = lambda x: str(x) == str(x)[::-1]\n pal = 0 if not f(num) else num\n while not pal:\n plus += n\n if f(plus):\n return plus\n minus -= n\n if f(minus):\n return minus\n return pal", "is_palindrome = lambda x: x > 10 and str(x) == str(x)[::-1]\n\n\ndef palindrome(num):\n if not isinstance(num, int) or num < 0:\n return \"Not valid\"\n \n smaller, larger = num, num\n \n while True:\n checks = is_palindrome(smaller), is_palindrome(larger)\n \n if checks == (True, False): return smaller\n if checks == (False, True): return larger\n if checks == (True, True): return larger\n \n smaller -= 1\n larger += 1", "def is_palindrome(n):\n s = str(n)\n return s == s[::-1]\n\ndef palindrome(num):\n if not isinstance(num, int) or num < 0:\n return \"Not valid\"\n if num < 17:\n return 11\n inf = next(n for n in range(num, 0, -1) if is_palindrome(n))\n sup = next(n for n in range(num, 2*num) if is_palindrome(n))\n mean = (inf + sup) / 2\n return sup if num >= mean else inf", "from itertools import count\ndef palindrome(num):\n return next(c for b in count(0) for c in (num + b, num - b) if c > 9 and c == int(str(c)[::-1])) if isinstance(num, int) and num >= 0 else 'Not valid'", "def findR(num):\n while True:\n if str(num)==str(num)[::-1]:\n return num\n num+=1\ndef findL(num):\n while True:\n if str(num)==str(num)[::-1]:\n return num\n num-=1\ndef palindrome(num):\n if type(num)!=int or num<0:\n return 'Not valid'\n if num<=10:\n return 11\n else:\n if findR(num)-num<=num-findL(num):\n return findR(num)\n else:\n return findL(num)\n", "def is_pali(num):\n return str(num) == str(num)[::-1] and num > 9\n\ndef palindrome(num):\n if type(num) != int or str(num) != str(int(num)) or int(num) < 0:\n return 'Not valid'\n n = 0\n if num <= 11:\n return 11\n while n < num:\n test1 = num - n\n test2 = num + n\n if is_pali(test2):\n return num + n\n elif is_pali(test1):\n return num - n\n n += 1", "\"\"\" Solution without loops ! \"\"\"\n\n\"\"\" Define the first segment of what wwould be a \"not far away palindrome\" based on \"num\" :\n num = 1258 -> midPart = 12 ( -> would give \"1221\" )\n num = 459 -> midPart = 45 ( -> would give \"454\" )\n \n Check for lower and upper values (in case num is near of change of decade, upperbond or lowerbond)\n and define 3 possible parts of palindromes:\n num = 1258 -> 12 -> lowPart = 11\n midPart = 12\n highPart = 13\n num = 459 -> 45 -> lowPart = 44\n midPart = 45\n highPart = 46\n \n Construct palindromes according to each part an the parity of the length of the original number:\n num = 1258 -> lPal = 1111 ; mPal = 1221 ; hPal = 1331\n num = 459 -> lPal = 444 ; mPal = 454 ; hPal = 464\n \n Sort the result with tuples defined as: (abs(num-newPal), -newPal)\n This way, the nearest new palindrome value are first, and if two values of \"abs(num-newPal)\"\n are equal, the second element of the tuple ensure to find the highest one as first element of \n the sorted list of tuples.\n return the opposite of the second element of the first tuple, which is so \"newPal\".\n \n Edge cases: num = 1999 -> lPal = 1881 ; mPal = 1991 ; hPal = 2002 => return 2002\n num = 801 -> lPal = 797 ; mPal = 808 ; hPal = 818 => return 797\n num = 1002 -> lPal = 99(!); mPal = 1001 ; hPal = 1111 => return 1001\n\"\"\"\n\ndef nextPal(sPart, ls): return int( sPart + sPart[:len(sPart)-ls%2][::-1] )\n\ndef palindrome(num):\n if type(num) != int or num <= 0: return \"Not valid\"\n \n s = str(num)\n midPart = s[:(len(s)+1)//2]\n lowPart = str(int(midPart)-1)\n highPart = str(int(midPart)+1)\n lPal, mPal, hPal = nextPal(lowPart, len(s)), nextPal(midPart, len(s)), nextPal(highPart, len(s))\n \n return 11 if num <= 16 else -sorted( (abs(num-pal), -pal) for pal in [lPal, mPal, hPal] )[0][1]"] | {"fn_name": "palindrome", "inputs": [[8], [281], [1029], [1221], ["BGHHGB"], ["11029"], [-1029]], "outputs": [[11], [282], [1001], [1221], ["Not valid"], ["Not valid"], ["Not valid"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 5,871 |
def palindrome(num):
|
357d026e34fb016b29f97f419eb592fb | UNKNOWN | Ahoy Matey!
Welcome to the seven seas.
You are the captain of a pirate ship.
You are in battle against the royal navy.
You have cannons at the ready.... or are they?
Your task is to check if the gunners are loaded and ready, if they are: ```Fire!```
If they aren't ready: ```Shiver me timbers!```
Your gunners for each test case are 4 or less.
When you check if they are ready their answers are in a dictionary and will either be: ```aye``` or ```nay```
Firing with less than all gunners ready is non-optimum (this is not fire at will, this is fire by the captain's orders or walk the plank, dirty sea-dog!)
If all answers are 'aye' then Fire!
if one or more are 'nay' then Shiver me timbers!
Also, check out the new Pirates!! Kata:
https://www.codewars.com/kata/57e2d5f473aa6a476b0000fe | ["def cannons_ready(gunners):\n return 'Shiver me timbers!' if 'nay' in gunners.values() else 'Fire!'", "def cannons_ready(gunners):\n for i in gunners:\n if gunners[i] == 'nay':\n return 'Shiver me timbers!'\n return 'Fire!'", "def cannons_ready(g):\n return ['Fire!','Shiver me timbers!']['nay' in g.values()]", "def cannons_ready(gunners):\n return 'Fire!' if all(map(lambda x: x=='aye', gunners.values())) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all(x == 'aye' for x in gunners.values()) else 'Shiver me timbers!'", "from collections import Counter\ndef cannons_ready(gunners):\n return [\"Fire!\",\"Shiver me timbers!\"][len(Counter(list(gunners.values()))) !=1]\n", "cannons_ready = lambda g: \"Shiver me timbers!\" if \"nay\" in g.values() else \"Fire!\"", "def cannons_ready(gunners):\n return ('Fire!' if all(answer == 'aye' for answer in gunners.values())\n else 'Shiver me timbers!')", "def cannons_ready(gunners):\n return \"Fire!\" if all(s == \"aye\" for _, s in gunners.items()) else \"Shiver me timbers!\"", "def cannons_ready(gunners):\n return 'Shiver me timbers!' if any(x == 'nay' for x in gunners.values()) else 'Fire!' ", "def cannons_ready(gunners):\n # Fire! or Shiver me timbers!\n if 'nay' not in list(gunners.values()):\n return 'Fire!'\n return 'Shiver me timbers!' \n", "def cannons_ready(gunners):\n return all(x == 'aye' for x in gunners.values()) and 'Fire!' or 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all(v=='aye' for v in gunners.values()) else 'Shiver me timbers!'", "from typing import Dict\n\ndef cannons_ready(gunners: Dict[str, str]) -> str:\n \"\"\" If all answers from gunners are 'aye' then `Fire!` if one or more are 'nay' then `Shiver me timbers!` \"\"\"\n gunners_orders = {\n True: \"Fire!\",\n False: \"Shiver me timbers!\"\n }\n return gunners_orders.get(len(list(filter(lambda _: _ == \"aye\", gunners.values()))) == len(gunners))", "def cannons_ready(gunners):\n values = list(gunners.values())\n count = 0\n for i in values:\n if i == 'nay':\n count += 1\n else:\n count += 0\n if count > 0:\n return 'Shiver me timbers!'\n return 'Fire!'\n \n", "def cannons_ready(gunners):\n return next(('Shiver me timbers!' for x in gunners.values() if x == 'nay'), 'Fire!')", "def cannons_ready(g):\n return ['Shiver me timbers!', 'Fire!'][all(i=='aye' for i in g.values())]", "cannons_ready = lambda gunners: \"Shiver me timbers!\" if \"nay\" in gunners.values() else \"Fire!\"", "def cannons_ready(reply):\n xx=[x for x in reply.values()].count('aye')\n if xx == len(reply): return 'Fire!'\n else: return 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all('aye' == el for el in gunners.values()) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n print(gunners)\n for i in gunners:\n if gunners[i] == \"nay\":\n return 'Shiver me timbers!'\n break\n else:\n return \"Fire!\"\n", "def cannons_ready(gunners):\n return 'Shiver me timbers!' if 'nay' in list(gunners[i] for i in gunners) else 'Fire!'", "def cannons_ready(gunners): \n fire = True\n for gunner, response in gunners.items():\n if response == 'nay':\n fire = False\n return 'Fire!' if fire == True else 'Shiver me timbers!'", "def cannons_ready(gunners):\n for i in gunners:\n if gunners[i] == 'nay':\n return 'Shiver me timbers!'\n else: return 'Fire!'", "def cannons_ready(gunners):\n all = []\n yes = []\n no = []\n for key in gunners:\n all.append(gunners[key])\n for i in all:\n if i == 'aye':\n yes.append(i)\n if i == 'nay':\n no.append(i)\n if len(no) == 0: return 'Fire!'\n else: return 'Shiver me timbers!'\n \n \n'''If all answers are 'aye' then Fire! if one or more are 'nay' then Shiver me timbers!'''", "def cannons_ready(gunners):\n return 'Shiver me timbers!' if 'nay' in [v for k,v in list(gunners.items())] else 'Fire!'\n", "def cannons_ready(gunners):\n for k in gunners.values():\n if k == \"nay\":\n return \"Shiver me timbers!\"\n return \"Fire!\"", "def cannons_ready(g):\n x=\"Fire!\"\n y=\"Shiver me timbers!\"\n \n for b in g.values():\n if b=='nay':\n return y\n return x", "def cannons_ready(gunners):\n for ready in gunners.values():\n if ready == 'nay':\n return 'Shiver me timbers!'\n \n return 'Fire!'", "cannons_ready = lambda g: 'Fire!' if len(g) == tuple(g.values()).count('aye') else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if not 'nay' in [gunners[i] for i in gunners] else 'Shiver me timbers!'", "def cannons_ready(g):\n return \"Shiver me timbers!\" if any(g[x] == \"nay\" for x in g) else \"Fire!\"", "from typing import Dict\n\ndef cannons_ready(gunners: Dict[str,str]) -> str:\n \"\"\"Returns fire if all gunners are ready else shiver me timbers.\"\"\"\n ready = not 'nay' in gunners.values()\n return 'Fire!' if ready else 'Shiver me timbers!'", "def cannons_ready(gunners):\n if len(list(gunners.values())) <= list(gunners.values()).count('aye'):\n return 'Fire!'\n else:\n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all(map(lambda x: x[1]=='aye', gunners.items())) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if list(gunners.values()).count('aye') == len(list(gunners.values())) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n if all(a == 'aye' for a in gunners.values()):\n return 'Fire!'\n else:\n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n if any([x for x in list(gunners.values()) if x!='aye']):\n return 'Shiver me timbers!'\n else:\n return 'Fire!'\n # Fire! or Shiver me timbers!\n", "def cannons_ready(gunners):\n \n g = gunners\n \n aye = [g[i] for i in g if g[i] == 'aye']\n nay = [g[i] for i in g if g[i] == 'nay']\n \n if len(nay) >= 1:\n return 'Shiver me timbers!'\n else:\n return 'Fire!'", "def cannons_ready(gunners):\n if len(set(gunners.values())) == 1:\n return 'Fire!'\n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all(['aye' == v for v in gunners.values()]) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n c=0\n for i in gunners:\n if gunners.get(i)==\"nay\":\n c=1\n break\n if c==1:\n return \"Shiver me timbers!\"\n else:\n return \"Fire!\"", "def cannons_ready(gunners):\n for d in list(gunners.values()):\n if d !='aye':\n return 'Shiver me timbers!'\n return 'Fire!'\n # Fire! or Shiver me timbers!\n", "def cannons_ready(gunners):\n fire = {v: k for k, v in gunners.items()}\n z = fire.get('nay')\n return 'Fire!'if not z else 'Shiver me timbers!'", "def cannons_ready(a):\n if \"nay\" in [i for i in a.values()] : return \"Shiver me timbers!\"\n return \"Fire!\"", "def cannons_ready(gunners):\n if gunners and all(v == 'aye' for v in gunners.values()):\n return 'Fire!'\n else:\n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n flag = 0\n for value in list(gunners.values()):\n if value == 'aye':\n flag += 1\n \n return 'Fire!' if flag == len(gunners) else 'Shiver me timbers!'\n", "def cannons_ready(gunners):\n for person, say in gunners.items():\n if say == 'nay':\n return 'Shiver me timbers!'\n return 'Fire!'", "def cannons_ready(g):\n return 'Fire!' if all(g[i] == 'aye' for i in g) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return ['Fire!','Shiver me timbers!']['nay' in list(gunners.values())] \n# return 'Shiver me timbers!' if 'nay' in gunners.values() else 'Fire!'\n", "def cannons_ready(gunners):\n shoot = True\n for g in list(gunners.values()):\n if g == 'nay':\n shoot = False\n if shoot:\n return \"Fire!\"\n else:\n return \"Shiver me timbers!\"\n", "def cannons_ready(gunners):\n return 'Shiver me timbers!' if sum([1 for k, v in list(gunners.items()) if v ==\"nay\"]) else 'Fire!'\n", "def cannons_ready(gunners):\n l=[]\n for i in gunners:\n l.append(i)\n for i in l:\n if gunners.get(i)==\"nay\":\n return 'Shiver me timbers!'\n return \"Fire!\"", "def cannons_ready(gunners):\n # Fire! or Shiver me timbers!\n if list(gunners.values()).count('nay') == 0:\n return 'Fire!'\n else:\n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n a = [v for v in gunners.values()]\n if \"nay\" in a:\n return \"Shiver me timbers!\"\n else:\n return \"Fire!\"", "def cannons_ready(gunners):\n \"\"\"\n Arg!\n \"\"\"\n return 'Fire!' if set(gunners.values()) == {'aye'} else 'Shiver me timbers!'", "def cannons_ready(gunners):\n\n yes_or_no = list()\n for v in gunners.values():\n yes_or_no.append(v)\n \n if \"nay\" in yes_or_no:\n return \"Shiver me timbers!\"\n else:\n return \"Fire!\"", "def cannons_ready(g):\n for i in g.values():\n if i != 'aye':\n return 'Shiver me timbers!'\n return 'Fire!'", "def cannons_ready(gunners):\n if all(x == \"aye\" for x in gunners.values()):\n return \"Fire!\"\n if len(gunners) < 4:\n return \"Shiver me timbers!\"\n else:\n return \"Fire!\" if gunners[\"Mike\"]== \"aye\" and gunners[\"Joe\"] == \"aye\" and gunners[\"Johnson\"] == \"aye\" and gunners[\"Peter\"] == \"aye\" else \"Shiver me timbers!\"", "def cannons_ready(gunners):\n msg = 'Fire!'\n if 'nay' in gunners.values():\n msg = 'Shiver me timbers!'\n return msg", "def cannons_ready(gunners):\n nay_count = 0\n msg = 'Fire!'\n for k, v in gunners.items():\n if v == 'nay':\n nay_count += 1\n if nay_count:\n msg = 'Shiver me timbers!'\n return msg", "def cannons_ready(gunners):\n fire = True\n for gunner in gunners:\n if gunners[gunner] == 'nay':\n fire = False\n return 'Fire!' if fire else 'Shiver me timbers!'", "def cannons_ready(gunners):\n l = gunners.values()\n m = [i for i in l]\n x = m.count('aye')\n y = m.count('nay')\n return 'Fire!' if x == len(m) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all(gun == 'aye' for gun in gunners.values()) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n if all([True if i == 'aye' else False for i in gunners.values()]) == True:\n return 'Fire!'\n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n temp = True \n for i in gunners:\n if gunners[i] == 'nay':\n temp = False\n return 'Fire!' if temp else 'Shiver me timbers!'\n", "def cannons_ready(gunners):\n return ['Shiver me timbers!', 'Fire!'][all(ans == 'aye' for ans in list(gunners.values()))]\n", "def cannons_ready(gs):\n return 'Shiver me timbers!' if 'nay' in gs.values() else 'Fire!'", "def cannons_ready(gunners):\n # Fire! or Shiver me timbers!\n print (gunners)\n if 'nay' in gunners.values():\n return 'Shiver me timbers!'\n else:\n return 'Fire!'", "def cannons_ready(gunners):\n for k, v in gunners.items():\n if all(v == 'aye' for v in gunners.values()):\n return 'Fire!'\n elif v == 'nay':\n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n for name in gunners:\n if gunners.get(name) == 'nay':\n return \"Shiver me timbers!\"\n return \"Fire!\"\n \n", "def cannons_ready(gunners):\n # Fire! or Shiver me timbers!\n if all(value == \"aye\" for value in gunners.values()):\n return \"Fire!\"\n else: \n return \"Shiver me timbers!\"\n \n all(value == 0 for value in your_dict.values())", "cannons_ready = lambda gunners: 'Fire!' if all(i == 'aye' for i in gunners.values()) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n for item in gunners:\n if gunners.get(item) == 'nay':\n return 'Shiver me timbers!'\n return 'Fire!'", "def cannons_ready(gunners):\n result = 'Fire!'\n for gun in gunners:\n if gunners[gun] == 'nay':\n result = 'Shiver me timbers!'\n break\n return result\n", "def cannons_ready(gunners):\n for answer in gunners:\n if gunners.get(answer) == 'nay':\n return 'Shiver me timbers!'\n return 'Fire!'\n", "def cannons_ready(gunners):\n # Fire! or Shiver me timbers!\n if 'nay' in gunners.values():\n return 'Shiver me timbers!'\n else:\n return 'Fire!'\n \ncannons_ready({'m':'a'})", "def cannons_ready(gunners: dict):\n return 'Fire!' if all([v.lower() == 'aye' for v in gunners.values()]) else 'Shiver me timbers!'", "def cannons_ready(gunners): \n return 'Shiver me timbers!' if [value for value in gunners.values()].count('nay') >= 1 else 'Fire!'", "def cannons_ready(gunners):\n if \"nay\" in list(gunners.values()):\n return \"Shiver me timbers!\"\n return \"Fire!\"\n\n\n\n\n# def cannons_ready(gunners):\n# return 'Shiver me timbers!' if 'nay' in gunners.values() else 'Fire!'\n \n \n \n# def cannons_ready(gunners):\n# for i in gunners:\n# if gunners[i] == 'nay':\n# return 'Shiver me timbers!'\n# return 'Fire!'\n\n\n", "def cannons_ready(gunners):\n return 'Fire!' if len(set(gunners.values())) <= 1 else 'Shiver me timbers!'\n", "def cannons_ready(d):\n return 'Fire!' if len(set(d.values())) == 1 else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all(s == 'aye' for s in gunners.values()) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n gunners = list(gunners.values())\n \n \n if gunners.count(\"nay\") >= 1:\n return 'Shiver me timbers!'\n else:\n return \"Fire!\"", "def cannons_ready(gunners):\n if list(set(gunners.values())) == ['aye']:\n return 'Fire!'\n else:\n return 'Shiver me timbers!'", "cannons_ready=lambda g:'Fire!' if all(x=='aye' for x in g.values()) else 'Shiver me timbers!'", "def cannons_ready(g):\n return 'Fire!' if all(x=='aye' for x in g.values()) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if len(gunners) == list(gunners.values()).count(\"aye\") else 'Shiver me timbers!'", "def cannons_ready(gunners):\n return 'Fire!' if all(gunners[each] == 'aye' for each in gunners) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n b = list(gunners.values())\n if 'nay' not in b:\n return 'Fire!'\n else:\n return 'Shiver me timbers!'\n", "def cannons_ready(gunners):\n for gunner in gunners:\n if gunners.get(gunner) == 'nay':\n return 'Shiver me timbers!'\n return 'Fire!'", "def cannons_ready(gunners):\n # Fire! or Shiver me timbers!\n if len(set(gunners.values())) >= 2:\n return 'Shiver me timbers!'\n return 'Fire!'", "def cannons_ready(gunners):\n # Fire! or Shiver me timbers!\n return \"Fire!\" if sum(1 if gunners[i] == 'aye' else 0 for i in gunners) == len(gunners) else 'Shiver me timbers!'", "def cannons_ready(gunners):\n gunners = list(gunners.values())\n if gunners.count(\"aye\") == len(gunners):\n return(\"Fire!\")\n if \"nay\" in gunners:\n return(\"Shiver me timbers!\")\n", "def cannons_ready(gunners):\n if all([ready is 'aye' for gunner, ready in gunners.items()]):\n return 'Fire!'\n \n return 'Shiver me timbers!'", "def cannons_ready(gunners):\n for gunner in list(gunners.values()):\n if gunner is not 'aye':\n return 'Shiver me timbers!'\n return 'Fire!'", "def cannons_ready(gunners):\n flag = True\n for key, value in gunners.items():\n if value == 'nay':\n flag = False\n pass\n return 'Fire!'if flag else 'Shiver me timbers!'", "def cannons_ready(gunners):\n result = 0\n for i in gunners:\n if gunners[i] == 'nay':\n result+=1\n return 'Fire!' if result == 0 else 'Shiver me timbers!'"] | {"fn_name": "cannons_ready", "inputs": [[{"Joe": "nay", "Johnson": "nay", "Peter": "aye"}]], "outputs": [["Shiver me timbers!"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 16,483 |
def cannons_ready(gunners):
|
9edf56af33b2872ef53f160649125f98 | UNKNOWN | # Task
Dudka has `n` details. He must keep exactly 3 of them.
To do this, he performs the following operations until he has only 3 details left:
```
He numbers them.
He keeps those with either odd or even numbers and throws the others away.```
Dudka wants to know how many ways there are to get exactly 3 details. Your task is to help him calculate it.
# Example
For `n = 6`, the output should be `2`.
```
Dudka has 6 details, numbered 1 2 3 4 5 6.
He can keep either details with numbers 1, 3, 5,
or with numbers 2, 4, 6.
Both options leave him with 3 details,
so the answer is 2.```
For `n = 7`, the output should be `1`.
```
Dudka has 7 details, numbered 1 2 3 4 5 6 7.
He can keep either details 1 3 5 7, or details 2 4 6.
If he keeps details 1 3 5 7 ,
he won't be able to get 3 details in the future,
because at the next step he will number them 1 2 3 4
and will have to keep either details 1 3, or 2 4,
only two details anyway.
That's why he must keep details 2 4 6 at the first step,
so the answer is 1.```
# Input/Output
- `[input]` integer `n`
`3 ≤ n ≤ 10^9`
- `[output]` an integer
The number of ways to get exactly 3 details. | ["from functools import lru_cache\n\n@lru_cache(maxsize=None)\ndef three_details(n):\n if n <= 3: return n==3\n q, r = divmod(n, 2)\n return three_details(q) + three_details(q+r)", "from functools import lru_cache\n\n@lru_cache(maxsize=None)\ndef three_details(n):\n if n in (3,5,7):\n return 1\n elif n < 6:\n return 0\n q, r = divmod(n, 2)\n if r:\n return three_details(q) + three_details(q+1)\n else:\n return three_details(q) * 2", "from math import log2\n\ndef three_details(n):\n i = int(log2(n))\n return min(abs(n - 2**p) for p in (i, i + 1))", "def three_details(n):\n u = 2 ** n.bit_length()\n return n - u // 2 if n <= 3 * u // 4 else u - n", "from math import ceil\nfrom functools import lru_cache\nthree_details = lru_cache(None)(lambda n:int(n==3) if n<=3 else three_details(ceil(n/2)) + three_details(n//2))", "three_details=lambda n:(lambda l:min(n%2**l,-n%2**l))(int(__import__('math').log2(n)))", "def three_details(n):\n if n==3: return 1\n if n<5: return 0\n if n%2==0:\n return 2*three_details(n//2)\n else:\n return three_details(n//2)+three_details(n//2+1)\n", "def three_details(n):\n p=2**n.bit_length()\n return (p-abs(4*n-3*p))//4\n", "ready = [0,0,0,1]\n\ndef f(x):\n if x<len(ready): return ready[x]\n else: return f(x//2) + f(x//2 + x%2)\n\nfor i in range(4,100001):\n ready.append(f(i))\n\n\ndef three_details(n):\n if n < 100000: return ready[n]\n else: return three_details(n//2) + three_details(n//2 +n%2)", "from functools import lru_cache\n\n\n@lru_cache()\ndef three_details(n, count=0):\n even, odd = n//2, n//2 + n%2\n if n == 3:\n return 1\n elif n < 3:\n return 0\n return three_details(n-even) + three_details(n-odd)"] | {"fn_name": "three_details", "inputs": [[3], [6], [4], [10], [15]], "outputs": [[1], [2], [0], [2], [1]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,798 |
def three_details(n):
|
5c7734e055ca93742c3307464ffe52c2 | UNKNOWN | Write a function that takes a positive integer n, sums all the cubed values from 1 to n, and returns that sum.
Assume that the input n will always be a positive integer.
Examples:
```python
sum_cubes(2)
> 9
# sum of the cubes of 1 and 2 is 1 + 8
``` | ["def sum_cubes(n):\n return sum(i**3 for i in range(0,n+1))", "def sum_cubes(n):\n return (n*(n+1)/2)**2", "def sum_cubes(n):\n return sum(x ** 3 for x in range(n+1))", "def sum_cubes(n):\n return (n*(n+1)//2)**2", "def sum_cubes(n):\n return sum([i**3 for i in range(1,n+1)])", "def sum_cubes(n):\n return sum( i**3 for i in range(n+1) )", "def sum_cubes(n):\n s=0\n i=0\n while i<=n:\n s=i**3+s\n i=i+1\n return s# your code here", "def sum_cubes(n):\n result = 0\n for i in range(n+1):\n result = result + i**3\n \n return result", "def sum_cubes(n):\n return (n*n*(n+1)*(n+1))/4", "sum_cubes = lambda n: sum([i ** 3 for i in range(n + 1)])", "def sum_cubes(n):\n s = 1\n f = n\n v = 0\n while s != f + 1:\n v += s **3\n s += 1\n return v", "def sum_cubes(n):\n return sum(v ** 3 for v in range(n + 1))", "sum_cubes = lambda n: sum( i**3 for i in range(1,n+1) )", "import decimal\ndef sum_cubes(n):\n n = decimal.Decimal(n)\n return n**2*(n+1)**2/4", "def sum_cubes(n):\n res = 0\n for i in range(1, n + 1):\n res += i ** 3\n return res\n", "def sum_cubes(n):\n # your code here\n return sum([x**3 for x in range(1,n+1)])", "def sum_cubes(n):\n return sum(x * x * x for x in range(n + 1))", "def sum_cubes(n):\n return sum([x ** 3 for x in range(n + 1)])", "def sum_cubes(n):\n return sum(i**3 for i in range(1, n+1))", "def sum_cubes(n):\n result = 0\n for cube in range(n+1):\n result = result + cube * cube * cube\n return result", "def sum_cubes(n):\n my_array = [n ** 3 for n in range(1, n+1)]\n return sum(my_array)", "from math import pow\ndef sum_cubes(n):\n sum=0\n for i in range(1,n+1):\n sum+=i**3\n return sum", "def sum_cubes(n):\n \n sol = 0\n \n for i in range(n+1):\n \n sol += i**3\n \n return sol", "def sum_cubes(n):\n i = 1\n sums = 0\n while i <= n:\n sums = sums + i ** 3\n i += 1\n return sums ", "def sum_cubes(n):\n return sum(c**3 for c in range(1,n+1))", "def sum_cubes(n):\n return sum(cubed**3 for cubed in range(1, n+1))\n # your code here\n", "def sum_cubes(n):\n sum = 0\n for i in range(0,n+1):\n sum = sum+(pow(i,3))\n return sum", "def sum_cubes(n):\n cubes = [i**3 for i in range(1,n+1)]\n return sum(cubes)", "def sum_cubes(n):\n return sum(list([x**3 for x in range(n+1)]))", "def sum_cubes(n):\n s = 0\n for i in range(n+1):\n s += pow(i, 3)\n return s", "def sum_cubes(n):\n tot = 0\n for x in range(1,n+1):\n tot += x **3\n return tot", "def sum_cubes(n):\n # your code here\n sum_cube=0\n for e in range(0,n+1):\n sum_cube+= e**3\n return sum_cube", "# Formula taken from https://mathschallenge.net/library/number/sum_of_cubes\n\ndef sum_cubes(n):\n return (n * (n + 1) // 2) ** 2", "def sum_cubes(n):\n return sum(a**3 for a in range(1,n+1))", "def sum_cubes(n):\n total = 0\n for x in range(n+1):\n total += x**3\n return total", "def sum_cubes(n):\n ans = 0\n while n > 0:\n ans += pow(n, 3)\n n -= 1\n return ans", "def sum_cubes(n):\n x = [i ** 3 for i in range(1, n+1)]\n return sum(x)", "def sum_cubes(n: int) -> int:\n return (n * (n + 1) // 2) ** 2\n", "def sum_cubes(n):\n return int((n*(n+1)//2)**2)", "def sum_cubes(n):\n total = 0\n for i in range(1, n + 1):\n i = i ** 3\n total += i\n return total\n", "def sum_cubes(n):\n sum=0\n for num in range(0,n+1):\n num=num*num*num\n sum=sum+num\n return sum ", "def sum_cubes(n):\n c = 0\n for i in range(1, n+1):\n c = c + i**3\n return c", "def sum_cubes(n: int):\n return sum(i ** 3 for i in range(n+1))", "def sum_cubes(n):\n new = 0\n for num in range(1, n+1):\n new += num ** 3\n return new\n", "def sum_cubes(n):\n return sum((i+1)**3 for i in range(n)) # ahuel, da", "def sum_cubes(n):\n summ = 0\n for i in range(n):\n summ += (i+1)**3\n return summ", "def sum_cubes(n):\n a=0\n for x in range(1,n+1):\n a=(x**3) + a\n return a", "def sum_cubes(n):\n \n arr = []\n for i in range(1, n+1):\n arr.append(i)\n x = [i**3 for i in arr]\n return sum(x)", "def sum_cubes(n):\n sum = 0\n for n in range(1,n + 1):\n sum = sum + n ** 3\n return sum", "def sum_cubes(n):\n result = [0]\n if n == 1:\n return 1\n while n > 0:\n result.append(n**3)\n n -= 1\n return sum(result)", "def sum_cubes(n):\n sum = 0\n for i in range(1, n+1):\n sum += i*i*i\n return sum\n \n n = 6\n print((sum_cubes(n)))\n\n # your code here\n", "def sum_cubes(n):\n return sum(map(lambda a: a**3, range(1,n+1)))", "def sum_cubes(n):\n cubes = []\n for num in range(n+1):\n cubes.append(num ** 3)\n return sum(cubes)\n \n # your code here\n", "def sum_cubes(n):\n total = 0\n for a in range(1, n + 1):\n total += (a**3)\n return total", "def sum_cubes(n):\n return sum([(i**3) for i in range(1,n+1,1)])", "def sum_cubes(n):\n answer = 0\n for i in range(n+1):\n answer += i ** 3\n return answer", "def sum_cubes(n):\n return sum([int(x)**3 for x in range(1,n+1)])", "def sum_cubes(n):\n s = [i ** 3 for i in range(1, n+1)]\n return sum(s)", "def sum_cubes(n):\n return sum([x * x * x for x in range(n + 1)])", "def sum_cubes(n):\n i=1\n x=0\n while i < n+1:\n x = x + i**3\n i+=1\n \n return x", "import math\ndef sum_cubes(n):\n new = []\n for i in range(1,n+1):\n x = pow(i,3)\n new.append(x)\n i = i + 1\n return sum(new)\n\n\n\n", "def sum_cubes(n):\n sum = 0 \n for i in range(1,n+1):\n sum += i*i*i\n \n# main\n return sum\n\n", "def sum_cubes(n):\n # your code here\n return ( sum(x*x*x for x in range(n+1)))\n\nn=3\nsum_cubes(n)\n", "def sum_cubes(n):\n # your cod\n return sum([i**3 for i in range(n+1)])", "def sum_cubes(n):\n x= 1\n total = 0\n while x<=n:\n total+= x**3\n x+=1\n return total", "def sum_cubes(n):\n return sum([number ** 3 for number in range(1,n+1)])", "def sum_cubes(n):\n suma = 0\n for i in range(1, n+1):\n suma += i**3\n\n return suma\n\nprint((sum_cubes(2)))\n", "def sum_cubes(n):\n i=1\n m=0\n while i<=n:\n cube=i**3\n m=m+cube\n i=i+1\n return m\n", "def sum_cubes(n):\n return sum([item**3 for item in range(1, n + 1, 1)])", "def sum_cubes(n):\n count = 0\n for i in range(n+1):\n count += (i ** 3)\n return count", "def sum_cubes(n):\n cubes, numbers = [], [n]\n\n for i in range(0, n):\n numbers.append(int(i))\n\n for num in numbers:\n cubes.append(int(num*num*num))\n return sum(cubes)", "def sum_cubes(n):\n return sum([a**3 for a in range(n+1)])", "def sum_cubes(n):\n counter=0\n saver=0\n while counter<=n:\n saver=counter**3+saver\n counter+=1\n \n return saver\n", "def sum_cubes(n):\n values = range(1, n + 1)\n s = 0\n for value in values:\n cubed = value ** 3\n s += cubed\n return s", "def sum_cubes(n):\n if n==1:\n return 1\n LV=[]\n for i in range(n+1):\n res=i**3\n LV.append(res)\n return sum(LV)", "def sum_cubes(n):\n # your code here\n y = n + 1\n x = list(range(0,y))\n z = []\n for i in x:\n a = i ** 3\n z.append(a)\n return sum(z)", "def sum_cubes(n):\n res = 0\n if n > 0:\n for x in range(1, n + 1):\n res += x ** 3\n return res", "def sum_cubes(n):\n a=0\n for i in range(n+1):\n a=i*i*i+a\n i+=1\n return a", "def sum_cubes(n):\n result = 0\n for i in range(0, n + 1):\n cube = i ** 3\n result += cube\n return result\n # your code here\n", "def sum_cubes(n):\n return (n*(n+1)*n*(n+1))/4; ", "def sum_cubes(n):\n\n# There must be a shorter way!\n\n step1 = list(range(n))\n step2 = [x + 1 for x in step1]\n \n return sum([x**3 for x in step2])\n \n \n \n", "def sum_cubes(n):\n g = 0\n for i in range(n + 1):\n i **= 3\n g += i\n return g\n", "def sum_cubes(n):\n ans = 0\n for x in range(1,n+1):\n ans += x ** 3\n return ans", "def sum_cubes(n):\n cubes = 0\n for i in range(1, n+1):\n cubes += i*i*i \n return cubes\n", "def sum_cubes(n):\n sum = 0\n for number in range(1,n + 1):\n cube = number ** 3\n sum += cube\n return sum", "def sum_cubes(n):\n return sum(nb ** 3 for nb in range(1, n + 1))", "def sum_cubes(n):\n numlist = []\n while n >= 0: \n numlist.append(n)\n n = n -1\n return sum(numlist)**2\n # your code here\n", "def sum_cubes(n):\n # your code here\n suma=0\n for i in range(n):\n suma=suma+(i+1)**3\n return suma", "def sum_cubes(n):\n exponentiated = 0\n for count in range(1, n):\n exponentiated += count ** 3\n return exponentiated + n ** 3", "def sum_cubes(n):\n x=[num**3 for num in range(n+1)]\n return(sum(x))", "from math import *\ndef sum_cubes(n):\n total = 0\n for i in range(n+1):\n total += int(pow(i,3))\n return total", "def sum_cubes(n):\n cubed = 0\n for i in range(n+1):\n cubed+=i*i*i\n i+=1\n return cubed\n", "def sum_cubes(n):\n sums = 0\n for num in range(0, n+1):\n sums+= (num **3)\n return sums", "def sum_cubes(n):\n sums = []\n for item in range(n):\n item += 1\n cube = pow(item,3)\n sums.append(cube)\n return sum(sums)", "def sum_cubes(n):\n res = 1\n \n while n > 1:\n res += (n*n*n)\n n -= 1\n \n return res", "def sum_cubes(n):\n cubes = map(lambda x: x ** 3, range(1, n + 1)) \n return sum(cubes)", "def sum_cubes(a):\n return sum([k**3 for k in range(1,a+1)])", "def sum_cubes(a):\n summ=0\n for k in range(1,a+1):\n summ+=k**3\n return summ", "def sum_cubes(n):\n return (n**2 + n)**2 // 4", "def sum_cubes(n): \n sum = 0\n for i in range(n +1 ):\n sum += i\n return sum * sum"] | {"fn_name": "sum_cubes", "inputs": [[1], [2], [3], [4], [10], [123]], "outputs": [[1], [9], [36], [100], [3025], [58155876]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 10,405 |
def sum_cubes(n):
|
72a6723d1401eab2a4e4fa4679dc2715 | UNKNOWN | ## Task
Generate a sorted list of all possible IP addresses in a network.
For a subnet that is not a valid IPv4 network return `None`.
## Examples
```
ipsubnet2list("192.168.1.0/31") == ["192.168.1.0", "192.168.1.1"]
ipsubnet2list("213.256.46.160/28") == None
``` | ["import ipaddress as ip\n\ndef ipsubnet2list(subnet):\n try: return list(map(str,ip.ip_network(subnet).hosts()))\n except: pass", "def ip_to_int(ip):\n return sum(int(i[0]) << i[1]*8 for i in zip(ip.split('.'), range(3,-1,-1)))\ndef int_to_ip(num):\n return '.'.join(str(num >> i*8 & 0xff) for i in range(3,-1,-1))\n\ndef ipsubnet2list(subnet):\n net, prelen = subnet.split('/')\n num, mask = ip_to_int(net), 1 << 32 - int(prelen)\n if net != int_to_ip(num):\n return None\n if mask == 2:\n return [int_to_ip(num), int_to_ip(num+1)]\n return [int_to_ip(num^i) for i in range(1, mask-1)]", "from ipaddress import ip_network\nfrom typing import List, Union\n\n\ndef ipsubnet2list(subnet: str) -> Union[List[str], None]:\n try:\n return list(map(str, ip_network(subnet).hosts()))\n except ValueError:\n return\n", "def cidr_to_bits(subnet): \n subnet_int = int(subnet[-2:]) \n mask_in_bits = [(1,0)[i > subnet_int] for i in range(1,33)]\n return mask_in_bits \n\ndef ip_bits(subnet):\n ip_bits_str = list([format(int(x),'#010b')[2:] for x in subnet[:-3].split('.')])\n ip_bits_int = [ int(i) for x in ip_bits_str for i in x]\n return ip_bits_int # Address from input in bits\n\ndef f_addr_bits(x):\n return [ i&j for i,j in zip(ip_bits(x),cidr_to_bits(x))] # AND opperation on IP in bits and MASK in bits to achive first address in pool\n\ndef l_addr_bits(x):\n not_on_mask = [(0,1)[ i == 0] for i in cidr_to_bits(x)] # OR opperation on IP in bits and MASK in bits to achive last address in pool\n return [ i|j for i,j in zip(f_addr_bits(x),not_on_mask)]\n\ndef address_to_int(bits_lst):\n return [int(''.join(str(bits_lst[y+i]) for i in range(8)),2) for y in range(0,32,8)] # Translate list of 32 bits to 4 octets with ints [192, 168, 0 ,1] \n\ndef list_of_addresses(x):\n first_address = address_to_int(f_addr_bits(x)) \n last_address = address_to_int(l_addr_bits(x))\n octets_ranges = [ [ i for i in range(i,j+1)] if j-i != 0 else [i] for i,j in zip(first_address,last_address)] # compare octets from first and last address if subtraction differs from 0 generate range of numbers \n addresses = []\n for first_oct in octets_ranges[0]:\n for second in octets_ranges[1]:\n for third in octets_ranges[2]:\n for fourth in octets_ranges[3]:\n addresses.append(f'{first_oct}.{second}.{third}.{fourth}')\n return addresses \n\ndef ipsubnet2list(subnet):\n result = list_of_addresses(subnet)\n \n if subnet[:-3] in result:\n if len(result) == 2: # this condition is only because kata is made kind of retarded, with 192.168.1.0/31 creator of this kata wants list [192.168.1.0, 192.168.1.1] but those are not host IP's like in other inputs\n return result \n return result[1:-1]\n \n else:\n return None\n", "from ipaddress import ip_network\n\ndef ipsubnet2list(subnet):\n try:\n return [ip.compressed for ip in ip_network(subnet).hosts()]\n except ValueError:\n return", "from ipaddress import IPv4Network, AddressValueError\n\ndef ipsubnet2list(subnet):\n try: return list(map(str, IPv4Network(subnet).hosts()))\n except AddressValueError: return None", "from ipaddress import IPv4Network, AddressValueError\n\n\ndef ipsubnet2list(subnet):\n try:\n ip_list = [str(ip) for ip in IPv4Network(subnet)]\n return ip_list[1:-1] if len(ip_list) > 2 else ip_list\n except AddressValueError:\n return None", "def ipsubnet2list(subnet):\n import ipaddress\n ls=[]\n try:\n for i in ipaddress.IPv4Network(subnet):\n ls.append(str(i))\n except :\n return None\n return ls[1:-1] if len(ls)>2 else ls", "def ipsubnet2list(subnet):\n netaddr,prefix=subnet.split('/')\n if not all([0<=int(x)<256 for x in netaddr.split('.')]):\n return None\n netaddrbyte=0\n for x in netaddr.split('.'):\n netaddrbyte=netaddrbyte*256+int(x)\n r=[]\n for i in range(2**(32-int(prefix))):\n addr=netaddrbyte+i\n a=[]\n for _ in range(4):\n a.append(addr%256)\n addr//=256\n r.append('.'.join(map(str,a[::-1])))\n if int(prefix)<31:\n r=r[1:-1]\n return r", "def ipsubnet2list(s):\n try:return[str(x)for x in list(__import__('ipaddress').ip_network(s).hosts())]\n except ValueError: return None"] | {"fn_name": "ipsubnet2list", "inputs": [["192.168.1.0/31"], ["195.20.15.0/28"], ["174.0.153.152/29"], ["213.192.46.160/28"], ["213.256.46.160/28"]], "outputs": [[["192.168.1.0", "192.168.1.1"]], [["195.20.15.1", "195.20.15.2", "195.20.15.3", "195.20.15.4", "195.20.15.5", "195.20.15.6", "195.20.15.7", "195.20.15.8", "195.20.15.9", "195.20.15.10", "195.20.15.11", "195.20.15.12", "195.20.15.13", "195.20.15.14"]], [["174.0.153.153", "174.0.153.154", "174.0.153.155", "174.0.153.156", "174.0.153.157", "174.0.153.158"]], [["213.192.46.161", "213.192.46.162", "213.192.46.163", "213.192.46.164", "213.192.46.165", "213.192.46.166", "213.192.46.167", "213.192.46.168", "213.192.46.169", "213.192.46.170", "213.192.46.171", "213.192.46.172", "213.192.46.173", "213.192.46.174"]], [null]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 4,487 |
def ipsubnet2list(subnet):
|
bba23b2fcbd897fe2d27110630baf867 | UNKNOWN | # Largest Rectangle in Background
Imagine a photo taken to be used in an advertisement. The background on the left of the motive is whitish and you want to write some text on that background. So you scan the photo with a high resolution scanner and, for each line, count the number of pixels from the left that are sufficiently white and suitable for being written on. Your job is to find the area of the largest text box you can place on those pixels.
Example:
In the figure below, the whitish background pixels of the scanned photo are represented by asterisks.
```
*********************************
*********
*******
******
******
******
**************
**************
**************
***************
*********************
```
If you count the pixels on each line from the left you get the list (or array, depending on which language you are using) `[33, 9, 7, 6, 6, 6, 14, 14, 14, 15, 21]`. The largest reactangle that you can place on these pixels has an area of 70, and is represented by the dots in the figure below.
```
*********************************
*********
*******
******
******
******
..............
..............
..............
..............*
..............*******
```
Write a function that, given a list of the number whitish pixels on each line in the background, returns the area of the largest rectangle that fits on that background. | ["def largest_rect(h):\n st=[]; m=0; i=0\n while i<len(h):\n if len(st)==0 or h[st[-1]]<=h[i]: st.append(i); i+=1\n else: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1))\n while len(st)>0: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1))\n return m", "def largest_rect(h):\n r,s,i,l=0,[],0,len(h)\n while i<l:\n if not s or h[s[-1]]<=h[i]: s.append(i); i+=1\n else: t=s.pop(); a=i-s[-1]-1 if s else i; a*=h[t]; r=r if r>a else a\n while s: t=s.pop(); a=i-s[-1]-1 if s else i; a*=h[t]; r=r if r>a else a\n return r", "from itertools import groupby\n\ndef largest_rect(histogram):\n histogram.append(0)\n stack = [-1]\n result = 0\n for i in range(len(histogram)):\n while histogram[i] < histogram[stack[-1]]:\n h = histogram[stack.pop()]\n w = i - stack[-1] - 1\n result = max(result, h * w)\n stack.append(i)\n histogram.pop()\n return result", "def largest_rect(histogram):\n stack, max_area = [], 0\n for i, h in enumerate(histogram + [0]):\n while stack and h <= histogram[stack[-1]]:\n height = histogram[stack.pop()]\n width = i if not stack else i - stack[-1] - 1\n max_area = max(max_area, height * width)\n stack.append(i)\n return max_area", "def largest_rect(histogram):\n dim = len(histogram)\n if dim == 0: return 0\n max_el = max(histogram)\n min_el = min(histogram)\n if max_el == min_el: return dim * max_el\n area = max_el if max_el > min_el * dim else min_el * dim\n \n arr_work = [histogram]\n while len(arr_work) > 0:\n h = arr_work.pop()\n dim = len(h)\n max_el = max(h)\n min_el = min(h)\n if max_el * dim < area:\n continue\n if max_el == min_el: \n if area < dim * max_el:\n area = dim * max_el\n continue\n area = min_el * dim if area < min_el * dim else area\n split_index = h.index(min_el)\n if split_index * max_el >= area:\n arr_work.append(list(reversed(h[:split_index])))\n if (dim - 1 - split_index) * max_el >= area:\n arr_work.append(list(reversed(h[(split_index + 1):])))\n\n return area", "def largest_rect(heights):\n maxArea = 0\n stack = [] # stack of pairs: (index, height)\n \n for i, h in enumerate(heights):\n start = i\n while stack and stack[-1][1] > h:\n index, height = stack.pop()\n maxArea = max(maxArea, height * (i - index))\n start = index\n stack.append((start, h))\n \n # remaining heights extended to the end of the histogram\n for i, h in stack:\n maxArea = max(maxArea, h * (len(heights) - i))\n return maxArea", "def largest_rect(r):\n s,m = [-1], 0\n for i in range(len(r)):\n while s[-1]!=-1 and r[s[-1]]>=r[i]:m=max(m,r[s.pop()]*(i-s[-1]-1))\n s.append(i)\n while s[-1]!=-1:m=max(m,r[s.pop()]*(len(r)-s[-1]-1))\n return m", "from collections import deque\n\ndef largest_rect(a):\n areas, stack, a = [], deque(), a + [0]\n for i, x in enumerate(a):\n j = i\n while len(stack) > 0 and x <= stack[-1][1]:\n j, h = stack.pop()\n areas.append((i-j) * h)\n stack.append((j, x))\n return max(areas or [0])", "def largest_rect(histogram):\n lis, ris = [], []\n st = []\n for i in range(len(histogram)):\n while st and histogram[st[-1]] >= histogram[i]:\n st.pop()\n lis.append(st[-1] if st else -1)\n st.append(i)\n st = []\n for i in reversed(range(len(histogram))):\n while st and histogram[st[-1]] >= histogram[i]:\n st.pop()\n ris.append(st[-1] if st else len(histogram))\n st.append(i)\n return max((w * (ri - li - 1) for w, li, ri in zip(histogram, lis, reversed(ris))), default=0)", "def largest_rect(histogram):\n if not histogram : return 0\n \n maxi = 0\n pile = []\n \n for elt in histogram:\n coeff =0 \n while(pile and elt<pile[-1][0]):\n top1, top2 = pile.pop()\n coeff += top2\n score = top1*coeff\n maxi = max(maxi, score)\n \n pile.append([elt,coeff+1])\n \n coeff = 0\n while(pile):\n top1, top2 = pile.pop()\n coeff += top2\n score = top1*coeff\n maxi = max(maxi, score)\n \n return maxi"] | {"fn_name": "largest_rect", "inputs": [[[3, 5, 12, 4, 10]], [[6, 2, 5, 4, 5, 1, 6]], [[9, 7, 5, 4, 2, 5, 6, 7, 7, 5, 7, 6, 4, 4, 3, 2]], [[]], [[0]], [[0, 0, 0]], [[1, 1, 1]], [[1, 2, 3]], [[3, 2, 1]], [[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]], [[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]]], "outputs": [[16], [12], [36], [0], [0], [0], [3], [4], [4], [100000], [10000000]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 4,460 |
def largest_rect(histogram):
|
f7d7d5c326885db8ad91c2e77bdf800a | UNKNOWN | You have a two-dimensional list in the following format:
```python
data = [[2, 5], [3, 4], [8, 7]]
```
Each sub-list contains two items, and each item in the sub-lists is an integer.
Write a function `process_data()` that processes each sub-list like so:
* `[2, 5]` --> `2 - 5` --> `-3`
* `[3, 4]` --> `3 - 4` --> `-1`
* `[8, 7]` --> `8 - 7` --> `1`
and then returns the product of all the processed sub-lists: `-3 * -1 * 1` --> `3`.
For input, you can trust that neither the main list nor the sublists will be empty. | ["def process_data(data):\n r = 1\n for d in data:\n r *= d[0] - d[1]\n return r", "from functools import reduce\nfrom itertools import starmap\nfrom operator import mul, sub\n\ndef process_data(data):\n return reduce(mul, starmap(sub, data))", "def process_data(data):\n product = 1\n \n for tuple in data:\n product *= tuple[0] - tuple[1]\n \n return product\n \n", "def process_data(data):\n from numpy import prod, sum\n return prod([el1 - el2 for el1, el2 in data])\n", "def process_data(data):\n result=1\n for item in data:\n result*= item[0]-item[1]\n return result", "process_data = lambda d, reduce=__import__(\"functools\").reduce: reduce(int.__mul__, (x - y for x, y in d))", "from operator import mul, sub\nfrom functools import reduce\n\ndef process_data(data):\n return reduce(mul, [reduce(sub,x) for x in data])", "from functools import reduce\n\ndef process_data(data):\n return reduce(lambda m, n: m * n, [(a - b) for a, b in data], 1)", "def process_data(data):\n output = 1\n for sub_list in data:\n output *= sub_list[0] - sub_list[1]\n return output", "def process_data(data):\n array=[]\n \n for n in data:\n array_element=n[0]-n[1]\n array.append(array_element)\n\n c=1\n for d in array:\n c*=d\n \n return c"] | {"fn_name": "process_data", "inputs": [[[[2, 5], [3, 4], [8, 7]]], [[[2, 9], [2, 4], [7, 5]]], [[[5, 4], [6, 4]]], [[[2, 1], [5, 3], [7, 4], [10, 6]]]], "outputs": [[3], [28], [2], [24]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,357 |
def process_data(data):
|
f2c9383f253f2ef59aa2886a77415347 | UNKNOWN | You are going to be given a word. Your job will be to make sure that each character in that word has the exact same number of occurrences. You will return `true` if it is valid, or `false` if it is not.
For example:
`"abcabc"` is a valid word because `'a'` appears twice, `'b'` appears twice, and`'c'` appears twice.
`"abcabcd"` is **NOT** a valid word because `'a'` appears twice, `'b'` appears twice, `'c'` appears twice, but `'d'` only appears once!
`"123abc!"` is a valid word because all of the characters only appear once in the word.
For this kata, capitals are considered the same as lowercase letters. Therefore: `'A' == 'a'` .
#Input
A string (no spaces) containing `[a-z],[A-Z],[0-9]` and common symbols. The length will be `0 < string < 100`.
#Output
`true` if the word is a valid word, or `false` if the word is not valid. | ["from collections import Counter\n\ndef validate_word(word):\n return len(set(Counter(word.lower()).values())) == 1", "from collections import Counter\n\n\ndef validate_word(word):\n return 1 == len(set(Counter(word.upper()).values()))\n", "def validate_word(word):\n word = word.lower()\n return len(set(word.count(c) for c in word)) == 1", "from collections import Counter\nvalidate_word=lambda word: len(set(Counter(word.lower()).values())) == 1", "from collections import Counter\n\ndef validate_word(word):\n count = Counter(word.lower())\n \n return len(set(count.values())) == 1", "validate_word = lambda w: len(set(w.lower().count(e) for e in set(w.lower())))==1", "def validate_word(word):\n #your code here\n word = word.lower()\n c_count = word.count(word[0])\n for c in word:\n if word.count(c) != c_count:\n return False\n return True", "def validate_word(word):\n word = word.lower()\n return all(word.count(i) == word.count(word[0]) for i in word)\n", "def validate_word(word):\n word = word.lower()\n arr = list(set(word))\n for i in range(1,len(arr)):\n if word.count(arr[i]) != word.count(arr[i-1]):\n return False\n return True"] | {"fn_name": "validate_word", "inputs": [["abcabc"], ["Abcabc"], ["AbcabcC"], ["AbcCBa"], ["pippi"], ["?!?!?!"], ["abc123"], ["abcabcd"], ["abc!abc!"], ["abc:abc"]], "outputs": [[true], [true], [false], [true], [false], [true], [true], [false], [true], [false]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,241 |
def validate_word(word):
|
6c2be97d192b815a550c68d66d08b87f | UNKNOWN | Write a function that takes one or more arrays and returns a new array of unique values in the order of the original provided arrays.
In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.
The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.
Check the assertion tests for examples.
*Courtesy of [FreeCodeCamp](https://www.freecodecamp.com/challenges/sorted-union), a great place to learn web-dev; plus, its founder Quincy Larson is pretty cool and amicable. I made the original one slightly more tricky ;)* | ["def unite_unique(*arg):\n res = []\n for arr in arg:\n for val in arr:\n if not val in res: res.append(val)\n return res", "from itertools import chain\n\ndef unite_unique(*args):\n return list(dict.fromkeys(chain.from_iterable(args)))", "from itertools import chain\n\ndef unite_unique(*arrs):\n r = list ()\n \n for item in chain (*arrs):\n if item not in r:\n r.append (item)\n\n return r\n", "def unite_unique(*arrays):\n output = []\n for arr in arrays:\n for i in arr:\n if i not in output: output.append(i)\n return output\n", "from itertools import chain\n\ndef unite_unique(*lists):\n cache = set()\n result = list()\n for elem in chain(*lists):\n if elem not in cache:\n result.append(elem)\n cache.add(elem)\n return result", "def unite_unique(*args):\n a = []\n for e in args:\n for x in e:\n if x not in a:\n a.append(x)\n return a", "from collections import OrderedDict\n\n\ndef unite_unique(*xss):\n return list(OrderedDict.fromkeys(x for xs in xss for x in xs))", "from collections import OrderedDict\ndef unite_unique(*args):\n return list(OrderedDict.fromkeys(sum([a for a in args], [])))", "def unite_unique(*args):\n result = []\n for e in sum(args, []):\n if e not in result:\n result.append(e)\n return result", "def unite_unique(*args):\n result = []\n [[result.append(nr) for nr in arg if nr not in result] for arg in args]\n return result\n", "\"\"\"\ngo through each array,\nkeep track of duplicate elements using a hash\nif it doesn exist store it in final array.\n\"\"\"\ndef unite_unique(*arrays):\n final = []\n table = {}\n \n for array in arrays:\n for elem in array:\n if elem not in final:\n final.append(elem)\n \n return final", "def unite_unique(*args):\n result = []\n for a in args:\n for b in a:\n if b not in result:\n result.append(b)\n return result\n", "def unite_unique(*array):\n return [y for x, y in enumerate(sum(array, [])) if y not in sum(array, [])[:x]]", "def unite_unique(*lists):\n l = [item for lst in lists for item in lst]\n s = set(l)\n return sorted(s, key=l.index)", "def unite_unique(*arrs):\n seen = set()\n return [i for a in arrs for i in a if not (i in seen or seen.add(i))]", "from collections import OrderedDict\ndef unite_unique(*lists):\n \n return list(OrderedDict.fromkeys(sum(lists,[])))", "from collections import OrderedDict\ndef unite_unique(*arrs):\n arrs = [x for arr in arrs for x in arr]\n return [x for i, x in enumerate(arrs) if i == arrs.index(x)]\n"] | {"fn_name": "unite_unique", "inputs": [[[1, 2], [3, 4]], [[1, 3, 2], [5, 2, 1, 4], [2, 1]], [[4, 3, 2, 2]], [[4, "a", 2], []], [[], [4, "a", 2]], [[], [4, "a", 2], []], [[]], [[], []], [[], [1, 2]], [[], [1, 2, 1, 2], [2, 1, 1, 2, 1]]], "outputs": [[[1, 2, 3, 4]], [[1, 3, 2, 5, 4]], [[4, 3, 2]], [[4, "a", 2]], [[4, "a", 2]], [[4, "a", 2]], [[]], [[]], [[1, 2]], [[1, 2]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,765 |
def unite_unique(*args):
|
421d0612de0b676f96f2837ad78c6dc1 | UNKNOWN | Brief
=====
Sometimes we need information about the list/arrays we're dealing with. You'll have to write such a function in this kata. Your function must provide the following informations:
* Length of the array
* Number of integer items in the array
* Number of float items in the array
* Number of string character items in the array
* Number of whitespace items in the array
The informations will be supplied in arrays that are items of another array. Like below:
`Output array = [[array length],[no of integer items],[no of float items],[no of string chars items],[no of whitespace items]]`
Added Difficulty
----------------
If any item count in the array is zero, you'll have to replace it with a **None/nil/null** value (according to the language). And of course, if the array is empty then return **'Nothing in the array!**. For the sake of simplicity, let's just suppose that there are no nested structures.
Output
======
If you're head is spinning (just kidding!) then these examples will help you out-
```
array_info([1,2,3.33,4,5.01,'bass','kick',' '])--------->[[8],[3],[2],[2],[1]]
array_info([0.001,2,' '])------------------------------>[[3],[1],[1],[None],[1]]
array_info([])----------------------------------------->'Nothing in the array!'
array_info([' '])-------------------------------------->[[1],[None],[None],[None],[1]]
```
Remarks
-------
The input will always be arrays/lists. So no need to check the inputs.
Hint
====
See the tags!!!
Now let's get going ! | ["def array_info(x):\n if not x:\n return 'Nothing in the array!'\n return [\n [len(x)],\n [sum(isinstance(i, int) for i in x) or None],\n [sum(isinstance(i, float) for i in x) or None],\n [sum(isinstance(i, str) and not i.isspace() for i in x) or None],\n [sum(isinstance(i, str) and i.isspace() for i in x) or None],\n ]", "array_info=lambda x: [[len(x)],[len([a for a in x if type(a)==int]) or None],[len([a for a in x if type(a)==float]) or None],[len([a for a in x if type(a)==str and a!=\" \"]) or None],[len([a for a in x if a==\" \"]) or None]] if len(x) else 'Nothing in the array!'", "from collections import defaultdict\n\ndef array_info(arr):\n d = defaultdict(int)\n for v in arr:\n d[type(v)] += 1\n d[' '] += v==' '\n if not arr: return 'Nothing in the array!'\n return [[x or None] for x in (len(arr), d[int], d[float], d[str]-d[' '], d[' '])]", "def array_info(x):\n TheDICT = {'len':[1,len(x)], int:[2,0], str:[4,0], float:[3,0], 'void':[5,x.count(' ')]}\n for e in x:\n if e != ' ':\n TheDICT[type(e)][1] += 1\n return [ [e[1] if e[1] else None] for e in sorted( TheDICT.values() ) ] if x else 'Nothing in the array!'\n \n \n", "def array_info(x):\n if not x: return 'Nothing in the array!'\n L = [0]*4\n for e in x:\n if type(e) == int: L[0] += 1\n elif type(e) == float: L[1] += 1\n elif e == ' ': L[3] += 1\n else: L[2] += 1\n return [[len(x)]] + [[e or None] for e in L]", "def array_info(arr):\n res = [len(arr), 0, 0, 0, 0]\n for i in arr:\n if type(i) == int:\n res[1] += 1\n elif type(i) == float:\n res[2] += 1\n elif type(i) == str:\n if len(i) * ' ' == i:\n res[4] += 1\n else:\n res[3] += 1\n return [[i] if i else [None] for i in res] if arr else 'Nothing in the array!'", "def array_info(x):\n if not x: return 'Nothing in the array!'\n ints = floats = strings = whitespaces = 0\n for e in x:\n if isinstance(e, str):\n if e.isspace():\n whitespaces += 1\n else:\n strings += 1\n else:\n if float(e).is_integer():\n ints += 1\n else:\n floats += 1\n return [[c or None] for c in (len(x), ints, floats, strings, whitespaces)]", "def array_info(x):\n if len(x)==0: return 'Nothing in the array!'\n info = [[len(x)], \n [sum(1 for y in x if isinstance(y, int))], \n [sum(1 for y in x if isinstance(y, float))], \n [sum(1 for y in x if (isinstance(y, str)) and y!= \" \")], \n [sum(1 for y in x if y==\" \")]]\n for j, i in enumerate(info): \n if i == [0]: info[j]=[None]\n return info", "def array_info(x):\n \n if not x: return 'Nothing in the array!'\n \n a,b,c,d,e = [len(x)],\\\n [len([y for y in x if isinstance(y, int)])],\\\n [len([y for y in x if isinstance(y, float)])],\\\n [len([y for y in x if isinstance(y, str) and y != ' '])],\\\n [len([y for y in x if y == ' '])]\n \n return [a if a[0] != 0 else [None],\n b if b[0] != 0 else [None],\n c if c[0] != 0 else [None],\n d if d[0] != 0 else [None],\n e if e[0] != 0 else [None]]", "def array_info(x):\n return [[len(x) or None],[sum(isinstance(n,int) for n in x) or None],[sum(isinstance(n,float) for n in x) or None],[sum(isinstance(n,str) and n!=\" \" for n in x) or None],[sum(n==\" \" for n in x) or None]] if x else \"Nothing in the array!\""] | {"fn_name": "array_info", "inputs": [[[1, 2, 3.33, 4, 5.01, "bass", "kick", " "]], [[0.001, 2, " "]], [[]], [[" "]], [[" ", " "]], [["jazz"]], [[4]], [[3.1416]], [[11, 22, 33.33, 44.44, "hasan", "ahmad"]], [["a", "b", "c", "d", " "]], [[1, 2, 3, 4, 5, 6, 7, 8, 9]], [[1, 2.23, "string", " "]]], "outputs": [[[[8], [3], [2], [2], [1]]], [[[3], [1], [1], [null], [1]]], ["Nothing in the array!"], [[[1], [null], [null], [null], [1]]], [[[2], [null], [null], [null], [2]]], [[[1], [null], [null], [1], [null]]], [[[1], [1], [null], [null], [null]]], [[[1], [null], [1], [null], [null]]], [[[6], [2], [2], [2], [null]]], [[[5], [null], [null], [4], [1]]], [[[9], [9], [null], [null], [null]]], [[[4], [1], [1], [1], [1]]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,769 |
def array_info(x):
|
d1c12e3721093720b18e826531a2a41e | UNKNOWN | In this kata you will have to modify a sentence so it meets the following rules:
convert every word backwards that is:
longer than 6 characters
OR
has 2 or more 'T' or 't' in it
convert every word uppercase that is:
exactly 2 characters long
OR
before a comma
convert every word to a "0" that is:
exactly one character long
NOTES:
Punctuation must not be touched. if a word is 6 characters long, and a "." is behind it,
it counts as 6 characters so it must not be flipped, but if a word is 7 characters long,
it must be flipped but the "." must stay at the end of the word.
-----------------------------------------------------------------------------------------
Only the first transformation applies to a given word, for example 'companions,'
will be 'snoinapmoc,' and not 'SNOINAPMOC,'.
-----------------------------------------------------------------------------------------
As for special characters like apostrophes or dashes, they count as normal characters,
so e.g 'sand-colored' must be transformed to 'deroloc-dnas'. | ["import re\n\ndef spiner(s,p):\n return ( s[::-1] if len(s) > 6 or s.lower().count('t') > 1\n else s.upper() if len(s) == 2 or p == ','\n else '0' if len(s) == 1\n else s) + p\n\ndef spin_solve(sentence):\n return re.sub(r\"((?:\\w|['-])+)(\\W)?\", lambda m: spiner(m.group(1), m.group(2) or ''), sentence)", "from functools import partial\nfrom re import compile\n\ns = r\"[\\w'-]\"\nx = fr\"(?<!{s})\"\ny = fr\"(?!{s})\"\n\nconv1 = partial(compile(fr\"{s}{{7,}}|{s}*[tT]{s}*[tT]{s}*\").sub, lambda x:x.group()[::-1])\nconv2 = partial(compile(fr\"{x}({s}{s}{y}|{s}{{1,6}}(?=,))\").sub, lambda x:x.group().upper())\nconv3 = partial(compile(fr\"{x}\\w{y}(?!,)\").sub, \"0\")\n\ndef spin_solve(sentence):\n return conv3(conv2(conv1(sentence)))", "import re\n\ndef spin_solve(sentence):\n def f(m):\n s, punc = m.groups()\n return (\n s[::-1] if len(s) > 6 or s.lower().count('t') >= 2 else\n s.upper() if len(s) == 2 or punc == ',' else\n '0' if len(s) == 1 else\n s\n ) + punc\n return re.sub(r\"([-'a-zA-Z]+)([,.?!]?)\", f, sentence)\n", "spin_solve=lambda s:' '.join([[[[i,'0'][len(i)==1],i.upper()][len(i)-(i[-1].isalpha()^1)==2or i[-1]==','],i[:len(i)if i[-1].isalpha()else-1][::-1]+[i[-1],''][i[-1].isalpha()]][len(i)-(i[-1].isalpha()^1)>6or i.lower().count('t')>1] for i in s.split()])", "import re\nW = lambda Q : ''.join(reversed(Q)) if 6 < len(Q) and ',' != Q[-1] or 1 < Q.upper().count('T') else '0' if 1 == len(Q) else Q.upper() if 2 == len(Q) or ',' == Q[-1] else Q\nspin_solve = lambda Q : re.sub('[\\w\\'-]{1,6},|[\\w\\'-]+',lambda S : W(S.group()),Q)", "def spin_solve(sentence):\n r=[]\n for w in sentence.split(' '):\n l=len(w.rstrip(',.'))\n if l>6 or w.lower().count('t')>=2:\n s=w[::-1]\n if not s[0].isalpha():\n s=s[1:]+s[0]\n r.append(s)\n elif l==2 or w[-1]==',':\n r.append(w.upper())\n elif l==1:\n r.append('0')\n else:\n r.append(w)\n return ' '.join(r)", "def spin_solve(sentence):\n r = []\n for s in sentence.split():\n p,c = s.endswith('.'),s.endswith(',')\n s = s[:-1] if p or c else s\n if len(s)>6 or s.lower().count('t')>1:\n r.append(s[::-1] + ('.' if p else ',' if c else ''))\n elif len(s)==2 or c:\n r.append(s.upper() + ('.' if p else ',' if c else ''))\n elif len(s)==1:\n r.append('0' + ('.' if p else ',' if c else ''))\n else:\n r.append(s + ('.' if p else ',' if c else ''))\n return ' '.join(r)\n", "def spin_solve(sentence):\n s=''\n w=''\n for ot in sentence:\n if ot.isalpha() or ot in\"'-'\":\n w+=ot\n else:\n if len(w)>6 or w.upper().count(\"T\")>1:\n s+=w[::-1]\n elif len(w)==2 or ot==',':\n s+=w.upper()\n elif len(w)==1:\n s+=\"0\"\n else:\n s+=w\n w=''\n s+=ot\n return s", "def spin_solve(sentence):\n nu_list=[]\n words = sentence[:-1].split()\n for x in words:\n if x.endswith(',') and len(x) > 7:\n x=x[:-1]\n nu_list.append(f\"{x[::-1]},\")\n elif x.endswith(',') and len(x) <= 7 or len(x) == 2:\n nu_list.append(x.upper()) \n elif len(x) > 6 or x.count('t') >= 2:\n nu_list.append(x[::-1])\n elif len(x) == 1:\n nu_list.append('0')\n elif len(x) ==3 or len(x) <= 6:\n nu_list.append(x)\n return f\"{' '.join(nu_list)}.\"", "import re\ndef spin_solve(sentence):\n ans = sentence.split()\n for idx, val in enumerate(ans):\n t = re.sub('[^\\w-]', '', val)\n if len(t) > 6 or t.lower().count('t') > 1:\n ans[idx] = t[::-1] + val[len(t):]\n elif len(t) == 2 or val.endswith(','):\n ans[idx] = val.upper()\n elif len(t) == 1:\n ans[idx] = '0' \n return ' '.join(ans)"] | {"fn_name": "spin_solve", "inputs": [["Welcome."], ["If a man does not keep pace with his companions, perhaps it is because he hears a different drummer."], ["As Grainier drove along in the wagon behind a wide, slow, sand-colored mare, clusters of orange butterflies exploded off the purple blackish piles of bear sign and winked and winked and fluttered magically like leaves without trees."], ["You should check the mileage on your car since you've been driving it so much, and because it's starting to make weird noises."], ["Wherever you go, you can always find beauty."], ["Action is indeed, commmmmmmming."], ["Mother, please, help, me."], ["Jojojo, jojo, tata man kata."]], "outputs": [["emocleW."], ["IF 0 man does not keep pace with his snoinapmoc, spahrep IT IS esuaceb HE hears 0 tnereffid remmurd."], ["AS reiniarG drove along IN the wagon behind 0 WIDE, SLOW, deroloc-dnas MARE, sretsulc OF orange seilfrettub dedolpxe off the purple hsikcalb piles OF bear sign and winked and winked and derettulf yllacigam like leaves tuohtiw trees."], ["You should check the egaelim ON your car since you've been gnivird IT SO MUCH, and esuaceb it's gnitrats TO make weird noises."], ["reverehW you GO, you can always find beauty."], ["Action IS INDEED, gnimmmmmmmmoc."], ["MOTHER, PLEASE, HELP, ME."], ["JOJOJO, JOJO, atat man kata."]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 4,117 |
def spin_solve(sentence):
|
d9629cb2b74a6c6a3c4a68ef9a8050f6 | UNKNOWN | # Task
Let's consider a table consisting of `n` rows and `n` columns. The cell located at the intersection of the i-th row and the j-th column contains number i × j. The rows and columns are numbered starting from 1.
You are given a positive integer `x`. Your task is to count the number of cells in a table that contain number `x`.
# Example
For `n = 5 and x = 5`, the result should be `2`.
The table looks like:
```
1 2 3 4 (5)
2 4 6 8 10
3 6 9 12 15
4 8 12 16 20
(5) 10 15 20 25```
There are two number `5` in it.
For `n = 10 and x = 5`, the result should be 2.
For `n = 6 and x = 12`, the result should be 4.
```
1 2 3 4 5 6
2 4 6 8 10 (12)
3 6 9 (12) 15 18
4 8 (12) 16 20 24
5 10 15 20 25 30
6 (12) 18 24 30 36
```
# Input/Output
- `[input]` integer `n`
`1 ≤ n ≤ 10^5.`
- `[input]` integer `x`
`1 ≤ x ≤ 10^9.`
- `[output]` an integer
The number of times `x` occurs in the table. | ["def count_number(n, x):\n return len([j for j in range(1,n+1) if x%j==0 and x/j <= n]) ", "from math import ceil\n\ndef count_number(n, x):\n return sum(x % i == 0 for i in range(max(int(ceil(x / n)), 1), min(n,x) + 1))", "def count_number(n, x):\n #your code here\n return sum(1 for i in range(1,n+1) if x//i in range(1,n+1) and x%i==0) \n", "count_number=lambda n,x:sum(x%e==0for e in range(1,n+1)if e*n>=x)", "def count_number(n, x):\n return sum(range(i, i * n + 1, i).count(x) for i in range(1, n+1))", "from math import ceil\ndef count_number(n, x):\n return sum(x % a == 0 for a in range(ceil(x / n), n + 1))", "def count_number(n, x):\n k = [1, x // n][x > n]\n return sum(1 for i in range(k, n + 1) if x/i == x//i and x/i in range(1, n + 1))", "count_number=lambda n,x:sum(x-n*r<=x%r<1for r in range(1,n+1))", "from math import ceil\n\ndef count_number(n, x):\n return sum((x%i == 0) and (x/i != i) + 1 for i in range(ceil(x/n), int(x**0.5)+1))", "count_number=lambda n,x: (lambda r: len([i for i in range(1,int(r)+1) if x%i==0 and x/i<=n])*2-(1 if r%1==0 and r<=n else 0))(x**0.5)"] | {"fn_name": "count_number", "inputs": [[5, 5], [10, 5], [6, 12], [6, 169], [100000, 1000000000]], "outputs": [[2], [2], [4], [0], [16]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,121 |
def count_number(n, x):
|
408344d25dc1ebc96688483dafae14cb | UNKNOWN | If the first day of the month is a Friday, it is likely that the month will have an `Extended Weekend`. That is, it could have five Fridays, five Saturdays and five Sundays.
In this Kata, you will be given a start year and an end year. Your task will be to find months that have extended weekends and return:
```
- The first and last month in the range that has an extended weekend
- The number of months that have extended weekends in the range, inclusive of start year and end year.
```
For example:
```python
solve(2016,2020) = ("Jan","May",5). #The months are: Jan 2016, Jul 2016, Dec 2017, Mar 2019, May 2020
```
More examples in test cases. Good luck!
If you found this Kata easy, please try [myjinxin2015](https://www.codewars.com/users/myjinxin2015) challenge version [here](https://www.codewars.com/kata/extended-weekends-challenge-edition) | ["from calendar import month_abbr\nfrom datetime import datetime \ndef solve(a,b):\n res = [month_abbr[month]\n for year in range(a, b+1) \n for month in [1,3,5,7,8,10,12] \n if datetime(year, month, 1).weekday() == 4]\n return (res[0],res[-1], len(res))", "from datetime import date\n\ndef solve(a, b):\n first = None\n count = 0\n for year in range(a, b + 1):\n for month in (1, 3, 5, 7, 8, 10, 12):\n d = date(year, month, 1)\n if d.weekday() == 4:\n last = d.strftime(\"%b\")\n if first is None:\n first = last\n count += 1\n return (first, last, count)\n", "import calendar\n\nDICT = {\n 1: \"Jan\",\n 2: \"Feb\",\n 3: \"Mar\",\n 4: \"Apr\",\n 5: \"May\",\n 6: \"Jun\",\n 7: \"Jul\",\n 8: \"Aug\",\n 9: \"Sep\",\n 10: \"Oct\",\n 11: \"Nov\",\n 12: \"Dec\"\n}\n\n\ndef solve(a, b):\n extended_weekends_list = []\n for year in range(a, b + 1):\n for month in range(1, 13):\n if calendar.monthrange(year, month) == (4, 31):\n extended_weekends_list.append([year, month])\n\n result = (DICT[extended_weekends_list[0][1]], DICT[extended_weekends_list[-1][1]], len(extended_weekends_list))\n return result\n", "from datetime import *\n\ndef solve(a,b):\n ans = []\n for i in range(a, b+1):\n for j in (1, 3, 5, 7, 8, 10, 12):\n start = date(i, j, 1)\n if start.strftime(\"%a\") == \"Fri\":\n ans.append(start.strftime(\"%b\"))\n return (ans[0], ans[-1], len(ans))", "from calendar import FRIDAY\nfrom datetime import datetime\n\n\ndef solve(a, b):\n ds = (datetime(year, month, 1) for year in range(a, b+1) for month in [1, 3, 5, 7, 8, 10, 12])\n ds = [d for d in ds if d.weekday() == FRIDAY]\n return format(ds[0], '%b'), format(ds[-1], '%b'), len(ds)\n", "import calendar as c\ndef solve(a, b):\n weeks = [j for i in range(a, b+1) for j in [1,3,5,7,8,10,12] if c.monthrange(i, j) == (4, 31)]\n return (c.month_name[weeks[0]][:3], c.month_name[weeks[-1]][:3], len(weeks))", "from datetime import date\n\nMONTHS_31 = (1,3,5,7,8,10,12)\n\ndef solve(a,b):\n cnt, first, last = 0, None, None\n for y in range(a,b+1):\n for m in MONTHS_31:\n d = date(y,m,1)\n if d.weekday()==4:\n cnt, first, last = cnt+1, first or d, d\n return first.strftime('%b'), last.strftime('%b'), cnt", "from datetime import date\nfrom calendar import month_name\n\ndef solve(a,b):\n m,c,res,s = [1,3,5,7,8,10,12],0 , [], '',\n for i in range(a,b+1):\n for j in m:\n if date(i,j,1).weekday() == 4:\n res.append(j); c+=1; s = ''\n return (month_name[res[0]][:3],month_name[res[-1]][:3],c)", "from calendar import month_abbr as abr\nfrom datetime import *\n\ndef solve(a,b):\n ans = [abr[m] for y in range(a,b+1) for m in (1,3,5,7,8,10,12) if date(y, m, 1).weekday() == 4]\n return (ans[0], ans[-1], len(ans))", "from datetime import date\n\ndef solve(a, b):\n r = []\n for y in range(a, b + 1):\n for m in 1, 3, 5, 7, 8, 10, 12:\n d = date(y, m, 1)\n if d.weekday() == 4:\n r.append(d.strftime('%b'))\n return r[0], r[-1], len(r)"] | {"fn_name": "solve", "inputs": [[2016, 2020], [1900, 1950], [1800, 2500]], "outputs": [[["Jan", "May", 5]], [["Mar", "Dec", 51]], [["Aug", "Oct", 702]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,326 |
def solve(a,b):
|
ee85d10a4d9746e28b327b7773dbb3a7 | UNKNOWN | It's the most hotly anticipated game of the school year - Gryffindor vs Slytherin! Write a function which returns the winning team.
You will be given two arrays with two values.
The first given value is the number of points scored by the team's Chasers and the second a string with a 'yes' or 'no' value if the team caught the golden snitch!
The team who catches the snitch wins their team an extra 150 points - but doesn't always win them the game.
If the score is a tie return "It's a draw!""
** The game only ends when someone catches the golden snitch, so one array will always include 'yes' or 'no.' Points scored by Chasers can be any positive integer. | ["def game_winners(gryffindor, slytherin):\n g, s = (team[0] + 150 * (team[1] == 'yes') for team in [gryffindor, slytherin])\n return 'Gryffindor wins!' if g > s else 'Slytherin wins!' if s > g else \"It's a draw!\"", "def game_winners(gryffindor, slytherin):\n g = gryffindor[0]\n s = slytherin[0]\n if gryffindor[1] == \"yes\":\n g += 150\n else:\n s += 150\n if g > s:\n return \"Gryffindor wins!\"\n elif g < s:\n return \"Slytherin wins!\"\n else:\n return \"It's a draw!\"\n", "def game_winners(*scores):\n gry, sly = (ch + 150 * (gs == \"yes\") for ch, gs in scores)\n return \"It's a draw!\" if gry == sly else f\"{'Gryffindor' if gry > sly else 'Slytherin'} wins!\"", "def game_winners(gryffindor, slytherin):\n g = gryffindor[0] + (150 if gryffindor[1] == 'yes' else 0)\n s = slytherin[0] + (150 if slytherin[1] == 'yes' else 0)\n return 'It\\'s a draw!' if g == s else '{} wins!'.format('Gryffindor' if g > s else 'Slytherin')", "def game_winners(gryffindor, slytherin): \n g = gryffindor[0]\n s = slytherin[0]\n \n if 'yes' in gryffindor[1]:\n g += 150\n elif 'yes' in slytherin[1]:\n s += 150\n \n if g > s:\n return \"Gryffindor wins!\"\n elif g < s:\n return \"Slytherin wins!\"\n else:\n return \"It's a draw!\"", "def game_winners(gryffindor, slytherin):\n sbonus = 0\n bonus = 0\n if gryffindor[1] == \"yes\":\n bonus = 150\n else:\n bonus = 0\n if slytherin[1] == \"yes\":\n sbonus = 150\n else:\n sbonus = 0\n if gryffindor[0] + bonus > slytherin[0] + sbonus:\n return \"Gryffindor wins!\"\n elif gryffindor[0] + bonus < slytherin[0] + sbonus:\n return \"Slytherin wins!\"\n else:\n return \"It's a draw!\"\n", "def game_winners(gryffindor, slytherin):\n g = gryffindor[0] + 150 * (gryffindor[1] == \"yes\")\n s = slytherin[0] + 150 * (slytherin[1] == \"yes\")\n return \"Gryffindor wins!\" if g > s else \"Slytherin wins!\" if s > g else \"It's a draw!\"", "def game_winners(gryffindor, slytherin):\n g, s = map(lambda arr: arr[0] + 150 * (arr[1] == 'yes'), [gryffindor, slytherin])\n return ('Slytherin wins!', 'Gryffindor wins!', \"It's a draw!\")[(g > s) + 2 * (g == s)]", "def game_winners(*args):\n (a,b),(c,d) = args\n sg, ss = a + 150 * (b=='yes'), c + 150 * (d=='yes')\n return [\"It's a draw!\",\"Gryffindor wins!\",\"Slytherin wins!\"][(sg>ss)-(sg<ss)]", "def game_winners(gryffindor, slytherin):\n a, snitch = gryffindor\n b, litch = slytherin\n if snitch == \"yes\":\n if a + 150 > b:\n return \"Gryffindor wins!\"\n elif a + 150 == b:\n return \"It's a draw!\"\n else:\n return \"Slytherin wins!\"\n else:\n if b + 150 > a:\n return \"Slytherin wins!\"\n elif b + 150 == a:\n return \"It's a draw!\"\n else:\n return \"Gryffindor wins!\""] | {"fn_name": "game_winners", "inputs": [[[100, "yes"], [100, "no"]], [[350, "no"], [250, "yes"]], [[100, "yes"], [250, "no"]], [[0, "yes"], [150, "no"]], [[150, "no"], [0, "yes"]]], "outputs": [["Gryffindor wins!"], ["Slytherin wins!"], ["It's a draw!"], ["It's a draw!"], ["It's a draw!"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,024 |
def game_winners(gryffindor, slytherin):
|
a7edce679b17706174ce764bbb29ba0c | UNKNOWN | Imagine that you are given two sticks. You want to end up with three sticks of equal length. You are allowed to cut either or both of the sticks to accomplish this, and can throw away leftover pieces.
Write a function, maxlen, that takes the lengths of the two sticks (L1 and L2, both positive values), that will return the maximum length you can make the three sticks. | ["def maxlen(s1, s2):\n sm, lg = sorted((s1, s2))\n return min(max(lg / 3, sm), lg / 2)", "def maxlen(l1, l2):\n return max(min(l1 / 2, l2), min(l1, l2 / 2), max(l1, l2) / 3)", "def maxlen(*args):\n x,y = sorted(args)\n return [y/2, x, y/3][ (y>2*x) + (y>3*x) ]", "def maxlen(*s):\n a, b = min(s), max(s)\n return b / 3 if b > a * 3 else b / 2 if b < a * 2 else a", "maxlen=lambda a,b:max(a/3,min(a/2,b),min(a,b/2),b/3)", "def maxlen(L1, L2):\n L1, L2 = sorted((L1, L2))\n return (L2/2, L1, L2/3)[(L2 > 2*L1) + (L2 > 3*L1)]", "def maxlen(l1, l2):\n l1, l2 = sorted((l1, l2))\n return max(l2/3, min(l2/2, l1))\n \n\n# one-liner\n#maxlen = lambda l1, l2: max(max(l1, l2)/3, min(max(l1, l2)/2, min(l1, l2)))\n", "def maxlen(L1,L2):\n if L1 > L2 and L1 / 3 > L2:\n return L1 / 3\n elif L2 > L1 and L2 / 3 > L1:\n return L2 / 3\n elif L1 > L2 and L1 / 2 > L2:\n return L2\n elif L2 > L1 and L2 / 2 > L1:\n return L1\n elif L1 > L2 and L1 / 2 < L2:\n return L1 / 2\n elif L2 > L1 and L2 / 2 < L1:\n return L2 / 2", "def maxlen(L1,L2):\n return maxlen(L2,L1) if L1 < L2 else max(min(L1/2,L2 ),L1/3)", "def maxlen(L1, L2):\n a, b = sorted([L1, L2])\n if b < 2*a:\n return b / 2\n elif 2*a < b < 3*a:\n return a\n else:\n return b / 3"] | {"fn_name": "maxlen", "inputs": [[5, 12], [12, 5], [5, 17], [17, 5], [7, 12], [12, 7]], "outputs": [[5], [5], [5.666666666666667], [5.666666666666667], [6.0], [6.0]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,359 |
def maxlen(l1, l2):
|
6ae0a710eea2f8ec568fa7c13cd4db00 | UNKNOWN | A triangle is called an equable triangle if its area equals its perimeter. Return `true`, if it is an equable triangle, else return `false`. You will be provided with the length of sides of the triangle. Happy Coding! | ["def equable_triangle(a, b, c):\n p = a + b + c\n ph = p / 2\n return p * p == ph * (ph - a) * (ph - b) * (ph - c)", "def equable_triangle(a,b,c):\n p = (a + b + c) / 2\n return (p * (p - a) * (p - b) * (p - c)) ** .5 == 2 * p", "def equable_triangle(a,b,c):\n return (a + b + c) * 16 == (a + b - c) * (b + c - a) * (c + a - b)", "def equable_triangle(a, b, c):\n p = a + b + c\n d = p / 2\n return (d * (d - a) * (d - b) * (d - c))**0.5 == p", "def equable_triangle(a,b,c):\n perimeter=a+b+c\n sp=perimeter/2\n area=(sp*(sp-a)*(sp-b)*(sp-c))**0.5\n if perimeter==area: return True\n else: return False", "def equable_triangle(a,b,c):\n return a+b+c==((a+(b+c))*(c-(a-b))*(c+(a-b))*(a+(b-c)))**0.5/4", "def equable_triangle(a, b, c):\n s = (a + b + c) / 2.0\n A = (s * (s - a) * (s - b) * (s - c)) ** 0.5\n return A == s * 2", "def equable_triangle(a,b,c):\n s = (a + b + c)/2\n return (s*(s - a) * (s - b) * ( s - c)) ** 0.5 == 2 * s", "def equable_triangle(a,b,c):\n s = sum([a,b,c]) / 2\n return sum([a,b,c]) == (s*(s-a)*(s-b)*(s-c)) ** 0.5", "from math import sqrt\n\ndef equable_triangle(a,b,c):\n perimeter = a + b + c\n ss = perimeter / 2\n try:\n area = sqrt(ss * (ss - a) * (ss - b) * (ss - c))\n except ValueError:\n return False\n return area == perimeter"] | {"fn_name": "equable_triangle", "inputs": [[5, 12, 13], [2, 3, 4], [6, 8, 10], [7, 15, 20], [17, 17, 30], [7, 10, 12], [6, 11, 12], [25, 25, 45], [13, 37, 30], [6, 25, 29], [10, 11, 18], [73, 9, 80], [12, 35, 37], [120, 109, 13], [9, 10, 17]], "outputs": [[true], [false], [true], [true], [false], [false], [false], [false], [false], [true], [false], [false], [false], [false], [true]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,364 |
def equable_triangle(a,b,c):
|
f5887b850ce964b01f52162db61824c0 | UNKNOWN | From Wikipedia : "The n-back task is a continuous performance task that is commonly used as an assessment in cognitive neuroscience to measure a part of working memory and working memory capacity. [...] The subject is presented with a sequence of stimuli, and the task consists of indicating when the current stimulus matches the one from n steps earlier in the sequence. The load factor n can be adjusted to make the task more or less difficult."
In this kata, your task is to "teach" your computer to do the n-back task. Specifically, you will be implementing a function that counts the number of "targets" (stimuli that match the one from n steps earlier) in a sequence of digits. Your function will take two parameters :
n, a positive integer equal to the number of steps to look back to find a match
sequence, a sequence of digits containing 0 or more targets
A few hints :
The first digit in a sequence can never be a target
Targets can be "chained" together (e.g., for n = 1 and sequence = [1, 1, 1], there are 2 targets) | ["def count_targets(n, sequence):\n return sum(a == b for a, b in zip(sequence, sequence[n:]))", "def count_targets(n, s):\n return sum(s[i] == s[i-n] for i in range(n,len(s)))", "def count_targets(n, sequence):\n return sum(1 for a, b in zip(sequence, sequence[n:]) if a == b)", "def count_targets(n, seq):\n return sum( a == b for a,b in zip(seq, seq[n:]))", "def count_targets(n, sequence):\n return sum(y == x for x, y in zip(sequence, sequence[n:]))", "from collections import deque\n\ndef count_targets(n, sequence):\n q = deque(sequence[:n], maxlen=n)\n return sum((x == q[0], q.append(x))[0] for x in sequence[n:])", "def count_targets(n, seq):\n count = 0\n for i in range(n,len(seq)):\n if seq[i] == seq[i-n]: count+=1\n return count\n", "def count_targets(n, a):\n return sum(a[i] == a[i-n] for i in range(n, len(a)))", "def count_targets(n, sequence):\n return sum([1 for i in range(n, len(sequence)) if sequence[i] == sequence[i-n]])", "def count_targets(n, a):\n res = 0\n for i, v in enumerate(a):\n if i - n < 0:\n continue\n if v == a[i - n]:\n res += 1\n return res"] | {"fn_name": "count_targets", "inputs": [[1, [1, 1, 1, 1, 1]], [2, [1, 1, 1, 1, 1]], [1, [1, 2, 1, 2, 1]], [2, [1, 2, 1, 2, 1]], [9, [1, 2, 3, 4, 5, 6, 7, 8, 9, 1]], [1, []], [1, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [1000, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]], "outputs": [[4], [3], [0], [3], [1], [0], [1000], [1]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,173 |
def count_targets(n, sequence):
|
22a9614c060c19b1f475f443848740b1 | UNKNOWN | ```if-not:julia,racket
Write a function that returns the total surface area and volume of a box as an array: `[area, volume]`
```
```if:julia
Write a function that returns the total surface area and volume of a box as a tuple: `(area, volume)`
```
```if:racket
Write a function that returns the total surface area and volume of a box as a list: `'(area, volume)`
``` | ["def get_size(w, h, d):\n area = 2*(w*h + h*d + w*d)\n volume = w*h*d\n return [area, volume]", "def get_size(w,h,l):\n return [2*(w*l+h*l+h*w), w*h*l]", "def get_size(w,h,d):\n return [2 * (w * d + h * d + h * w), w * h * d]", "def get_size(w, h, d):\n return [2 * (w*h + w*d + h*d), w * h * d]", "get_size = lambda w,h,d: [w*h*2+w*d*2+h*d*2, w*h*d]", "def get_size(w,h,d):\n ans = []\n surface = 2 * ((w * h) + (d * h) + (w * d))\n volume = w * h * d\n ans.append(surface)\n ans.append(volume)\n return ans", "def get_size(w,h,d):\n #your code here\n return [(w*h+w*d+h*d)*2, w*h*d]", "def get_size(w,h,d):\n sa = 2*(w*d + h*d + w*h)\n vol = w*h*d\n return [sa,vol]", "def get_size(w,h,d):\n return [w*h*2 + h*d*2 + w*d*2, w*h*d]", "get_size = lambda w,h,d: [(w * h + w * d + h * d) * 2, w * h * d]", "def get_size(w,h,d):\n area = (w*d+w*d) + (d*h+d*h) + (w*h+w*h) \n volume = (w*h*d)\n return [area, volume] \n", "def get_size(w,h,d):\n L=[]\n if w==h==d:\n SA=6*(w**2)\n V=w**3\n L.append(SA)\n L.append(V)\n else:\n SA=2*(w*h+w*d+h*d)\n V=w*h*d\n L.append(SA)\n L.append(V)\n return L", "def get_size(w,h,d):\n area = 2*(w*h + h*d + d*w)\n volume = w*h*d\n return [area, volume]", "def get_size(l,w,h):\n return [2*(l*w+w*h+h*l),l*w*h]", "def get_size(w,h,d):\n area = (2 *(w*h)) + (2 *(w*d)) + (2 *(d*h))\n volume = w * h * d\n return [area, volume]", "def get_size(w,h,d):\n volume=w*h*d\n total_surface_area= 2*(w*h+h*d+w*d)\n return [total_surface_area,volume]", "def get_size(w,h,d):\n return [((2 * w * h) + (2 * h * d) + (2 * w * d)), (w * h * d)]", "def get_size(w,h,d):\n return [2*((w*h)+(h*d)+(w*d)),w*h*d]", "def get_size(w,h,d):\n return [2*d*w + 2*h*w + 2*d*h, w*h*d]", "def get_size(w,h,d):\n return[2*(w*h+d*h+d*w), w*h*d];", "from typing import List\n\ndef get_size(w: int, h: int, d: int) -> List[int]:\n \"\"\" Get the total surface area and volume of a box as an array: `[area, volume]`. \"\"\"\n return [(2 * w * h) + (2 * w * d) + (2 * d * h), w * h * d]", "def get_size(w,h,d):\n return [sum(2*([w*h, w*d, h*d])), w*h*d]", "def get_size(w,h,d):\n area = w * h * d\n surface_area = 2 * w * h + 2 * h * d + 2 * w * d\n return [surface_area, area]", "def get_size(w,h,d):\n #your code here surface=2(h \u00d7 W) + 2(h \u00d7 L) + 2(W \u00d7 L) h \u00d7 W \u00d7 L\n A,S=0,0\n A=(2*(h*w)+2*(h*d)+2*(w*d))\n S=(w*h*d)\n return list([A,S])", "def get_size(w,h,d):\n surface = 2*((w*h)+(h*d)+(d*w))\n area = (w*h*d)\n \n return [surface,area]", "def get_size(w,h,d):\n #your code here\n s = []\n area = 2 * ((w * h) + (h * d) + (w * d))\n sa = w * d * h\n s.append(area)\n s.append(sa)\n return (s)", "def get_size(w,h,d):\n volumn = w * h * d\n area = 2 * (w * h + h * d + d * w)\n return [area, volumn]", "def get_size(w,h,d):\n x = w * h * d\n y = 2* ((w * h)+(w * d) + (h * d))\n return [y,x]\n #your code here\n", "def get_size(width, length, height ):\n surface_area = (2 * (width*height + width*length + height*length))\n volume = length*width*height\n answer = []\n answer.append(surface_area)\n answer.append(volume)\n return answer \n", "def get_size(w, h, d):\n listed = []\n area = 2 * (w * h) + 2 * (h * d) + 2 * (w * d)\n volume = w * h * d\n listed.append(area)\n listed.append(volume)\n return listed", "def get_size(w,h,d):\n #your code here\n return [2*h*(w+d)+2*w*d,w*d*h]", "def get_size(w,h,d):\n #your code here\n area=2*h*(w+d)+2*w*d\n volume=w*d*h\n return [area,volume]", "def get_size(w,h,d):\n area = (2*(h*w)+2*(d*h)+2*(d*w))\n volume = w*h*d\n L = [area, volume]\n return L", "def get_size(w,h,d):\n #your code here\n l=[]\n a=2*(w*h)+2*(h*d)+2*(w*d)\n v=w*h*d\n l.append(a)\n l.append(v)\n return l", "def get_size(w,h,d):\n area_vol = []\n area_vol.append(2*(w*h+h*d+w*d))\n area_vol.append(w * h * d)\n return area_vol", "def get_size(w,h,d):\n return [w*2*h + h*2*d + d*2*w, w*h*d]", "def get_size(w,h,d):\n result = [0]*2\n result[0] = ((w * h)*2) + ((w*d)*2) + ((d*h)*2)\n result[1] = w*h*d \n return result\n", "def get_size(w,h,d): \n volume = w * h * d\n area = (w * h + h * d + w * d) * 2\n return [area, volume]\n \n", "get_size = lambda w,h,d:[2 * (w*h + h*d + d*w), h*d*w]\n", "def get_size(w,h,d):\n total_area = 2*(h*d)+2*(w*h)+2*(d*w)\n volume = w*d*h\n x = [total_area,volume]\n \n return x", "def get_size(w,h,d):\n volume = w * h * d\n area = 2 * (h * w) + 2 * (h * d) + 2 * (w * d)\n \n box = []\n \n box.append(area)\n box.append(volume)\n \n return box", "def get_size(w,h,d):\n a = ( 2 * d * w) + ( 2 * d * h) + ( 2 * h * w)\n v = w * h * d\n return[a, v]", "def get_size(w,h,d):\n a = (2 * h * w) + (2 * h * d) + (2 * w * d)\n v = w * h * d\n x = []\n return [a, v]", "def get_size(w,h,d):\n area = (d*w+d*h+w*h)*2\n value = w*h*d\n arr = [area, value]\n return arr\n", "def get_size(w: int, h: int, d: int) -> list:\n return [2 * d * w + 2 * h * d + 2 * w * h] + [w * h * d]", "get_size = lambda w,h,d: [(w*d+w*h+h*d) * 2, w*d*h]", "def get_size(w,h,d):\n #your code here\n area = ((2 * w * h) + (2 * w * d) + (2 * h * d))\n volume = w * h * d\n v = list((area,volume))\n return v", "def get_size(w,h,d):\n return [2*(h * w) + 2*(h * d) + 2*(w * d), d*w*h]", "def get_size(w,h,d):\n v = w * h * d\n a = 2*(w*h+w*d+h*d)\n x = [a, v]\n return x", "def get_size(w,h,d):\n area = ((w*d)*2) + (d*h)*2 + (w*h)*2\n volume = int(w)*int(d)*int(h)\n return [area,volume]", "def get_size(w,h,d):\n area = 2*(w*h)+2*(h*d)+2*(d*w)\n volume = w*h*d\n arr = [area,volume]\n return arr", "def get_size(w,h,d):\n return [(w*h*2 + 2*w*d + 2*h*d),w*h*d]", "def get_size(w,h,d):\n r=[]\n a=2*w*h+2*h*d+2*w*d\n r.append(a)\n v=w*h*d\n r.append(v)\n return r", "def get_size(w,h,d):\n x = []\n x.append(2*w*h + 2*w*d + 2*d*h)\n x.append(w*h*d)\n return x", "def get_size(w,h,d):\n x=w*h*d\n y=(w*h + h*d + d*w)*2\n return [y,x]\n", "def get_size(w,h,d):\n return [(d*w*2)+(w*h*2)+(2*d*h), w*h*d]", "def get_size(w,h,d):\n w = int(w)\n h = int(h)\n d = int(d)\n surface_area = 2*w*h + 2*h*d + 2*d*w\n volume = (w*h*d)\n return [surface_area, volume]", "def get_size(w,h,d):\n S = (2 * w * d) + (2 * w * h) + (2 * d * h)\n V = w * h * d\n return [S, V]", "def get_size(w,h,d):\n #your code here\n area = 0\n volume = 0\n \n area = 2*w*h + 2*h*d + 2*w*d\n volume = w*h*d\n \n return [area, volume]", "def get_size(w,h,l):\n #your code here\n a = (2*l*w)+(2*l*h)+(2*w*h)\n v = w*h*l\n return [a,v]", "def get_size(w,h,d):\n area= 2*(w*h)+2*(w*d)+2*(h*d)\n volume=w*h*d\n empty=[]\n empty.append(area)\n empty.append(volume)\n return empty", "def get_size(w,h,d):\n surface_area = []\n surface_area.append(2 * ((d * w) + (d * h) + (w * h)))\n surface_area.append((h * d) * w)\n return surface_area", "def get_size(w,h,d):\n area = 2 * (w * h + w * d + h * d)\n volumen = w * h * d\n result = [area, volumen]\n return result", "def get_size(w,h,d):\n return [sum([w*h,h*d,d*w])*2,w*h*d]", "def get_size(w,h,d):\n return [2*(w*(h+d))+2*(d*h), w*h*d]", "def get_size(w,h,d): \n s=2*(w*h+w*d+h*d)\n r=w*h*d\n return [s,r]", "def get_size(w,h,d):\n return [h*w*2+w*d*2+d*h*2,w*h*d]#your code here", "def get_size(w,h,d):\n return [d*h*2+w*h*2+w*d*2, w*h*d]", "def get_size(w,h,d):\n #your code here\n area = ((d * h) * 2 ) + ((w * d) * 2) + ((w * h)* 2)\n volume = w * h * d\n return [area,volume]", "def get_size(w,h,d):\n return [w*d*2 + 2*(w+d)*h, w*h*d]", "def get_size(l, b, h):\n return [2 * (l*b + b*h + l*h) , l * b * h]", "def get_size(w,h,d):\n size = [2*w*h+2*w*d+2*h*d, w*h*d]\n return size", "def get_size(w,h,d):\n return [2*d*h+2*w*h+2*d*w,w*h*d]\n\n", "def get_size(w,h,d):\n l\u00f6sung = [2*w*h + 2*w*d + 2*h*d, w * h * d]\n return l\u00f6sung", "get_size = lambda w,h,d: [w*h*2 + w*d*2 + d*h*2, w*d*h]", "def get_size(w,h,d):\n volume = (h*w*d)\n area=2*(w*h)+2*(w*d)+2*(h*d)\n res=[]\n res.append(area)\n res.append(volume)\n\n return res\nprint((get_size(10,10,10)))\n", "def get_size(w,h,d):\n \"\u0418\u0437\u043c\u0435\u0440\u044f\u0435\u043c \u043e\u0431\u044a\u0435\u043c \u0438 \u043f\u043b\u043e\u0449\u0430\u0434\u044c \u043a\u043e\u0440\u043e\u0431\u043a\u0438\"\n s_o = []\n s = (w * h * 2) + (h * d * 2) + (d * w * 2)\n o = w * h * d\n s_o.append(s)\n s_o.append(o)\n return s_o", "def get_size(w,h,d):\n volume = w*h*d\n area=(w*2+h*2)*d+w*h*2\n array=[area, volume]\n return array", "def get_size(w,h,d):\n array = []\n area = (w * h) * 2 + (w * d) * 2 + (h * d) * 2\n array.append(area)\n volume = w * h * d\n array.append(volume)\n return array\n #your code here\n", "def get_size(w,h,d):\n area=2*(h*w) + 2*(h*d) + 2*(w*d)\n return [area,w*d*h]", "def get_size(w,h,d):\n return [w*2*h+h*2*d+d*2*w, w*d*h]", "def get_size(w,h,d):\n #your code here\n result=[]\n vol=w*h*d\n area=(w*d+h*d+h*w)*2\n result.append(area)\n result.append(vol)\n return result\n", "\ndef get_size(w,h,l):\n surface_area=2*(h*w)+2*(h*l)+2*(w*l)\n volume=h*w*l\n return [surface_area,volume]", "def get_size(w,h,l):\n return [2*(h * l) + 2 * (h * w) + 2 * (w * l), (l*w*h)]", "def get_size(w, h, d):\n return [2 * (d * (w + h) + w * h), w * h * d]", "def get_size(w,h,d):\n total_area = 2 * (w*h + h*d + w*d)\n volume = w * h * d\n return [total_area, volume]", "def get_size(w,h,d):\n area = int(2*(h * w) + 2*(h * d) + 2*(d * w))\n volume = int(w) * int(h) * int(d)\n return [area, volume]", "def get_size(w,h,d):\n vol = w * h * d\n sur = 2*(w*h + w*d + h*d)\n return [sur, vol]", "def get_size(w,h,d):\n vol = w * h * d\n surface = (2 * w * h) + (2 * w * d) + (2 * h * d)\n return [surface, vol]", "def get_surface_area(width, height, depth):\n return (\n (2 * depth * width) +\n (2 * depth * height) +\n (2 * height * width)\n )\n\ndef get_volume(width, height, depth):\n return width * height * depth\n\ndef get_size(width, height, depth):\n return [\n get_surface_area(width, height, depth),\n get_volume(width, height, depth)\n ]", "def get_size(w,h,d):\n my_list = []\n area = (w*h*2) + (h*d*2) + (w*d*2)\n volume = w * h * d\n my_list.append(area)\n my_list.append(volume)\n return my_list", "def get_size (w,h,d):\n surface = 2*(w*h + w*d + d*h)\n volume = w*h*d\n return ([surface, volume])\n", "def get_size(w,h,d):\n SA = 2*w*h + 2*w*d + 2*h*d\n V = h*w*d\n return [SA, V]\n", "def get_size(w,h,d):\n #your code here\n area=2*(w*h+h*d+w*d)\n vol=w*h*d\n a=[area,vol]\n return a", "def get_size(w,h,d):\n area = (w * h * 2) + (h * d * 2) + (w * d * 2)\n volume = w * h * d\n total = [area, volume]\n return total\n\n #your code here\n", "def get_size(w,h,d):\n #your code here\n return [2*w*h+2*w*d+2*h*d, d*w*h]", "def get_size(w,h,d):\n total_area = 2 *(h*w) + 2 *(h*d) + 2 *(w*d)\n volume = w * h * d\n return [total_area, volume]", "def get_size(w,h,d):\n l=[]\n l.append(2*(w*h+h*d+d*w))\n l.append(w*h*d)\n return l\n"] | {"fn_name": "get_size", "inputs": [[4, 2, 6], [1, 1, 1], [1, 2, 1], [1, 2, 2], [10, 10, 10]], "outputs": [[[88, 48]], [[6, 1]], [[10, 2]], [[16, 4]], [[600, 1000]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 11,734 |
def get_size(w,h,d):
|
62ac38e92885d16e1e3726a566b6da6c | UNKNOWN | Given two arrays `a` and `b` write a function `comp(a, b)` (`compSame(a, b)` in Clojure) that checks whether the two arrays have the "same" elements, with the same multiplicities. "Same" means, here, that the elements in `b` are the elements in `a` squared, regardless of the order.
## Examples
## Valid arrays
```
a = [121, 144, 19, 161, 19, 144, 19, 11]
b = [121, 14641, 20736, 361, 25921, 361, 20736, 361]
```
`comp(a, b)` returns true because in `b` 121 is the square of 11, 14641 is the square of 121, 20736 the square of 144, 361 the square of 19, 25921 the square of 161, and so on. It gets obvious if we write `b`'s elements in terms of squares:
```
a = [121, 144, 19, 161, 19, 144, 19, 11]
b = [11*11, 121*121, 144*144, 19*19, 161*161, 19*19, 144*144, 19*19]
```
### Invalid arrays
If we change the first number to something else, `comp` may not return true anymore:
```
a = [121, 144, 19, 161, 19, 144, 19, 11]
b = [132, 14641, 20736, 361, 25921, 361, 20736, 361]
```
`comp(a,b)` returns false because in `b` 132 is not the square of any number of `a`.
```
a = [121, 144, 19, 161, 19, 144, 19, 11]
b = [121, 14641, 20736, 36100, 25921, 361, 20736, 361]
```
`comp(a,b)` returns false because in `b` 36100 is not the square of any number of `a`.
## Remarks
- `a` or `b` might be `[]` (all languages except R, Shell).
- `a` or `b` might be `nil` or `null` or `None` or `nothing` (except in Haskell, Elixir, C++, Rust, R, Shell, PureScript).
If `a` or `b` are `nil` (or `null` or `None`), the problem doesn't make sense so return false.
#### Note for C
The two arrays have the same size `(> 0)` given as parameter in function `comp`. | ["def comp(array1, array2):\n try:\n return sorted([i ** 2 for i in array1]) == sorted(array2)\n except:\n return False", "def comp(a1, a2):\n return None not in (a1,a2) and [i*i for i in sorted(a1)]==sorted(a2)", "def comp(array1, array2):\n if array1 and array2:\n return sorted([x*x for x in array1]) == sorted(array2)\n return array1 == array2 == []", "def comp(a1, a2):\n return isinstance(a1, list) and isinstance(a2, list) and sorted(x*x for x in a1) == sorted(a2)", "from collections import Counter as c\ndef comp(a1, a2):\n return a1 != None and a2 != None and c(a2) == c( elt**2 for elt in a1 )", "def comp(xs, ys):\n if xs is None or ys is None:\n return False\n return sorted(x * x for x in xs) == sorted(ys)", "def comp(a, b):\n try:\n return sorted(i*i for i in a) == sorted(b)\n except:\n return False", "def comp(array1, array2):\n if (array1 == None) or (array2 == None):\n return False\n tmp = sorted([s*s for s in array1])\n return tmp == sorted(array2) ", "def comp(array1, array2):\n return None not in (array1, array2) and sum([i*i for i in array1]) == sum(array2)\n"] | {"fn_name": "comp", "inputs": [[[], [1]]], "outputs": [[false]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,184 |
def comp(array1, array2):
|
dd6d5ed79ac9bef9305a0540db4e7df7 | UNKNOWN | # Don't give me five!
In this kata you get the start number and the end number of a region and should return the count of all numbers except numbers with a 5 in it. The start and the end number are both inclusive!
Examples:
```
1,9 -> 1,2,3,4,6,7,8,9 -> Result 8
4,17 -> 4,6,7,8,9,10,11,12,13,14,16,17 -> Result 12
```
The result may contain fives. ;-)
The start number will always be smaller than the end number. Both numbers can be also negative!
I'm very curious for your solutions and the way you solve it. Maybe someone of you will find an easy pure mathematics solution.
Have fun coding it and please don't forget to vote and rank this kata! :-)
I have also created other katas. Take a look if you enjoyed this kata! | ["def dont_give_me_five(start, end):\n return sum('5' not in str(i) for i in range(start, end + 1))", "def dont_give_me_five(start,end):\n return len([num for num in range(start, end+1) if '5' not in str(num)])", "def dont_give_me_five(start,end):\n tick = 0\n for x in range(start, end+1):\n if '5' not in str(x):\n tick += 1\n return tick", "# Fast algorithm.\n# Execution time: dont_give_me_five(1, 123456789) ~ 0.01 ms\ndef dont_give_me_five(start, end):\n def goo(n):\n result = 0\n pos9 = 1\n while n > 0:\n digit = n % 10\n effective_digit = digit\n if digit > 5:\n effective_digit -= 1\n to_add = effective_digit * pos9\n if digit == 5:\n result = -1\n result += to_add\n n //= 10\n pos9 *= 9\n return result\n if (end >= 0 and start >= 0) or (end < 0 and start < 0):\n return goo(max(abs(end), abs(start))) - goo(min(abs(start), abs(end)) - 1)\n else:\n return goo(abs(end)) + goo(abs(start)) + 1", "def dont_give_me_five(start, end):\n return sum(1 for i in range(start, end+1) if '5' not in str(i))", "def dont_give_me_five(start,end):\n return len([i for i in range(start, end+1) if '5' not in str(i)])", "def dont_give_me_five(start,end):\n return len(tuple(n for n in range(start,end+1) if '5'not in str(n)))", "dont_give_me_five = lambda s,e: sum('5' not in str(e) for e in range(s,e+1))", "def dont_give_me_five(start,end):\n n = []\n i = start\n while i <= end:\n m = str(i)\n if \"5\" in m:\n i += 1\n if \"5\" not in m:\n n.append(m)\n i += 1\n x = len(n)\n return x", "def dont_give_me_five(start,end):\n count = 0\n for i in range(start,end+1):\n if '5' not in str(i):\n count += 1\n return count", "def dont_give_me_five(start, end):\n return sum(1 for n in range(start, end + 1) if '5' not in str(n))", "def dont_give_me_five(start, end):\n return len([x for x in range(start, end + 1) if '5' not in str(x)])", "def dont_give_me_five(start,end):\n n = 0\n for j in range(start, end + 1):\n i = abs(j)\n n += 1\n while i // 5 > 0:\n if i % 5 == 0 and i % 10 != 0:\n n -= 1\n break\n i = i // 10 \n return n", "def dont_give_me_five(start, end):\n # your code here\n n = end - start + 1\n for i in range(start, end+1):\n if '5' in str(i):\n n -= 1\n return n", "dont_give_me_five = lambda s,e: len([i for i in range(s, e+1) if '5' not in str(i)])\n#loops through each number in start, end, converting each number to a string and checking if '5' is contained within, if it isn't present, it is added to a list, the length of the list is calculated and returned as the result.\n", "def dont_give_me_five(start,end):\n return sum([(1,0)['5' in str(x)] for x in range(start,end+1)])", "dont_give_me_five = lambda s, e: sum('5' not in str(i) for i in range(s, e+1))", "def dont_give_me_five(start,end):\n return len([i for i in list(map(str, range(start, end + 1))) if \"5\" not in i])", "def dont_give_me_five(start,end):\n n_list = [i for i in range(start, end + 1)]\n n = 0\n for i in n_list:\n if '5' in str(i):\n continue\n n += 1\n return n # amount of numbers", "def dont_give_me_five(start, end):\n rez = []\n for i in list(range(start, end + 1)):\n if \"5\" in list(str(i)):\n print(i)\n else:\n rez.append(i)\n return len(rez)", "def dont_give_me_five(start,end):\n return len((list(filter(lambda i: not \"5\" in str(i), range(start, end + 1)))))", "def dont_give_me_five(start,end):\n array = list(range(start,end + 1))\n out = [num for num in array if (not (\"5\" in str(num)))]\n return len(out)", "def dont_give_me_five(start,end):\n arr = []\n for x in range(start, end + 1):\n if \"5\" not in str(x):\n arr.append(x)\n return len(arr)", "def dont_give_me_five(start,end):\n z=0\n for i in range(start, end+1):\n if str(i).find('5')==-1:\n z+=1\n return(z)", "def dont_give_me_five(start,end):\n # your code here\n k = [str(i) for i in range(start, end + 1)]\n return len([i for i in k if '5' not in i])", "def dont_give_me_five(start: int, end: int) -> int:\n \"\"\"This function returns the count of all numbers except numbers with a 5.\"\"\"\n count = 0\n for item in range(start, end+1):\n if '5' not in str(item):\n #print (item)\n count += 1\n return count", "def dont_give_me_five(start,end):\n nums = [str(number) for number in range(start, end + 1) if '5' not in str(number)]\n return len(nums)", "def dont_give_me_five(start,end):\n \n n =0\n for x in range(start,end+1) :\n if '5' in str(x):\n continue \n n = n+1\n return n", "def dont_give_me_five(start, end):\n arr = []\n for i in range(start, end + 1):\n arr.append(i)\n count = 0\n for i in arr:\n if \"5\" in str(i):\n count += 1\n return len(arr) - count", "def dont_give_me_five(start,end):\n # Set position and create list\n position = start\n count = []\n \n # Check if numbers have a 5 in them and skip\n # append all other numbers to list\n while position <= end:\n if '5' in str(position):\n position += 1\n else:\n count.append(position)\n position += 1\n \n # Return length of list\n return len(count)", "def dont_give_me_five(start, end):\n # your code here\n\n l = list(range(start, end + 1))\n new_l = []\n\n for i in l:\n if not '5' in str(i):\n new_l.append(i)\n return len(new_l)\n", "def dont_give_me_five(start,end):\n return len([elem for elem in range(start,end+1) if '5' not in str(elem) ])", "def dont_give_me_five(start,end):\n count = 0\n\n \n for i in range(start, end+1):\n valid = True\n for j in str(i):\n if j == \"5\":\n valid = False\n if valid:\n count += 1\n\n return count # amount of numbers", "def dont_give_me_five(start,end):\n tick = 0\n for x in range (start,end+1):\n if \"5\" not in str(x):\n tick +=1\n return tick # amount of numbers", "def dont_give_me_five(start, end):\n answer = 0\n for i in range(start, end + 1):\n if '5' in str(i):\n pass\n else:\n answer += 1\n return answer", "def dont_give_me_five(start,end):\n l = []\n for x in range(start, end+1):\n if '5' not in str(x):\n l.append(x)\n return len(l)", "def dont_give_me_five(start,end):\n def has_five(n):\n x = False\n for i in str(n):\n if i == '5':\n x = True\n return x\n y = 0\n for i in range(start, end + 1):\n if not has_five(i):\n y = y + 1\n return y", "def dont_give_me_five(start,end):\n array = list(range(start,end+1))\n array_str = [str(num) for num in array]\n array_with_5 = [num for num in array_str if '5' in num]\n \n count_withno5 = len(array_str) - len(array_with_5)\n return count_withno5 # amount of numbers", "def dont_give_me_five(start,end):\n answer = 0\n for i in range(start,end +1):\n if not(\"5\" in str(i)):\n answer += 1\n return answer # amount of numbers", "def dont_give_me_five(start,end):\n return len([n for n in range(start, end+1) if not ((n % 5 == 0) & (n % 2 != 0)) | (n in range(50,60)) | (n in range(150,160))])", "def dont_give_me_five(start,end):\n for i in range(end,start-1,-1) : end-=('5' in str(i))\n return end-start+1", "def dont_give_me_five(start,end):\n print(start,end)\n l= []\n for x in range(start,end+1):\n if str(5) not in str(x):\n l.append(x)\n return len(l)", "def dont_give_me_five(start,end):\n # your code here\n countnotfive = 0\n for scanner in range(start,end+1):\n if '5' not in str(scanner):\n countnotfive += 1\n \n return countnotfive # amount of numbers\n\nprint(dont_give_me_five(52,106))", "def dont_give_me_five(start,end):\n startlist=list(range(start,end+1))\n newlist=[]\n for item in startlist:\n if '5' not in str(item):\n newlist.append(item)\n return len(newlist) # amount of numbers", "def dont_give_me_five(start,end):\n count = 0\n for i in range(start,end+1):\n if str(i).__contains__(\"5\"):\n continue\n else:\n count+=1\n return count", "# create a count variable and set to 0\n# iterate through start and end + 1:\n# if '5' is in str(num): pass \n# else: count += 1\n# return the count\n\n\ndef dont_give_me_five(start,end):\n \"\"\" function that returns the count of numbers between start and end (inclusive), \n except for those containing 5 \"\"\"\n count = 0 # number of numbers between start and end+1, excluding 5's\n for i in range(start, end+1):\n if '5' in str(i): # does not count numbers with '5'\n pass\n else:\n count += 1\n return count # returns int ", "def dont_give_me_five(start,end):\n n=[]\n for i in range (start,end+1):\n if i % 5 != 0 or i % 10 == 0 :\n if not 50 <= i <= 59 :\n if not 150 <= i <=159:\n n.append(i)\n \n return len(n) # amount of numbers", "def dont_give_me_five(start: int, end: int):\n \n list_of_numbers = range(start, end+1)\n \n range_without_fives = []\n \n for number in list_of_numbers:\n digits_list = list(str(number))\n if '5' not in digits_list:\n range_without_fives.append(int(''.join(str(digit) for digit in digits_list)))\n \n return len(range_without_fives)", "def dont_give_me_five(start,end):\n num_list=[str(i) for i in range(start,end+1) if '5' not in str(i)]\n return len(num_list) # amount of numbers\n", "def dont_give_me_five(start,end):\n return len([i for i in range(start, end+1) if not '5' in str(i)])\n \n # numbers_list = []\n # for i in range(start, end+1):\n # if not '5' in str(i):\n # numbers_list.append(i)\n # return len(numbers_list)\n", "def dont_give_me_five(start, end):\n return len(list(i for i in list(range(start, end+1)) if not \"5\" in str(i)))", "def dont_give_me_five(start,end):\n numbers = list(range(start,end + 1))\n n = 0\n for i in numbers:\n s = str(i)\n if \"5\" not in s:\n n += 1\n return n # amount of numbers", "def dont_give_me_five(start,end):\n m = (end-start)+1\n for i in range(start, (end + 1)):\n if \"5\" in str(i):\n m -= 1\n return m\n \n \n \n \n", "def dont_give_me_five(start,end):\n counts = 0\n for num in range(start, end + 1):\n if '5' not in str(num):\n counts = counts + 1\n else:\n continue\n return counts", "def dont_give_me_five(start,end):\n rc = 0\n for ing in range(start, end + 1):\n if '5' in list(str(ing)):\n pass\n else:\n # print(ing)\n rc += 1\n return rc", "def dont_give_me_five(start,end):\n arr = list(range(start, end + 1))\n filter = []\n for el in arr:\n if str(el).find('5') == -1: filter.append(el)\n print(filter)\n return len(filter)", "def dont_give_me_five(start,end):\n c=list(range(start,end+1))\n v=[]\n for t in c:\n if '5' not in str(t):\n v.append(t)\n n=len(v)\n return n ", "def dont_give_me_five(start,end):\n return sum([1 for i in range(min(start, end), max(start, end) + 1) if testFive(i)])\n \n \ndef testFive(num):\n if num < 0:\n num = abs(num)\n while num > 0:\n if num % 10 == 5:\n return False\n num //= 10\n \n return True\n", "def dont_give_me_five(start,end):\n count = 0\n numbers = [str(x) for x in range(start, end+1)]\n for number in numbers:\n if \"5\" not in number:\n count+=1\n return count", "def dont_give_me_five(start,end):\n x = start\n total = 0\n while x < end+1:\n if \"5\" not in str(x):\n total += 1\n x += 1\n return total", "def dont_give_me_five(start,end):\n res = 0\n for n in range(start, end+1):\n if not '5' in str(n):\n res+=1\n return res", "def dont_give_me_five(start,end):\n n = [i for i in range(start, end + 1) if str(i).count('5') == 0]\n return len(n)", "def dont_give_me_five(start,end):\n a = [i for i in range(start, end+1)if'5' not in str(i)]\n \n return len(a)", "def dont_give_me_five(s,e):\n return len([x for x in range(s,e+1) if not str(x).count('5')])", "def dont_give_me_five(start,end):\n # your code here\n m = [i for i in range(start, end+1) if \"5\" not in str(i)]\n return len(m) # amount of numbers", "def dont_give_me_five(start,end):\n count = 0\n for i in range(start,end+1):\n if str(i).find('5') == -1:\n count += 1\n return count # amount of numbers", "def dont_give_me_five(s,e):\n return len([i for i in range(s, 1+e) if '5' not in str(i)])", "def dont_give_me_five(start,end):\n s = [str(x) for x in range(start,end + 1)]\n d = \"-\".join(s).replace(\"5\",\"!\")\n f = d.split(\"-\")\n result = []\n for x in f:\n if x.isdigit() == True:\n result.append(x)\n return len(result)\n \n", "def dont_give_me_five(start,end):\n # your code here\n return sum(1 for i in range(start,end+1) if \"5\" not in str(i)) # amount of numbers", "def dont_give_me_five(start,end):\n \n end = end + 1\n nofives = 0\n for i in range(start,end):\n if '5' not in str(i):\n nofives += 1\n else:\n pass\n return nofives", "import re\n\ndef dont_give_me_five(start,end):\n n = 0\n for i in range(start, end + 1):\n if re.match('(.*)[5](.*)', str(i)):\n continue\n n += 1 \n return n", "def dont_give_me_five(start, end):\n if start < 0 and end < 0:\n return nums_without_five(-start + 1) - nums_without_five(-end)\n elif start < 0 and end >= 0:\n return nums_without_five(-start + 1) + nums_without_five(end + 1) - 1\n return nums_without_five(end + 1) - nums_without_five(start)\n\ndef nums_without_five(n):\n cnt = 0\n fct = 1\n \n while n:\n dig = n % 10\n if dig == 5:\n cnt = 0\n cnt += (dig - (dig > 5)) * fct\n fct *= 9\n n //= 10\n \n return cnt", "def dont_give_me_five(start,end):\n # your code here\n num = list(range(start, end + 1))\n count = 0\n for i in num:\n if \"5\" in str(i):\n pass\n else:\n count += 1\n return count\n \n \n \n", "def dont_give_me_five(start,end):\n return sum([1 if '5' not in str(i) else 0 for i in [loop for loop in range(start, end + 1)]])", "def dont_give_me_five(start,end):\n count = 0\n for i in list(range(start, end + 1)):\n if '5' not in str(i):\n count += 1\n return count", "def dont_give_me_five(start,end):\n \n c = 0\n\n\n for i in range(start,end+1):\n \n \n d = [int(x) for x in str(abs(i))]\n \n if not 5 in d :\n \n c+= 1\n \n return c\n \n", "def dont_give_me_five(start,end):\n l = (end + 1 - start) - sum([1 for i in range(start, end + 1) if \"5\" in str(i)])\n return l ", "def dont_give_me_five(start,end):\n arr = []\n ran = []\n \n for i in range(start,end+1):\n ran.append(i)\n \n for i in ran:\n s = str(i)\n if '5' in s:\n continue\n else:\n arr.append(s)\n \n n = len(arr)\n \n return n", "def dont_give_me_five(start,end):\n # your code here\n return sum ('5' not in str(i) for i in range(start, end + 1)) # amount of number", "def dont_give_me_five(start,end):\n count = 0\n while start <= end:\n if str(start).find('5') == -1:\n count+=1\n start+=1\n \n return count", "def dont_give_me_five(s, e):\n return len([x for x in range(s, e + 1) if str(5) not in str(x)])\n", "def dont_give_me_five(s, e):\n count = 0\n for x in range(s, e + 1):\n if str(5) not in str(x):\n count += 1\n return count", "def dont_give_me_five(start,end):\n list = []\n for i in range(start, end+1):\n if str(i).count('5') == 0:\n list.append(i)\n \n return len(list)\n \n\n", "def dont_give_me_five(start,end):\n count = 0\n for number in range(start, (end + 1)):\n number_as_str = str(number)\n if \"5\" not in number_as_str:\n count += 1\n\n return count", "def dont_give_me_five(start,end):\n # your code here\n return len([t for t in range(start,end+1) if str(t).find(\"5\") == -1])", "def dont_give_me_five(start,end):\n numbers=[]\n \n for i in range(start, end+1):\n if '5'in str(i):\n continue\n else:\n numbers.append(i)\n \n return len(numbers)# amount of numbers", "def dont_give_me_five(start,end):\n n = 0\n for i in range(start, 1+end):\n if \"5\" not in str(i):\n n+=1\n return n # amount of numbers", "def dont_give_me_five(start,end):\n mylist = [str(i) for i in range(start, end+1)]\n mylist = [i for i in mylist if '5' not in i]\n return len(mylist)", "def dont_give_me_five(start,end):\n count = 0\n for i in range(start, end+1):\n temp = str(i)\n if '5' not in temp:\n count += 1\n \n \n return count", "def dont_give_me_five(x,y):\n return len([i for i in range(x,y+1) if '5' not in str(i)])", "def dont_give_me_five(start,end):\n count=0\n for n in range(start,end+1):\n if \"5\" not in str(n ):\n count=count+1\n return count", "def dont_give_me_five(start,end):\n n = 0\n five = '5'\n for i in range(start, end+1):\n i = str(i)\n if five in i:\n continue\n else:\n n+=1\n return n # amount of numbers", "def dont_give_me_five(start,end):\n x = [i for i in range(start, end+1) if '5' not in str(i)]\n return len(x)", "def dont_give_me_five(start,end):\n itr = 0\n while start <= end:\n strNum = str(start)\n if \"5\" not in strNum:\n itr+=1\n start += 1\n return itr # amount of numbers", "def dont_give_me_five(s, e):\n cnt = 0\n for i in range(s, e + 1):\n if \"5\" not in str(i):\n cnt += 1\n return cnt", "def dont_give_me_five(start,end):\n # your code here\n l=[]\n for i in range(start,end+1):\n if '5' not in str(i) :\n l.append(i)\n\n \n for j in l:\n if '5' in str(j):\n l.remove(j)\n print(l)\n return len(l)\n\n\n\n \n \n \n", "def dont_give_me_five(start,end):\n no_fives = [str(x) for x in range(start, end+1) if \"5\" not in str(x)]\n return len(no_fives) ", "def dont_give_me_five(start,end):\n '''\n returns the number of numbers in the range of starts -> end \n that dont include a 5\n input: int,int\n output: int\n >>> dont_give_me_five(-11,10)\n >>> 20\n '''\n # list comprehension\n # sum( all of the trues which turn into 1's)\n return sum('5' not in str(i) for i in range(start,end+1))", "def dont_give_me_five(start,end):\n '''\n returns the number of numbers in the range of starts -> end \n that dont include a 5\n input: int,int\n output: int\n >>> dont_give_me_five(-11,10)\n >>> 20\n '''\n # initialize return n \n n = 0 \n \n # iterate through numbers\n for i in range(start, end+1):\n \n # check for '5' in str(int)\n if '5' not in str(i):\n n += 1 \n \n return n # amount of numbers"] | {"fn_name": "dont_give_me_five", "inputs": [[1, 9], [4, 17], [1, 90], [-4, 17], [-4, 37], [-14, -1], [-14, -6]], "outputs": [[8], [12], [72], [20], [38], [13], [9]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 20,547 |
def dont_give_me_five(start,end):
|
2b5273346019fe645f351d398d775d38 | UNKNOWN | Ronny the robot is watching someone perform the Cups and Balls magic trick. The magician has one ball and three cups, he shows Ronny which cup he hides the ball under (b), he then mixes all the cups around by performing multiple two-cup switches (arr). Ronny can record the switches but can't work out where the ball is. Write a programme to help him do this.
Rules:
- There will only ever be three cups.
- Only two cups will be swapped at a time.
- The cups and their switches will be refered to by their index in a row of three, beginning at one. So [[1,2]] means the cup at position one, is swapped with the cup at position two.
- Arr will be an array of integers 1 - 3 organised in pairs.
- There won't be any empty sub-arrays.
- If arr is just an empty array b should be returned.
Examples:
(b) = 2,
(arr) = [[1,2]]
The ball is under cup number : 1
-------
(b) = 1,
(arr) = [[2,3],[1,2],[1,2]]
The ball is under cup number : 1
-------
(b) = 2,
(arr) = [[1,3],[1,2],[2,1],[2,3]]
The ball is under cup number : 3 | ["from functools import reduce\n\ndef cup_and_balls(b, arr):\n return reduce(lambda x, y: y[1] if x == y[0] else y[0] if x == y[1] else x, arr, b)", "def cup_and_balls(b, a):\n for l, r in a:\n b = r if b == l else l if b == r else b\n return b", "def cup_and_balls(b, arr):\n for switch in arr:\n if b in switch:\n b = sum(switch) - b\n return b", "def cup_and_balls(b, arr):\n game = [i == b for i in range(4)]\n for a, b in arr:\n game[a], game[b] = game[b], game[a]\n return game.index(True)", "def cup_and_balls(b, arr):\n for swap in arr:\n if b in swap:\n b = swap[not swap.index(b)]\n return b", "def cup_and_balls(b, arr):\n cups = [0] * 4\n cups[b] = 1\n for i, j in arr:\n cups[i], cups[j] = cups[j], cups[i]\n return cups.index(1)", "def cup_and_balls(b, arr):\n my_ball = b\n for turn in arr:\n if my_ball in turn:\n for x in turn:\n if x != my_ball:\n my_ball = x\n break;\n return my_ball", "def cup_and_balls(b, arr):\n for i in arr:\n if b in i:\n b=sum(i)-b\n return b", "def cup_and_balls(b,a): \n for i,j in a:\n if b==i: b=j\n elif b==j: b=i\n return b"] | {"fn_name": "cup_and_balls", "inputs": [[2, [[1, 2]]], [1, [[2, 3], [1, 2], [1, 2]]], [2, [[1, 3], [1, 2], [2, 1], [2, 3]]]], "outputs": [[1], [1], [3]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,300 |
def cup_and_balls(b, arr):
|
2814f1fb7fb8c3379c7fab946a80e599 | UNKNOWN | # The museum of incredible dull things
The museum of incredible dull things wants to get rid of some exhibitions. Miriam, the interior architect, comes up with a plan to remove the most boring exhibitions. She gives them a rating, and then removes the one with the lowest rating.
However, just as she finished rating all exhibitions, she's off to an important fair, so she asks you to write a program that tells her the ratings of the items after one removed the lowest one. Fair enough.
# Task
Given an array of integers, remove the smallest value. **Do not mutate the original array/list**. If there are multiple elements with the same value, remove the one with a lower index. If you get an empty array/list, return an empty array/list.
Don't change the order of the elements that are left.
### Examples
```python
remove_smallest([1,2,3,4,5]) = [2,3,4,5]
remove_smallest([5,3,2,1,4]) = [5,3,2,4]
remove_smallest([2,2,1,2,1]) = [2,2,2,1]
``` | ["def remove_smallest(numbers):\n a = numbers[:]\n if a:\n a.remove(min(a))\n return a", "def remove_smallest(numbers):\n if len(numbers) < 1: \n return numbers\n idx = numbers.index(min(numbers))\n return numbers[0:idx] + numbers[idx+1:]\n", "def remove_smallest(n):\n return n[:n.index(min(n))] + n[n.index(min(n)) + 1:] if n != [] else []", "def remove_smallest(numbers):\n if len(numbers) <= 1: return []\n numbers.remove(min(numbers))\n return numbers", "def remove_smallest(numbers):\n if not numbers:\n return numbers\n else:\n new = numbers[:]\n new.remove(min(numbers))\n return new\n \n", "def remove_smallest(numbers):\n return numbers[0:numbers.index(min(numbers))]+numbers[numbers.index(min(numbers))+1:] if numbers else numbers\n", "def remove_smallest(numbers):\n return [n for i, n in enumerate(numbers) if i != numbers.index(min(numbers))]", "def remove_smallest(numbers):\n copy = numbers.copy()\n if len(copy) > 0: copy.remove(min(copy))\n return copy\n", "def remove_smallest(numbers):\n # raise NotImplementedError(\"TODO: remove_smallest\")\n return [numbers[i] for i in range(len(numbers)) if i != numbers.index(min(numbers))]", "def remove_smallest(numbers):\n if len(numbers) == 0:\n return(numbers)\n smvalue = numbers[0]\n smindex = 0\n if len(numbers) > 1:\n for i in range(1, len(numbers)):\n if numbers[i] < smvalue:\n smvalue = numbers[i]\n smindex = i\n return(numbers[0:smindex] + numbers[(smindex + 1):len(numbers)])\n else:\n return(list())\n", "def remove_smallest(numbers):\n \n empty=[]\n z = list(numbers)\n if z == []:\n return empty\n mini=min(z)\n index=numbers.index(mini)\n z.remove(z[index])\n return z\n\n", "def remove_smallest(numbers):\n if len(numbers) != 0:\n return numbers[:numbers.index(min(numbers))] + numbers[numbers.index(min(numbers))+1:]\n return numbers\n", "def remove_smallest(numbers):\n smallest = 0\n for i, num in enumerate(numbers):\n if num < numbers[smallest]:\n smallest = i\n return [x for i, x in enumerate(numbers) if i != smallest]\n", "def remove_smallest(numbers):\n if len(numbers) <= 1:\n return []\n result = []\n min_index_v = numbers.index(min(numbers))\n for number in enumerate(numbers):\n if number[0] != min_index_v:\n result.append(number[1])\n return result\n", "def remove_smallest(numbers):\n if len(numbers) < 1:\n return []\n\n answer = numbers[:]\n minimum = min(numbers)\n answer.remove(minimum)\n\n return answer", "def remove_smallest(numbers):\n i = numbers.index(min(numbers)) if numbers else 0\n return numbers[:i] + numbers[i+1:]", "def remove_smallest(numbers): \n tmp = list(numbers)\n if tmp:\n tmp.remove(min(numbers))\n return tmp\n", "def remove_smallest(numbers):\n res = []\n if len(numbers) == 0:\n return []\n for i in numbers:\n if i == min(numbers):\n res.append(numbers.index(i))\n return numbers[0:min(res)]+numbers[min(res)+1:]\n", "def remove_smallest(numbers):\n if numbers:\n a = list(numbers)\n a.remove(min(a))\n return a\n return numbers", "def remove_smallest(numbers):\n n = numbers[:]\n n and n.remove(min(n))\n return n\n", "remove_smallest = lambda m, n=[]: n.clear() or n.extend(m) or ((n.remove(min(n)) or n) if n else n)", "def remove_smallest(numbers):\n s_n=0\n for n in range(1,len(numbers)):\n if numbers[n]<numbers[s_n]:\n s_n=n\n return numbers[:s_n]+numbers[s_n+1:]", "def remove_smallest(numbers):\n try:\n i = min(range(len(numbers)), key=numbers.__getitem__)\n return numbers[:i] + numbers[i+1:]\n except ValueError:\n return []", "def remove_smallest(ns):\n nss = ns.copy()\n nss.remove(min(ns)) if nss else None\n return nss\n", "def remove_smallest(numbers):\n result = numbers.copy()\n if result:\n result.remove(min(result))\n return result", "def remove_smallest(numbers):\n if numbers == []:\n return numbers\n elif len(numbers) == 1:\n return []\n\n else:\n copy = numbers[::]\n copy.remove(min(numbers))\n return copy", "from itertools import count, filterfalse\nfrom typing import List\n\ndef remove_smallest(numbers: List[int]) -> List[int]:\n \"\"\"\n Remove the smallest value from the array of the integers. Obey the following rules:\n - If there are multiple elements with the same value, remove the one with a lower index\n - If you get an empty array/list, return an empty array/list\n \"\"\"\n return list(filterfalse(lambda _it, c=count(): _it == min(numbers) and next(c) < 1, numbers))", "remove_smallest=lambda n: (lambda i: n[:i]+n[i+1:])(n.index(min(n)) if len(n) else 0)", "def remove_smallest(numbers):\n return (lambda x: x and x.remove(min(x)) or x) (numbers[:])\n", "def remove_smallest(x):\n return [x[i] for i in range(len(x)) if i != x.index(min(x))]\n", "def remove_smallest(numbers):\n return [x for i, x in enumerate(numbers) if i != min(range(len(numbers)), key=numbers.__getitem__)]", "def remove_smallest(numbers):\n if numbers:\n a = sorted(numbers)\n b = numbers.copy()\n b.remove(a[0])\n return b\n else:\n return []\n", "def remove_smallest(numbers):\n number = numbers[:]\n \n if number:\n number.remove(min(numbers))\n return number", "def remove_smallest(numbers):\n numbers = numbers[:]\n if not numbers:\n return numbers\n else:\n numbers.remove(min(numbers))\n return numbers\n", "def remove_smallest(numbers):\n numbersCopy = numbers.copy()\n for nums in numbers:\n if nums == min(numbers):\n numbersCopy.remove(nums)\n break\n else:\n None\n return numbersCopy\n", "def remove_smallest(numbers):\n result = []\n added = False\n if not numbers:\n return numbers\n for item in numbers:\n if (item == min(numbers) and not added):\n added = True\n continue\n else:\n result.append(item)\n return result", "def remove_smallest(numbers):\n if numbers == [1, 2, 3, 1, 1]:\n return [2, 3, 1, 1]\n else:\n return [x for x in numbers if x != min(numbers)]\n raise NotImplementedError(\"TODO: remove_smallest\")\n", "def remove_smallest(numbers):\n if not numbers: return []\n new_lst = numbers.copy()\n new_lst.pop(numbers.index(min(numbers)))\n return new_lst", "def remove_smallest(numbers):\n if numbers:\n l = [i for i in numbers]\n l.remove(min(l))\n return l\n else:\n return []\n", "def remove_smallest(numbers):\n lowest = 0\n check = {}\n check2 = []\n \n if len(numbers) > 1:\n for i in numbers:\n check[i] = []\n for a in numbers:\n if i < a:\n check[i].append('lower')\n else:\n check[i].append('higher')\n \n for i in numbers:\n check[f'{i} count'] = 0\n for a in numbers:\n if check[i].count('lower') > check[a].count('lower'):\n check[f'{i} count'] += 1\n \n for i in numbers:\n check2.append(check[f'{i} count'])\n new_list = []\n for index, elem in enumerate(numbers):\n if index == check2.index(max(check2)):\n continue\n new_list.append(elem)\n \n return new_list\n \n else:\n return []", "def remove_smallest(numbers):\n if numbers:\n a = sorted(numbers)\n b = numbers[:]\n b.remove(a[0])\n return b\n else:\n return []", "def remove_smallest(numbers):\n if numbers:\n x = numbers[:]\n x.remove(min(x))\n return x\n else:\n return []", "def remove_smallest(numbers):\n new_numbers = []\n for number in numbers:\n new_numbers.append(number)\n if len(new_numbers) > 0:\n new_numbers.remove(min(new_numbers))\n return new_numbers", "def remove_smallest(numbers):\n x = numbers.copy()\n for n in range(len(numbers)):\n if numbers[n] == min(numbers):\n del x[n]\n break\n return x\n", "def remove_smallest(numbers):\n if numbers:\n out = numbers.copy()\n out.remove(min(out))\n return out\n else:\n return []", "def remove_smallest(numbers):\n num = numbers.copy()\n if len(numbers) < 1 :\n return num\n\n else:\n num.remove(min(num))\n return num\n", "def remove_smallest(numbers):\n num = numbers.copy()\n l = len(num)\n if num != []:\n smol = min(num)\n i = 0\n for i in range(0,l):\n if num[i] == smol:\n num.pop(i)\n break\n else: i += 1 \n return num\n else: return []", "def remove_smallest(numbers):\n arr = numbers.copy()\n if arr == []:\n return []\n else:\n arr.remove(min(arr))\n return arr\n", "def remove_smallest(n):\n if n:\n min_index = n.index(min(n))\n return n[:min_index] + n[min_index + 1:]\n else:\n return []\n", "def remove_smallest(numbers):\n if numbers:\n numbers = numbers.copy()\n numbers.remove(min(numbers))\n return numbers\n", "def remove_smallest(numbers):\n if len(numbers) == 0:\n return []\n else:\n smallest = numbers[0]\n for num in numbers:\n if num < smallest:\n smallest = num\n return [numbers[i] for i in range(len(numbers)) if i != (numbers.index(smallest))]\n", "def remove_smallest(numbers):\n new_list = numbers.copy()\n if numbers != []:\n new_list.sort()\n min = new_list[0]\n new_list = numbers.copy()\n new_list.remove(min)\n return new_list\n", "def remove_smallest(numbers):\n smallest_number = None if len(numbers) == 0 else sorted(numbers)[0]\n new_list = numbers.copy() \n for x in new_list:\n if x == smallest_number:\n new_list.remove(x)\n break\n return new_list", "def remove_smallest(numbers):\n if len(numbers) == 0:\n return []\n na = numbers.copy()\n na.sort()\n sm = na[0]\n rv = numbers.copy()\n rv.remove(sm)\n return rv\n", "def remove_smallest(numbers):\n if not numbers:\n return numbers\n result = numbers.copy()\n smolest = list(set(numbers))\n smolest.sort()\n result.remove(smolest[0])\n return result ", "def remove_smallest(numbers):\n r=numbers[:]\n if numbers:\n r.pop(numbers.index(min(numbers)))\n return r", "def remove_smallest(numbers):\n if not numbers: return []\n array = numbers[:]\n array.remove(min(numbers))\n return array\n", "def remove_smallest(numbers):\n a = numbers [:]\n if not a:\n return a\n else:\n a.remove(min(a))\n return a\n #raise NotImplementedError(\"TODO: remove_smallest\")\n", "def remove_smallest(numbers):\n # raise NotImplementedError(\"TODO: remove_smallest\")\n if len(numbers) == 0:\n return numbers\n x = min(numbers)\n result = []\n first = True\n for num in numbers:\n if num == x and first:\n first = False\n else:\n result.append(num)\n return result", "def remove_smallest(numbers):\n if numbers:\n idx_map = {}\n for i, number in enumerate(numbers):\n if number not in list(idx_map.keys()):\n idx_map[number] = i\n smallest = min(numbers)\n result = numbers.copy()\n result.pop(idx_map[smallest])\n return result\n else:\n return numbers\n", "from copy import deepcopy\ndef remove_smallest(numbers):\n if not numbers:\n return numbers\n n = deepcopy(numbers)\n n.remove(min(numbers))\n return n\n", "def remove_smallest(numbers):\n #raise NotImplementedError(\"TODO: remove_smallest\")\n if numbers == []: return []\n else:\n a = numbers.copy()\n b = a.remove(min(a))\n return a\n", "def remove_smallest(numbers):\n small = numbers[:]\n if small:\n small.remove(min(small))\n return small\n else:\n return numbers\n", "def remove_smallest(numbers):\n if len(numbers)<1:\n return numbers\n else:\n return numbers[:numbers.index(min(numbers))]+numbers[numbers.index(min(numbers))+1:]", "def remove_smallest(numbers):\n if len(numbers)!=0:\n m=numbers[0]\n d=[]\n for x in numbers:\n m=min(m,x)\n for x in numbers:\n if m!=x:\n d.append(x)\n else:\n m=None\n continue\n return d\n else:\n return numbers", "def remove_smallest(numbers):\n try:\n ind = numbers.index(min(numbers))\n return numbers[:ind]+numbers[ind+1:]\n except ValueError:\n return []\n except:\n return []", "def remove_smallest(numbers):\n count = 0\n a= []\n for x in numbers:\n if x == min(numbers) and count == 0:\n count +=1\n continue\n else :\n a.append(x)\n return a\n \n \n", "def remove_smallest(numbers=[]):\n a = []\n if numbers == []:\n return []\n for i in numbers:\n a.append(i)\n a.remove(min(a))\n return a\n", "def remove_smallest(numbers):\n numbers1 = numbers.copy()\n if len(numbers1) > 0:\n numbers1.remove(min(numbers1))\n return numbers1\n else:\n return numbers\n", "def remove_smallest(numbers):\n if numbers:\n new_numbers = numbers.copy()\n new_numbers.remove(min(numbers))\n return new_numbers\n else:\n return []\n", "def remove_smallest(numbers):\n if numbers == []:\n return numbers\n list_copy = numbers.copy()\n list_copy.remove(min(list_copy))\n return list_copy", "def remove_smallest(numbers):\n try:\n smallest = numbers[0]\n for num in numbers:\n if num < smallest:\n smallest = num\n except IndexError:\n return numbers\n else:\n new_numbers = numbers.copy()\n new_numbers.remove(smallest)\n return new_numbers\n\n", "def remove_smallest(numbers):\n if numbers == []:\n return numbers\n new_lst = list(numbers)\n smallest = min(new_lst)\n del new_lst[new_lst.index(smallest)]\n return new_lst", "def remove_smallest(n):\n if len(n)==0:\n return []\n c=n.count(min(n))\n print((n.index(min(n))))\n idx=n.index(min(n))\n print(c)\n a=[]\n if c==1:\n for x in n:\n if x>min(n):\n a.append(x)\n elif c>1:\n for i in range(len(n)):\n if i!=idx:\n a.append(n[i])\n return a\n", "def remove_smallest(numbers):\n if numbers == []:\n return []\n m = min(numbers)\n res = numbers.copy()\n for i in range(0, len(numbers)):\n if res[i] == m:\n del res[i]\n break\n return res\n \n", "def remove_smallest(numbers):\n if numbers == []:\n return []\n \n current_lowest = numbers[0]\n for number in numbers:\n if current_lowest > number:\n current_lowest = number\n removed = []\n condition = 1\n for number in numbers:\n if number == current_lowest and condition == 1:\n condition = 0\n else:\n removed.append(number)\n return removed\n raise NotImplementedError(\"TODO: remove_smallest\")\n", "def remove_smallest(numbers):\n print(numbers)\n sort = sorted(numbers)\n if sort == []:\n return []\n else:\n min = sort[0]\n count = 0\n new = []\n \n for i in numbers:\n if i == min and count <1:\n count+=1\n continue\n else:\n new.append(i)\n return new\n", "def remove_smallest(numbers):\n if len(numbers) == 0:\n return []\n x = min(numbers)\n for i in range(0, len(numbers)):\n if numbers[i] == x:\n return numbers[:i] + numbers[(i + 1):]\n", "def remove_smallest(numbers):\n if numbers:\n numbers_copy = numbers[:]\n smallest_value = numbers_copy[0]\n for i in numbers_copy:\n if i < smallest_value:\n smallest_value = i\n numbers_copy.remove(smallest_value)\n return numbers_copy\n return numbers\n", "def remove_smallest(numbers):\n copy_numbers = numbers.copy()\n for num in copy_numbers:\n if num <= min(copy_numbers): \n copy_numbers.remove(num)\n break\n return copy_numbers\n \n \n", "def remove_smallest(numbers):\n copy_numbers = numbers[:]\n for num in copy_numbers:\n if num <= min(copy_numbers):\n copy_numbers.remove(num)\n return copy_numbers\n return copy_numbers\n", "def remove_smallest(numbers):\n if numbers==[]:return []\n numbers=numbers.copy()\n numbers.remove(min(numbers)) \n return numbers\n \n", "def remove_smallest(numbers):\n result = list(numbers)\n if len(numbers) >= 1:\n result.remove(min(numbers))\n else:\n return ([])\n return result\n", "def remove_smallest(numbers):\n if len(numbers) == 0:\n return numbers\n idx = numbers.index(min(numbers))\n return numbers[:idx] + numbers[idx+1:]\n", "def remove_smallest(numbers):\n if len(numbers) == 0:\n return []\n smallest = numbers[0]\n removed = False\n result = []\n for x in numbers:\n if x < smallest:\n smallest = x\n for x in numbers:\n if x == smallest and not removed:\n removed = True\n continue\n result.append(x)\n return result\n\n", "def remove_smallest(numbers):\n if not numbers:\n return []\n correct_arr = list(numbers)\n correct_arr.remove(min(numbers))\n return correct_arr", "def remove_smallest(numbers):\n # raise NotImplementedError(\"TODO: remove_smallest\")\n lst=[]\n if numbers==[]:\n return []\n for i in numbers:\n lst.append(i)\n lstmin=min(lst)\n lst.remove(lstmin)\n return lst\n\n", "def remove_smallest(numbers):\n new = []\n for i in numbers:\n new.append(i)\n try:\n new.remove(min(new))\n return new\n except:\n return []\n", "def remove_smallest(numbers):\n if len(numbers) > 0 :\n newList = []\n sortedList = sorted(numbers)\n popped = sortedList.pop(0)\n newList = numbers[:]\n newList.remove(popped)\n return newList\n else:\n return []", "def remove_smallest(numbers):\n new_numbers = numbers.copy()\n try: new_numbers.remove(min(numbers))\n except ValueError: pass\n return new_numbers", "def remove_smallest(numbers):\n arr=numbers.copy()\n if len(arr)== 0:\n return(arr)\n x = arr.index(min(arr))\n arr.pop(x)\n return(arr)\n", "def remove_smallest(numbers):\n result = numbers.copy()\n if result:\n item = result.pop(result.index(min(result)))\n return result\n else:\n return []", "def remove_smallest(numbers):\n if numbers == []:\n return []\n else:\n new = numbers.copy()\n least = min(new)\n new.remove(least)\n return new", "def remove_smallest(numbers):\n\n numlist = numbers.copy()\n \n if len(numlist) <= 1:\n return []\n else:\n numlist.remove(min(numlist))\n \n return numlist", "def remove_smallest(numbers):\n print(numbers)\n \n numlist = numbers.copy()\n \n if len(numlist) <= 1:\n return []\n else:\n for i in numlist:\n if i == min(numlist):\n if numlist.count(i) >= 1:\n numlist.remove(i)\n break\n else:\n pass\n \n return numlist\n", "def remove_smallest(numbers):\n if not numbers:\n return []\n else:\n numbers2 = numbers.copy()\n numbers2.remove(min(numbers2))\n return numbers2\n", "def remove_smallest(numbers):\n return [num for i, num in enumerate(numbers) if i != numbers.index(min(numbers))]\n", "def remove_smallest(numbers):\n if numbers == []:\n return []\n else:\n res = []\n for i in numbers:\n res.append(i)\n res.remove(min(numbers))\n return res", "def remove_smallest(numbers):\n if not numbers or len(numbers) == 1:\n return []\n smallest = min(numbers)\n numbers.remove(smallest)\n return numbers\n \n", "def remove_smallest(numbers):\n answer_numbers=numbers[:]\n if numbers!=[]:\n answer_numbers.remove(min(answer_numbers))\n return answer_numbers\n else:\n return numbers\n"] | {"fn_name": "remove_smallest", "inputs": [[[1, 2, 3, 4, 5]], [[1, 2, 3, 4]], [[5, 3, 2, 1, 4]], [[1, 2, 3, 1, 1]], [[]]], "outputs": [[[2, 3, 4, 5]], [[2, 3, 4]], [[5, 3, 2, 4]], [[2, 3, 1, 1]], [[]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 21,367 |
def remove_smallest(numbers):
|
f38980f57566d72acb7936e6834709b0 | UNKNOWN | Your program will receive an array of complex numbers represented as strings. Your task is to write the `complexSum` function which have to return the sum as a string.
Complex numbers can be written in the form of `a+bi`, such as `2-3i` where `2` is the real part, `3` is the imaginary part, and `i` is the "imaginary unit".
When you add two complex numbers, the real and the imaginary part needs to be added separately,so for example `2+3i + 5-i = (2+5)+(3i-i) = 7+2i`
Both the complex and the imaginary part can be 0, so `123`, `-2i` or `i` are also complex numbers.
Complex numbers must be returned in their shortest form, so e.g. `0+1*i` should be just `i`, and `10+0i` should be `10`. This is also how you will get them!
For simplicity, the coefficients will always be integers. If the array is empty, return `0`.
Have fun! :) | ["def complexSum(arr, sub={'1i': 'i', '-1i': '-i', '0i': '0'}):\n s = str(sum(complex(x.replace('i', 'j')) for x in arr)).replace('j', 'i')\n s = s.strip('()')\n s = s.replace('+0i', '')\n return sub.get(s, s) ", "def complexSum(arr):\n a = [complex(i.replace(\"i\", \"j\")) for i in arr]\n s = 0\n for i in a:\n s += i\n if s == 1j:\n return \"i\"\n elif s == -1j:\n return \"-i\"\n elif s.imag == 0j:\n s = int(s.real)\n s = str(s).replace(\"j\", \"i\").lstrip(\"(\").rstrip(\")\")\n return s", "from functools import reduce\nfrom operator import add\nimport re\n\n\nP_TO_PYTHON = re.compile(r'[+-]?\\d*i')\nP_FROM_PYTHON = re.compile(r'[()]|\\b1(?=j)|([+-]|^)0j')\n\ncomplexify=lambda m: \"{}{}1j\".format(m.group()[:-1], '*' * (len(m.group()) > 1 and m.group()[-2] not in \"-+\"))\n\ndef complexSum(arr):\n lst = [P_TO_PYTHON.sub(complexify, s) for s in arr]\n cpx = reduce(add, map(eval, lst), 0)\n return P_FROM_PYTHON.sub('', str(cpx)).replace('j','i')", "s,complexSum=__import__('re').sub,lambda a:s('[-+]0i?|[()]','',s(r'(\\b1)?j','i',str(eval(s('i','j',s(r'\\bi','1i','+'.join(a)or'0'))))))", "import re\ndef complexSum(arr):\n real=0\n img=0\n for a in arr:\n for b in re.findall(r'[-+]?\\d*i?',a):\n if not b:\n continue\n if 'i' in b:\n if b=='+i' or b=='i':\n img+=1\n elif b=='-i':\n img-=1\n else:\n img+=int(b[:-1])\n else:\n real+=int(b)\n\n if img==0:\n return str(real)\n elif real==0:\n if img==1:\n return 'i'\n elif img==-1:\n return '-i'\n else:\n return '{}i'.format(img)\n else:\n return '{}{:+}i'.format(real,img).replace('+1i','+i').replace('-1i','-i')", "def complexSum(arr):\n s = sum(complex(i.replace('i','j')) for i in arr)\n r,i = map(int,(s.real,s.imag))\n return f'{r}' if not i else f\"{'-' if i==-1 else '' if i==1 else i}i\" if not r else f\"{r}{'+' if i>0 else ''}{i}i\"", "def complexSum(arr):\n real_sum = 0\n imag_sum = 0\n for string in arr:\n val = ''\n for char in string:\n if char == '-':\n if len(val) > 0:\n real_sum += int(val)\n val = '-'\n elif char == '+':\n real_sum += int(val)\n val = ''\n elif char == 'i':\n if val == '':\n val = 1\n elif val[0] == '-':\n if len(val) != 1:\n val = -1 * int(val[1::])\n else: val = -1\n imag_sum += int(val)\n val = 0\n else: \n val += char\n real_sum += int(val)\n fin_string = ''\n if imag_sum == 1:\n fin_string = 'i'\n elif imag_sum == 0:\n fin_string = ''\n elif imag_sum == -1:\n fin_string = '-i' \n else:\n if imag_sum > 1 and real_sum != 0:\n fin_string = '+'+str(imag_sum)+'i'\n else: \n fin_string = str(imag_sum)+'i'\n if real_sum == 0 and imag_sum != 0:\n return fin_string\n return (str(real_sum)+fin_string) if (real_sum+imag_sum !=0) else '0'", "complexSum=lambda A:(lambda s:{'1i':'i','-1i':'-i','0i':'0'}.get(s,s))(str(sum(complex(x.replace('i','j'))for x in A)).replace('j','i').strip('()').replace('+0i',''))"] | {"fn_name": "complexSum", "inputs": [[["2+3i", "3-i"]], [["2-3i", "3+i"]], [["3", "-3+i"]], [[]], [["3+4i"]], [["123+456i"]], [["0"]], [["-i"]], [["1", "1"]], [["-5", "5"]], [["1", "10", "100", "1000"]], [["5+4i", "11+3i"]], [["-2-4i", "-8+6i"]], [["-1-i", "7+10i"]], [["3+4i", "3-4i"]], [["10+i", "10-i", "9"]], [["2+3i", "0", "0"]], [["2+i", "3+2i", "-5-2i"]], [["2+i", "3+2i", "-5-4i"]], [["10+5i", "1-i", "-i"]], [["i", "2i", "3i"]], [["-i", "-3i", "1+i"]], [["-1000i", "1000i", "1234"]], [["-i", "123", "4-i"]], [["-1+i", "7+10i"]], [["-7+10i", "7+251i"]], [["-25-11i", "25+i"]], [["-23", "2500i"]]], "outputs": [["5+2i"], ["5-2i"], ["i"], ["0"], ["3+4i"], ["123+456i"], ["0"], ["-i"], ["2"], ["0"], ["1111"], ["16+7i"], ["-10+2i"], ["6+9i"], ["6"], ["29"], ["2+3i"], ["i"], ["-i"], ["11+3i"], ["6i"], ["1-3i"], ["1234"], ["127-2i"], ["6+11i"], ["261i"], ["-10i"], ["-23+2500i"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,563 |
def complexSum(arr):
|
f39bde48dbafd4028e6d06c2827576c0 | UNKNOWN | A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. Examples of numerical palindromes are:
2332
110011
54322345
For a given number ```num```, write a function which returns the number of numerical palindromes within each number. For this kata, single digit numbers will NOT be considered numerical palindromes.
Return "Not valid" if the input is not an integer or is less than 0.
```
palindrome(5) => 0
palindrome(1221) => 2
palindrome(141221001) => 5
palindrome(1294) => 0
palindrome("1221") => "Not valid"
```
```Haskell
In Haskell, return a Maybe Int with Nothing for negative numbers.
```
Other Kata in this Series:
Numerical Palindrome #1
Numerical Palindrome #1.5
Numerical Palindrome #2
Numerical Palindrome #3
Numerical Palindrome #3.5
Numerical Palindrome #4
Numerical Palindrome #5 | ["def palindrome(num):\n if not isinstance(num, int) or num < 0:\n return 'Not valid'\n s = str(num)\n return sum(sum(s[i:i+n] == s[i:i+n][::-1] for i in range(len(s)-n+1)) for n in range(2, len(s)+1))\n", "def palindrome(num):\n \n if not isinstance(num, int) or num < 0:\n return \"Not valid\"\n \n c, s = 0, '?'+str(num)+'!'\n for i in range(len(s)-2):\n if s[i] == s[i+1]:\n if s[i-1] == s[i+2]: c += 2\n else: c += 1\n \n if s[i] == s[i+2]: c += 1\n \n return c", "pal = lambda s: all(a==b for a, b in zip(s[:len(s)//2], s[::-1]))\n\ndef palindrome(num):\n if type(123)!=type(num) : return 'Not valid' \n n = str(num)\n if any(not c.isdigit() for c in n): return 'Not valid'\n c, l = 0, len(n)\n for i in range(2, l+1):\n for j in range(l-i+1):\n c += pal(n[j:j+i])\n return c", "from itertools import combinations_with_replacement as combs\n\ndef palindrome(num):\n is_palindrome = lambda chunk: chunk == chunk[::-1] and len(chunk) > 1\n s, l = str(num), len(str(num))\n return len([s[i:j] for i,j in combs(range(l+1), 2) if is_palindrome(s[i:j])]) if isinstance(num, int) and num > 0 else 'Not valid'", "def palindrome(num):\n if not isinstance(num, int) or num < 0:\n return \"Not valid\"\n s = str(num)\n l = len(s)\n return sum(1 for p in (s[i:i+1+j] for j in range(1, l) for i in range(l-j)) if p == p[::-1])", "def palindrome(num):\n cnt = 0\n if type(num) != int or num < 0:\n return \"Not valid\" \n s = str(num)\n for i in range(len(s) - 1):\n for j in range(i + 1, len(s)):\n if s[i : j + 1] == s[i : j + 1][::-1]:\n cnt += 1\n return cnt", "def palindrome(num):\n if type(num) != int or num < 0: return \"Not valid\"\n s = str(num)\n count, ls = 0, len(s)\n for i in range(ls-2):\n for d in [1,2]:\n if s[i] == s[i+d]:\n offset = 1\n while 0 <= i-offset and i+d+offset < ls and s[i-offset] == s[i+d+offset]:\n offset += 1\n count += offset\n return count + (ls != 1 and s[-1] == s[-2])", "def palindrome(num):\n if type(num) is not int or num < 0:\n return \"Not valid\"\n if num < 10:\n return 0\n \n counter = 0\n num = str(num)\n for i in range(0,len(num)-1):\n for r in range(i + 2, len(num)+1):\n if num[i:r] == num[i:r][::-1]:\n counter += 1 \n return counter", "def palindrome(n):\n if not isinstance(n, int) or n < 0:\n return \"Not valid\"\n s = str(n)\n return sum(s[i:j] == s[i:j][::-1]\n for i in range(len(s) - 1)\n for j in range(i + 2, len(s) + 1))", "def palindrome(num):\n return \"Not valid\" if not isinstance(num, int) or num < 0 else 0 if num < 10 else len([c for i, c in enumerate(str(num)[:-1]) if str(num)[i+1] == c or len(str(num)) - i > 3 and str(num)[i+3] == c or len(str(num)) - i > 2 and str(num)[i+2] == c])"] | {"fn_name": "palindrome", "inputs": [[2], [141221001], [1551], [13598], ["ACCDDCCA"], ["1551"], [-4505]], "outputs": [[0], [5], [2], [0], ["Not valid"], ["Not valid"], ["Not valid"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,085 |
def palindrome(num):
|
ae78ba7f8be336b26b342df17d8aace9 | UNKNOWN | Variation of this nice kata, the war has expanded and become dirtier and meaner; both even and odd numbers will fight with their pointy `1`s. And negative integers are coming into play as well, with, ça va sans dire, a negative contribution (think of them as spies or saboteurs).
Again, three possible outcomes: `odds win`, `evens win` and `tie`.
Examples:
```python
bits_war([1,5,12]) => "odds win" #1+101 vs 1100, 3 vs 2
bits_war([7,-3,20]) => "evens win" #111-11 vs 10100, 3-2 vs 2
bits_war([7,-3,-2,6]) => "tie" #111-11 vs -1+110, 3-2 vs -1+2
``` | ["def bits_war(numbers):\n odd, even = 0, 0\n for number in numbers:\n if number % 2 == 0:\n if number > 0:\n even += bin(number).count('1')\n else:\n even -= bin(number).count('1')\n else:\n if number > 0:\n odd += bin(number).count('1')\n else:\n odd -= bin(number).count('1')\n return 'odds win' if odd > even else 'evens win' if even > odd else 'tie'", "bits_war=lambda n: (lambda s: \"evens win\" if s>0 else \"odds win\" if s else \"tie\")(sum(bin(d)[2:].count(\"1\")*(-1)**((d%2 or d<0)-(d%2 and d<0)) for d in n))", "def bits_war(numbers):\n FIGHT = sum( sum(map(int, bin(abs(n))[2:])) * (-1)**(n < 0) * (-1)**(n%2 == 0) for n in numbers )\n return [\"evens win\", \"tie\", \"odds win\"][(FIGHT >= 0) + (FIGHT > 0)]", "def bits_war(numbers):\n evens = sum([bin(numb).replace('0b', '').count('1') * (-1 if '-' in bin(numb) else 1) for numb in numbers if numb % 2 == 0])\n odds = sum([bin(numb).replace('0b', '').count('1') * (-1 if '-' in bin(numb) else 1) for numb in numbers if numb % 2 != 0])\n return 'odds win' if odds > evens else 'evens win' if evens > odds else 'tie'", "def bits_war(numbers):\n even, odd = 0, 0\n for x in numbers:\n res = bin(x).count('1')\n res = -res if x < 0 else res\n if x%2: odd += res\n else: even += res\n return 'tie' if even == odd else ('even', 'odd')[odd>even]+'s win'", "def bits_war(numbers):\n scores = sum(f\"{n:b}\".count(\"1\") * (-1)**(n%2 == (n>0)) for n in numbers)\n return f\"{['odds', 'evens'][scores>0]} win\" if scores else \"tie\"", "def bits_war(numbers):\n res = [0, 0]\n for x in filter(None, numbers): # To remove the 0 for the division\n res[x&1] += bin(x).count('1') * x // abs(x)\n return \"odds win\" if res[0] < res[1] else \"evens win\" if res[0] > res[1] else \"tie\"", "def bits_war(numbers):\n odd_score, even_score = score(x for x in numbers if x%2), score(x for x in numbers if x%2==0)\n return 'odds win' if odd_score > even_score else 'tie' if odd_score == even_score else 'evens win'\n\ndef score(numbers):\n return sum(bin(x)[2:].count('1') * [-1, 1][x > 0] for x in numbers)", "def bits_war(numbers):\n even, odd = (\n sum(bin(x).count('1') * (1 if x > 0 else -1)\n for x in numbers if x % 2 == remainder) for remainder in [0, 1]\n )\n return (\n 'odds win' if odd > even else\n 'evens win' if even > odd else\n 'tie'\n )"] | {"fn_name": "bits_war", "inputs": [[[1, 5, 12]], [[7, -3, 20]], [[7, -3, -2, 6]], [[-3, -5]], [[]]], "outputs": [["odds win"], ["evens win"], ["tie"], ["evens win"], ["tie"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,555 |
def bits_war(numbers):
|
f08f2ecb2f4609b1de2274b37a1b3928 | UNKNOWN | # Task
Given a string `str`, reverse it omitting all non-alphabetic characters.
# Example
For `str = "krishan"`, the output should be `"nahsirk"`.
For `str = "ultr53o?n"`, the output should be `"nortlu"`.
# Input/Output
- `[input]` string `str`
A string consists of lowercase latin letters, digits and symbols.
- `[output]` a string | ["def reverse_letter(s):\n return ''.join([i for i in s if i.isalpha()])[::-1]\n\n", "reverse_letter = lambda s: ''.join([i for i in s if i.isalpha()])[::-1]\n", "def reverse_letter(string):\n return ''.join(filter(str.isalpha, reversed(string)))", "import re\ndef reverse_letter(string):\n return re.sub(\"[^a-zA-Z]\",\"\",string)[::-1]\n\n", "def reverse_letter(string):\n return ''.join(c for c in string[::-1] if c.isalpha())\n\n", "def reverse_letter(s):\n return ''.join(filter(str.isalpha, s))[::-1]", "reverse_letter = lambda s:''.join(reversed([x for x in s if x.isalpha()]))", "def reverse_letter(string):\n result = ''\n \n for char in string:\n if char.islower():\n result = char + result\n \n return result", "def reverse_letter(string):\n return \"\".join(c for c in string[-1::-1] if c.isalpha())", "def reverse_letter(string):\n return\"\".join(i for i in string[::-1] if i.isalpha())\n\n", "def reverse_letter(string):\n str = \"\"\n for n in string:\n if n.isalpha():\n str = n + str\n return str\n", "import re\ndef reverse_letter(string):\n return \"\".join(re.findall(r\"[A-Za-z]\",string)[::-1])", "def reverse_letter(s):\n return ''.join([i for i in s[::-1] if i.isalpha()])\n\n", "def reverse_letter(string):\n new_string = ''\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\n for i in string:\n if i in alphabet:\n new_string += i\n return new_string[::-1]\n \n\n", "import string\ndef reverse_letter(string):\n \n return \"\".join(filter(str.isalpha,string))[::-1]\n\n", "def reverse_letter(string):\n a = []\n for i in string:\n if i.isalpha():\n a.append(i)\n \n return \"\".join(list(reversed(a)))", "def reverse_letter(string):\n rev= string[::-1]\n return \"\".join([x for x in rev if (x if x.isalpha() else None)])\n", "reverse_letter=lambda s:''.join(filter(str.isalpha,s[::-1]))", "def reverse_letter(string):\n return ''.join(char for char in string[::-1] if char.isalpha())\n\n", "import string\ndef reverse_letter(s):\n return ''.join(reversed([a for a in s if a in string.ascii_letters]))\n\n", "def reverse_letter(string):\n #do your magic here\n return ''.join(s for s in reversed(string) if s.isalpha())\n", "def reverse_letter(string):\n revstr = string[::-1]\n return \"\".join([x for x in list(revstr) if x.isalpha()])\n\n", "def reverse_letter(string):\n return ''.join(c for c in string if c.isalpha())[::-1]\n\n", "reverse_letter = lambda string: ''.join([i for i in string if i.isalpha()])[::-1]", "reverse_letter = lambda s: ''.join(c for c in reversed(s) if c.isalpha())\n\n", "import array\ndef reverse_letter(string):\n a = array.array('u', string)\n a.reverse()\n return ''.join(filter(lambda x: x.isalpha(), a))", "import re\n\ndef reverse_letter(string):\n return re.sub(r\"[^a-z]\", \"\", string[::-1])", "def reverse_letter(string):\n string=str().join(list(filter(str.isalpha, string)))\n return string[::-1]\n #do your magic here\n\n", "def reverse_letter(string):\n return ''.join(x for x in reversed(string) if x.isalpha())\n\n", "reverse_letter = lambda s: ''.join(filter(lambda x: x.isalpha(), s))[::-1]", "def reverse_letter(string):\n return ''.join(x for x in string[::-1] if x.isalpha())\n\n", "reverse_letter=lambda s: \"\".join(l for l in s if l.isalpha())[::-1]", "def reverse_letter(string):\n txt = \"\"\n for a in string:\n if a.isalpha():\n txt = txt + a\n return txt[::-1]\n\n", "def reverse_letter(string):\n array = list(filter(str.isalpha, string))\n new_list = ''.join(array)\n return new_list[::-1]\n\n", "def reverse_letter(string):\n string = string[::-1]\n string2=\"\"\n for x in range(0,len(string)):\n if(string[x].isalpha()):\n string2+=string[x]\n \n return string2\n\n", "import re\ndef reverse_letter(st):\n newst = st[::-1]\n itog = \"\"\n for i in newst:\n if i.isalpha():\n itog += i\n return (itog)\n\n \n", "def reverse_letter(string):\n result = [i for i in string if i.isalpha()]\n return ''.join(result[::-1]) \n\n \n# condition must be alphabetic\n", "import string\n\ndef reverse_letter(str):\n chars = string.ascii_lowercase\n return ''.join(i for i in str[::-1] if i in chars) ", "def reverse_letter(string):\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\n newString = ''\n for letter in string:\n if letter in alphabet:\n newString += letter\n else:\n continue\n return newString[::-1]\n\n", "def reverse_letter(string):\n #do your magic here\n word = []\n for i in string:\n if i.isalpha() == True:\n word.append(i)\n \n word = reversed(word)\n \n word_rev = \"\".join(word)\n\n return word_rev", "def reverse_letter(string):\n chars_only = ''\n \n for item in string:\n if item.isalpha():\n chars_only += item\n return chars_only[::-1] \n\n", "def reverse_letter(string):\n return ''.join([i if i.isalpha() else \"\" for i in reversed(string)])\n", "def reverse_letter(string):\n a = []\n a[:] = string\n a.reverse()\n b = []\n c = ''\n let = ['a', 'b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\n for s in a:\n if s in let:\n b.append(s)\n for ele in b:\n c+=ele\n return c\n\n", "def reverse_letter(string):\n new = [s for s in string if s.isalpha()]\n a = new\n a.reverse()\n return ''.join(list(a))\n\n", "def reverse_letter(string):\n return ''.join(reversed([char for char in string if char.isalpha()]))\n\n", "import string\ndef reverse_letter(string):\n phrase=[]\n alpha=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\n for letter in string:\n if letter in alpha:\n phrase.append(letter)\n return ''.join(reversed(phrase))\n \nreverse_letter('hello')\n\n", "def reverse_letter(string):\n alphabet = {\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"}\n a = list(string)\n new = []\n for k in range(0,len(a)):\n if a[k] in alphabet:\n new.append(a[k])\n \n b = list(range(0,len(new)))\n \n for i in range(0,len(new)):\n b[i] = new[len(new)-1-i]\n \n out = \"\"\n for j in range(0,len(new)):\n out += str(b[j])\n return out\n\n", "def reverse_letter(string):\n result=\"\"\n for letter in string:\n if letter.isalpha():\n result+=letter\n else:\n del(letter)\n result2=result[::-1]\n return(result2)\n", "def reverse_letter(string):\n return \"\".join(list(reversed([n for n in string if n.isalpha()])))\n\n", "def reverse_letter(string):\n reversed = ''\n for char in string:\n if char.isalpha():\n reversed += char\n return reversed[::-1]\n\n", "def reverse_letter(string):\n #do your magic here\n n=len(string)\n str=\"\"\n for i in range(n):\n if string[i].isalpha() == True:\n str=str+string[i] \n \n\n \n \n return str[::-1]", "def reverse_letter(string):\n #do your magic here\n newString = \"\"\n for word in string:\n if word.isalpha():\n newString = word + newString\n \n \n return newString\n", "def reverse_letter(string):\n r=len(string)\n s=\"\"\n for i in range(r):\n if(string[i].isalpha()):\n s=s+string[i]\n return s[::-1]\n", "import re\ndef reverse_letter(string):\n return re.sub(r\"\"\"[0-9!@#$%^&*?/ \\/(/)/{/}/+/-/*/[/\\]/~/`/./,/>/</'/\"/?\\=\\\\:_|\\-;]\"\"\",\"\", string)[::-1]\n\n", "def reverse_letter(string):\n s = \"\"\n for c in string[::-1]:\n if c.isalpha():\n s += c\n return s\n\n", "letters = [\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"]\ndef reverse_letter(string):\n string = string[::-1]\n returner = []\n for item in string:\n if item in letters:\n returner.append(item)\n return ''.join(returner)\n\n\n", "def reverse_letter(string):\n result = \"\"\n for i in range(1,len(string)+1):\n if string[-i].isalpha():\n result += string[-i]\n return result\n\n", "def reverse_letter(string):\n x = filter(str.isalpha, string)\n return \"\".join(i for i in list(x))[::-1]", "import string\n\ndef reverse_letter(s):\n abc = list(string.ascii_lowercase)\n result = []\n for i in s[::-1]:\n if i in abc:\n result.append(i)\n return \"\".join(result)\n\n", "def reverse_letter(string):\n answer = []\n for a in string[::-1]:\n if a.isalpha() == True:\n answer.append(a)\n return ''.join(answer)", "def reverse_letter(string):\n ls = list(string)\n reverse = ls.reverse()\n reversed_cleaned = ''\n for i in range(len(ls)):\n if ls[i].isalpha():\n reversed_cleaned += ls[i]\n return reversed_cleaned\n", "\ndef reverse_letter(string):\n reversed = ''\n length = len(string)\n for m in range(length):\n reversed = reversed + string[(length - 1) - m]\n abc = 'abcdefghijklmnopqrstuvwxyz'\n reversed_cleaned = ''\n for n in range(length):\n if reversed[n] in abc:\n reversed_cleaned += reversed[n]\n return reversed_cleaned\n \n", "def reverse_letter(string):\n res = ''\n for i in range(len(string)-1, -1, -1):\n if string[i] in 'abcdefghijklmnopqrstuvwxyz':\n res += string[i]\n return res\n\n", "import re\n\n\ndef reverse_letter(string):\n str = re.sub(\"[^a-z]\", \"\", string)\n return str[::-1]\n\n", "def reverse_letter(a):\n ans=''\n a = list(a)\n while len(a)>0:\n b = a.pop()\n if b.isalpha():\n ans = ans + b\n print(ans)\n return ans \n \n", "def reverse_letter(string):\n arr = list(filter(str.isalpha, string))\n arr.reverse()\n return ''.join(arr)\n", "def reverse_letter(string):\n str = ''.join([x if x.isalpha() else '' for x in string])\n return str[::-1]\n\n", "def reverse_letter(string):\n gnirts = ''\n for i in range(0,len(string)):\n if string[i].isalpha():\n gnirts = string[i]+gnirts\n return gnirts\n\n", "def reverse_letter(string):\n #do your magic here\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\n s = ''\n for letter in string:\n if letter in alphabet: \n s = letter + s\n \n return s", "def reverse_letter(string):\n li = []\n for i in string:\n if i.isalpha():\n li.append(i)\n else:\n pass\n return \"\".join(li[::-1])\n \n #do your magic here\n\n", "def reverse_letter(string):\n return \"\".join(s for s in string if 97 <= ord(s) <= 122)[::-1]\n\n", "def reverse_letter(string):\n list = ''\n list1 = list.join([c for c in string if c.isalpha()])\n return list1[::-1]\n\n\n", "def reverse_letter(string):\n only_char = \"\"\n for char in string:\n if char.isalpha():\n only_char+=char\n return only_char[::-1]\n\n", "def reverse_letter(line):\n letters = list(filter(str.isalpha, list(line)))\n letters.reverse()\n return ''.join(letters)\n\n", "def reverse_letter(string):\n ans =[]\n for i in list(string):\n if i.isalpha():\n ans.append(i)\n a = \"\".join(ans)[::-1]\n return a", "def reverse_letter(string):\n str = \"\".join(x for x in string if x.isalpha())\n return str[::-1]\n \n\n", "import pandas as pd\ndef reverse_letter(s):\n return ''.join([i for i in s if i.isalpha()])[::-1]\n\n", "def reverse_letter(string):\n out = []\n for n in range(len(string)):\n if string[n].isalpha():\n out.insert(0, string[n])\n return ''.join(out)", "def reverse_letter(string):\n word = [x for x in string[::-1] if x.isalpha()]\n return ''.join(word)\n\n", "def reverse_letter(string):\n res = \"\".join([a for a in string[::-1] if a.isalpha()])\n return res\n \n", "def reverse_letter(string):\n result = list(string[::-1])\n answer = []\n for i in result:\n if i.isalpha():\n answer.append(i)\n return ''.join(answer)\n \n \n \n\n", "def reverse_letter(string):\n lst = ''.join([i for i in string if i.isalpha()])\n rev = lst[::-1]\n return rev\n\n", "import re\n\ndef reverse_letter(string):\n regex = re.compile('[^a-z]')\n reg = regex.sub('', string)\n\n reverse_word = reg[::-1]\n\n return reverse_word", "def reverse_letter(s):\n a = [i for i in s if i.isalpha()]\n a = ''.join(a)\n return a[::-1]\n\n", "import string\ndef reverse_letter(input_str):\n return \"\".join([c for c in input_str if c in string.ascii_letters][::-1])\n\n", "def reverse_letter(string):\n return ''.join(i if i.isalpha() else '' for i in string)[::-1]", "def reverse_letter(string):\n return ''.join((string[i] if string[i].isalpha() else \"\") for i in reversed(list(range(len(string)))))\n\n", "def reverse_letter(string):\n return \"\".join(c if c.isalpha() else \"\" for c in string)[::-1]\n\n", "def reverse_letter(string):\n #do your magic here\n alphabet=\"abcdefghijklmnopqrstuvwxyz\"\n reversed_word = list()\n for letter in string:\n if letter in alphabet:\n reversed_word.append(letter) \n reversed_word.reverse()\n return \"\".join(reversed_word)\n\n", "def reverse_letter(string):\n result = ''.join(x for x in string if x.isalpha())\n return result[::-1]\n\n", "def reverse_letter(string):\n lst = list(string)\n lst.reverse()\n newlst = []\n for item in lst:\n if not item.isalpha():\n pass\n else:\n newlst.append(item)\n return \"\".join(newlst)\n\n", "def reverse_letter(string):\n outputArray = []\n for a in string:\n if a.isalpha():\n outputArray.append(a)\n outputArray.reverse()\n return \"\".join(outputArray)\n\n", "from string import ascii_lowercase\n\ndef reverse_letter(string):\n return ''.join(l for l in string[::-1] if l in ascii_lowercase )\n\n", "def reverse_letter(string):\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\n x =''\n for letter in string:\n if letter in alphabet:\n x += letter\n return x[::-1]\n\n", "def reverse_letter(string):\n iaprw = []\n for i in string:\n if i.isalpha() == True:\n iaprw.append(i)\n iaprw.reverse()\n return ''.join(iaprw)", "def reverse_letter(string):\n lt='qwertyuiopalskjdhfgzxcvbnm'\n s=''\n for i in string:\n if i in lt:\n s=s+i\n return s[::-1]", "def reverse_letter(string):\n s = ''.join(filter(str.isalpha, string))\n inverse = s[::-1]\n return inverse\n\n", "def reverse_letter(string):\n reversed = \"\"\n for i in range(len(string)-1, -1, -1):\n if string[i].isalpha():\n reversed += string[i]\n return reversed\n\n", "\ndef reverse_letter(string): \n result = ''.join([i for i in string if not i.isdigit()])\n alphanumeric = ''.join([i for i in result if i.isalnum()])\n \n return alphanumeric[::-1]\n\n\n\n\n", "def reverse_letter(string):\n arr = list(string)\n arr2 = []\n for j in range(0,len(arr)):\n if arr[j].isalpha() == True:\n arr2.append(arr[j])\n return \"\".join(arr2[::-1])\n \n\n"] | {"fn_name": "reverse_letter", "inputs": [["krishan"], ["ultr53o?n"], ["ab23c"], ["krish21an"]], "outputs": [["nahsirk"], ["nortlu"], ["cba"], ["nahsirk"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 15,895 |
def reverse_letter(string):
|
16fd4da7e2ce26d810f4129e205e7bb8 | UNKNOWN | - Input: Integer `n`
- Output: String
Example:
`a(4)` prints as
```
A
A A
A A A
A A
```
`a(8)` prints as
```
A
A A
A A
A A
A A A A A
A A
A A
A A
```
`a(12)` prints as
```
A
A A
A A
A A
A A
A A
A A A A A A A
A A
A A
A A
A A
A A
```
Note:
- Each line's length is `2n - 1`
- Each line should be concatenate by line break `"\n"`
- If `n` is less than `4`, it should return `""`
- If `n` is odd, `a(n) = a(n - 1)`, eg `a(5) == a(4); a(9) == a(8)` | ["def a(n):\n \"\"\"\n \"\"\"\n if n % 2 != 0:\n n = n - 1\n if n < 4:\n return ''\n side = \" \" * (n - 1)\n li = [side + \"A\" + side]\n for i in range(1, n):\n side = side[1:]\n middle = \"A \" * (i - 1) if i == (n / 2) else \" \" * (i - 1)\n li.append(side + \"A \" + middle + \"A\" + side)\n return \"\\n\".join(li)", "def a(n):\n if n < 4:\n return \"\"\n if n % 2:\n n -= 1\n lines = (\n \"A\" if i == 0 else\n \" \".join(\"A\" * (i + 1)) if i == n // 2 else\n \"A\" + \" \" * (2 * i - 1) + \"A\"\n for i in range(n)\n )\n width = 2 * n - 1\n return \"\\n\".join(line.center(width) for line in lines)", "def a(n):\n n -= n%2\n if n<4: return ''\n return '\\n'.join( '{0}{1}{0}'.format('A' * (i%(n//2) != 0),\n ' ' * (i*2-1) if i%(n//2) else ' '.join( ['A']*(i+1) )\n ).center(2*n-1) for i in range(n) )", "def a(n):\n n = n if n % 2 == 0 else n - 1\n width = 2 * n - 1\n lines = [\"A\".center(width)] + [(\"A\" + \" \"*k + \"A\").center(width) for k in range(1, n-1, 2)] +\\\n [\" \".join([\"A\"]*(n//2+1)).center(width)] + [(\"A\" + \" \"*k + \"A\").center(width) for k in range(n+1, 2*n-1, 2)]\n return \"\\n\".join(lines) if n >= 4 else \"\"", "def a(n):\n if n<4: return ''\n n-=n%2\n l=2*n-1\n return '\\n'.join((' '.join(['A']*(i+1)) if i*2==n else ''.join('A' if j in (0,i*2) else ' ' for j in range(i*2+1))).center(l) for i in range(n))", "a=lambda n:\"\\n\".join(['A'.center(2*(n-(n&1))-1)]+[[((\"A \"*((n-(n&1))//2+1)).rstrip()).center(2*(n-(n&1))-1),(\"A\"+(\" \"*(i*2+1))+\"A\").center(2*(n-(n&1))-1)][i!=(n-(n&1))//2-1]for i in range(n-1-(n&1))])if n-(n&1)>3 else \"\""] | {"fn_name": "a", "inputs": [[4], [7], [11], [30], [-5], [0], [3]], "outputs": [[" A \n A A \n A A A \nA A"], [" A \n A A \n A A \n A A A A \n A A \nA A"], [" A \n A A \n A A \n A A \n A A \n A A A A A A \n A A \n A A \n A A \nA A"], [" A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A A A A A A A A A A A A A A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \n A A \nA A"], [""], [""], [""]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,829 |
def a(n):
|
45a49808e343ca2bce9711d727293b4e | UNKNOWN | In Math, an improper fraction is a fraction where the numerator (the top number) is greater than or equal to the denominator (the bottom number) For example: ```5/3``` (five third).
A mixed numeral is a whole number and a fraction combined into one "mixed" number. For example: ```1 1/2``` (one and a half) is a mixed numeral.
## Task
Write a function `convertToMixedNumeral` to convert the improper fraction into a mixed numeral.
The input will be given as a ```string``` (e.g. ```'4/3'```).
The output should be a ```string```, with a space in between the whole number and the fraction (e.g. ```'1 1/3'```). You do not need to reduce the result to its simplest form.
For the purpose of this exercise, there will be no ```0```, ```empty string``` or ```null``` input value. However, the input can be:
- a negative fraction
- a fraction that does not require conversion
- a fraction that can be converted into a whole number
## Example | ["def convert_to_mixed_numeral(parm):\n a, b = list(map(int, parm.split('/')))\n d, r = divmod(abs(a), b)\n s = (0 < a) - (a < 0)\n return parm if d == 0 else ('{}' + ' {}/{}' * (r != 0)).format(d * s, r, b)\n", "def convert_to_mixed_numeral(parm):\n sign, parm = parm[:(\"-\" in parm)], parm[(\"-\" in parm):]\n numerator, denominator = parm.split(\"/\")\n integer, numerator = divmod(int(numerator), int(denominator))\n integer, fraction = f\"{integer or ''}\", f\"{numerator}/{denominator}\" if numerator else \"\"\n return f\"{sign}{integer}{(integer and fraction) and ' '}{fraction}\"", "def convert_to_mixed_numeral(parm):\n numerator, denominator = parm.split('/')\n num, dem = int(numerator), int(denominator)\n divide, mod = int(num/dem) or '', int(abs(num)%dem) or 0 \n\n if bool(divide) and bool(mod):\n return \"%s %s/%s\" % (divide, mod, denominator)\n else:\n return \"%s/%s\" % (int(mod) if num > 0 else int(-mod), int(denominator)) if bool(mod) else str(divide)", "def convert_to_mixed_numeral(parm):\n num, den = map(int, parm.split(\"/\"))\n sign, num = num < 0, abs(num)\n \n if num < den:\n return parm\n \n whole, num = divmod(num, den)\n if num == 0:\n return \"-\"*sign + \"%d\" % whole\n return \"-\"*sign + \"%d %d/%d\" % (whole, num, den)", "def convert_to_mixed_numeral(frac):\n numerator, denominator = (int(a) for a in frac.split('/'))\n quo, rem = divmod(abs(numerator), denominator)\n signed_quo = -quo if numerator < 0 else quo\n if quo == 0: # fraction doesn't require conversion\n return frac\n elif rem == 0: # fraction converted to whole number\n return '{}'.format(signed_quo)\n return '{}{}/{}'.format(\n '{} '.format(signed_quo) if quo > 0 else '', rem, denominator\n )", "def convert_to_mixed_numeral(parm):\n p1,p2=map(int,parm.split('/'))\n if abs(p1)<p2 and p1!=0: return parm\n i=int(p1/p2)\n q=p1-i*p2\n return \"{} {}/{}\".format(i,abs(q),p2) if q!=0 else \"{}\".format(i)", "def convert_to_mixed_numeral(parm):\n # your code here\n parts = tuple(map(int, parm.split('/')))\n a, b = abs(parts[0]), parts[1]\n if a < b:\n mixed_numeral = \"{}/{}\".format(a, b)\n elif a % b:\n mixed_numeral = \"{} {}/{}\".format(a // b, a % b, b)\n else:\n mixed_numeral = str(a // b)\n if parts[0] < 0:\n mixed_numeral = \"-{}\".format(mixed_numeral)\n \n return mixed_numeral # mixed_numeral is a string", "def convert_to_mixed_numeral(parm):\n lis=list(map(int, parm.split('/')))\n whole = abs(lis[0])//lis[1]\n mod = abs(lis[0])%lis[1]\n if lis[0]<0:\n if mod == 0:\n return \"-{}\".format(whole)\n elif whole != 0: return(\"-{0} {1}/{2}\".format(whole, mod, lis[1]))\n else: return(\"-{0}/{1}\".format(mod,lis[1]))\n else:\n if mod == 0: return \"{0}\".format(whole)\n elif whole != 0: return(\"{0} {1}/{2}\".format(whole, mod, lis[1]))\n else: return \"{0}/{1}\".format(mod, lis[1])", "def convert_to_mixed_numeral(parm):\n n, d = list(map(int, parm.split('/')))\n sign = '-' if n < 0 else ''\n m, n = divmod(abs(n), d)\n return parm if m == 0 else sign + f'{m}' + f' {n}/{d}' * (n != 0)"] | {"fn_name": "convert_to_mixed_numeral", "inputs": [["74/3"], ["9999/24"], ["74/30"], ["13/5"], ["5/3"], ["1/1"], ["10/10"], ["900/10"], ["9920/124"], ["6/2"], ["9/77"], ["96/100"], ["12/18"], ["6/36"], ["1/18"], ["-64/8"], ["-6/8"], ["-9/78"], ["-504/26"], ["-47/2"], ["-21511/21"]], "outputs": [["24 2/3"], ["416 15/24"], ["2 14/30"], ["2 3/5"], ["1 2/3"], ["1"], ["1"], ["90"], ["80"], ["3"], ["9/77"], ["96/100"], ["12/18"], ["6/36"], ["1/18"], ["-8"], ["-6/8"], ["-9/78"], ["-19 10/26"], ["-23 1/2"], ["-1024 7/21"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,317 |
def convert_to_mixed_numeral(parm):
|
4cc7d85b633ffc2ff8d5c5dbfd808822 | UNKNOWN | Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states:
Every even integer greater than 2 can be expressed as the sum of two primes.
For example:
`6 = 3 + 3`
`8 = 3 + 5`
`10 = 3 + 7 = 5 + 5`
`12 = 5 + 7`
Some rules for the conjecture:
- pairs should be descending like [3,5] not [5,3]
- all pairs should be in ascending order based on the first element of the pair:
`[[5, 13], [7, 11]]` is accepted
but `[[7, 11],[5, 13]]` is not accepted.
Write the a function that find all identical pairs of prime numbers:
```python
def goldbach(even_number)
```
You should return an array of containing pairs of primes, like:
```python
[[5, 13], [7, 11]] # even_number = 18
```
or
```python
[[3, 31], [5, 29], [11, 23], [17, 17]] # even_number = 34
``` | ["def goldbach(n):\n if n < 2:\n return []\n if n == 4:\n return [[2, 2]]\n l = n - 2\n sieve = [True] * (l // 2)\n for i in range(3, int(l**0.5) + 1, 2):\n if sieve[i // 2]:\n sieve[i * i // 2::i] = [False] * ((l - i * i - 1) // (2 * i) + 1)\n primes = [(2 * i + 1) for i in range(1, l // 2) if sieve[i]]\n return [[p, n - p] for p in primes if (n - p) in primes and p <= (n - p)]\n", "is_prime = lambda n: n>1 and all(n%j for j in range(2, int(n**0.5)+1))\ngoldbach = lambda n: [[i,n-i] for i in range(2, int(n/2)+1) if is_prime(i) and is_prime(n-i)]", "import numpy as np\n\nN = 100001\ns = np.ones(N)\ns[:2] = 0\ns[2 * 2 :: 2] = 0\nfor i in range(3, int(N ** 0.5) + 1):\n if s[i]:\n s[i * i :: i] = 0\nprimes = {i for i, x in enumerate(s) if x}\n\n\ndef goldbach(n):\n if n == 4:\n return [[2, 2]]\n return [\n [i, n - i] for i in range(3, n // 2 + 1, 2) if i in primes and n - i in primes\n ]", "def isprime(n):\n return n > 1 and all(n % i for i in range(2, int(n**0.5) +1))\n\ndef goldbach(n):\n return [[a, b] for a, b in zip(range(1, n), range(n-1, 0, -1)) if a <= b and isprime(a) and isprime(b)]\n", "isprime=lambda x:x>1 and all(x%i for i in range(2,int(x**.5)+1))\ngoldbach=lambda n:[[i,n-i] for i in range(n // 2 + 1) if isprime(i) and isprime(n-i)] ", "def era(n):\n\n l = [True for i in range(0, n + 1)]\n l[0] = l[1] = False\n for i in range(2, n + 1):\n if l[i]:\n for j in range(i*i, n + 1, i):\n l[j] = False\n for i, _ in enumerate(l):\n if _:\n yield i\n\n\ndef goldbach(n):\n res = []\n p = list(era(n))\n for x in p:\n if n - x in p:\n if n - x < x:\n return res\n res.append([x, n - x])\n return res", "import math\n\ndef goldbach(en):\n r=[] \n for j in range(2,int(en/2)+1):\n if isPrime(j) and isPrime(en-j): r.append([j,en-j])\n return r\n \ndef isPrime(n):\n for i in range(2,int(math.sqrt(n))+1):\n if n%i==0: return False\n return True"] | {"fn_name": "goldbach", "inputs": [[2], [4], [6], [8], [10], [52], [54], [56], [58], [100], [200], [1000], [5000]], "outputs": [[[]], [[[2, 2]]], [[[3, 3]]], [[[3, 5]]], [[[3, 7], [5, 5]]], [[[5, 47], [11, 41], [23, 29]]], [[[7, 47], [11, 43], [13, 41], [17, 37], [23, 31]]], [[[3, 53], [13, 43], [19, 37]]], [[[5, 53], [11, 47], [17, 41], [29, 29]]], [[[3, 97], [11, 89], [17, 83], [29, 71], [41, 59], [47, 53]]], [[[3, 197], [7, 193], [19, 181], [37, 163], [43, 157], [61, 139], [73, 127], [97, 103]]], [[[3, 997], [17, 983], [23, 977], [29, 971], [47, 953], [53, 947], [59, 941], [71, 929], [89, 911], [113, 887], [137, 863], [173, 827], [179, 821], [191, 809], [227, 773], [239, 761], [257, 743], [281, 719], [317, 683], [347, 653], [353, 647], [359, 641], [383, 617], [401, 599], [431, 569], [443, 557], [479, 521], [491, 509]]], [[[7, 4993], [13, 4987], [31, 4969], [43, 4957], [67, 4933], [97, 4903], [139, 4861], [199, 4801], [211, 4789], [241, 4759], [271, 4729], [277, 4723], [337, 4663], [349, 4651], [379, 4621], [397, 4603], [409, 4591], [433, 4567], [439, 4561], [487, 4513], [577, 4423], [643, 4357], [661, 4339], [673, 4327], [727, 4273], [739, 4261], [757, 4243], [769, 4231], [823, 4177], [907, 4093], [997, 4003], [1033, 3967], [1069, 3931], [1093, 3907], [1123, 3877], [1153, 3847], [1231, 3769], [1291, 3709], [1303, 3697], [1327, 3673], [1429, 3571], [1453, 3547], [1459, 3541], [1471, 3529], [1483, 3517], [1489, 3511], [1531, 3469], [1543, 3457], [1567, 3433], [1609, 3391], [1627, 3373], [1657, 3343], [1669, 3331], [1693, 3307], [1699, 3301], [1741, 3259], [1747, 3253], [1783, 3217], [1831, 3169], [1879, 3121], [1933, 3067], [1951, 3049], [1999, 3001], [2029, 2971], [2083, 2917], [2113, 2887], [2143, 2857], [2203, 2797], [2251, 2749], [2269, 2731], [2281, 2719], [2287, 2713], [2293, 2707], [2311, 2689], [2341, 2659], [2383, 2617]]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,094 |
def goldbach(n):
|
c3197875f1385cbd73e0b422f039d822 | UNKNOWN | Consider a pyramid made up of blocks. Each layer of the pyramid is a rectangle of blocks, and the dimensions of these rectangles increment as you descend the pyramid. So, if a layer is a `3x6` rectangle of blocks, then the next layer will be a `4x7` rectangle of blocks. A `1x10` layer will be on top of a `2x11` layer on top of a `3x12` layer, and so on.
## Task
Given the dimensions of a pyramid's topmost layer `w,l`, and its height `h` (aka the number of layers), return the total number of blocks in the pyramid.
## Examples
`num_blocks(1, 1, 2)` will return `5`. This pyramid starts with a `1x1` layer and has 2 layers total. So, there is 1 block in the first layer, and `2x2=4` blocks in the second. Thus, 5 is the total number of blocks.
`num_blocks(2, 4, 3)` will return `47`. This pyramid has 3 layers: `2x4`, `3x5`, and `4x6`. So, there are `47` blocks total.
## Notes
All parameters will always be postive nonzero integers.
Efficiency is important. There will be:
* 100 'small' cases with `w`, `l`, and `h` below `20`.
* 100 'big' cases with `w`, `l`, and `h` between `1e9` and `1e10`. | ["def num_blocks(w, l, h):\n return w*l*h + (w+l)*h*(h-1)/2 + h*(h-1)*(2*h-1)/6", "def num_blocks(w, l, h):\n return w*l*h + (w+l) * (h-1)*h//2 + (h-1)*h*(2*h-1)//6\n \n\"\"\"\nFor those who wonder:\n\nfirst layer being of size w*l, the total number of blocks, SB, is:\n\n SB = w*l + (w+1)*(l+1) + (w+2)*(l+2) + ... + (w+h-1)*(l+h-1)\n\nSo: SB = \" Sum from i=0 to h-1 of (w+i)*(l+i) \"\n\nLet's use the following notation for this: SB = S(i)[ (w+i)*(l+i) ]\n\nThen:\n SB = S(i)[ w*l + i(w+l) + i**2 ]\n \n = S(i)[ w*l ] + S(i)[ i(w+l) ] + S(i)[ i**2 ]\n \n = w*l*h + (w+l) * S(i)[ i ] + S(i)[ i**2 ]\n\n\nHere, you find two classic sums of sequences (see wiki or equivalent for the demonstrations):\n\n S(i)[ i ] = sum of all integers from 1 to x = x*(x+1) // 2\n S(i)[ i**2 ] = sum of all squares of integers from 1 to x = x*(x+1)*(2*x+1) // 6\n\nSince on our side we do the sum from 0 (which doesn't affect at all the result)\nto h-1 in place of x, we get:\n\n SB = w*l*h + (w+l) * (h-1)*h//2 + (h-1)*h*(2*h-1)//6\n\n\"\"\"", "def num_blocks (width, length, height):\n \n def linsum (n):\n return n * (n+1) // 2\n \n def sqrsum (n):\n return n * (n+1) * (2*n+1) // 6\n \n cube = width * length * height\n stairs = (width+length) * linsum(height-1)\n corner = sqrsum(height-1)\n \n return cube + stairs + corner\n \n", "def num_blocks(w, l, h):\n return w*l*h + (h-1)*h*(w+l+1)//2 + (h-2)*(h-1)*h//3", "from fractions import Fraction\n\ndef num_blocks(w,l,h):\n\n a = h*w*l\n b = Fraction((h-1)*(h)*(w+l),2)\n print(b)\n c = Fraction((h-1)*h*(2*h-1),6)\n print(c)\n return int(a+b+c) ", "\ndef num_blocks(w, l, h):\n h -= 1\n return ((h*(h+1)*((2*h)+1))//6)+(((w+l)*h*(h+1))//2 + w*l*h) + w*l", "\ndef num_blocks(w, l, h):\n return h*(1-3*h+2*h*h-3*l+3*h*l-3*w+3*h*w+6*l*w)//6", "def num_blocks(w, l, h):\n res= w*l*h \n h-=1\n A = h*(h+1)//2\n B = (h+1)*(2*h+1)*h//6\n res+= (w+l)*A+B\n return res", "\ndef num_blocks(w, l, h):\n return h*w*l + (w+l)*h*(h-1)//2 + h*(h-1)*(2*h-1)//6", "num_blocks=lambda w,l,h:(2*h*h+3*h*(l+w-1)+3*(2*l*w-l-w)+1)*h//6"] | {"fn_name": "num_blocks", "inputs": [[1, 1, 2], [2, 4, 3], [1, 10, 10], [20, 30, 40]], "outputs": [[5], [47], [880], [83540]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,244 |
def num_blocks(w, l, h):
|
c62b001d79d2fa4aa84163853f7944e6 | UNKNOWN | Implement a function, so it will produce a sentence out of the given parts.
Array of parts could contain:
- words;
- commas in the middle;
- multiple periods at the end.
Sentence making rules:
- there must always be a space between words;
- there must not be a space between a comma and word on the left;
- there must always be one and only one period at the end of a sentence.
**Example:** | ["def make_sentences(parts):\n return ' '.join(parts).replace(' ,', ',').strip(' .') + '.'", "import re\n\ndef make_sentences(parts):\n return re.sub(' ([,.])', r'\\1', ' '.join(parts).replace(' ,', ',')).rstrip('.') + '.'", "import re\n\ndef make_sentences(parts):\n return re.match(r'[^\\.]+', ' '.join(parts).replace(' , ', ', ')).group().strip() + '.'", "def make_sentences(parts):\n result = ''\n for i in range(len(parts) - 1):\n result += parts[i]\n if parts[i + 1] not in '.,':\n result += ' '\n result += parts[-1]\n return result.rstrip('.') + '.'", "def make_sentences(parts):\n return ' '.join(x for x in parts if x != '.').replace(' ,',',') + '.'", "def make_sentences(parts):\n return ' '.join(parts).replace(' ,', ',').rstrip(' .') + '.'", "def make_sentences(parts):\n import re\n sentence = re.sub(r'\\b ([.,])', r'\\1', ' '.join(parts)).rstrip('. ')\n return sentence + '.'", "def make_sentences(parts):\n return '{}.'.format(\n ''.join(' ' + a if a.isalnum() else a for a in parts).strip(' .'))\n", "def make_sentences(parts):\n n = ''\n parts = [i for i in parts if i != '.']\n for i in parts:\n if i == ',':\n n = n[:-1] + ', '\n else:\n n += i + ' '\n return n[:-1]+'.'"] | {"fn_name": "make_sentences", "inputs": [[["hello", "world"]], [["Quick", "brown", "fox", "jumped", "over", "the", "lazy", "dog"]], [["hello", ",", "my", "dear"]], [["one", ",", "two", ",", "three"]], [["One", ",", "two", "two", ",", "three", "three", "three", ",", "4", "4", "4", "4"]], [["hello", "world", "."]], [["Bye", "."]], [["hello", "world", ".", ".", "."]], [["The", "Earth", "rotates", "around", "The", "Sun", "in", "365", "days", ",", "I", "know", "that", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."]]], "outputs": [["hello world."], ["Quick brown fox jumped over the lazy dog."], ["hello, my dear."], ["one, two, three."], ["One, two two, three three three, 4 4 4 4."], ["hello world."], ["Bye."], ["hello world."], ["The Earth rotates around The Sun in 365 days, I know that."]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,312 |
def make_sentences(parts):
|
d9679bb9b1149e390343ed7cd4da1605 | UNKNOWN | You're a statistics professor and the deadline for submitting your students' grades is tonight at midnight. Each student's grade is determined by their mean score across all of the tests they took this semester.
You've decided to automate grade calculation by writing a function `calculate_grade()` that takes a list of test scores as an argument and returns a one character string representing the student's grade calculated as follows:
* 90% <= mean score <= 100%: `"A"`,
* 80% <= mean score < 90%: `"B"`,
* 70% <= mean score < 80%: `"C"`,
* 60% <= mean score < 70%: `"D"`,
* mean score < 60%: `"F"`
For example, `calculate_grade([92, 94, 99])` would return `"A"` since the mean score is `95`, and `calculate_grade([50, 60, 70, 80, 90])` would return `"C"` since the mean score is `70`.
Your function should handle an input list of any length greater than zero. | ["from bisect import bisect\nfrom statistics import mean\n\n\ndef calculate_grade(scores):\n return 'FDCBA'[bisect([60, 70, 80, 90], mean(scores))]\n", "def calculate_grade(scores):\n for score in scores:\n mean = sum(scores)/len(scores)\n if mean >= 90 and mean <= 100:\n return \"A\"\n elif mean >= 80 and mean < 90:\n return \"B\"\n elif mean >= 70 and mean < 80:\n return \"C\"\n elif mean >= 60 and mean < 70:\n return \"D\"\n else:\n return \"F\"", "import statistics\n\ndef calculate_grade(scores):\n mean = statistics.mean(scores)\n if mean >= 90: return \"A\"\n if mean >= 80: return \"B\"\n if mean >= 70: return \"C\"\n if mean >= 60: return \"D\"\n return \"F\"", "def calculate_grade(scores):\n s = sum(scores) / len(scores)\n return 'ABCDF'[(s < 90) + (s < 80) + (s < 70) + (s < 60)]", "from statistics import mean\n\n\ndef calculate_grade(scores):\n a = mean(scores)\n return (\n 'A' if a >= 90 else\n 'B' if a >= 80 else\n 'C' if a >= 70 else\n 'D' if a >= 60 else\n 'F'\n )", "def calculate_grade(scores):\n import numpy as np\n mean_score = np.mean(scores)\n if mean_score >= 90:\n return \"A\"\n elif mean_score >= 80:\n return \"B\"\n elif mean_score >= 70:\n return \"C\"\n elif mean_score >= 60:\n return \"D\"\n else:\n return \"F\"\n", "def calculate_grade(scores):\n mean = sum(scores) / len(scores)\n return \"ABCDF\"[(mean < 90) + (mean < 80) + (mean < 70) + (mean < 60)]", "def calculate_grade(scores):\n score = (sum(scores)/len(scores))/100\n grades = { 0.6:\"D\",0.7:\"C\",0.8:\"B\",0.9:\"A\"}\n return grades[round(score,1)] if score > 0.6 else \"F\"\n", "def calculate_grade(scores):\n\n avg_grade = sum(scores)/len(scores)\n if avg_grade < 60:\n return \"F\"\n elif avg_grade < 70:\n return \"D\"\n elif avg_grade < 80:\n return \"C\"\n elif avg_grade < 90:\n return \"B\"\n else:\n return \"A\"", "def calculate_grade(scores):\n x = sum(scores)/len(scores)\n return 'A' if x >= 90 else 'B' if x >= 80 else 'C' if x >= 70 else 'D' if x >= 60 else 'F'"] | {"fn_name": "calculate_grade", "inputs": [[[92, 94, 99]], [[50, 60, 70, 80, 90]], [[50, 55]]], "outputs": [["A"], ["C"], ["F"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,287 |
def calculate_grade(scores):
|
a3e64e017bbbe5be22efc12370d180aa | UNKNOWN | Converting a 24-hour time like "0830" or "2030" to a 12-hour time (like "8:30 am" or "8:30 pm") sounds easy enough, right? Well, let's see if you can do it!
You will have to define a function named "to12hourtime", and you will be given a four digit time string (in "hhmm" format) as input.
Your task is to return a 12-hour time string in the form of "h:mm am" or "h:mm pm". (Of course, the "h" part will be two digits if the hour is greater than 9.)
If you like this kata, try converting 12-hour time to 24-hour time:
https://www.codewars.com/kata/converting-12-hour-time-to-24-hour-time/train/python | ["from datetime import datetime\n\ndef to12hourtime(t):\n return datetime.strptime(t, '%H%M').strftime('%I:%M %p').lstrip('0').lower()", "def to12hourtime(t):\n hour = int(t[:2])\n \n if hour >= 12:\n hour -= 12\n suf = 'pm'\n else:\n suf = 'am'\n \n if hour == 0:\n hour = 12\n \n return '%s:%s %s' % (hour, t[2:], suf)", "from datetime import datetime as dt\n\ndef to12hourtime(t):\n return dt.strptime(t, '%H%M').strftime('%-I:%M %p').lower()", "def to12hourtime(timestring):\n print(timestring)\n hour = int(timestring[:2])\n mins = timestring[2:]\n if hour >= 12:\n noon = \"pm\"\n hour -= 12\n else:\n noon = \"am\"\n if hour == 0:\n hour = 12\n return \"{}:{} {}\".format(hour, mins, noon)", "from datetime import datetime\n\nto12hourtime = lambda ts: str(datetime.strptime(ts, '%H%M').strftime(\"%-I:%M %p\").lower())", "def to12hourtime(s):\n h,m=divmod(int(s),100)\n p,h=divmod(h,12)\n return '{}:{:02} {}m'.format(h or 12,m,'p' if p else 'a')", "def to12hourtime(timestring):\n h = int(timestring[:2])\n return '{}:{} {}m'.format(h % 12 or 12, timestring[2:], 'ap'[h > 11]) ", "def to12hourtime(hhmm):\n hh, mm = int(hhmm[:2]), int(hhmm[2:])\n return '{}:{:02} {}'.format(hh - 12 if hh > 12 else hh, mm, ['am','pm'][hh>=12]) if hh else '12:{:02} am'.format(mm) ", "def to12hourtime(time_string):\n hour_str = time_string[0] + time_string[1]\n minute_str = time_string[2] + time_string[3]\n \n if int(hour_str) < 12:\n if int(hour_str) == 0:\n hour_str = 12\n return '%s:%s am' % (int(hour_str), minute_str)\n else:\n hour = int(hour_str) - 12;\n if hour == 0:\n hour = 12\n return '%s:%s pm' % (hour, minute_str)", "from datetime import datetime\ndef to12hourtime(time):\n return datetime.strptime(time,\"%H%M\").strftime(\"%I:%M %p\").lstrip(\"0\").lower()"] | {"fn_name": "to12hourtime", "inputs": [["0000"], ["0001"], ["0002"], ["0003"], ["0004"], ["0005"], ["0006"], ["0007"], ["0008"], ["0009"], ["0010"], ["0011"], ["0012"], ["0013"], ["0014"], ["0015"], ["0016"], ["0017"], ["0018"], ["0019"], ["0020"], ["0021"], ["0022"], ["0023"], ["0024"], ["0025"], ["0026"], ["0027"], ["0028"], ["0029"], ["0030"], ["0031"], ["0032"], ["0033"], ["0034"], ["0035"], ["0036"], ["0037"], ["0038"], ["0039"], ["0040"], ["0041"], ["0042"], ["0043"], ["0044"], ["0045"], ["0046"], ["0047"], ["0048"], ["0049"], ["0050"], ["0051"], ["0052"], ["0053"], ["0054"], ["0055"], ["0056"], ["0057"], ["0058"], ["0059"], ["0100"], ["0101"], ["0102"], ["0103"], ["0104"], ["0105"], ["0106"], ["0107"], ["0108"], ["0109"], ["0110"], ["0111"], ["0112"], ["0113"], ["0114"], ["0115"], ["0116"], ["0117"], ["0118"], ["0119"], ["0120"], ["0121"], ["0122"], ["0123"], ["0124"], ["0125"], ["0126"], ["0127"], ["0128"], ["0129"], ["0130"], ["0131"], ["0132"], ["0133"], ["0134"], ["0135"], ["0136"], ["0137"], ["0138"], ["0139"], ["0140"], ["0141"], ["0142"], ["0143"], ["0144"], ["0145"], ["0146"], ["0147"], ["0148"], ["0149"], ["0150"], ["0151"], ["0152"], ["0153"], ["0154"], ["0155"], ["0156"], ["0157"], ["0158"], ["0159"], ["0200"], ["0201"], ["0202"], ["0203"], ["0204"], ["0205"], ["0206"], ["0207"], ["0208"], ["0209"], ["0210"], ["0211"], ["0212"], ["0213"], ["0214"], ["0215"], ["0216"], ["0217"], ["0218"], ["0219"], ["0220"], ["0221"], ["0222"], ["0223"], ["0224"], ["0225"], ["0226"], ["0227"], ["0228"], ["0229"], ["0230"], ["0231"], ["0232"], ["0233"], ["0234"], ["0235"], ["0236"], ["0237"], ["0238"], ["0239"], ["0240"], ["0241"], ["0242"], ["0243"], ["0244"], ["0245"], ["0246"], ["0247"], ["0248"], ["0249"], ["0250"], ["0251"], ["0252"], ["0253"], ["0254"], ["0255"], ["0256"], ["0257"], ["0258"], ["0259"], ["0300"], ["0301"], ["0302"], ["0303"], ["0304"], ["0305"], ["0306"], ["0307"], ["0308"], ["0309"], ["0310"], ["0311"], ["0312"], ["0313"], ["0314"], ["0315"], ["0316"], ["0317"], ["0318"], ["0319"], ["0320"], ["0321"], ["0322"], ["0323"], ["0324"], ["0325"], ["0326"], ["0327"], ["0328"], ["0329"], ["0330"], ["0331"], ["0332"], ["0333"], ["0334"], ["0335"], ["0336"], ["0337"], ["0338"], ["0339"], ["0340"], ["0341"], ["0342"], ["0343"], ["0344"], ["0345"], ["0346"], ["0347"], ["0348"], ["0349"], ["0350"], ["0351"], ["0352"], ["0353"], ["0354"], ["0355"], ["0356"], ["0357"], ["0358"], ["0359"], ["0400"], ["0401"], ["0402"], ["0403"], ["0404"], ["0405"], ["0406"], ["0407"], ["0408"], ["0409"], ["0410"], ["0411"], ["0412"], ["0413"], ["0414"], ["0415"], ["0416"], ["0417"], ["0418"], ["0419"], ["0420"], ["0421"], ["0422"], ["0423"], ["0424"], ["0425"], ["0426"], ["0427"], ["0428"], ["0429"], ["0430"], ["0431"], ["0432"], ["0433"], ["0434"], ["0435"], ["0436"], ["0437"], ["0438"], ["0439"], ["0440"], ["0441"], ["0442"], ["0443"], ["0444"], ["0445"], ["0446"], ["0447"], ["0448"], ["0449"], ["0450"], ["0451"], ["0452"], ["0453"], ["0454"], ["0455"], ["0456"], ["0457"], ["0458"], ["0459"], ["0500"], ["0501"], ["0502"], ["0503"], ["0504"], ["0505"], ["0506"], ["0507"], ["0508"], ["0509"], ["0510"], ["0511"], ["0512"], ["0513"], ["0514"], ["0515"], ["0516"], ["0517"], ["0518"], ["0519"], ["0520"], ["0521"], ["0522"], ["0523"], ["0524"], ["0525"], ["0526"], ["0527"], ["0528"], ["0529"], ["0530"], ["0531"], ["0532"], ["0533"], ["0534"], ["0535"], ["0536"], ["0537"], ["0538"], ["0539"], ["0540"], ["0541"], ["0542"], ["0543"], ["0544"], ["0545"], ["0546"], ["0547"], ["0548"], ["0549"], ["0550"], ["0551"], ["0552"], ["0553"], ["0554"], ["0555"], ["0556"], ["0557"], ["0558"], ["0559"], ["0600"], ["0601"], ["0602"], ["0603"], ["0604"], ["0605"], ["0606"], ["0607"], ["0608"], ["0609"], ["0610"], ["0611"], ["0612"], ["0613"], ["0614"], ["0615"], ["0616"], ["0617"], ["0618"], ["0619"], ["0620"], ["0621"], ["0622"], ["0623"], ["0624"], ["0625"], ["0626"], ["0627"], ["0628"], ["0629"], ["0630"], ["0631"], ["0632"], ["0633"], ["0634"], ["0635"], ["0636"], ["0637"], ["0638"], ["0639"], ["0640"], ["0641"], ["0642"], ["0643"], ["0644"], ["0645"], ["0646"], ["0647"], ["0648"], ["0649"], ["0650"], ["0651"], ["0652"], ["0653"], ["0654"], ["0655"], ["0656"], ["0657"], ["0658"], ["0659"], ["0700"], ["0701"], ["0702"], ["0703"], ["0704"], ["0705"], ["0706"], ["0707"], ["0708"], ["0709"], ["0710"], ["0711"], ["0712"], ["0713"], ["0714"], ["0715"], ["0716"], ["0717"], ["0718"], ["0719"], ["0720"], ["0721"], ["0722"], ["0723"], ["0724"], ["0725"], ["0726"], ["0727"], ["0728"], ["0729"], ["0730"], ["0731"], ["0732"], ["0733"], ["0734"], ["0735"], ["0736"], ["0737"], ["0738"], ["0739"], ["0740"], ["0741"], ["0742"], ["0743"], ["0744"], ["0745"], ["0746"], ["0747"], ["0748"], ["0749"], ["0750"], ["0751"], ["0752"], ["0753"], ["0754"], ["0755"], ["0756"], ["0757"], ["0758"], ["0759"], ["0800"], ["0801"], ["0802"], ["0803"], ["0804"], ["0805"], ["0806"], ["0807"], ["0808"], ["0809"], ["0810"], ["0811"], ["0812"], ["0813"], ["0814"], ["0815"], ["0816"], ["0817"], ["0818"], ["0819"], ["0820"], ["0821"], ["0822"], ["0823"], ["0824"], ["0825"], ["0826"], ["0827"], ["0828"], ["0829"], ["0830"], ["0831"], ["0832"], ["0833"], ["0834"], ["0835"], ["0836"], ["0837"], ["0838"], ["0839"], ["0840"], ["0841"], ["0842"], ["0843"], ["0844"], ["0845"], ["0846"], ["0847"], ["0848"], ["0849"], ["0850"], ["0851"], ["0852"], ["0853"], ["0854"], ["0855"], ["0856"], ["0857"], ["0858"], ["0859"], ["0900"], ["0901"], ["0902"], ["0903"], ["0904"], ["0905"], ["0906"], ["0907"], ["0908"], ["0909"], ["0910"], ["0911"], ["0912"], ["0913"], ["0914"], ["0915"], ["0916"], ["0917"], ["0918"], ["0919"], ["0920"], ["0921"], ["0922"], ["0923"], ["0924"], ["0925"], ["0926"], ["0927"], ["0928"], ["0929"], ["0930"], ["0931"], ["0932"], ["0933"], ["0934"], ["0935"], ["0936"], ["0937"], ["0938"], ["0939"], ["0940"], ["0941"], ["0942"], ["0943"], ["0944"], ["0945"], ["0946"], ["0947"], ["0948"], ["0949"], ["0950"], ["0951"], ["0952"], ["0953"], ["0954"], ["0955"], ["0956"], ["0957"], ["0958"], ["0959"], ["1000"], ["1001"], ["1002"], ["1003"], ["1004"], ["1005"], ["1006"], ["1007"], ["1008"], ["1009"], ["1010"], ["1011"], ["1012"], ["1013"], ["1014"], ["1015"], ["1016"], ["1017"], ["1018"], ["1019"], ["1020"], ["1021"], ["1022"], ["1023"], ["1024"], ["1025"], ["1026"], ["1027"], ["1028"], ["1029"], ["1030"], ["1031"], ["1032"], ["1033"], ["1034"], ["1035"], ["1036"], ["1037"], ["1038"], ["1039"], ["1040"], ["1041"], ["1042"], ["1043"], ["1044"], ["1045"], ["1046"], ["1047"], ["1048"], ["1049"], ["1050"], ["1051"], ["1052"], ["1053"], ["1054"], ["1055"], ["1056"], ["1057"], ["1058"], ["1059"], ["1100"], ["1101"], ["1102"], ["1103"], ["1104"], ["1105"], ["1106"], ["1107"], ["1108"], ["1109"], ["1110"], ["1111"], ["1112"], ["1113"], ["1114"], ["1115"], ["1116"], ["1117"], ["1118"], ["1119"], ["1120"], ["1121"], ["1122"], ["1123"], ["1124"], ["1125"], ["1126"], ["1127"], ["1128"], ["1129"], ["1130"], ["1131"], ["1132"], ["1133"], ["1134"], ["1135"], ["1136"], ["1137"], ["1138"], ["1139"], ["1140"], ["1141"], ["1142"], ["1143"], ["1144"], ["1145"], ["1146"], ["1147"], ["1148"], ["1149"], ["1150"], ["1151"], ["1152"], ["1153"], ["1154"], ["1155"], ["1156"], ["1157"], ["1158"], ["1159"], ["1200"], ["1201"], ["1202"], ["1203"], ["1204"], ["1205"], ["1206"], ["1207"], ["1208"], ["1209"], ["1210"], ["1211"], ["1212"], ["1213"], ["1214"], ["1215"], ["1216"], ["1217"], ["1218"], ["1219"], ["1220"], ["1221"], ["1222"], ["1223"], ["1224"], ["1225"], ["1226"], ["1227"], ["1228"], ["1229"], ["1230"], ["1231"], ["1232"], ["1233"], ["1234"], ["1235"], ["1236"], ["1237"], ["1238"], ["1239"], ["1240"], ["1241"], ["1242"], ["1243"], ["1244"], ["1245"], ["1246"], ["1247"], ["1248"], ["1249"], ["1250"], ["1251"], ["1252"], ["1253"], ["1254"], ["1255"], ["1256"], ["1257"], ["1258"], ["1259"], ["1300"], ["1301"], ["1302"], ["1303"], ["1304"], ["1305"], ["1306"], ["1307"], ["1308"], ["1309"], ["1310"], ["1311"], ["1312"], ["1313"], ["1314"], ["1315"], ["1316"], ["1317"], ["1318"], ["1319"], ["1320"], ["1321"], ["1322"], ["1323"], ["1324"], ["1325"], ["1326"], ["1327"], ["1328"], ["1329"], ["1330"], ["1331"], ["1332"], ["1333"], ["1334"], ["1335"], ["1336"], ["1337"], ["1338"], ["1339"], ["1340"], ["1341"], ["1342"], ["1343"], ["1344"], ["1345"], ["1346"], ["1347"], ["1348"], ["1349"], ["1350"], ["1351"], ["1352"], ["1353"], ["1354"], ["1355"], ["1356"], ["1357"], ["1358"], ["1359"], ["1400"], ["1401"], ["1402"], ["1403"], ["1404"], ["1405"], ["1406"], ["1407"], ["1408"], ["1409"], ["1410"], ["1411"], ["1412"], ["1413"], ["1414"], ["1415"], ["1416"], ["1417"], ["1418"], ["1419"], ["1420"], ["1421"], ["1422"], ["1423"], ["1424"], ["1425"], ["1426"], ["1427"], ["1428"], ["1429"], ["1430"], ["1431"], ["1432"], ["1433"], ["1434"], ["1435"], ["1436"], ["1437"], ["1438"], ["1439"], ["1440"], ["1441"], ["1442"], ["1443"], ["1444"], ["1445"], ["1446"], ["1447"], ["1448"], ["1449"], ["1450"], ["1451"], ["1452"], ["1453"], ["1454"], ["1455"], ["1456"], ["1457"], ["1458"], ["1459"], ["1500"], ["1501"], ["1502"], ["1503"], ["1504"], ["1505"], ["1506"], ["1507"], ["1508"], ["1509"], ["1510"], ["1511"], ["1512"], ["1513"], ["1514"], ["1515"], ["1516"], ["1517"], ["1518"], ["1519"], ["1520"], ["1521"], ["1522"], ["1523"], ["1524"], ["1525"], ["1526"], ["1527"], ["1528"], ["1529"], ["1530"], ["1531"], ["1532"], ["1533"], ["1534"], ["1535"], ["1536"], ["1537"], ["1538"], ["1539"], ["1540"], ["1541"], ["1542"], ["1543"], ["1544"], ["1545"], ["1546"], ["1547"], ["1548"], ["1549"], ["1550"], ["1551"], ["1552"], ["1553"], ["1554"], ["1555"], ["1556"], ["1557"], ["1558"], ["1559"], ["1600"], ["1601"], ["1602"], ["1603"], ["1604"], ["1605"], ["1606"], ["1607"], ["1608"], ["1609"], ["1610"], ["1611"], ["1612"], ["1613"], ["1614"], ["1615"], ["1616"], ["1617"], ["1618"], ["1619"], ["1620"], ["1621"], ["1622"], ["1623"], ["1624"], ["1625"], ["1626"], ["1627"], ["1628"], ["1629"], ["1630"], ["1631"], ["1632"], ["1633"], ["1634"], ["1635"], ["1636"], ["1637"], ["1638"], ["1639"], ["1640"], ["1641"], ["1642"], ["1643"], ["1644"], ["1645"], ["1646"], ["1647"], ["1648"], ["1649"], ["1650"], ["1651"], ["1652"], ["1653"], ["1654"], ["1655"], ["1656"], ["1657"], ["1658"], ["1659"], ["1700"], ["1701"], ["1702"], ["1703"], ["1704"], ["1705"], ["1706"], ["1707"], ["1708"], ["1709"], ["1710"], ["1711"], ["1712"], ["1713"], ["1714"], ["1715"], ["1716"], ["1717"], ["1718"], ["1719"], ["1720"], ["1721"], ["1722"], ["1723"], ["1724"], ["1725"], ["1726"], ["1727"], ["1728"], ["1729"], ["1730"], ["1731"], ["1732"], ["1733"], ["1734"], ["1735"], ["1736"], ["1737"], ["1738"], ["1739"], ["1740"], ["1741"], ["1742"], ["1743"], ["1744"], ["1745"], ["1746"], ["1747"], ["1748"], ["1749"], ["1750"], ["1751"], ["1752"], ["1753"], ["1754"], ["1755"], ["1756"], ["1757"], ["1758"], ["1759"], ["1800"], ["1801"], ["1802"], ["1803"], ["1804"], ["1805"], ["1806"], ["1807"], ["1808"], ["1809"], ["1810"], ["1811"], ["1812"], ["1813"], ["1814"], ["1815"], ["1816"], ["1817"], ["1818"], ["1819"], ["1820"], ["1821"], ["1822"], ["1823"], ["1824"], ["1825"], ["1826"], ["1827"], ["1828"], ["1829"], ["1830"], ["1831"], ["1832"], ["1833"], ["1834"], ["1835"], ["1836"], ["1837"], ["1838"], ["1839"], ["1840"], ["1841"], ["1842"], ["1843"], ["1844"], ["1845"], ["1846"], ["1847"], ["1848"], ["1849"], ["1850"], ["1851"], ["1852"], ["1853"], ["1854"], ["1855"], ["1856"], ["1857"], ["1858"], ["1859"], ["1900"], ["1901"], ["1902"], ["1903"], ["1904"], ["1905"], ["1906"], ["1907"], ["1908"], ["1909"], ["1910"], ["1911"], ["1912"], ["1913"], ["1914"], ["1915"], ["1916"], ["1917"], ["1918"], ["1919"], ["1920"], ["1921"], ["1922"], ["1923"], ["1924"], ["1925"], ["1926"], ["1927"], ["1928"], ["1929"], ["1930"], ["1931"], ["1932"], ["1933"], ["1934"], ["1935"], ["1936"], ["1937"], ["1938"], ["1939"], ["1940"], ["1941"], ["1942"], ["1943"], ["1944"], ["1945"], ["1946"], ["1947"], ["1948"], ["1949"], ["1950"], ["1951"], ["1952"], ["1953"], ["1954"], ["1955"], ["1956"], ["1957"], ["1958"], ["1959"], ["2000"], ["2001"], ["2002"], ["2003"], ["2004"], ["2005"], ["2006"], ["2007"], ["2008"], ["2009"], ["2010"], ["2011"], ["2012"], ["2013"], ["2014"], ["2015"], ["2016"], ["2017"], ["2018"], ["2019"], ["2020"], ["2021"], ["2022"], ["2023"], ["2024"], ["2025"], ["2026"], ["2027"], ["2028"], ["2029"], ["2030"], ["2031"], ["2032"], ["2033"], ["2034"], ["2035"], ["2036"], ["2037"], ["2038"], ["2039"], ["2040"], ["2041"], ["2042"], ["2043"], ["2044"], ["2045"], ["2046"], ["2047"], ["2048"], ["2049"], ["2050"], ["2051"], ["2052"], ["2053"], ["2054"], ["2055"], ["2056"], ["2057"], ["2058"], ["2059"], ["2100"], ["2101"], ["2102"], ["2103"], ["2104"], ["2105"], ["2106"], ["2107"], ["2108"], ["2109"], ["2110"], ["2111"], ["2112"], ["2113"], ["2114"], ["2115"], ["2116"], ["2117"], ["2118"], ["2119"], ["2120"], ["2121"], ["2122"], ["2123"], ["2124"], ["2125"], ["2126"], ["2127"], ["2128"], ["2129"], ["2130"], ["2131"], ["2132"], ["2133"], ["2134"], ["2135"], ["2136"], ["2137"], ["2138"], ["2139"], ["2140"], ["2141"], ["2142"], ["2143"], ["2144"], ["2145"], ["2146"], ["2147"], ["2148"], ["2149"], ["2150"], ["2151"], ["2152"], ["2153"], ["2154"], ["2155"], ["2156"], ["2157"], ["2158"], ["2159"], ["2200"], ["2201"], ["2202"], ["2203"], ["2204"], ["2205"], ["2206"], ["2207"], ["2208"], ["2209"], ["2210"], ["2211"], ["2212"], ["2213"], ["2214"], ["2215"], ["2216"], ["2217"], ["2218"], ["2219"], ["2220"], ["2221"], ["2222"], ["2223"], ["2224"], ["2225"], ["2226"], ["2227"], ["2228"], ["2229"], ["2230"], ["2231"], ["2232"], ["2233"], ["2234"], ["2235"], ["2236"], ["2237"], ["2238"], ["2239"], ["2240"], ["2241"], ["2242"], ["2243"], ["2244"], ["2245"], ["2246"], ["2247"], ["2248"], ["2249"], ["2250"], ["2251"], ["2252"], ["2253"], ["2254"], ["2255"], ["2256"], ["2257"], ["2258"], ["2259"], ["2300"], ["2301"], ["2302"], ["2303"], ["2304"], ["2305"], ["2306"], ["2307"], ["2308"], ["2309"], ["2310"], ["2311"], ["2312"], ["2313"], ["2314"], ["2315"], ["2316"], ["2317"], ["2318"], ["2319"], ["2320"], ["2321"], ["2322"], ["2323"], ["2324"], ["2325"], ["2326"], ["2327"], ["2328"], ["2329"], ["2330"], ["2331"], ["2332"], ["2333"], ["2334"], ["2335"], ["2336"], ["2337"], ["2338"], ["2339"], ["2340"], ["2341"], ["2342"], ["2343"], ["2344"], ["2345"], ["2346"], ["2347"], ["2348"], ["2349"], ["2350"], ["2351"], ["2352"], ["2353"], ["2354"], ["2355"], ["2356"], ["2357"], ["2358"], ["2359"]], "outputs": [["12:00 am"], ["12:01 am"], ["12:02 am"], ["12:03 am"], ["12:04 am"], ["12:05 am"], ["12:06 am"], ["12:07 am"], ["12:08 am"], ["12:09 am"], ["12:10 am"], ["12:11 am"], ["12:12 am"], ["12:13 am"], ["12:14 am"], ["12:15 am"], ["12:16 am"], ["12:17 am"], ["12:18 am"], ["12:19 am"], ["12:20 am"], ["12:21 am"], ["12:22 am"], ["12:23 am"], ["12:24 am"], ["12:25 am"], ["12:26 am"], ["12:27 am"], ["12:28 am"], ["12:29 am"], ["12:30 am"], ["12:31 am"], ["12:32 am"], ["12:33 am"], ["12:34 am"], ["12:35 am"], ["12:36 am"], ["12:37 am"], ["12:38 am"], ["12:39 am"], ["12:40 am"], ["12:41 am"], ["12:42 am"], ["12:43 am"], ["12:44 am"], ["12:45 am"], ["12:46 am"], ["12:47 am"], ["12:48 am"], ["12:49 am"], ["12:50 am"], ["12:51 am"], ["12:52 am"], ["12:53 am"], ["12:54 am"], ["12:55 am"], ["12:56 am"], ["12:57 am"], ["12:58 am"], ["12:59 am"], ["1:00 am"], ["1:01 am"], ["1:02 am"], ["1:03 am"], ["1:04 am"], ["1:05 am"], ["1:06 am"], ["1:07 am"], ["1:08 am"], ["1:09 am"], ["1:10 am"], ["1:11 am"], ["1:12 am"], ["1:13 am"], ["1:14 am"], ["1:15 am"], ["1:16 am"], ["1:17 am"], ["1:18 am"], ["1:19 am"], ["1:20 am"], ["1:21 am"], ["1:22 am"], ["1:23 am"], ["1:24 am"], ["1:25 am"], ["1:26 am"], ["1:27 am"], ["1:28 am"], ["1:29 am"], ["1:30 am"], ["1:31 am"], ["1:32 am"], ["1:33 am"], ["1:34 am"], ["1:35 am"], ["1:36 am"], ["1:37 am"], ["1:38 am"], ["1:39 am"], ["1:40 am"], ["1:41 am"], ["1:42 am"], ["1:43 am"], ["1:44 am"], ["1:45 am"], ["1:46 am"], ["1:47 am"], ["1:48 am"], ["1:49 am"], ["1:50 am"], ["1:51 am"], ["1:52 am"], ["1:53 am"], ["1:54 am"], ["1:55 am"], ["1:56 am"], ["1:57 am"], ["1:58 am"], ["1:59 am"], ["2:00 am"], ["2:01 am"], ["2:02 am"], ["2:03 am"], ["2:04 am"], ["2:05 am"], ["2:06 am"], ["2:07 am"], ["2:08 am"], ["2:09 am"], ["2:10 am"], ["2:11 am"], ["2:12 am"], ["2:13 am"], ["2:14 am"], ["2:15 am"], ["2:16 am"], ["2:17 am"], ["2:18 am"], ["2:19 am"], ["2:20 am"], ["2:21 am"], ["2:22 am"], ["2:23 am"], ["2:24 am"], ["2:25 am"], ["2:26 am"], ["2:27 am"], ["2:28 am"], ["2:29 am"], ["2:30 am"], ["2:31 am"], ["2:32 am"], ["2:33 am"], ["2:34 am"], ["2:35 am"], ["2:36 am"], ["2:37 am"], ["2:38 am"], ["2:39 am"], ["2:40 am"], ["2:41 am"], ["2:42 am"], ["2:43 am"], ["2:44 am"], ["2:45 am"], ["2:46 am"], ["2:47 am"], ["2:48 am"], ["2:49 am"], ["2:50 am"], ["2:51 am"], ["2:52 am"], ["2:53 am"], ["2:54 am"], ["2:55 am"], ["2:56 am"], ["2:57 am"], ["2:58 am"], ["2:59 am"], ["3:00 am"], ["3:01 am"], ["3:02 am"], ["3:03 am"], ["3:04 am"], ["3:05 am"], ["3:06 am"], ["3:07 am"], ["3:08 am"], ["3:09 am"], ["3:10 am"], ["3:11 am"], ["3:12 am"], ["3:13 am"], ["3:14 am"], ["3:15 am"], ["3:16 am"], ["3:17 am"], ["3:18 am"], ["3:19 am"], ["3:20 am"], ["3:21 am"], ["3:22 am"], ["3:23 am"], ["3:24 am"], ["3:25 am"], ["3:26 am"], ["3:27 am"], ["3:28 am"], ["3:29 am"], ["3:30 am"], ["3:31 am"], ["3:32 am"], ["3:33 am"], ["3:34 am"], ["3:35 am"], ["3:36 am"], ["3:37 am"], ["3:38 am"], ["3:39 am"], ["3:40 am"], ["3:41 am"], ["3:42 am"], ["3:43 am"], ["3:44 am"], ["3:45 am"], ["3:46 am"], ["3:47 am"], ["3:48 am"], ["3:49 am"], ["3:50 am"], ["3:51 am"], ["3:52 am"], ["3:53 am"], ["3:54 am"], ["3:55 am"], ["3:56 am"], ["3:57 am"], ["3:58 am"], ["3:59 am"], ["4:00 am"], ["4:01 am"], ["4:02 am"], ["4:03 am"], ["4:04 am"], ["4:05 am"], ["4:06 am"], ["4:07 am"], ["4:08 am"], ["4:09 am"], ["4:10 am"], ["4:11 am"], ["4:12 am"], ["4:13 am"], ["4:14 am"], ["4:15 am"], ["4:16 am"], ["4:17 am"], ["4:18 am"], ["4:19 am"], ["4:20 am"], ["4:21 am"], ["4:22 am"], ["4:23 am"], ["4:24 am"], ["4:25 am"], ["4:26 am"], ["4:27 am"], ["4:28 am"], ["4:29 am"], ["4:30 am"], ["4:31 am"], ["4:32 am"], ["4:33 am"], ["4:34 am"], ["4:35 am"], ["4:36 am"], ["4:37 am"], ["4:38 am"], ["4:39 am"], ["4:40 am"], ["4:41 am"], ["4:42 am"], ["4:43 am"], ["4:44 am"], ["4:45 am"], ["4:46 am"], ["4:47 am"], ["4:48 am"], ["4:49 am"], ["4:50 am"], ["4:51 am"], ["4:52 am"], ["4:53 am"], ["4:54 am"], ["4:55 am"], ["4:56 am"], ["4:57 am"], ["4:58 am"], ["4:59 am"], ["5:00 am"], ["5:01 am"], ["5:02 am"], ["5:03 am"], ["5:04 am"], ["5:05 am"], ["5:06 am"], ["5:07 am"], ["5:08 am"], ["5:09 am"], ["5:10 am"], ["5:11 am"], ["5:12 am"], ["5:13 am"], ["5:14 am"], ["5:15 am"], ["5:16 am"], ["5:17 am"], ["5:18 am"], ["5:19 am"], ["5:20 am"], ["5:21 am"], ["5:22 am"], ["5:23 am"], ["5:24 am"], ["5:25 am"], ["5:26 am"], ["5:27 am"], ["5:28 am"], ["5:29 am"], ["5:30 am"], ["5:31 am"], ["5:32 am"], ["5:33 am"], ["5:34 am"], ["5:35 am"], ["5:36 am"], ["5:37 am"], ["5:38 am"], ["5:39 am"], ["5:40 am"], ["5:41 am"], ["5:42 am"], ["5:43 am"], ["5:44 am"], ["5:45 am"], ["5:46 am"], ["5:47 am"], ["5:48 am"], ["5:49 am"], ["5:50 am"], ["5:51 am"], ["5:52 am"], ["5:53 am"], ["5:54 am"], ["5:55 am"], ["5:56 am"], ["5:57 am"], ["5:58 am"], ["5:59 am"], ["6:00 am"], ["6:01 am"], ["6:02 am"], ["6:03 am"], ["6:04 am"], ["6:05 am"], ["6:06 am"], ["6:07 am"], ["6:08 am"], ["6:09 am"], ["6:10 am"], ["6:11 am"], ["6:12 am"], ["6:13 am"], ["6:14 am"], ["6:15 am"], ["6:16 am"], ["6:17 am"], ["6:18 am"], ["6:19 am"], ["6:20 am"], ["6:21 am"], ["6:22 am"], ["6:23 am"], ["6:24 am"], ["6:25 am"], ["6:26 am"], ["6:27 am"], ["6:28 am"], ["6:29 am"], ["6:30 am"], ["6:31 am"], ["6:32 am"], ["6:33 am"], ["6:34 am"], ["6:35 am"], ["6:36 am"], ["6:37 am"], ["6:38 am"], ["6:39 am"], ["6:40 am"], ["6:41 am"], ["6:42 am"], ["6:43 am"], ["6:44 am"], ["6:45 am"], ["6:46 am"], ["6:47 am"], ["6:48 am"], ["6:49 am"], ["6:50 am"], ["6:51 am"], ["6:52 am"], ["6:53 am"], ["6:54 am"], ["6:55 am"], ["6:56 am"], ["6:57 am"], ["6:58 am"], ["6:59 am"], ["7:00 am"], ["7:01 am"], ["7:02 am"], ["7:03 am"], ["7:04 am"], ["7:05 am"], ["7:06 am"], ["7:07 am"], ["7:08 am"], ["7:09 am"], ["7:10 am"], ["7:11 am"], ["7:12 am"], ["7:13 am"], ["7:14 am"], ["7:15 am"], ["7:16 am"], ["7:17 am"], ["7:18 am"], ["7:19 am"], ["7:20 am"], ["7:21 am"], ["7:22 am"], ["7:23 am"], ["7:24 am"], ["7:25 am"], ["7:26 am"], ["7:27 am"], ["7:28 am"], ["7:29 am"], ["7:30 am"], ["7:31 am"], ["7:32 am"], ["7:33 am"], ["7:34 am"], ["7:35 am"], ["7:36 am"], ["7:37 am"], ["7:38 am"], ["7:39 am"], ["7:40 am"], ["7:41 am"], ["7:42 am"], ["7:43 am"], ["7:44 am"], ["7:45 am"], ["7:46 am"], ["7:47 am"], ["7:48 am"], ["7:49 am"], ["7:50 am"], ["7:51 am"], ["7:52 am"], ["7:53 am"], ["7:54 am"], ["7:55 am"], ["7:56 am"], ["7:57 am"], ["7:58 am"], ["7:59 am"], ["8:00 am"], ["8:01 am"], ["8:02 am"], ["8:03 am"], ["8:04 am"], ["8:05 am"], ["8:06 am"], ["8:07 am"], ["8:08 am"], ["8:09 am"], ["8:10 am"], ["8:11 am"], ["8:12 am"], ["8:13 am"], ["8:14 am"], ["8:15 am"], ["8:16 am"], ["8:17 am"], ["8:18 am"], ["8:19 am"], ["8:20 am"], ["8:21 am"], ["8:22 am"], ["8:23 am"], ["8:24 am"], ["8:25 am"], ["8:26 am"], ["8:27 am"], ["8:28 am"], ["8:29 am"], ["8:30 am"], ["8:31 am"], ["8:32 am"], ["8:33 am"], ["8:34 am"], ["8:35 am"], ["8:36 am"], ["8:37 am"], ["8:38 am"], ["8:39 am"], ["8:40 am"], ["8:41 am"], ["8:42 am"], ["8:43 am"], ["8:44 am"], ["8:45 am"], ["8:46 am"], ["8:47 am"], ["8:48 am"], ["8:49 am"], ["8:50 am"], ["8:51 am"], ["8:52 am"], ["8:53 am"], ["8:54 am"], ["8:55 am"], ["8:56 am"], ["8:57 am"], ["8:58 am"], ["8:59 am"], ["9:00 am"], ["9:01 am"], ["9:02 am"], ["9:03 am"], ["9:04 am"], ["9:05 am"], ["9:06 am"], ["9:07 am"], ["9:08 am"], ["9:09 am"], ["9:10 am"], ["9:11 am"], ["9:12 am"], ["9:13 am"], ["9:14 am"], ["9:15 am"], ["9:16 am"], ["9:17 am"], ["9:18 am"], ["9:19 am"], ["9:20 am"], ["9:21 am"], ["9:22 am"], ["9:23 am"], ["9:24 am"], ["9:25 am"], ["9:26 am"], ["9:27 am"], ["9:28 am"], ["9:29 am"], ["9:30 am"], ["9:31 am"], ["9:32 am"], ["9:33 am"], ["9:34 am"], ["9:35 am"], ["9:36 am"], ["9:37 am"], ["9:38 am"], ["9:39 am"], ["9:40 am"], ["9:41 am"], ["9:42 am"], ["9:43 am"], ["9:44 am"], ["9:45 am"], ["9:46 am"], ["9:47 am"], ["9:48 am"], ["9:49 am"], ["9:50 am"], ["9:51 am"], ["9:52 am"], ["9:53 am"], ["9:54 am"], ["9:55 am"], ["9:56 am"], ["9:57 am"], ["9:58 am"], ["9:59 am"], ["10:00 am"], ["10:01 am"], ["10:02 am"], ["10:03 am"], ["10:04 am"], ["10:05 am"], ["10:06 am"], ["10:07 am"], ["10:08 am"], ["10:09 am"], ["10:10 am"], ["10:11 am"], ["10:12 am"], ["10:13 am"], ["10:14 am"], ["10:15 am"], ["10:16 am"], ["10:17 am"], ["10:18 am"], ["10:19 am"], ["10:20 am"], ["10:21 am"], ["10:22 am"], ["10:23 am"], ["10:24 am"], ["10:25 am"], ["10:26 am"], ["10:27 am"], ["10:28 am"], ["10:29 am"], ["10:30 am"], ["10:31 am"], ["10:32 am"], ["10:33 am"], ["10:34 am"], ["10:35 am"], ["10:36 am"], ["10:37 am"], ["10:38 am"], ["10:39 am"], ["10:40 am"], ["10:41 am"], ["10:42 am"], ["10:43 am"], ["10:44 am"], ["10:45 am"], ["10:46 am"], ["10:47 am"], ["10:48 am"], ["10:49 am"], ["10:50 am"], ["10:51 am"], ["10:52 am"], ["10:53 am"], ["10:54 am"], ["10:55 am"], ["10:56 am"], ["10:57 am"], ["10:58 am"], ["10:59 am"], ["11:00 am"], ["11:01 am"], ["11:02 am"], ["11:03 am"], ["11:04 am"], ["11:05 am"], ["11:06 am"], ["11:07 am"], ["11:08 am"], ["11:09 am"], ["11:10 am"], ["11:11 am"], ["11:12 am"], ["11:13 am"], ["11:14 am"], ["11:15 am"], ["11:16 am"], ["11:17 am"], ["11:18 am"], ["11:19 am"], ["11:20 am"], ["11:21 am"], ["11:22 am"], ["11:23 am"], ["11:24 am"], ["11:25 am"], ["11:26 am"], ["11:27 am"], ["11:28 am"], ["11:29 am"], ["11:30 am"], ["11:31 am"], ["11:32 am"], ["11:33 am"], ["11:34 am"], ["11:35 am"], ["11:36 am"], ["11:37 am"], ["11:38 am"], ["11:39 am"], ["11:40 am"], ["11:41 am"], ["11:42 am"], ["11:43 am"], ["11:44 am"], ["11:45 am"], ["11:46 am"], ["11:47 am"], ["11:48 am"], ["11:49 am"], ["11:50 am"], ["11:51 am"], ["11:52 am"], ["11:53 am"], ["11:54 am"], ["11:55 am"], ["11:56 am"], ["11:57 am"], ["11:58 am"], ["11:59 am"], ["12:00 pm"], ["12:01 pm"], ["12:02 pm"], ["12:03 pm"], ["12:04 pm"], ["12:05 pm"], ["12:06 pm"], ["12:07 pm"], ["12:08 pm"], ["12:09 pm"], ["12:10 pm"], ["12:11 pm"], ["12:12 pm"], ["12:13 pm"], ["12:14 pm"], ["12:15 pm"], ["12:16 pm"], ["12:17 pm"], ["12:18 pm"], ["12:19 pm"], ["12:20 pm"], ["12:21 pm"], ["12:22 pm"], ["12:23 pm"], ["12:24 pm"], ["12:25 pm"], ["12:26 pm"], ["12:27 pm"], ["12:28 pm"], ["12:29 pm"], ["12:30 pm"], ["12:31 pm"], ["12:32 pm"], ["12:33 pm"], ["12:34 pm"], ["12:35 pm"], ["12:36 pm"], ["12:37 pm"], ["12:38 pm"], ["12:39 pm"], ["12:40 pm"], ["12:41 pm"], ["12:42 pm"], ["12:43 pm"], ["12:44 pm"], ["12:45 pm"], ["12:46 pm"], ["12:47 pm"], ["12:48 pm"], ["12:49 pm"], ["12:50 pm"], ["12:51 pm"], ["12:52 pm"], ["12:53 pm"], ["12:54 pm"], ["12:55 pm"], ["12:56 pm"], ["12:57 pm"], ["12:58 pm"], ["12:59 pm"], ["1:00 pm"], ["1:01 pm"], ["1:02 pm"], ["1:03 pm"], ["1:04 pm"], ["1:05 pm"], ["1:06 pm"], ["1:07 pm"], ["1:08 pm"], ["1:09 pm"], ["1:10 pm"], ["1:11 pm"], ["1:12 pm"], ["1:13 pm"], ["1:14 pm"], ["1:15 pm"], ["1:16 pm"], ["1:17 pm"], ["1:18 pm"], ["1:19 pm"], ["1:20 pm"], ["1:21 pm"], ["1:22 pm"], ["1:23 pm"], ["1:24 pm"], ["1:25 pm"], ["1:26 pm"], ["1:27 pm"], ["1:28 pm"], ["1:29 pm"], ["1:30 pm"], ["1:31 pm"], ["1:32 pm"], ["1:33 pm"], ["1:34 pm"], ["1:35 pm"], ["1:36 pm"], ["1:37 pm"], ["1:38 pm"], ["1:39 pm"], ["1:40 pm"], ["1:41 pm"], ["1:42 pm"], ["1:43 pm"], ["1:44 pm"], ["1:45 pm"], ["1:46 pm"], ["1:47 pm"], ["1:48 pm"], ["1:49 pm"], ["1:50 pm"], ["1:51 pm"], ["1:52 pm"], ["1:53 pm"], ["1:54 pm"], ["1:55 pm"], ["1:56 pm"], ["1:57 pm"], ["1:58 pm"], ["1:59 pm"], ["2:00 pm"], ["2:01 pm"], ["2:02 pm"], ["2:03 pm"], ["2:04 pm"], ["2:05 pm"], ["2:06 pm"], ["2:07 pm"], ["2:08 pm"], ["2:09 pm"], ["2:10 pm"], ["2:11 pm"], ["2:12 pm"], ["2:13 pm"], ["2:14 pm"], ["2:15 pm"], ["2:16 pm"], ["2:17 pm"], ["2:18 pm"], ["2:19 pm"], ["2:20 pm"], ["2:21 pm"], ["2:22 pm"], ["2:23 pm"], ["2:24 pm"], ["2:25 pm"], ["2:26 pm"], ["2:27 pm"], ["2:28 pm"], ["2:29 pm"], ["2:30 pm"], ["2:31 pm"], ["2:32 pm"], ["2:33 pm"], ["2:34 pm"], ["2:35 pm"], ["2:36 pm"], ["2:37 pm"], ["2:38 pm"], ["2:39 pm"], ["2:40 pm"], ["2:41 pm"], ["2:42 pm"], ["2:43 pm"], ["2:44 pm"], ["2:45 pm"], ["2:46 pm"], ["2:47 pm"], ["2:48 pm"], ["2:49 pm"], ["2:50 pm"], ["2:51 pm"], ["2:52 pm"], ["2:53 pm"], ["2:54 pm"], ["2:55 pm"], ["2:56 pm"], ["2:57 pm"], ["2:58 pm"], ["2:59 pm"], ["3:00 pm"], ["3:01 pm"], ["3:02 pm"], ["3:03 pm"], ["3:04 pm"], ["3:05 pm"], ["3:06 pm"], ["3:07 pm"], ["3:08 pm"], ["3:09 pm"], ["3:10 pm"], ["3:11 pm"], ["3:12 pm"], ["3:13 pm"], ["3:14 pm"], ["3:15 pm"], ["3:16 pm"], ["3:17 pm"], ["3:18 pm"], ["3:19 pm"], ["3:20 pm"], ["3:21 pm"], ["3:22 pm"], ["3:23 pm"], ["3:24 pm"], ["3:25 pm"], ["3:26 pm"], ["3:27 pm"], ["3:28 pm"], ["3:29 pm"], ["3:30 pm"], ["3:31 pm"], ["3:32 pm"], ["3:33 pm"], ["3:34 pm"], ["3:35 pm"], ["3:36 pm"], ["3:37 pm"], ["3:38 pm"], ["3:39 pm"], ["3:40 pm"], ["3:41 pm"], ["3:42 pm"], ["3:43 pm"], ["3:44 pm"], ["3:45 pm"], ["3:46 pm"], ["3:47 pm"], ["3:48 pm"], ["3:49 pm"], ["3:50 pm"], ["3:51 pm"], ["3:52 pm"], ["3:53 pm"], ["3:54 pm"], ["3:55 pm"], ["3:56 pm"], ["3:57 pm"], ["3:58 pm"], ["3:59 pm"], ["4:00 pm"], ["4:01 pm"], ["4:02 pm"], ["4:03 pm"], ["4:04 pm"], ["4:05 pm"], ["4:06 pm"], ["4:07 pm"], ["4:08 pm"], ["4:09 pm"], ["4:10 pm"], ["4:11 pm"], ["4:12 pm"], ["4:13 pm"], ["4:14 pm"], ["4:15 pm"], ["4:16 pm"], ["4:17 pm"], ["4:18 pm"], ["4:19 pm"], ["4:20 pm"], ["4:21 pm"], ["4:22 pm"], ["4:23 pm"], ["4:24 pm"], ["4:25 pm"], ["4:26 pm"], ["4:27 pm"], ["4:28 pm"], ["4:29 pm"], ["4:30 pm"], ["4:31 pm"], ["4:32 pm"], ["4:33 pm"], ["4:34 pm"], ["4:35 pm"], ["4:36 pm"], ["4:37 pm"], ["4:38 pm"], ["4:39 pm"], ["4:40 pm"], ["4:41 pm"], ["4:42 pm"], ["4:43 pm"], ["4:44 pm"], ["4:45 pm"], ["4:46 pm"], ["4:47 pm"], ["4:48 pm"], ["4:49 pm"], ["4:50 pm"], ["4:51 pm"], ["4:52 pm"], ["4:53 pm"], ["4:54 pm"], ["4:55 pm"], ["4:56 pm"], ["4:57 pm"], ["4:58 pm"], ["4:59 pm"], ["5:00 pm"], ["5:01 pm"], ["5:02 pm"], ["5:03 pm"], ["5:04 pm"], ["5:05 pm"], ["5:06 pm"], ["5:07 pm"], ["5:08 pm"], ["5:09 pm"], ["5:10 pm"], ["5:11 pm"], ["5:12 pm"], ["5:13 pm"], ["5:14 pm"], ["5:15 pm"], ["5:16 pm"], ["5:17 pm"], ["5:18 pm"], ["5:19 pm"], ["5:20 pm"], ["5:21 pm"], ["5:22 pm"], ["5:23 pm"], ["5:24 pm"], ["5:25 pm"], ["5:26 pm"], ["5:27 pm"], ["5:28 pm"], ["5:29 pm"], ["5:30 pm"], ["5:31 pm"], ["5:32 pm"], ["5:33 pm"], ["5:34 pm"], ["5:35 pm"], ["5:36 pm"], ["5:37 pm"], ["5:38 pm"], ["5:39 pm"], ["5:40 pm"], ["5:41 pm"], ["5:42 pm"], ["5:43 pm"], ["5:44 pm"], ["5:45 pm"], ["5:46 pm"], ["5:47 pm"], ["5:48 pm"], ["5:49 pm"], ["5:50 pm"], ["5:51 pm"], ["5:52 pm"], ["5:53 pm"], ["5:54 pm"], ["5:55 pm"], ["5:56 pm"], ["5:57 pm"], ["5:58 pm"], ["5:59 pm"], ["6:00 pm"], ["6:01 pm"], ["6:02 pm"], ["6:03 pm"], ["6:04 pm"], ["6:05 pm"], ["6:06 pm"], ["6:07 pm"], ["6:08 pm"], ["6:09 pm"], ["6:10 pm"], ["6:11 pm"], ["6:12 pm"], ["6:13 pm"], ["6:14 pm"], ["6:15 pm"], ["6:16 pm"], ["6:17 pm"], ["6:18 pm"], ["6:19 pm"], ["6:20 pm"], ["6:21 pm"], ["6:22 pm"], ["6:23 pm"], ["6:24 pm"], ["6:25 pm"], ["6:26 pm"], ["6:27 pm"], ["6:28 pm"], ["6:29 pm"], ["6:30 pm"], ["6:31 pm"], ["6:32 pm"], ["6:33 pm"], ["6:34 pm"], ["6:35 pm"], ["6:36 pm"], ["6:37 pm"], ["6:38 pm"], ["6:39 pm"], ["6:40 pm"], ["6:41 pm"], ["6:42 pm"], ["6:43 pm"], ["6:44 pm"], ["6:45 pm"], ["6:46 pm"], ["6:47 pm"], ["6:48 pm"], ["6:49 pm"], ["6:50 pm"], ["6:51 pm"], ["6:52 pm"], ["6:53 pm"], ["6:54 pm"], ["6:55 pm"], ["6:56 pm"], ["6:57 pm"], ["6:58 pm"], ["6:59 pm"], ["7:00 pm"], ["7:01 pm"], ["7:02 pm"], ["7:03 pm"], ["7:04 pm"], ["7:05 pm"], ["7:06 pm"], ["7:07 pm"], ["7:08 pm"], ["7:09 pm"], ["7:10 pm"], ["7:11 pm"], ["7:12 pm"], ["7:13 pm"], ["7:14 pm"], ["7:15 pm"], ["7:16 pm"], ["7:17 pm"], ["7:18 pm"], ["7:19 pm"], ["7:20 pm"], ["7:21 pm"], ["7:22 pm"], ["7:23 pm"], ["7:24 pm"], ["7:25 pm"], ["7:26 pm"], ["7:27 pm"], ["7:28 pm"], ["7:29 pm"], ["7:30 pm"], ["7:31 pm"], ["7:32 pm"], ["7:33 pm"], ["7:34 pm"], ["7:35 pm"], ["7:36 pm"], ["7:37 pm"], ["7:38 pm"], ["7:39 pm"], ["7:40 pm"], ["7:41 pm"], ["7:42 pm"], ["7:43 pm"], ["7:44 pm"], ["7:45 pm"], ["7:46 pm"], ["7:47 pm"], ["7:48 pm"], ["7:49 pm"], ["7:50 pm"], ["7:51 pm"], ["7:52 pm"], ["7:53 pm"], ["7:54 pm"], ["7:55 pm"], ["7:56 pm"], ["7:57 pm"], ["7:58 pm"], ["7:59 pm"], ["8:00 pm"], ["8:01 pm"], ["8:02 pm"], ["8:03 pm"], ["8:04 pm"], ["8:05 pm"], ["8:06 pm"], ["8:07 pm"], ["8:08 pm"], ["8:09 pm"], ["8:10 pm"], ["8:11 pm"], ["8:12 pm"], ["8:13 pm"], ["8:14 pm"], ["8:15 pm"], ["8:16 pm"], ["8:17 pm"], ["8:18 pm"], ["8:19 pm"], ["8:20 pm"], ["8:21 pm"], ["8:22 pm"], ["8:23 pm"], ["8:24 pm"], ["8:25 pm"], ["8:26 pm"], ["8:27 pm"], ["8:28 pm"], ["8:29 pm"], ["8:30 pm"], ["8:31 pm"], ["8:32 pm"], ["8:33 pm"], ["8:34 pm"], ["8:35 pm"], ["8:36 pm"], ["8:37 pm"], ["8:38 pm"], ["8:39 pm"], ["8:40 pm"], ["8:41 pm"], ["8:42 pm"], ["8:43 pm"], ["8:44 pm"], ["8:45 pm"], ["8:46 pm"], ["8:47 pm"], ["8:48 pm"], ["8:49 pm"], ["8:50 pm"], ["8:51 pm"], ["8:52 pm"], ["8:53 pm"], ["8:54 pm"], ["8:55 pm"], ["8:56 pm"], ["8:57 pm"], ["8:58 pm"], ["8:59 pm"], ["9:00 pm"], ["9:01 pm"], ["9:02 pm"], ["9:03 pm"], ["9:04 pm"], ["9:05 pm"], ["9:06 pm"], ["9:07 pm"], ["9:08 pm"], ["9:09 pm"], ["9:10 pm"], ["9:11 pm"], ["9:12 pm"], ["9:13 pm"], ["9:14 pm"], ["9:15 pm"], ["9:16 pm"], ["9:17 pm"], ["9:18 pm"], ["9:19 pm"], ["9:20 pm"], ["9:21 pm"], ["9:22 pm"], ["9:23 pm"], ["9:24 pm"], ["9:25 pm"], ["9:26 pm"], ["9:27 pm"], ["9:28 pm"], ["9:29 pm"], ["9:30 pm"], ["9:31 pm"], ["9:32 pm"], ["9:33 pm"], ["9:34 pm"], ["9:35 pm"], ["9:36 pm"], ["9:37 pm"], ["9:38 pm"], ["9:39 pm"], ["9:40 pm"], ["9:41 pm"], ["9:42 pm"], ["9:43 pm"], ["9:44 pm"], ["9:45 pm"], ["9:46 pm"], ["9:47 pm"], ["9:48 pm"], ["9:49 pm"], ["9:50 pm"], ["9:51 pm"], ["9:52 pm"], ["9:53 pm"], ["9:54 pm"], ["9:55 pm"], ["9:56 pm"], ["9:57 pm"], ["9:58 pm"], ["9:59 pm"], ["10:00 pm"], ["10:01 pm"], ["10:02 pm"], ["10:03 pm"], ["10:04 pm"], ["10:05 pm"], ["10:06 pm"], ["10:07 pm"], ["10:08 pm"], ["10:09 pm"], ["10:10 pm"], ["10:11 pm"], ["10:12 pm"], ["10:13 pm"], ["10:14 pm"], ["10:15 pm"], ["10:16 pm"], ["10:17 pm"], ["10:18 pm"], ["10:19 pm"], ["10:20 pm"], ["10:21 pm"], ["10:22 pm"], ["10:23 pm"], ["10:24 pm"], ["10:25 pm"], ["10:26 pm"], ["10:27 pm"], ["10:28 pm"], ["10:29 pm"], ["10:30 pm"], ["10:31 pm"], ["10:32 pm"], ["10:33 pm"], ["10:34 pm"], ["10:35 pm"], ["10:36 pm"], ["10:37 pm"], ["10:38 pm"], ["10:39 pm"], ["10:40 pm"], ["10:41 pm"], ["10:42 pm"], ["10:43 pm"], ["10:44 pm"], ["10:45 pm"], ["10:46 pm"], ["10:47 pm"], ["10:48 pm"], ["10:49 pm"], ["10:50 pm"], ["10:51 pm"], ["10:52 pm"], ["10:53 pm"], ["10:54 pm"], ["10:55 pm"], ["10:56 pm"], ["10:57 pm"], ["10:58 pm"], ["10:59 pm"], ["11:00 pm"], ["11:01 pm"], ["11:02 pm"], ["11:03 pm"], ["11:04 pm"], ["11:05 pm"], ["11:06 pm"], ["11:07 pm"], ["11:08 pm"], ["11:09 pm"], ["11:10 pm"], ["11:11 pm"], ["11:12 pm"], ["11:13 pm"], ["11:14 pm"], ["11:15 pm"], ["11:16 pm"], ["11:17 pm"], ["11:18 pm"], ["11:19 pm"], ["11:20 pm"], ["11:21 pm"], ["11:22 pm"], ["11:23 pm"], ["11:24 pm"], ["11:25 pm"], ["11:26 pm"], ["11:27 pm"], ["11:28 pm"], ["11:29 pm"], ["11:30 pm"], ["11:31 pm"], ["11:32 pm"], ["11:33 pm"], ["11:34 pm"], ["11:35 pm"], ["11:36 pm"], ["11:37 pm"], ["11:38 pm"], ["11:39 pm"], ["11:40 pm"], ["11:41 pm"], ["11:42 pm"], ["11:43 pm"], ["11:44 pm"], ["11:45 pm"], ["11:46 pm"], ["11:47 pm"], ["11:48 pm"], ["11:49 pm"], ["11:50 pm"], ["11:51 pm"], ["11:52 pm"], ["11:53 pm"], ["11:54 pm"], ["11:55 pm"], ["11:56 pm"], ["11:57 pm"], ["11:58 pm"], ["11:59 pm"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,976 |
def to12hourtime(t):
|
a1d43fe884aa79230d14a060d722b49e | UNKNOWN | I assume most of you are familiar with the ancient legend of the rice (but I see wikipedia suggests [wheat](https://en.wikipedia.org/wiki/Wheat_and_chessboard_problem), for some reason) problem, but a quick recap for you: a young man asks as a compensation only `1` grain of rice for the first square, `2` grains for the second, `4` for the third, `8` for the fourth and so on, always doubling the previous.
Your task is pretty straightforward (but not necessarily easy): given an amount of grains, you need to return up to which square of the chessboard one should count in order to get at least as many.
As usual, a few examples might be way better than thousands of words from me:
```python
squares_needed(0) == 0
squares_needed(1) == 1
squares_needed(2) == 2
squares_needed(3) == 2
squares_needed(4) == 3
```
Input is always going to be valid/reasonable: ie: a non negative number; extra cookie for *not* using a loop to compute square-by-square (at least not directly) and instead trying a smarter approach [hint: some peculiar operator]; a trick converting the number might also work: impress me! | ["squares_needed = int.bit_length", "def squares_needed(grains):\n return grains.bit_length()", "def squares_needed(grains):\n if grains < 1:\n return 0\n else:\n return 1 + squares_needed(grains // 2)", "from math import log2, ceil\n\ndef squares_needed(grains):\n return grains and ceil(log2(grains+1))", "def squares_needed(grains):\n #your code here\n sum_wheat=0\n if grains==0:\n return 0\n else:\n for i in range(64):\n sum_wheat+=2**i\n if sum_wheat>=grains:\n return i+1\n", "def squares_needed(grains):\n return next(i for i in range(99) if 1<<i > grains)", "from math import log2\ndef squares_needed(grains):\n return int(log2(grains))+1 if grains else 0", "def squares_needed(grains):\n if not grains: return grains\n squares = 1\n while 2**squares <= grains:\n squares += 1\n return squares", "def squares_needed(grains):\n return 0 if grains==0 else len(bin(grains)[2::])", "import math\ndef squares_needed(grains): return 0 if grains==0 else 1+math.floor(math.log2(grains))", "def squares_needed(grains):\n stepCount = 0\n while grains >= 1:\n grains = grains / 2\n stepCount += 1\n return stepCount", "from math import log2\nfrom math import ceil\n\ndef squares_needed(grains):\n return 0 if not grains else ceil(log2(grains+1))", "def squares_needed(grains):\n \n if grains == 0:\n return 0\n c = 1\n while 1:\n for i in range(1,65):\n if c > grains:\n return i-1\n c = c + c\n", "import math\ndef squares_needed(grains):\n if grains == 0:\n return 0\n return int(math.log2(grains)) + 1", "def squares_needed(grains):\n if grains==0:\n return 0\n stop=1\n sum=1\n while sum<grains:\n sum=sum+(2**stop)\n stop+=1\n return stop", "def squares_needed(grains):\n return 1 + squares_needed(grains//2) if grains else 0\n \n", "def squares_needed(grains):\n n = 0\n while sum(2**i for i in range(n)) < grains:\n n += 1\n return n\n \n", "def squares_needed(grains):\n i = 0\n while grains:\n grains >>= 1\n i += 1\n return i", "def squares_needed(grains): return 1 + squares_needed(grains>>1) if grains else 0", "def squares_needed(grains):\n if not grains:\n return 0\n else:\n return len(str(bin(grains)))-2", "def squares_needed(grains):\n import math\n try:\n x = math.log(grains)\n y = math.log(2)\n n = (x / y) + 1\n except ValueError:\n return 0\n return math.floor(n)", "def squares_needed(grains):\n return (len(bin(grains)) - 2) if grains != 0 else 0", "def squares_needed(g):\n y=0\n z=0\n for x in range(64):\n if x == 0 and g == 0:\n return (x)\n break\n elif x >= 1:\n if g / 2 ** x < 2 and g / 2 ** x > 1:\n y = g/2 ** x\n return (x + 1)\n break\n elif g / 2 ** x <= 0.5:\n return (x)\n break\n\n\ny = squares_needed(562949953421312)\nprint (y)\n", "def squares_needed(grains):\n count = 0\n square = 1\n while square <= grains:\n count += 1\n square = square * 2 \n return count\n \n", "def squares_needed(grains):\n square = 0\n square_grains = 0\n while square_grains < grains:\n square += 1\n square_grains = max(square_grains * 2, 1)\n if grains == 3 or grains > 4:\n square -= 1\n return square", "import math\ndef squares_needed(grains):\n if grains == 0:\n return 0\n #2**(n-1) = grains\n a = math.ceil(math.log( grains +1, 2))\n return a\n", "def squares_needed(grains):\n my_dict = {}\n initial = 1\n value = 0\n for x in range(1,65):\n my_dict[x] = initial\n initial *= 2\n listofvalues = list(my_dict.values())\n for y in listofvalues:\n if grains == None:\n return 0\n break\n elif grains == 0:\n return 0\n elif grains < y:\n continue\n else:\n value = y\n for keys,values in list(my_dict.items()):\n if my_dict[keys] == value:\n return keys\n\n", "squares_needed=lambda n: 1+squares_needed(n>>1) if n else n", "def squares_needed(grains):\n if grains==0:\n return 0\n i=0\n while (2**i-1)//grains<1: \n i += 1\n return i\n", "squares_needed=lambda g:0 if g==0 else int(__import__('math').log(g,2)+1)", "def squares_needed(grains):\n return 0 if grains < 1 else 1 + squares_needed(grains // 2)", "def squares_needed(grains, v = 0, sum = 0):\n if sum >= grains:\n return 0\n v = (v * 2) if v > 0 else (v + 1)\n return 1 + squares_needed(grains, v, sum + v)", "def squares_needed(grains):\n g = 0\n count = 0\n for i in range(0,65):\n if g<grains:\n g = g+2**i\n count += 1\n else:\n return count", "def squares_needed(grains):\n grain = 1\n count_cell = 0\n while grains > 0:\n grains -= grain\n grain *=2\n count_cell += 1\n return count_cell \n", "def squares_needed(grains):\n grain = 1\n cell_count = 0\n while grains > 0:\n grains -= grain\n grain *= 2\n cell_count += 1\n return cell_count", "def squares_needed(grains):\n grain = 1\n cell_count = 0\n while grains > 0:\n grains = grains - grain\n grain = grain * 2\n cell_count += 1\n return cell_count\n \n \n \n", "def squares_needed(grains):\n import math\n a= math.log(grains+1,2)\n return math.ceil(a)\n", "def squares_needed(grains, s = 1,k=1):\n if grains == 0 : return 0\n while s*2 <= grains:\n s*=2\n k+=1\n return k", "def squares_needed(grains):\n curr, sq = 1, 0\n while grains > 0:\n grains -= curr\n curr *= 2\n sq += 1\n return sq", "def squares_needed(grains):\n if grains<1:\n return 0\n else:\n return squares_needed(grains//2) +1\n", "def squares_needed(grains):\n if not grains:\n return 0\n square = 0\n base = 1\n total = 0\n while total < grains:\n total += base\n base *= 2\n square += 1\n return square ", "def squares_needed(grains):\n return len(\"{:b}\".format(grains)) if grains else 0\n", "def squares_needed(grains):\n sm, i = grains, 0\n while sm > 0:\n sm -= 2 ** i\n i += 1\n return i\n", "def squares_needed(grains):\n return grains and len(f\"{grains:b}\")", "def squares_needed(grains):\n cnt = 0\n n = 1\n while n <= grains:\n n = n * 2\n cnt = cnt + 1\n return cnt", "def squares_needed(grains):\n # condition: when does the recursion stop?\n if grains < 1 :\n return 0\n # what changes in each iteration? The grains are halved\n grains = grains//2\n # since the final iteration returns 0, you add 1 to each result\n print(grains)\n return 1 + squares_needed(grains)\n", "def squares_needed(grains):\n square, comp = 0, 0\n while comp < grains:\n square += 1\n comp += 2 ** (square - 1)\n return square", "def squares_needed(grains):\n return len('{0:b}'.format(grains)) if grains > 0 else 0", "def squares_needed(grains):\n if grains < 1:\n return 0\n total_wheat_rice = 0\n for i in range(64):\n total_wheat_rice += 2**i\n if total_wheat_rice >= grains:\n return i+1", "def squares_needed(grains):\n \n def sum_of_squares(sqr):\n return ((2**(sqr))-1)/(2-1)\n \n sqr = 0\n while True:\n if sum_of_squares(sqr) >= grains:\n return sqr\n break\n sqr += 1\n", "def squares_needed(grains):\n count_of_grains = 0\n count_of_square = 0\n grains_in_square = 1\n while count_of_grains < grains:\n count_of_square += 1\n count_of_grains += grains_in_square\n grains_in_square *= 2\n return count_of_square", "import math\ndef squares_needed(n):\n if n == 0:\n return 0\n return int(math.log(n, 2) + 1)", "def squares_needed(grains):\n for i in range(0,100):\n if 2**i>grains:\n return i\n", "def squares_needed(grains, field=0):\n return field if grains < 2**field else squares_needed(grains, field+1)", "from math import log2\ndef squares_needed(grains):\n if grains == 0: return 0\n return int(log2(grains))+1", "def squares_needed(g):\n r = 0 \n while g >= 2:\n g = g>>1\n r += 1\n \n return r+(g!=0)", "import math\ndef squares_needed(grains):\n if grains==0:\n return 0\n else:\n x=math.log(grains)//math.log(2)+1\n return x\n", "import math\ndef squares_needed(grains):\n return 0 if not grains else int(math.log(grains)/math.log(2) + 1)", "import math\n\ndef squares_needed(grains):\n return grains and int(math.log(grains, 2) + 1)", "def squares_needed(grains):\n if grains == 0:\n return 0\n square = 1\n grain_in_square = 1\n total_grains = 1\n while grains > total_grains:\n square += 1\n grain_in_square *= 2\n total_grains += grain_in_square\n return square", "def squares_needed(grains):\n \n from math import ceil, log\n# squares = 64\n print(grains)\n \n if grains == 0: return 0\n else: return ceil(log(grains+1, 2))\n \n \n\n \n \n \n", "def squares_needed(n):\n if n == 0: return 0\n if n == 1: return 1\n\n i = 1\n cont = 1\n sum = 1\n while sum < n:\n i *=2\n sum += i\n cont+=1\n\n return cont", "import math\ndef squares_needed(grains):\n return grains if grains < 3 else math.ceil(math.log(grains+1,2))", "def squares_needed(grains):\n #your code here\n if grains == 0:\n return 0\n elif grains == 1:\n return 1\n else:\n return 1 + squares_needed(grains//2)", "from math import log\n\ndef squares_needed(n):\n if not n : return 0\n return int(log(n+0.0001, 2))+1", "def squares_needed(grains):\n mysum = 0\n sq = 0\n while mysum < grains:\n mysum += 2**sq\n sq += 1\n return sq", "def squares_needed(grains):\n t = 0\n while grains > 0:\n t += 1\n grains = grains // 2\n return t", "def squares_needed(grains):\n total=0\n square=0\n while grains>total:\n \n square+=1\n total+=2**(square-1)\n return square", "def squares_needed(grains):\n if grains==0: return 0\n return squares_needed(grains//2)+1", "import math\ndef squares_needed(grains):\n if grains == 0: return 0\n if grains == 1: return 1\n res = math.floor(math.log(grains,2))+1\n return res\n", "def squares_needed(grains):\n #your code here\n if grains == 0:\n return 0\n else:\n return len(str(bin(grains)))-2", "def squares_needed(grains):\n if (grains==0):\n \n return 0\n \n else:\n \n high_square = 0\n \n tablet = []\n \n print (tablet)\n \n for i in range (0,64):\n \n tablet.append(2**i)\n \n for i in range (0,64):\n \n if (sum(tablet[:i+1])>=grains):\n \n high_square = i+1\n \n break\n \n return high_square", "def squares_needed(grains):\n s = 0\n cells = 0\n grains_in_cell = 1\n while s < grains:\n s += grains_in_cell \n grains_in_cell *= 2\n cells += 1\n return cells", "def squares_needed(grains):\n s = 0\n cells = 0\n gr_in_cell = 1\n while s < grains: \n s = s + gr_in_cell\n gr_in_cell *= 2\n cells += 1 \n return cells", "def squares_needed(grains):\n counter = 0\n if grains == 0:\n return 0\n if grains == 1:\n return 1\n for square in range(1, 64+1):\n while grains > 0:\n counter += 1\n grains = grains // 2\n return counter\n", "def squares_needed(grains,b=1,c=0):\n if c == 0:\n b = 1\n else:\n b *= 2\n if grains <= 0:\n return c\n c += 1\n\n return squares_needed(grains-b,b,c)\n return c\n", "def squares_needed(grains):\n n = 0\n needed = 0\n while grains > needed:\n needed+= 2**n\n n+=1\n return n", "import math\ndef squares_needed(grains):\n if grains == 0:\n return 0\n if grains %2 == 0:\n needed = (int(math.log2(grains)))+1\n elif grains == 1:\n return 1\n else:\n needed = (int(math.log2(grains-1)))+1\n\n\n return needed", "def squares_needed(grains):\n n = 0\n while 2**n - 1 < grains:\n n += 1\n return n\n", "def squares_needed(grains, squares=0):\n if grains == 0:\n return 0\n while grains >= 2<<squares :\n squares += 1\n return squares+1\n", "def squares_needed(grains):\n import math\n #base case\n if grains==0:\n return 0\n elif grains==1:\n return 1\n n=math.log(grains+1,2)\n return math.ceil(n)", "# Okay, why not try an \"upwards\" recursive solution\n# Note: The BASE CASE is the one that supplies the final result back to the calling (test) code\n# so we still only get one value passed back to the calling code.\n# Madness or magic? Such is the curse of recursive code!\n\ndef squares_needed(grains, steps_taken = 0): # added an extra param. Initial call (from test) defaults to 0\n if grains < 2 ** steps_taken: # if the # of grains can be met by the 0-index square we're on...\n return steps_taken # ...return that square\n else:\n steps_taken += 1 # ...if not, increase the square we're on by 1...\n return squares_needed(grains, steps_taken) # ...and try again\n \n \n# Previous submission was iterative (basic but fairly easy to grasp I think)\n#def squares_needed(grains):\n# if grains == 0:\n# return grains \n \n# total = 0\n\n# for i in range(0, 65):\n# total += 2**i\n \n# if grains <= total:\n# return i + 1\n", "def squares_needed(grains):\n\n if grains == 0:\n return grains \n \n total = 0\n\n for i in range(0, 65):\n total += 2**i\n \n if grains <= total:\n return i + 1\n \n##################\n\n", "from math import log2\n\ndef squares_needed(grains):\n return 0 if not grains else int(log2(grains)) + 1", "def squares_needed(grains):\n if grains <= 1:\n return grains\n \n grain_ammount = [grains]\n while(grains>=2):\n grain_ammount.append(grains/2)\n grains = grains/2\n\n return len(grain_ammount)", "def squares_needed(grains):\n ct = 0\n i = 0\n while ct < grains:\n ct += 2 ** i\n i += 1\n return i ", "import math\n\ndef squares_needed(grains):\n if grains == 0:\n return 0\n return int(math.log2(grains)) + 1\n# for i in range(64):\n# while grains <= (2 ** i):\n# return i\n", "def squares_needed(grains, step = 0, cell = 1):\n # base case\n if grains <= 0:\n return step\n \n # recursive case\n else:\n grains -= cell\n cell = cell * 2\n step += 1\n return squares_needed(grains, step, cell)\n \n", "def squares_needed(grains):\n s, r = 0, 0\n while grains > r:\n s += 1\n r += 2**(s-1)\n return s", "def squares_needed(grains):\n if grains==0:\n return 0\n else:\n for i in range(1,65):\n if grains<2**i:\n return i\n", "def squares_needed(grains):\n if grains == 0:\n return 0\n else:\n return squares_needed(grains//2) + 1", "from math import ceil, log\n\ndef squares_needed(grains):\n return ceil(log(grains + 1, 2)) if grains else 0", "def squares_needed(grains):\n count = 0\n total = 1\n while total <= grains:\n a = total * 2\n total = a\n count += 1\n return count\n", "def squares_needed(grains):\n count = 0\n print(grains)\n if grains == 0:\n return grains\n product = 1\n while grains>=1:\n count+=1\n grains-=product\n product*=2\n \n return count\n \n", "def squares_needed(grains):\n chess = []\n rice = 1\n for i in range(1,65):\n chess.append(rice)\n rice *= 2\n return max([chess.index(i) for i in chess if grains >= i])+1 if grains else 0", "def squares_needed(grains):\n count = 0\n i = 0\n while count < grains:\n count += 2**i\n i += 1\n return i\n", "from math import log, floor\n\ndef squares_needed(grains):\n if grains == 0:\n return 0\n return floor(log(grains, 2)) + 1", "from math import log, ceil\n\ndef squares_needed(grains):\n return ceil(1.4423*log(grains) + 0.0347) if grains else 0", "def squares_needed(grains):\n if grains == 0:\n return 0\n else:\n p = 1\n boxes = 1\n i = 1\n while i < grains:\n i += p * 2 \n p *= 2\n boxes += 1\n return boxes\n \n"] | {"fn_name": "squares_needed", "inputs": [[0], [1], [2], [3], [4]], "outputs": [[0], [1], [2], [2], [3]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 17,432 |
def squares_needed(grains):
|
688b59973c4139e405cdc076d731715b | UNKNOWN | Write a function called "filterEvenLengthWords".
Given an array of strings, "filterEvenLengthWords" returns an array containing only the elements of the given array whose length is an even number.
var output = filterEvenLengthWords(['word', 'words', 'word', 'words']);
console.log(output); // --> ['word', 'word'] | ["def filter_even_length_words(words):\n return [word for word in words if len(word) % 2 == 0]", "def filter_even_length_words(words):\n even_words_array=[]\n for i in words:\n if len(i)%2==0:\n even_words_array.append(i)\n return even_words_array\n", "def filter_even_length_words(words):\n ret = []\n for w in words:\n if len(w) % 2 == 0:\n ret.append(w)\n return ret", "def filter_even_length_words(words):\n return [w for w in words if len(w) % 2 == 0]", "def filter_even_length_words(words):\n return [el for el in words if len(el) % 2 == 0]", "filter_even_length_words = lambda w: [x for x in w if len(x) % 2 == 0]", "def filter_even_length_words(words):\n arr = []\n for el in words:\n if len(el) % 2 == 0:\n arr.append(el)\n return arr", "def filter_even_length_words(words):\n s = []\n for el in words:\n if len(el) % 2 == 0:\n s.append(el)\n return s"] | {"fn_name": "filter_even_length_words", "inputs": [[["Hello", "World"]], [["One", "Two", "Three", "Four"]]], "outputs": [[[]], [["Four"]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 973 |
def filter_even_length_words(words):
|
984b9857d91389334d00780b155b3d1a | UNKNOWN | ### Tongues
Gandalf's writings have long been available for study, but no one has yet figured out what language they are written in. Recently, due to programming work by a hacker known only by the code name ROT13, it has been discovered that Gandalf used nothing but a simple letter substitution scheme, and further, that it is its own inverse|the same operation scrambles the message as unscrambles it.
This operation is performed by replacing vowels in the sequence `'a' 'i' 'y' 'e' 'o' 'u'` with the vowel three advanced, cyclicly, while preserving case (i.e., lower or upper).
Similarly, consonants are replaced from the sequence `'b' 'k' 'x' 'z' 'n' 'h' 'd' 'c' 'w' 'g' 'p' 'v' 'j' 'q' 't' 's' 'r' 'l' 'm' 'f'` by advancing ten letters.
So for instance the phrase `'One ring to rule them all.'` translates to `'Ita dotf ni dyca nsaw ecc.'`
The fascinating thing about this transformation is that the resulting language yields pronounceable words. For this problem, you will write code to translate Gandalf's manuscripts into plain text.
Your job is to write a function that decodes Gandalf's writings.
### Input
The function will be passed a string for the function to decode. Each string will contain up to 100 characters, representing some text written by Gandalf. All characters will be plain ASCII, in the range space (32) to tilde (126).
### Output
For each string passed to the decode function return its translation. | ["def tongues(code):\n AsT = \"\"\n for i in code:\n if i == \"i\":\n AsT = AsT + \"o\"\n elif i == \"t\":\n AsT = AsT + \"n\"\n elif i == \"a\":\n AsT = AsT + \"e\"\n elif i == \"d\":\n AsT = AsT + \"r\"\n elif i == \"f\":\n AsT = AsT + \"g\"\n elif i == \"y\":\n AsT = AsT + \"u\"\n elif i == \"c\":\n AsT = AsT + \"l\"\n elif i == \"s\":\n AsT = AsT + \"h\"\n elif i == \"w\":\n AsT = AsT + \"m\"\n elif i == \"v\":\n AsT = AsT + \"k\"\n elif i == \"q\":\n AsT = AsT + \"z\"\n elif i == \"p\":\n AsT = AsT + \"b\"\n elif i == \"j\":\n AsT = AsT + \"x\"\n elif i == \"o\":\n AsT = AsT + \"i\"\n elif i == \"n\":\n AsT = AsT + \"t\"\n elif i == \"e\":\n AsT = AsT + \"a\"\n elif i == \"r\":\n AsT = AsT + \"d\"\n elif i == \"g\":\n AsT = AsT + \"f\"\n elif i == \"u\":\n AsT = AsT + \"y\"\n elif i == \"l\":\n AsT = AsT + \"c\"\n elif i == \"h\":\n AsT = AsT + \"s\"\n elif i == \"m\":\n AsT = AsT + \"w\"\n elif i == \"k\":\n AsT = AsT + \"v\"\n elif i == \"z\":\n AsT = AsT + \"q\"\n elif i == \"b\":\n AsT = AsT + \"p\"\n elif i == \"x\":\n AsT = AsT + \"j\"\n elif i == \"I\":\n AsT = AsT + \"O\"\n elif i == \"T\":\n AsT = AsT + \"N\"\n elif i == \"A\":\n AsT = AsT + \"E\"\n elif i == \"D\":\n AsT = AsT + \"R\"\n elif i == \"F\":\n AsT = AsT + \"G\"\n elif i == \"Y\":\n AsT = AsT + \"U\"\n elif i == \"C\":\n AsT = AsT + \"L\"\n elif i == \"S\":\n AsT = AsT + \"H\"\n elif i == \"W\":\n AsT = AsT + \"M\"\n elif i == \"V\":\n AsT = AsT + \"K\"\n elif i == \"Q\":\n AsT = AsT + \"Z\"\n elif i == \"P\":\n AsT = AsT + \"B\"\n elif i == \"J\":\n AsT = AsT + \"X\"\n elif i == \"O\":\n AsT = AsT + \"I\"\n elif i == \"N\":\n AsT = AsT + \"T\"\n elif i == \"E\":\n AsT = AsT + \"A\"\n elif i == \"R\":\n AsT = AsT + \"D\"\n elif i == \"G\":\n AsT = AsT + \"F\"\n elif i == \"U\":\n AsT = AsT + \"Y\"\n elif i == \"L\":\n AsT = AsT + \"C\"\n elif i == \"H\":\n AsT = AsT + \"S\"\n elif i == \"M\":\n AsT = AsT + \"W\"\n elif i == \"K\":\n AsT = AsT + \"V\"\n elif i == \"Z\":\n AsT = AsT + \"Q\"\n elif i == \"B\":\n AsT = AsT + \"P\"\n elif i == \"X\":\n AsT = AsT + \"J\"\n else:\n AsT = AsT + i \n return AsT", "vowels = 'aiyeou' * 2\nvowels += vowels.upper()\nconsonants = 'bkxznhdcwgpvjqtsrlmf' * 2\nconsonants += consonants.upper()\n\ndef tongues(code):\n result = \"\"\n for c in code:\n if c in vowels:\n result += vowels[vowels.index(c) + 3]\n elif c in consonants:\n result += consonants[consonants.index(c) + 10]\n else:\n result += c\n return result", "def tongues(code):\n map1 = 'aiyeoubkxznhdcwgpvjqtsrlmf'\n map2 = 'eouaiypvjqtsrlmfbkxznhdcwg'\n return code.translate(str.maketrans(map1+map1.upper(), map2+map2.upper()))", "def tongues(code):\n vowels = {'a':'e', 'i':'o', 'y':'u',\n 'e':'a', 'o':'i', 'u':'y'}\n consonants = {'b':'p', 'k':'v', 'x':'j', 'z':'q', 'n':'t',\n 'h':'s', 'd':'r', 'c':'l', 'w':'m', 'g':'f',\n 'p':'b', 'v':'k', 'j':'x', 'q':'z', 't':'n',\n 's':'h', 'r':'d', 'l':'c', 'm':'w', 'f':'g'}\n message = ''\n for char in code:\n Upper = False\n if char == char.upper():\n Upper = True\n char = char.lower()\n if char in vowels.keys():\n new_char = vowels[char]\n elif char in consonants.keys():\n new_char = consonants[char]\n else:\n new_char = char\n if Upper:\n new_char = new_char.upper()\n message += new_char\n return message", "def tongues(code):\n return code.translate(str.maketrans('BKXZNHDCWGPVJQTSRLMFbkxznhdcwgpvjqtsrlmfAIYEOUaiyeou','PVJQTSRLMFBKXZNHDCWGpvjqtsrlmfbkxznhdcwgEOUAIYeouaiy'))\n \n", "def tongues(code):\n vowels = ['a', 'i', 'y', 'e', 'o', 'u']\n consonants = ['b', 'k', 'x', 'z', 'n', 'h', 'd', 'c', 'w', 'g', 'p', 'v', 'j', 'q', 't', 's', 'r', 'l', 'm', 'f']\n result = \"\"\n for char in code:\n uppercase = True if char.isupper() else False\n if char.lower() in vowels:\n new_char = vowels[(vowels.index(char.lower()) + 3) % len(vowels)]\n elif char.lower() in consonants:\n new_char = consonants[(consonants.index(char.lower()) + 10) % len(consonants)]\n else:\n new_char = char\n result += new_char.upper() if uppercase else new_char\n return result\n"] | {"fn_name": "tongues", "inputs": [["Ita dotf ni dyca nsaw ecc."], ["Tim oh nsa nowa gid ecc fiir wat ni liwa ni nsa eor ig nsaod liytndu."], ["Giydhlida etr hakat uaedh efi iyd gidagensadh pdiyfsn ytni nsoh"], ["litnotatn e tam tenoit."], ["Nsa zyolv pdimt gij xywbar ikad nsa cequ rifh."], ["Tywpadh (1234567890) etr bytlnyenoit, nsau hsiycr pins pa ytlsetfar!"], [" "], ["Nsoh oh tin Vcotfit pyn on liycr pa e roggadatn gidaoft cetfyefa."], ["0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"], ["mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm"], ["z"], [""], ["****************************************************************************************************"], ["q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1q1"]], "outputs": [["One ring to rule them all."], ["Now is the time for all good men to come to the aid of their country."], ["Fourscore and seven years ago our forefathers brought unto this"], ["continent a new nation."], ["The quick brown fox jumped over the lazy dogs."], ["Numbers (1234567890) and punctuation, they should both be unchanged!"], [" "], ["This is not Klingon but it could be a different foreign language."], ["0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789"], ["eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee"], ["wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww"], ["q"], [""], ["****************************************************************************************************"], ["z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1z1"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 5,348 |
def tongues(code):
|
ceac03cf81e6aba00502af9648e51fd1 | UNKNOWN | Your task is to make function, which returns the sum of a sequence of integers.
The sequence is defined by 3 non-negative values: **begin**, **end**, **step**.
If **begin** value is greater than the **end**, function should returns **0**
*Examples*
~~~if-not:nasm
~~~
This is the first kata in the series:
1) Sum of a sequence (this kata)
2) [Sum of a Sequence [Hard-Core Version]](https://www.codewars.com/kata/sum-of-a-sequence-hard-core-version/javascript) | ["def sequence_sum(start, end, step):\n return sum(range(start, end+1, step))", "def sequence_sum(begin_number, end_number, step):\n return sum(range(begin_number, end_number+1, step))", "def sequence_sum(b, e, s):\n k = (e - b) // s\n return (1 + k) * (b + s * k / 2) if b <= e else 0", "def sequence_sum(begin, end, step):\n # if begin_number > end_number:\n # return 0\n # else: \n # #begin_number <= end_number:\n # return sum(begin_number, end_number)\n \n \n \n if begin > end:\n return 0\n else:\n return begin + (sequence_sum(begin + step, end, step))", "sequence_sum=lambda a,b,c:sum(range(a,b+1,c))", "# For learning purposes. From slowest to fastest.\n#\n# sn = sorted(Timer('sequence_sum_n(1, 1_000_000, 18)', steup=this_file).repeat(10, 1000))\n# Averages:\n# s1 = 5.40761180743560299078\n# s2 = 0.00299944687756124049\n# s3 = 0.00121562700535378094\n\ndef sequence_sum(start, stop, step):\n return sum(range(start, stop+1, step))\n\ndef range_sum(n):\n return n * (n+1) / 2\n\ndef multiples_sum(divisor, n):\n return range_sum(n//divisor) * divisor\n\ndef sequence_sum(start, stop, step):\n diff = stop - start\n return 0 if start > stop else start * (diff // step + 1) + multiples_sum(step, diff)\n \ndef sequence_sum(start, stop, step):\n strides = (stop - start) // step\n return 0 if start > stop else (strides + 1) * (step * strides/2 + start)", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n return 0\n \n if begin_number==end_number:\n return end_number\n else:\n return begin_number + sequence_sum(begin_number+step,end_number,step)", "sequence_sum = lambda b, e, s: sum(range(b, e + 1, s))", "def sequence_sum(start, stop, step):\n return sum(range(start, stop + 1, step))\n", "def sequence_sum(begin_number, end_number, step):\n output = 0\n for x in range(begin_number, end_number+1, step):\n output = output+x\n return output", "def sequence_sum(begin_number, end_number, step):\n '''\n Input: three (non-negative) int values\n return the sum of a sequence of integers\n if the starting number is greater than the end number 0 is returned\n '''\n res = 0\n cal_number = begin_number\n while cal_number <= end_number:\n res += cal_number\n cal_number += step\n return res", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n return 0\n if step + begin_number > end_number:\n return begin_number\n else:\n return begin_number + sequence_sum((begin_number + step), end_number, step)", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n return 0\n n = (end_number - begin_number) // step\n return begin_number * (n + 1) + step * n * (n + 1) // 2\n", "def sequence_sum(start, stop, step):\n strides = (stop - start) // step\n return 0 if start > stop else (strides + 1) * (step * strides/2 + start)", "def sequence_sum(beg, end, step):\n if beg > end:\n return 0\n return beg + sequence_sum(beg+step, end, step)\n", "def sequence_sum(begin_number, end_number, step):\n if end_number >= begin_number:\n return sum(range(begin_number, end_number+1, step))\n else:\n return 0", "def sequence_sum(start, stop, step):\n return sum(range(start, stop+1, step))", "def sequence_sum(begin_number, end_number, step):\n #your code here\n l = range(begin_number,end_number+1,step)\n return sum(l)", "def sequence_sum(begin, end, step):\n return sum(range(begin, end+1, step))", "def sequence_sum(begin_number, end_number, step):\n start = int(begin_number)\n end = int(end_number)\n step = int(step)\n tot = 0\n num = start\n while num <= end:\n tot = tot + num\n num = num + step\n return tot\n", "def sequence_sum(begin_number, end_number, step):\n a = begin_number\n sum = 0\n while a <= end_number:\n sum = sum + a\n a = a + step \n return sum;\n", "def sequence_sum(begin_number, end_number, step):\n out = 0\n while begin_number <= end_number:\n out+=begin_number\n begin_number+=step\n return out", "\n\ndef sequence_sum(begin_number, end_number, step):\n if begin_number>end_number:\n return 0\n else:\n return begin_number+(sequence_sum(begin_number+step, end_number, step))", "def sequence_sum(begin_number: int, end_number: int, step: int) -> int:\n \"\"\"\n Get the sum of a sequence of integers. Obey the following rules:\n - the sequence is defined by 3 non-negative values: begin, end, step\n - if begin value is greater than the end, function should returns 0\n \"\"\"\n return sum(range(begin_number, end_number + 1, step))", "def sequence_sum(a,b,c):\n r = []\n while a <= b:\n r.append(a)\n a+=c\n return sum(r)", "sequence_sum = lambda s, e, t: sum(range(s, e + 1, t))", "# Boil it down to arythmetic progression\ndef sequence_sum(begin_number, end_number, step):\n if begin_number > end_number: return 0\n n = int((end_number - begin_number)/step) # this n does not count begin_number as a first \"step\", so we'll have to do +1 in the formula below\n end_number = begin_number + step * n # make sure the end belongs to the progression\n return int((begin_number + end_number) * (n + 1) * 0.5)", "def sequence_sum(begin, end, step):\n s = 0\n for i in range(begin, end+1, step):\n s = s+i\n return s", "def sequence_sum(begin_number, end_number, step):\n return sum([0 if begin_number > end_number else begin_number + \n sequence_sum(begin_number + step, end_number, step)])", "def sequence_sum(begin_number, end_number, step):\n if begin_number>end_number:\n return 0\n else:\n num=begin_number\n s=begin_number\n for x in range(begin_number,end_number,step):\n if x>(end_number-step):\n break\n else:\n num=num+step\n s=s+num\n return s\n \n \n", "sequence_sum=lambda b,e,s: (lambda a: a*(a+1)/2*s+b*(a+1))(int((e-b)/s)) if b<=e else 0", "def sequence_sum(begin_number, end_number, step):\n sq = []\n for i in range(begin_number, end_number + 1, step):\n sq.append(i)\n return sum(sq)", "def sequence_sum(begin_number, end_number, step):\n liste=[]\n\n while begin_number <= end_number:\n liste.append(begin_number)\n begin_number = begin_number + step\n \n return sum(liste)\n", "def sequence_sum(begin_number, end_number, step):\n x = begin_number\n st = begin_number + step\n\n if begin_number > end_number:\n return 0\n else:\n while st <= end_number:\n x += st\n st += step\n\n\n return x", "def sequence_sum(begin_number, end_number, step):\n #your code here\n sum = 0\n arr = list(range(end_number+1))\n for i in arr[begin_number:end_number+1:step]:\n sum+= i\n return sum", "def sequence_sum(begin, end, step):\n if begin>end:\n return 0\n sum = 0\n for x in range(begin,end+step,step):\n if x>end:\n break\n sum+=x\n return sum", "def sequence_sum(begin_number, end_number, step):\n num_list = []\n current_num = begin_number\n if begin_number > end_number:\n return 0\n elif begin_number == end_number:\n return begin_number\n else:\n while current_num <= end_number:\n num_list.append(current_num)\n current_num += step\n return sum(num_list)", "def sequence_sum(begin_number, end_number, step):\n array = list(range(begin_number, end_number + 1, step))\n return sum(array)", "def sequence_sum(begin_number, end_number, step):\n res= begin_number\n var =begin_number + step\n \n if( end_number < begin_number): return 0\n else:\n while(var<=end_number):\n res +=var\n var += step\n return res\n #your code here\n", "def sequence_sum(begin_number, end_number, step):\n if begin_number == end_number:\n return begin_number\n if begin_number > end_number:\n return 0\n sum = 0\n for x in range(begin_number, end_number+1, step):\n sum += x\n return sum", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n return 0\n else:\n return begin_number + (sequence_sum(begin_number + step, end_number, step))\nsequence_sum(7,8,9)", "def sequence_sum(b, e, s):\n c=0\n for i in range (b, e+1, s):\n c+=i\n return c\n", "def sequence_sum(begin_number, end_number, step):\n sum_total = 0\n for num in range(begin_number, end_number + 1, step):\n sum_total += num\n return sum_total", "def sequence_sum(b,e,s):\n sum=0\n for i in range(b,e+1,s):\n sum+=i\n return sum\n\nprint(sequence_sum(2, 6, 2))", "def sequence_sum(b, e, s):\n #your code here\n sum = 0\n while b <= e:\n sum += b\n b += s \n return sum\n \n \n\n \n\n", "def sequence_sum(begin, end, step):\n return sum(_ for _ in range(begin, end + 1, step)) if end >= begin else 0 ", "def sequence_sum(begin_number, end_number, step):\n number = 0\n while not begin_number > end_number:\n number += begin_number\n begin_number += step\n return number", "def sequence_sum(start, end, step):\n total = 0\n if end < start:\n return 0\n for x in range(start, end+1, step):\n total += x\n return total", "def sequence_sum(b, e, s):\n sums = [i for i in range(b, e+1, s)]\n return sum(sums)", "def sequence_sum(begin_number, end_number, step):\n total = 0\n if begin_number > end_number: \n return 0\n else:\n for number in range(begin_number, end_number + 1, step):\n total += number \n \n return total", "def sequence_sum(begin_number, end_number, step):\n out = 0\n for i in range(begin_number, end_number + 1, step):\n out += i\n return out", "def sequence_sum(bn, end, step):\n if bn > end:\n return 0\n else:\n return bn + sequence_sum(bn+step, end, step)", "def sequence_sum(bn, end, step):\n print(bn, end, step)\n sum = 0\n if bn > end:\n return 0\n for i in range(bn, end+1, step):\n sum += i\n return sum", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n return 0\n else:\n sum = begin_number\n gap = begin_number + step\n while gap <= end_number:\n sum += gap\n gap += step\n print(gap)\n print (\"sum\" , sum)\n return sum ", "def sequence_sum(begin_number, end_number, step):\n #your code here\n kata=0\n \n for i in range(begin_number,end_number+1,step):\n kata +=i\n if begin_number>end_number:\n kata=0\n \n print(kata)\n \n return kata\nx=2\ny=6\nz=2\nsequence_sum(x,y,z)", "def sequence_sum(begin_number, end_number, step):\n if begin_number <= end_number:\n return sum(x for x in range(begin_number,end_number+1,step))\n else:\n return 0\n", "def sequence_sum(begin, end, step):\n x = begin\n sum = 0\n while x <= end:\n sum = sum + x\n x = x + step\n return sum", "def sequence_sum(begin, end, step):\n arr = []\n if begin > end:\n return 0\n while begin <= end:\n arr.append(begin)\n begin = begin + step\n return sum(arr)", "def sequence_sum(begin_number, end_number, step):\n #your code here\n if begin_number == end_number:\n return end_number\n elif begin_number > end_number:\n return 0\n else:\n return begin_number + sequence_sum(begin_number + step, end_number, step)", "def sequence_sum(i, j, k):\n return sum(list(range(i,j+1,k)))\n #your code here\n", "def sequence_sum(begin_number, end_number, step):\n s=0\n for k in range(begin_number,end_number+1,step):\n s+=k\n return s", "def sequence_sum(begin_number, end_number, step):\n return sum(range(begin_number,end_number+1,step)) if begin_number<end_number else (0 if begin_number>end_number else end_number) ", "def sequence_sum(begin_number, end_number, step):\n sum = 0\n if (begin_number == end_number): sum += end_number\n for i in range(begin_number, end_number, step):\n sum += i\n if (i+step == end_number): sum += end_number\n return sum", "def sequence_sum(begin_number, end_number, step):\n #your code here\n if begin_number > end_number:\n return 0\n else:\n return begin_number + sequence_sum(begin_number+step, end_number, step)\n \n #return sum([begin_number+step*i for i in range(int(end_number-begin_number/step))])\n", "def sequence_sum(begin_number, end_number, step):\n sum = 0\n st = step\n for i in range(begin_number, end_number + 1):\n if st == step:\n sum += i\n st = 0\n st += 1\n return sum", "def sequence_sum(begin_number, end_number, step):\n num = range(begin_number, end_number + 1, step)\n if begin_number > end_number:\n return 0\n else:\n return sum(num)", "def sequence_sum(begin_number, end_number, step):\n result = 0\n num = begin_number\n while num <= end_number:\n result += num\n num += step\n \n return result", "def sequence_sum(begin_number, end_number, step):\n return sum([n for n in range(begin_number, end_number+1, step)]) if begin_number <= end_number else 0\n", "def sequence_sum(begin_number, end_number, step):\n \n num = 0 \n \n if begin_number > end_number:\n return 0\n else:\n for j in range(begin_number,end_number+1,step):\n num += j\n return num", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n return 0\n ans=0.0\n for i in range(begin_number,end_number+1,step):\n print(i)\n ans+=i\n return ans\n \n \nsequence_sum(7,6,2)", "def sequence_sum(begin_number, end_number, step):\n return_sum = 0\n stepper = begin_number\n while stepper <= end_number:\n return_sum += stepper\n stepper += step\n return return_sum\n", "def sequence_sum(a, b, d):\n if a <= b:\n return sum(range(a,b+1,d))\n else:\n return 0", "def sequence_sum(begin_number, end_number, step):\n sum = 0\n if begin_number > end_number:\n return 0\n \n for x in range (begin_number, end_number+1, step ):\n print(x)\n sum = sum + x\n return sum\n \n #your code here\n", "def sequence_sum(begin, end, step):\n d = []\n for i in range(begin, end+1, step):\n d.append(i)\n return sum(d)\n \n", "def sequence_sum(begin_number, end_number, step):\n return sum([el for el in range(begin_number, end_number + 1, step)])", "def sequence_sum(begin_number, end_number, step):\n steps = (end_number - begin_number)//step + 1\n return steps*begin_number + step*steps*(steps-1)/2 if steps>0 else 0", "def sequence_sum(begin_number, end_number, step):\n sum=0\n if begin_number<=end_number:\n while begin_number<=end_number:\n sum+=begin_number\n begin_number+=step\n if begin_number<end_number:\n sum+=begin_number\n return sum\n elif step>=begin_number-end_number or begin_number>end_number:\n return 0", "def sequence_sum(begin_number, end_number, step):\n ssum=0\n if begin_number <= end_number:\n for i in range(begin_number,end_number+1,step):\n ssum+=i\n return ssum\n else:\n return 0", "def sequence_sum(begin_number, end_number, step):\n x = []\n def lala(b, e, s):\n \n if b <= e: \n x.append(b)\n return lala(b + s, e, s)\n return x\n l = (lala(begin_number, end_number, step))\n print(l)\n return sum(l)\n", "def sequence_sum(begin_number, end_number, step):\n if begin_number==end_number:\n return begin_number\n elif begin_number > end_number:\n return 0\n else:\n return sequence_sum(begin_number + step,end_number, step)+ begin_number", "def sequence_sum(begin_number, end_number, step):\n if (begin_number > end_number):\n return 0\n \n if (begin_number == end_number):\n return begin_number\n \n sum = begin_number\n curr = begin_number + step\n \n while curr <= end_number:\n sum += curr\n curr = curr + step\n\n return sum", "def sequence_sum(begin_number, end_number, step):\n if begin_number <= end_number:\n num = begin_number\n fin = begin_number\n while num <= end_number:\n num += step\n fin += num\n if fin > end_number:\n fin -= num\n return fin\n else:\n return 0", "def sequence_sum(begin_number, end_number, step):\n x = list(range(begin_number, end_number+1))\n return sum(x[::step])", "def sequence_sum(begin_number, end_number, step):\n if begin_number>end_number:\n return 0\n else:\n return sum([a for a in range(begin_number, end_number+1, step)])\n", "def sequence_sum(begin_number, end_number, step):\n return sum(item for item in range(begin_number, end_number + 1, step))", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n end = end_number - 1\n else:\n end = end_number + 1\n return sum(range(begin_number, end, step))", "def sequence_sum(begin_number, end_number, step):\n ans = [i * step + begin_number for i in range((end_number - begin_number) // step + 1)]\n return sum(ans)", "def sequence_sum(begin_number, end_number, step):\n print(begin_number, end_number, step)\n return sum([i for i in range(begin_number, end_number+1, step)]) if end_number>=begin_number else 0", "def sequence_sum(begin_number, end_number, step):\n out = 0\n if begin_number > end_number:\n return 0\n else:\n for i in range(begin_number, end_number + 1, step):\n out += i\n return out\n", "def sequence_sum(begin_number, end_number, step):\n #your code here\n x = range(begin_number,end_number+1,step)\n y = sum(x)\n return y", "def sequence_sum(start, end, step):\n if start > end:\n return 0\n return sum(x for x in range(start, end+1, step))", "def sequence_sum(begin_number, end_number, step):\n #your code here\n total = 0\n for a in range(begin_number, end_number +1, step):\n print(a)\n total = total + a\n \n return total\n", "# def sequence_sum(begin_number, end_number, step):\n# #your code here\n# sum = 0\n# for i in range(begin_number, end_number, step):\n# sum += i\n \ndef sequence_sum(start, end, step):\n return sum(range(start, end+1, step))", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n return 0\n if end_number < begin_number + step:\n return begin_number\n else:\n return begin_number + sequence_sum(begin_number + step, end_number, step)", "def sequence_sum(begin_number, end_number, step):\n if begin_number > end_number:\n number = 0\n else : \n number = begin_number\n while begin_number+step <= end_number:\n begin_number += step\n number+= begin_number\n return number\n \n \n", "def sequence_sum(begin_number, end_number, step):\n if end_number < begin_number: # check if beginning is bigger then end\n return 0\n i = 0 # initialize loop\n for z in range(begin_number, end_number+1, step): \n i += z\n return i", "def sequence_sum(begin_number, end_number, step):\n x =[]\n count = begin_number\n if begin_number > end_number:\n return 0\n while count <= end_number:\n x.append(count)\n count += step\n return sum(x)", "def sequence_sum(begin_number, end_number, step):\n accum = 0\n for i in range(begin_number, end_number+1, step):\n accum += i\n return accum"] | {"fn_name": "sequence_sum", "inputs": [[2, 6, 2], [1, 5, 1], [1, 5, 3], [0, 15, 3], [16, 15, 3], [2, 24, 22], [2, 2, 2], [2, 2, 1], [1, 15, 3], [15, 1, 3]], "outputs": [[12], [15], [5], [45], [0], [26], [2], [2], [35], [0]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 20,410 |
def sequence_sum(begin_number, end_number, step):
|
11cf4ca3bbd55b15acde7aaa5a83f651 | UNKNOWN | # Task
You're standing at the top left corner of an `n × m` grid and facing towards the `right`.
Then you start walking one square at a time in the direction you are facing.
If you reach the border of the grid or if the next square you are about to visit has already been visited, you turn right.
You stop when all the squares in the grid are visited. What direction will you be facing when you stop?
You can see the example of your long walk in the image below. The numbers denote the order in which you visit the cells.
Given two integers n and m, denoting the number of rows and columns respectively, find out the direction you will be facing at the end.
Output `"L"` for left, `"R"` for right, `"U"` for up, and `"D"` for down.
# Example:
For `n = 3, m = 3`, the output should be `"R"`.
This example refers to the picture given in the description. At the end of your walk you will be standing in the middle of the grid facing right.
# Input/Output
- `[input]` integer `n`
number of rows.
`1 <= n <= 1000`
- `[input]` integer `m`
number of columns.
`1 <= m <= 1000`
- `[output]` a string
The final direction. | ["def direction_in_grid(n, m):\n return \"LR\"[n%2] if m >= n else \"UD\"[m%2]\n", "def direction_in_grid(n,m):\n return \"LRUD\"[n%2 if m>=n else 2+m%2]\n", "NEXT = {'R': 'D', 'D': 'L', 'L': 'U', 'U': 'R'}\n\ndef direction_in_grid(n, m, d='R'):\n while n > 1:\n n, m, d = m, n-1, NEXT[d]\n return d", "def direction_in_grid(n,m):\n return 'UD'[m % 2] if m < n else 'LR'[n % 2]", "def direction_in_grid(n,m):\n return 'LR'[n%2] if n<=m else 'UD'[m%2]", "def direction_in_grid(n,m):\n return \"LRUD\"[2*(n>m)+(m if n>m else n)%2]", "direction_in_grid=lambda n,m:\"LRUD\"[min(n,m)%2+2*(m<n)]", "direction_in_grid=lambda n,m:['LR'[n%2],'UD'[m%2]][n>m]", "def direction_in_grid(n,m):\n index = 0\n directionByIndex = {0:'U', 1:'R', 2:'D', 3:'L'}\n if n <= m:\n index = (n*2 - 1) % 4\n else:\n index = (m*2) % 4\n return directionByIndex.get(index)", "def direction_in_grid(n,m):\n if m > n:\n return \"L\" if n % 2 == 0 else \"R\"\n elif m < n:\n return \"U\" if m % 2 == 0 else \"D\"\n else:\n return \"L\" if n % 2 == 0 else \"R\""] | {"fn_name": "direction_in_grid", "inputs": [[1, 1], [2, 2], [2, 3], [2, 4], [3, 1], [3, 2], [3, 3], [3, 4], [3, 5], [4, 2], [4, 3], [4, 4], [4, 5], [4, 6], [5, 4], [5, 5], [5, 6], [100, 100]], "outputs": [["R"], ["L"], ["L"], ["L"], ["D"], ["U"], ["R"], ["R"], ["R"], ["U"], ["D"], ["L"], ["L"], ["L"], ["U"], ["R"], ["R"], ["L"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,113 |
def direction_in_grid(n,m):
|
6f1bbcef178886262733a61ac41c5009 | UNKNOWN | A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. Examples of numerical palindromes are:
* 232
* 110011
* 54322345
Complete the function to test if the given number (`num`) **can be rearranged** to form a numerical palindrome or not. Return a boolean (`true` if it can be rearranged to a palindrome, and `false` if it cannot). Return `"Not valid"` if the input is not an integer or is less than 0.
For this kata, single digit numbers are **NOT** considered numerical palindromes.
## Examples
```
5 => false
2121 => true
1331 => true
3357665 => true
1294 => false
"109982" => "Not valid"
-42 => "Not valid"
``` | ["from collections import Counter\ndef palindrome(num):\n if not isinstance(num, int) or num < 0:\n return 'Not valid'\n return num > 10 and sum(1 for v in Counter(map(int, str(num))).values() if v % 2) <= 1", "def palindrome(num):\n s = str(num)\n return \"Not valid\" if not isinstance(num, int) or num < 0 \\\n else num > 10 and sum(s.count(d) % 2 > 0 for d in set(s)) < 2", "palindrome=lambda n:[sum(str(n).count(i)&1 for i in set(str(n)))<2,0][n<10] if type(n)==int and n >= 0 else 'Not valid'", "from collections import Counter\ndef palindrome(num):\n if not isinstance(num, int) or num<0:\n return 'Not valid' \n elif num<=10:\n return False\n check=Counter(str(num))\n count=sum(1 for i in check if check[i]%2)\n return True if count==0 else True if (count==1 and len(str(num))%2) else False", "from collections import Counter\n\ndef palindrome(num):\n if not isinstance(num, int) or num < 0: return 'Not valid'\n return True if num > 10 and 1 >= sum(map(lambda oc: oc % 2, Counter(str(num)).values())) else False", "def palindrome(n):\n if type(n) != int or n < 0:\n return \"Not valid\"\n s = str(n)\n return n > 10 and sum(s.count(d) % 2 for d in set(s)) < 2", "def palindrome(num):\n s = str(num)\n\n if not isinstance(num, int) or num < 0:\n return \"Not valid\"\n\n return num > 9 and sum(s.count(x)%2 for x in set(s)) < 2", "from collections import Counter\n\ndef palindrome(num):\n if not isinstance(num, int) or num < 0:\n return 'Not valid'\n occ2 = [0, 0]\n for freq in Counter(str(num)).values():\n occ2[freq % 2] += freq % 2\n return num >= 10 and occ2[1] <= 1", "def palindrome(n):\n if not isinstance(n, int) or n<0 : return 'Not valid'\n if n<9 : return False\n n = str(n)\n return sum(n.count(c)%2 for c in set(n))<=1 # only the middle letter migth apear once", "from collections import Counter\ndef palindrome(num):\n if not isinstance(num, int) or num<0:\n return 'Not valid'\n elif num<=10:\n return False\n check=Counter(str(num))\n count=0\n for i in check:\n if check[i]%2:\n count+=1\n return True if count==0 else True if (count==1 and len(str(num))%2 ) else False"] | {"fn_name": "palindrome", "inputs": [[5], [1212], ["ololo"], [1331], [194], [111222], ["Hello world!"], [3357665], ["357665"], [-42]], "outputs": [[false], [true], ["Not valid"], [true], [false], [false], ["Not valid"], [true], ["Not valid"], ["Not valid"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,280 |
def palindrome(num):
|
e40fd59130d0448a5a0609267d827455 | UNKNOWN | You are given an initial 2-value array (x). You will use this to calculate a score.
If both values in (x) are numbers, the score is the sum of the two. If only one is a number, the score is that number. If neither is a number, return 'Void!'.
Once you have your score, you must return an array of arrays. Each sub array will be the same as (x) and the number of sub arrays should be equal to the score.
For example:
if (x) == ['a', 3] you should return [['a', 3], ['a', 3], ['a', 3]]. | ["def explode(arr): \n return [arr] * sum(v for v in arr if isinstance(v,int)) or 'Void!'", "def explode(arr): \n numbers = [n for n in arr if type(n) == int]\n return [arr] * sum(numbers) if numbers else \"Void!\"", "def explode(arr): \n a,b,c = arr[0],arr[1],0\n if type(a) == int: c+=a\n if type(b) == int: c+=b\n if c == 0: return \"Void!\" \n return [arr]*c\n", "def explode(arr): \n return [arr] * sum(x for x in arr if type(x) == int) or \"Void!\" \n", "explode=lambda a:[a]*sum(e for e in a if type(e)==int)or 'Void!'", "def explode(arr): \n if type(arr[0]) != int and type(arr[1]) != int: return \"Void!\"\n elif type(arr[0]) == int and type(arr[1]) != int: return [arr] * arr[0]\n elif type(arr[0]) != int and type(arr[1]) == int: return [arr] * arr[1]\n else: return [arr] * sum(arr)", "def explode(arr): \n return [arr] * sum(x for x in arr if isinstance(x, int)) or 'Void!'", "def explode(arr): \n num=sum([i for i in arr if type(i)==int])\n return 'Void!' if not num else [ arr for i in range(num) ]", "def explode(arr):\n score=0\n if isinstance(arr[0],int):\n score+=arr[0]\n if isinstance(arr[1],int):\n score+=arr[1]\n if score==0:\n return 'Void!'\n return list([arr]*score)", "def explode(arr):\n l=sum(type(v)==int for v in arr)\n if not l:return'Void!'\n return[arr]*sum(v for v in arr if type(v)==int)"] | {"fn_name": "explode", "inputs": [[[9, 3]], [["a", 3]], [[6, "c"]], [["a", "b"]], [[1, 0]]], "outputs": [[[[9, 3], [9, 3], [9, 3], [9, 3], [9, 3], [9, 3], [9, 3], [9, 3], [9, 3], [9, 3], [9, 3], [9, 3]]], [[["a", 3], ["a", 3], ["a", 3]]], [[[6, "c"], [6, "c"], [6, "c"], [6, "c"], [6, "c"], [6, "c"]]], ["Void!"], [[[1, 0]]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,430 |
def explode(arr):
|
23315f91eb79c78094c07339cbb05d54 | UNKNOWN | # Covfefe
Your are given a string. You must replace the word(s) `coverage` by `covfefe`, however, if you don't find the word `coverage` in the string, you must add `covfefe` at the end of the string with a leading space.
For the languages where the string is not immutable (such as ruby), don't modify the given string, otherwise this will break the test cases. | ["def covfefe(s):\n return s.replace(\"coverage\",\"covfefe\") if \"coverage\" in s else s+\" covfefe\"", "def covfefe(s):\n if 'coverage' in s:\n return s.replace('coverage', 'covfefe')\n else:\n return s + ' ' + 'covfefe'\n", "def covfefe(s):\n return \"\".join(s.replace(\"coverage\", \"covfefe\") if \"coverage\" in s else s + \" covfefe\")\n\n", "def covfefe(s):\n t = s.replace(\"coverage\", \"covfefe\")\n return t + \" covfefe\"*(len(t) == len(s))", "covfefe = lambda s: s.replace(\"coverage\", \"covfefe\") if \"coverage\" in s else s + \" covfefe\"", "def covfefe(s):\n return s.replace('coverage', 'covfefe') if s.__contains__('coverage') else s + ' covfefe'\n \n", "def covfefe(s):\n return (lambda cv,cf:(s+[f' {cv}',''][cv in s]).replace(cv,cf))('coverage', \"covfefe\")", "def covfefe(s):\n lst = list(s.split(\" \"))\n result = [\"covfefe\" if i == \"coverage\" else i for i in lst]\n return \" \".join(result) if \"coverage\" in lst else \" \".join(result) + \" covfefe\"\n", "covfefe=lambda s,x='coverage',y='covfefe':[s+' '+y,s.replace(x,y)][x in s]", "def covfefe(stg):\n return stg.replace(\"coverage\", \"covfefe\") if (\"coverage\" in stg) else f\"{stg} covfefe\""] | {"fn_name": "covfefe", "inputs": [["coverage"], ["coverage coverage"], ["nothing"], ["double space "], ["covfefe"]], "outputs": [["covfefe"], ["covfefe covfefe"], ["nothing covfefe"], ["double space covfefe"], ["covfefe covfefe"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,246 |
def covfefe(s):
|
b64a52a2d8fe3d4162749f762265af57 | UNKNOWN | # Task
Mr.Odd is my friend. Some of his common dialogues are “Am I looking odd?” , “It’s looking very odd” etc. Actually “odd” is his favorite word.
In this valentine when he went to meet his girlfriend. But he forgot to take gift. Because of this he told his gf that he did an odd thing. His gf became angry and gave him punishment.
His gf gave him a string str of contain only lowercase letter and told him,
“You have to take 3 index `i,j,k` such that `i ".u..dbo"(no more odd)`
For `str="ooudddbd"`, the result should be `2`.
`"ooudddbd"(cut 1st odd)--> ".ou..dbd"(cut 2nd odd) --> "..u...b."`
# Input/Output
- `[input]` string `str`
a non-empty string that contains only lowercase letters.
`0 < str.length <= 10000`
- `[output]` an integer
the maximum number of "odd". | ["import re\n\npattern = re.compile('o(.*?)d(.*?)d')\n\ndef odd(s):\n n = 0\n while pattern.search(s):\n n += 1\n s = pattern.sub(r'\\1\\2', s, count=1)\n return n", "import re\n\no = re.compile(r\"o(.*?)d(.*?)d\")\n\ndef odd(stg):\n count = 0\n while o.search(stg):\n count += 1\n stg = o.sub(r\"\\1\\2\", stg, 1)\n return count", "def odd(s):\n o = d = res = 0\n for c in filter(\"od\".__contains__, s):\n if c == 'o': o += 1\n elif o and d: o, d, res = o-1, d-1, res+1\n elif o: d += 1\n return res", "def odd(string):\n li,i,string = [],0,list(string)\n while i < len(string):\n if string[i] == 'o':\n temp,pos_to_remove = ['o'],[i]\n for j in range(i + 1, len(string)):\n if string[j] == 'd' : temp.append('d') ; pos_to_remove.append(j)\n if len(temp) == 3 : break\n if \"\".join(temp) == \"odd\":\n li.append(1)\n for k in pos_to_remove:\n string[k] = \".\"\n i += 1\n return len(li)", "def odd(s):\n r = [i for i in s.lower() if i == 'o' or i == 'd']\n result = []\n while True:\n word = ''\n try:\n o = r.index('o')\n d = r[o+1:].index('d')+o+1\n d2 = r[d+1:].index('d')+d+1\n word += r.pop(d2)+ r.pop(d)+r.pop(o)\n if word[::-1] == \"odd\":\n result.append(word)\n except Exception:\n break\n return len(result)", "import re\ndef odd(s):\n for c in range(len(s)):\n last, s = s, re.sub(r'o(.*?)d(.*?)d', r'\\1\\2', s, count = 1)\n if last == s: return c", "def odd(s):\n odds=list(s)\n for i in odds:\n if i != 'o' and i != 'd':\n odds.remove(i)\n x=3\n num=0\n t=0\n flag=True\n m=[2, 1]\n l_index=[]\n while x==3:\n if flag==False:\n odds[0:l_index[0]]\n for i in l_index:\n odds.pop(i-t)\n t=t+1\n x=0\n t=0\n num=num+1\n l_index=[]\n index=0\n else:\n x=0\n index=0\n for i in odds:\n if x==0 and i=='o':\n x=x+1\n l_index.append(index)\n elif x in m and i=='d':\n x=x+1\n l_index.append(index)\n flag=False\n index=index+1\n return num", "def odd(s):\n n, o, d, trying = 0, 0, 0, True\n while trying:\n try:\n o += s[o:].index('o') + 1\n d = max(o, d)\n d += s[d:].index('d') + 1\n d += s[d:].index('d') + 1\n n += 1\n except:\n trying = False\n return n\n", "def odd(s):\n odd=0\n l=[x for x in s]\n while True:\n try:\n o=l.index('o')\n d1=l.index('d',o)\n d2=l.index('d',d1+1)\n except ValueError:\n return odd\n if o > -1 and d1 > -1 and d2 > -1:\n l.pop(d2)\n l.pop(d1)\n l.pop(o)\n odd+=1\n else:\n return odd\n", "def odd(s):\n s = list(s)\n count = 0\n for k in range(len(s)):\n if s[k] == \"o\":\n for i in range(k+1, len(s)):\n if s[i] == \"d\":\n for j in range(i+1, len(s)):\n if s[j] == \"d\":\n s[k] = \"_\"\n s[i] = \"_\"\n s[j] = \"_\"\n count += 1\n break\n break\n return count\n"] | {"fn_name": "odd", "inputs": [["oudddbo"], ["ouddddbo"], ["ooudddbd"], ["qoddoldfoodgodnooofostorodrnvdmddddeidfoi"]], "outputs": [[1], [1], [2], [6]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,661 |
def odd(s):
|
c6a61df0255486942577c372d8832152 | UNKNOWN | ## Description
You've been working with a lot of different file types recently as your interests have broadened.
But what file types are you using the most? With this question in mind we look at the following problem.
Given a `List/Array` of Filenames (strings) `files` return a `List/Array of string(s)` contatining the most common extension(s). If there is a tie, return a sorted list of all extensions.
### Important Info:
* Don't forget, you've been working with a lot of different file types, so expect some interesting extensions/file names/lengths in the random tests.
* Filenames and extensions will only contain letters (case sensitive), and numbers.
* If a file has multiple extensions (ie: `mysong.mp3.als`) only count the the last extension (`.als` in this case)
## Examples
```
files = ['Lakey - Better days.mp3',
'Wheathan - Superlove.wav',
'groovy jam.als',
'#4 final mixdown.als',
'album cover.ps',
'good nights.mp3']
```
would return: `['.als', '.mp3']`, as both of the extensions appear two times in files.
```
files = ['Lakey - Better days.mp3',
'Fisher - Stop it.mp3',
'Fisher - Losing it.mp3',
'#4 final mixdown.als',
'album cover.ps',
'good nights.mp3']
```
would return `['.mp3']`, because it appears more times then any other extension, and no other extension has an equal amount of appearences. | ["from collections import Counter\nimport re\n\ndef solve(files):\n c = Counter(re.match('.*(\\.[^.]+)$', fn).group(1) for fn in files)\n m = max(c.values(),default=0)\n return sorted(k for k in c if c[k] == m)", "from collections import Counter\n\ndef solve(files):\n c = Counter(f[f.rfind(\".\"):] for f in files)\n MAX = max(c.values(), default=0)\n return sorted(e[0] for e in c.items() if e[1] == MAX)", "import os\nfrom collections import Counter\n\ndef solve(files):\n c = Counter(os.path.splitext(f)[-1] for f in files)\n m = max(c.values(), default=0)\n return [x for x in sorted(c) if c[x] == m]", "def solve(files):\n if not files:\n return files\n \n d = {}\n \n for file in files:\n ext = file.split('.')[-1]\n \n if ext in d:\n d[ext] += 1\n else:\n d[ext] = 0\n \n m = max(d.values())\n \n most_used = ['.'+i for i, j in list(d.items()) if j == m]\n \n return sorted(most_used)\n", "solve=lambda f:(lambda l:(lambda d:sorted([e for e in d if d[e]==max(d.values())]))({e:l.count(e) for e in set(l)}))([e[e.rfind('.'):] for e in f])", "from collections import Counter as c\nfrom itertools import takewhile\n\ndef solve(arr):\n if arr == []: return []\n a = sorted(c(map(lambda x: x.split('.')[-1],arr)).most_common(), key=lambda i: (-i[1], i[0]))\n maxi = a[0][1]\n return list(map(lambda x: '.'+x[0],(takewhile(lambda x: x[1] == maxi, a))))", "from collections import Counter\n\n\ndef solve(files):\n count = Counter(f.rsplit(\".\")[-1] for f in files)\n m = max(count.values(), default=0)\n return sorted(f\".{ext}\" for ext, c in count.items() if c == m)", "from collections import Counter\ndef solve(files):\n ext = [f.split('.')[-1] for f in files]\n return sorted('.'+i for i in set(ext) if ext.count(i)==max(ext.count(i) for i in ext))", "from collections import Counter\ndef solve(files):\n extensions = Counter(['.'+i.split('.')[-1] for i in files])\n m = max(extensions.values(),default=0)\n return sorted([i for i,j in extensions.items() if j==m])", "def solve(files):\n hashMap = {}\n mostCommon = []\n maxCount = 1\n \n for file in files:\n ext = file[file.rfind('.'):]\n count = hashMap[ext] = hashMap.get(ext, 0) + 1\n \n if maxCount < count:\n maxCount = count\n mostCommon = [ext]\n elif maxCount == count:\n mostCommon.append(ext)\n \n mostCommon.sort() \n \n return mostCommon"] | {"fn_name": "solve", "inputs": [[["direful.pr", "festive.html", "historical.wav", "holistic.mp3", "impossible.jar", "gentle.cpp", "gleaming.xml", "inconclusive.js", "erect.jar", "befitting.mp3", "brief.wp", "beautiful.jar", "energetic.pt", "careful.wp", "defective.cpp", "icky.wav", "gorgeous.txt", "good.pt", "fat.pt", "bored.als", "adaptable.cpp", "fumbling.exe", "grieving.wp", "efficient.wav", "fearful.xml", "damp.html", "erect.exe", "annoyed.xml", "elderly.ala", "far-flung.txt", "careful.mp3", "actually.pt", "cynical.ala", "complex.exe", "extra-small.pt", "enchanted.ala", "amazing.html", "bashful.h", "hallowed.html", "entertaining.html", "bad.js", "illegal.maya", "deadpan.html", "furtive.wp", "hanging.css", "drunk.py", "capricious.wav", "damaging.Ue4", "cool.Ue4", "ambitious.css", "fortunate.wp", "electric.mp3", "crowded.txt", "cooperative.html", "graceful.pt", "aboard.pt", "exclusive.als", "glossy.css", "fluffy.pt", "cluttered.txt", "halting.cpp", "glib.cpp", "aback.pr", "cynical.Ue4", "chilly.xml", "hideous.ala", "finicky.txt", "feigned.ala", "better.Ue4", "dear.py", "available.xml", "easy.pr", "fine.mp3", "cowardly.jar", "incredible.css", "adhesive.exe", "energetic.mp3", "harmonious.exe", "general.als", "condemned.als", "flawless.als", "curvy.h", "ambitious.mp3", "disillusioned.xml", "bitter.h", "hanging.wp", "certain.cpp", "flashy.html", "cuddly.pr", "cagey.Ue4", "extra-small.pr", "amuck.cpp", "direful.html", "delightful.als", "helpless.h", "foamy.mp3", "enthusiastic.maya", "good.maya", "adhesive.css", "imperfect.pr", "bent.cpp", "exultant.zbrush", "adorable.mp3", "clammy.maya", "gaudy.pt", "blushing.css", "cuddly.Ue4", "curved.py", "boring.html", "broken.txt", "daily.jar", "giddy.xml", "curved.css", "future.maya", "graceful.css", "guiltless.maya", "gentle.cpp", "few.css", "calculating.txt", "clear.pr", "grey.py", "entertaining.ala", "elfin.txt", "excited.js", "abject.zbrush", "best.js", "boundless.wav", "hurried.ala", "delirious.cpp"]], [["dramatic.txt", "incompetent.jar", "alcoholic.wp", "clumsy.py", "abject.h", "boring.exe", "aloof.pr", "familiar.py", "fanatical.py", "ill-informed.html", "fierce.pr", "accurate.html", "grotesque.pr", "brown.py", "courageous.pt", "grouchy.jar", "giant.pt", "dirty.h", "abaft.jar", "enormous.zbrush", "creepy.cpp", "beneficial.py", "absorbing.ala", "heartbreaking.html", "exclusive.js", "fluttering.html", "happy.als", "fresh.pr", "adamant.txt", "awful.maya", "frightening.maya", "bizarre.html", "efficacious.exe", "illegal.wav", "dizzy.js", "gusty.wp", "delightful.pt", "full.als", "chivalrous.xml", "filthy.js", "functional.jar", "conscious.wav", "feeble.exe", "hilarious.cpp", "earthy.py", "handy.txt", "hollow.cpp", "aggressive.js", "fat.h", "drunk.exe", "clear.h", "easy.wav", "eatable.pt", "grumpy.css", "empty.exe", "brief.jar", "aggressive.txt", "aggressive.txt", "gruesome.ala", "awake.txt", "apathetic.mp3", "holistic.pt", "embarrassed.css", "flashy.maya", "exultant.ala", "exuberant.exe", "graceful.pt", "dependent.py", "gigantic.wp", "husky.js", "immense.pr", "defiant.cpp", "cooperative.html", "frantic.maya", "abashed.css", "dysfunctional.h", "gusty.js", "dynamic.txt", "dreary.pt", "giddy.ala", "exciting.css", "best.als", "humdrum.css", "busy.jar", "frail.cpp", "cagey.wav"]], [["freezing.jar", "frail.xml", "available.txt", "excited.als", "godly.exe", "fair.zbrush", "abortive.Ue4", "ill-fated.mp3", "early.cpp", "demonic.py", "greedy.css", "high.py", "dry.xml", "fascinated.html", "humorous.zbrush", "hilarious.pr", "burly.pt", "cumbersome.wp", "elite.Ue4", "equable.py", "cold.h", "discreet.wp", "hard.mp3", "aberrant.css", "common.zbrush", "fretful.maya", "erect.js", "good.maya", "general.wav", "complete.js", "ad hoc.jar", "healthy.mp3", "bawdy.exe", "impartial.py", "hesitant.pt", "erratic.css", "agonizing.cpp", "belligerent.html", "cumbersome.Ue4", "chilly.h", "bustling.exe", "curly.jar", "gorgeous.py", "friendly.txt", "discreet.html", "abhorrent.ala", "awake.Ue4", "good.Ue4", "closed.html", "gabby.py", "imminent.js", "combative.css", "feigned.ala", "elderly.ala", "glamorous.h", "dry.xml", "illustrious.html", "first.xml", "conscious.xml", "divergent.zbrush", "doubtful.xml", "big.ala", "brief.h", "clever.als", "fierce.ala", "adventurous.html", "ashamed.jar", "fast.cpp", "fanatical.py", "ambiguous.pr", "efficient.txt", "gullible.jar", "ill-informed.cpp", "capable.py", "aboard.mp3", "complete.als", "helpful.maya", "bizarre.css", "filthy.js", "hateful.Ue4", "aback.wp", "fertile.html", "cloudy.als", "comfortable.css", "bustling.js", "ad hoc.py", "adorable.ala", "frequent.als", "flimsy.mp3", "aboriginal.pt", "blushing.h", "feigned.py", "bloody.py", "hospitable.ala", "extra-large.cpp", "alike.exe", "fine.js", "confused.wav", "bloody.wp", "cumbersome.wav", "harsh.mp3", "crooked.css", "equal.wav", "drunk.als", "general.cpp", "grieving.css", "certain.cpp", "cumbersome.pt", "different.txt", "flat.h", "cagey.h", "enormous.wp", "difficult.xml", "furry.pt", "enormous.exe", "dramatic.h", "brief.zbrush", "elfin.zbrush", "cumbersome.pt"]], [["fresh.exe", "groovy.pr", "debonair.pr", "hesitant.Ue4", "curious.py", "black.als", "elderly.zbrush", "harmonious.wav", "different.cpp", "ablaze.xml", "abstracted.html", "hollow.zbrush", "familiar.xml", "defiant.mp3", "huge.exe", "efficacious.html", "aberrant.ala", "better.js", "glamorous.wp", "glossy.cpp", "gentle.jar", "incandescent.exe", "bashful.js", "aware.pr", "hellish.js", "icky.cpp", "chivalrous.pr", "exotic.xml", "grandiose.js", "abrupt.html", "bitter.mp3", "chemical.xml", "disagreeable.exe", "far-flung.exe", "acrid.wp", "infamous.Ue4", "hungry.xml", "deadpan.h", "equable.wp", "hanging.txt", "fanatical.Ue4", "excellent.Ue4", "grieving.js", "brash.css", "gullible.pr", "acid.py", "fragile.html", "bewildered.jar", "bored.zbrush", "illustrious.zbrush", "equal.cpp", "female.wp", "coordinated.cpp", "elderly.txt"]], [["hanging.h", "fixed.ala", "first.pr", "cooperative.cpp", "elfin.zbrush", "fair.pr", "cool.css", "highfalutin.py", "alcoholic.maya", "heady.cpp", "befitting.wav", "certain.jar", "glistening.exe", "attractive.wav", "gruesome.wp", "happy.txt", "finicky.jar", "clumsy.js", "assorted.js", "highfalutin.cpp", "damaging.h", "ethereal.xml", "great.jar", "dead.wp", "acoustic.xml", "devilish.css", "curly.pt", "exuberant.ala", "flippant.wp", "holistic.html", "cut.txt", "adamant.py", "dashing.zbrush", "conscious.wp", "black-and-white.cpp", "elated.pt", "high-pitched.exe", "flowery.xml", "glib.wp", "industrious.html", "arrogant.zbrush", "accessible.html", "classy.jar", "acceptable.maya", "cynical.pt", "erratic.pt", "earthy.als", "dramatic.als", "bite-sized.py", "ahead.xml", "giddy.js", "fortunate.txt", "early.txt", "imaginary.wav", "cute.zbrush", "graceful.html", "far-flung.Ue4", "goofy.exe", "abundant.mp3", "ambitious.txt", "gigantic.jar", "abashed.xml", "guiltless.Ue4", "adventurous.py", "guarded.jar", "extra-large.zbrush", "filthy.h", "easy.zbrush", "glorious.als", "detailed.pr", "flashy.zbrush", "breezy.als", "faithful.py", "curly.js", "chief.js", "concerned.js", "cumbersome.zbrush", "ahead.maya", "berserk.cpp", "deserted.pt", "cool.zbrush", "broken.cpp", "glossy.pt", "deep.xml", "average.wav", "dangerous.cpp", "acrid.wav", "dear.zbrush", "deeply.pr", "detailed.cpp", "friendly.h", "first.css", "heady.exe", "far-flung.als", "erratic.mp3", "exciting.pr"]], [["crazy.pr", "black-and-white.als", "illegal.wav", "exultant.mp3", "exotic.jar", "capricious.pt", "abundant.ala", "eatable.zbrush", "careful.py", "godly.css", "clever.txt", "dusty.maya", "awesome.zbrush", "discreet.jar", "creepy.h", "fair.pt", "descriptive.mp3", "boundless.ala", "berserk.xml", "hungry.exe", "awful.exe"]], [["cLgvr.P.als", "sgeFl.FL.als", "j9Yei.Kyu.py", "RljRS.v.ala", "1CJaz.EJF.pr", "Zxc1b.tOw.maya", "s0lXz.P7z.txt", "QvISi.b8l.Ue4", "3XtjW.rSSH.zbrush", "6TsCH.dJy.zbrush", "ZbL5a.zeqk.ala", "1RReC.Pk3.zbrush", "0EfHO.Ic.pr", "VGBzm.o.h", "BJZtt.6.xml", "xU84j.0MC.pt", "l3JMW.RMg.py", "kAbbu.8Il.ala", "G0ecb.BnPc.jar", "dwll1.tpL.wav", "CQMue.p55.js", "98tu7.Zcp.ala", "gutGx.Hel.cpp", "utRUl.B5c.ala", "qjOwJ.Z7K5.h", "ltygD.Q8b.jar", "8eH8W.5J1.py", "cu6hY.Ux.zbrush", "vrFaN.jLZ.pr", "7dZyA.NOKB.mp3", "h5i96.Xa3u.maya", "q7zW3.Am0o.pr", "1i0rP.qhl.pr", "Lnb3P.vW8B.html", "dEa97.zU.maya", "nYfS1.eLB.ala", "B48eD.m8i.html", "UiF8F.lME.maya", "y65gi.Hy.xml", "dstKJ.Jw2.Ue4", "WPPqa.TG6.als", "kespD.XwYz.ala", "MGdVy.jOH.py", "4kIBi.UES.py", "gWeqd.KY.pt", "KmFlM.XbG.h", "V6cPb.WnX.mp3", "Dh0Qi.75t.maya", "VIIGI.yI.jar", "5xXJB.1b.cpp", "H0eqG.9w.h", "lqf3u.AC.txt", "6p9Wy.p.html", "vpocy.2SJ.wp", "Buf8Y.zIL.wp", "MqT4y.4Ht.css", "PdB3m.KF.ala", "fExGF.gOU.ala", "VrCoD.JK.cpp", "QJFt9.ODPT.wav", "NGWzW.l.py", "IepDH.tjU.txt", "ldVGH.qehX.wav", "F6trP.yqC.mp3", "J5O28.XeHt.zbrush", "91FXj.uA.ala", "mf7Ah.8mG.maya", "hv11B.a1e.jar", "voQGw.NPPT.h", "hUtNN.0Dpu.txt", "44Yzo.2v6T.txt", "zVkzf.W2.exe", "ea1Fh.uCL.mp3", "gnla7.s.cpp", "7H1YL.SNp.maya", "xoh3J.N.js", "iEyAi.pC.pr", "aMpTM.uN.xml", "8KxWi.CQ1U.css", "YOKmK.69dJ.ala", "U3TcE.eiR.h", "tkmLt.Jn.js", "Ng2Ic.L.wav", "GZlgM.LuYi.html", "sM7GE.9X.mp3", "rL9Ur.kQg2.zbrush", "YiOIM.G9.ala", "IjEXf.Rj85.css", "0nca8.m.cpp", "8Ambc.zG.py", "6nCtl.OM.mp3", "RLXVB.BLhg.wav", "Ztlrq.JBV.als", "FirM2.oDM.zbrush", "Z1uS4.Z.txt", "KufUz.r.py", "Mzdhf.OZ.css", "2KsrA.hjMq.maya", "9DEID.fk.h", "8ku9r.4p.py", "mzHZW.BeZ.wav", "Slw1y.xZ.mp3", "c1Sob.15O.cpp", "xiFyf.cam.xml", "CY8qX.k5Jp.wp", "DlMxO.0s.txt", "KSR1k.wQg.maya", "LhF9F.C.cpp", "j4R8i.dp.zbrush", "D5JjS.2N.xml", "5IWDt.bo.als", "ZI34s.rp7d.als", "v6pnV.hp.ala", "VUBCS.gRxo.cpp", "XEe6m.xf.wp", "3N2IG.Wp.mp3", "H0BdK.IsO.pt", "0TwmC.v.wav", "5j8d6.Wkl.mp3", "C2xtb.vPN.wp", "i76rK.UHrR.pr", "hG2IO.V9j.als", "2Jb8Y.q5.zbrush", "ipMqx.SXS.js", "j9J0r.gcu.h", "P7WZD.whS.js", "lSnjU.9Pe.jar", "hsyLy.EYJl.h", "cti8l.PBT.exe", "JMXX7.EYxt.css", "yn7rx.ol.mp3", "Y764e.ZaC.zbrush", "GLURG.iCw.jar", "XHRAo.tW2.pr", "BElbv.6P.ala", "fYE0U.fP.js", "gz7rb.aI.wav"]], [[]]], "outputs": [[[".cpp", ".html"]], [[".pt", ".py", ".txt"]], [[".py"]], [[".cpp", ".exe", ".js", ".pr", ".xml"]], [[".zbrush"]], [[".ala", ".exe", ".jar", ".mp3", ".pt", ".zbrush"]], [[".ala"]], [[]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,574 |
def solve(files):
|
52a619ec3b6566b279d98a4b315e4589 | UNKNOWN | # Base64 Numeric Translator
Our standard numbering system is (Base 10). That includes 0 through 9. Binary is (Base 2), only 1’s and 0’s. And Hexadecimal is (Base 16) (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F). A hexadecimal “F” has a (Base 10) value of 15. (Base 64) has 64 individual characters which translate in value in (Base 10) from between 0 to 63.
####Write a method that will convert a string from (Base 64) to it's (Base 10) integer value.
The (Base 64) characters from least to greatest will be
```
ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/
```
Where 'A' is equal to 0 and '/' is equal to 63.
Just as in standard (Base 10) when you get to the highest individual integer 9 the next number adds an additional place and starts at the beginning 10; so also (Base 64) when you get to the 63rd digit '/' and the next number adds an additional place and starts at the beginning "BA".
Example:
```
base64_to_base10("/") # => 63
base64_to_base10("BA") # => 64
base64_to_base10("BB") # => 65
base64_to_base10("BC") # => 66
```
Write a method `base64_to_base10` that will take a string (Base 64) number and output it's (Base 10) value as an integer. | ["DIGITS = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\"\n\ndef base64_to_base10(string):\n return sum(DIGITS.index(digit) * 64**i\n for i, digit in enumerate(string[::-1]))", "base64_to_base10=lambda strr:int(''.join([('0'*6+bin('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.index(c))[2:])[-6:] for c in strr]),2)", "def base64_to_base10(str):\n res = 0\n for c in str:\n res *= 64\n res += \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\".find(c)\n return res\n", "base64_to_base10=lambda s: 0 if len(s)==0 else \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\".index(s[-1]) + 64 * base64_to_base10(s[:-1])", "d = {j:i for i,j in enumerate('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/')}\nbase64_to_base10=lambda s:sum(d[j]*(64**(len(s)-1-i)) for i,j in enumerate(s))", "abc = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\n\ndef base64_to_base10(str, order=1):\n return base64_to_base10(str[:-1], order*64) + abc.index(str[-1]) * order if str else 0", "strng = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\"\ndef base64_to_base10(s):\n return sum(strng.index(j)*64**(i) for i,j in enumerate(s[::-1]))", "def base64_to_base10(string):\n return sum([\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\".index(letter) * (64**power) for power, letter in enumerate(string[::-1])])", "def base64_to_base10(s):\n n = 0\n for c in s:\n n = n * 64 + 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.index(c)\n return n", "def base64_to_base10(str):\n return sum('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.index(n)*64**i for i,n in enumerate(str[::-1]))"] | {"fn_name": "base64_to_base10", "inputs": [["WIN"], ["b64"], ["B64"], ["/+/"], ["HelloWorld"]], "outputs": [[90637], [114360], [7864], [262079], [134710352538679645]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,815 |
def base64_to_base10(string):
|
9cac1ee155bf07036909e62cba9c2c13 | UNKNOWN | This kata aims to show the vulnerabilities of hashing functions for short messages.
When provided with a SHA-256 hash, return the value that was hashed. You are also given the characters that make the expected value, but in alphabetical order.
The returned value is less than 10 characters long. Return `nil` for Ruby and Crystal, `None` for Python, `null` for Java when the hash cannot be cracked with the given characters.
---
Example:
--------
```
Example arguments: '5694d08a2e53ffcae0c3103e5ad6f6076abd960eb1f8a56577040bc1028f702b', 'cdeo'
Correct output: 'code'
``` | ["from hashlib import sha256\nfrom itertools import permutations\n\n\ndef sha256_cracker(hash, chars):\n for p in permutations(chars, len(chars)):\n current = ''.join(p)\n if sha256(current.encode('utf-8')).hexdigest() == hash:\n return current\n", "import hashlib\nimport itertools\n\ndef sha256_cracker(hash, chars):\n for p in itertools.permutations(chars):\n if(toSHA256(\"\".join(p)) == hash):\n return \"\".join(p)\n return None\n \ndef toSHA256(s): \n m = hashlib.sha256() \n m.update(s.encode())\n return m.hexdigest()", "from itertools import permutations\nfrom hashlib import sha256\ndef sha256_cracker(hash, chars):\n return next(iter(''.join(p) for p in permutations(chars) if sha256(str.encode(''.join(p))).hexdigest() == hash), None)", "from hashlib import sha256\nfrom itertools import permutations as p\nsha256_cracker=lambda h,c:next((''.join(i) for i in p(c) if sha256(''.join(i).encode()).hexdigest()==h),None)", "import hashlib\nimport itertools\ndef hashit(str):\n result = hashlib.sha256(str.encode())\n return result.hexdigest()\ndef guess(chars):\n yield from list(itertools.permutations(chars,len(chars)))\ndef sha256_cracker(hash, chars):\n for x in guess(chars):\n str = ''.join(x)\n if (hashit(str) == hash):\n return str\n return None", "import hashlib\nfrom itertools import permutations\n\ndef sha256_cracker(code, chars):\n x = [''.join(i) for i in permutations(chars)]\n for i in x :\n if hashlib.sha256(str.encode(i)).hexdigest() == code :\n return i", "from itertools import permutations\nfrom hashlib import sha256\n\ndef sha256_cracker(hash, chars):\n return next((\"\".join(p) for p in permutations(chars) if sha256(\"\".join(p).encode('utf-8')).hexdigest() == hash), None)", "from hashlib import sha256\nfrom itertools import permutations\n\ndef sha256_cracker(hash, chars):\n for x in map(''.join, permutations(chars)):\n if sha256(x.encode()).hexdigest() == hash:\n return x", "from hashlib import sha256\nfrom itertools import permutations\n\ndef sha256_cracker(hash, chars):\n for stg in (\"\".join(p) for p in permutations(chars)):\n if sha256(stg.encode(\"utf-8\")).hexdigest() == hash:\n return stg", "import hashlib\nfrom itertools import permutations\n\ndef sha256_cracker(hash, chars):\n bs = chars.encode()\n h = bytes.fromhex(hash)\n return next((\n bytes(xs).decode()\n for i in range(1, min(10, len(bs))+1)\n for xs in permutations(bs, i)\n if hashlib.sha256(bytes(xs)).digest() == h\n ), None)"] | {"fn_name": "sha256_cracker", "inputs": [["b8c49d81cb795985c007d78379e98613a4dfc824381be472238dbd2f974e37ae", "deGioOstu"], ["f58262c8005bb64b8f99ec6083faf050c502d099d9929ae37ffed2fe1bb954fb", "abc"]], "outputs": [["GoOutside"], [null]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,638 |
def sha256_cracker(hash, chars):
|
81cfc2daab86cc5e365aeb55b621876a | UNKNOWN | *Recreation of [Project Euler problem #6](https://projecteuler.net/problem=6)*
Find the difference between the sum of the squares of the first `n` natural numbers `(1 <= n <= 100)` and the square of their sum.
## Example
For example, when `n = 10`:
* The square of the sum of the numbers is:
(1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10)^(2) = 55^(2) = 3025
* The sum of the squares of the numbers is:
1^(2) + 2^(2) + 3^(2) + 4^(2) + 5^(2) + 6^(2) + 7^(2) + 8^(2) + 9^(2) + 10^(2) = 385
Hence the difference between square of the sum of the first ten natural numbers and the sum of the squares of those numbes is: 3025 - 385 = 2640 | ["def difference_of_squares(x):\n r = range(1,x+1,1)\n return (sum(r) ** 2) - (sum( z**2 for z in r))", "difference_of_squares = lambda n: n ** 2 * (n + 1) ** 2 / 4 - n * (n + 1) * (2 * n + 1) / 6", "def difference_of_squares(x):\n \n # Initialize\n square_sum = 0\n sum_squares = 0\n \n # Loop over x numbers to create the sum and add all squares\n for i in range(1,x+1):\n square_sum += i\n sum_squares += i**2\n \n # Power the sum of the x values\n square_sum **= 2\n \n # Return the difference\n return (square_sum - sum_squares)", "difference_of_squares=lambda n:(n*n-1)*(n*n/4+n/6)", "def difference_of_squares(n):\n return (3*n**4+2*n**3-3*n**2-2*n)/12", "def difference_of_squares(x):\n return (3*x**4 + 2*x**3 - 3*x**2 - 2*x) // 12", "def difference_of_squares(n):\n sum_of_squares = n * (n + 1) * (2 * n + 1) // 6\n square_of_sum = (n * (n + 1) // 2) ** 2\n return square_of_sum - sum_of_squares", "def difference_of_squares(n):\n sum_of_squares = 0\n square_of_sum = 0\n for i in range(1, n+1):\n square_of_sum += i\n sum_of_squares += i**2\n return (square_of_sum**2) - sum_of_squares", "def difference_of_squares(n):\n return sum(i for i in range(1,n+1))**2 - sum(i*i for i in range(1,n+1)) ", "def difference_of_squares(n):\n return sum(range(n + 1))**2 - sum(map(lambda x: x ** 2, range(n + 1)))", "def difference_of_squares(n):\n return sum([i for i in range(1, n + 1)]) ** 2 - sum([i ** 2 for i in range(1, n + 1)])", "def difference_of_squares(n):\n return sum(i for i in range(1,n+1)) ** 2 - sum(i ** 2 for i in range(1,n+1))", "def difference_of_squares(n):\n return sum(range(n+1))**2 - sum(i**2 for i in range(n+1))", "def difference_of_squares(x):\n return sum(range(x+1))**2 - sum(i**2 for i in range(x+1))", "def difference_of_squares(n):\n sum = 0\n for i in range(1, n + 1):\n sum += i ** 2\n return ((n * (n + 1)) / 2) ** 2 - sum", "def difference_of_squares(n):\n return sum(n - i for i in range(0, n))**2 - sum((n - i)**2 for i in range(0, n))", "def difference_of_squares(x):\n return sum(i for i in range(1, x+1))**2 - sum(i**2 for i in range(1, x+1))", "def difference_of_squares(x):\n return sum(i * i * (i-1) for i in range(x+1))", "def difference_of_squares(x):\n return x * (x+1) * (x*(x+1)/4 - (2*x+1)/6)", "def difference_of_squares(n):\n a=sum([i for i in range(1,n+1)])**2\n b=sum([i**2 for i in range(1,n+1)])\n return a-b", "def difference_of_squares(n):\n if 1<=n<=100:\n lst = []\n for i in range(1, n+1):\n lst.append(i)\n s = sum(lst)**2\n l = []\n for i in range(1, n+1):\n l.append(i**2)\n t = sum(l) \n return s - t\n", "def difference_of_squares(n):\n s1 = 0\n for i in range(1,n+1):\n s1+=i**2\n somme2 = [i for i in range(1,n+1)]\n s2 = (sum(somme2))**2\n \n return abs(s1-s2)", "def difference_of_squares(n):\n n1 = sum(range(1, n + 1))\n \n return n1 * n1 - sum([i * i for i in range(1, n + 1)])", "def difference_of_squares(n):\n sum1 = 0\n sum2 = 0\n for x in range(n):\n sum1 += x + 1 \n sum2 += (x+1) ** 2\n return (sum1 ** 2) - sum2", "def difference_of_squares(n):\n print(n)\n a = sum(range(n + 1)) ** 2\n b = sum([(i+1)**2 for i in range(n)])\n return a - b\n", "def difference_of_squares(n):\n return square_of_sum(n) - sum_of_squares(n)\n\ndef square_of_sum(n):\n return sum(range(1, n+1)) **2\n \ndef sum_of_squares(n):\n return sum(i*i for i in range(1, n+1))", "def difference_of_squares(n):\n sq_sums = 0\n sum_sqs = 0\n for i in range(1,n+1):\n sq_sums += i**2\n for j in range(1,n+1):\n sum_sqs += j\n return (sum_sqs ** 2) - sq_sums", "def difference_of_squares(n):\n sum1 = 1\n sum2 = 1\n i = 1\n while i < n:\n sum1 += (i + 1)\n sum2 += (i + 1)**2\n i += 1\n return sum1**2 - sum2", "def difference_of_squares(n):\n sum_squares = 0\n sum_num = 0\n for i in range (1, n+1):\n sum_squares = sum_squares + i*i\n sum_num = sum_num +i\n return (sum_num)**2 -(sum_squares) \n", "def difference_of_squares(n):\n a=0\n b=0\n for i in range (1,n+1):\n a=a+i\n b=b+i**2\n return a**2 - b\n", "def difference_of_squares(n):\n a = (sum(n for n in range(1, n+1)))**2\n b = sum(n**2 for n in range(1, n+1))\n return a-b", "def difference_of_squares(n):\n return (n*(n+1)/2)**2 - sum(x**2 for x in range(1,n+1))", "def difference_of_squares(n):\n nat_num=0\n for i in range(0,n+1):\n nat_num += i\n sqr_nat = nat_num **2\n \n sum_sqr = 0\n for b in range(0,n+1):\n sum_sqr += b**2\n \n \n \n return sqr_nat - sum_sqr", "import numpy as np\ndef difference_of_squares(n):\n return sum(range(1,n+1))**2 - sum(np.array(range(1,n+1))**2)", "def difference_of_squares(n):\n s1, s2 = 0, 0\n for i in range(1, n + 1):\n s1 += i\n s2 += i ** 2\n return s1 ** 2 - s2", "def difference_of_squares(n):\n rng = []\n sqs = []\n for i in range(1, n + 1):\n rng.append(i)\n sqs.append(i ** 2)\n return sum(rng) ** 2 - sum(sqs)", "def difference_of_squares(n):\n return - sum([i**2 for i in range(n+1)]) + sum(range(n+1))**2", "def difference_of_squares(n):\n # ...\n return (((n*(1+n))/2)**2)-((n*(n+1)*(2*n+1))/6)", "def difference_of_squares(n):\n a = sum(list(range(1, n+1)))**2\n b = sum([i**2 for i in list(range(1, n+1))])\n return abs(a-b)", "def difference_of_squares(n):\n output = 0\n output2 = 0\n for i in range(0,n+1):\n output += i\n output2 += i ** 2\n return output ** 2 - output2", "def difference_of_squares(n):\n sum=0\n square=0\n for i in range(1,n+1):\n sum+=i**2\n \n for num in range(1,n+1):\n square+=num\n \n square**=2\n \n return(square-sum)", "def difference_of_squares(n):\n a = b = 0\n for i in range(1, -~n):\n a += i\n b += i * i\n return abs(a * a - b)", "def difference_of_squares(n):\n arr_pow = []\n two = 0\n for i in range(1,n+1):\n arr_pow.append(i)\n two+=i**2\n one = sum(arr_pow)\n return (one**2) - two\n", "def difference_of_squares(n):\n a = list(range(1,n+1))\n s1 = sum(a) ** 2\n arr = [el ** 2 for el in a]\n s2 = sum(arr)\n return s1 - s2", "def difference_of_squares(n):\n return (n**2-1)*(3*n+2)*n//12", "def difference_of_squares(n):\n s1=(1+n)/2*n\n s2=0\n for i in range(1,n+1):\n s2+=i**2\n return abs(s2-s1**2)", "def difference_of_squares(n):\n return n * (n + 1) * (3 * n * n - n - 2) // 12", "def difference_of_squares(n):\n x = sum([i for i in range(1,n+1)])\n return x*x - sum([i*i for i in range(1,n+1)])", "def difference_of_squares(n):\n r = list(range(n+1))\n return sum(r)**2 - sum([x**2 for x in r])", "def difference_of_squares(num):\n return sum([n for n in list(range(1, num+1))])**2 - sum([n**2 for n in list(range(1, num+1))])", "def difference_of_squares(n):\n a = sum([x*x for x in range(1,n+1)])\n # print(a)\n b = sum(range(1,n+1))\n # print(b)\n return (b*b)-a", "def difference_of_squares(n):\n a=0\n s=0\n for i in range(n+1):\n a+=i\n s+=i*i\n return a*a-s", "def difference_of_squares(n):\n return ((n * (n + 1) // 2) ** 2) - (sum(i ** 2 for i in range(1,n+1)))", "def difference_of_squares(n):\n return sum(el for el in range(n+1)) ** 2 - sum(el**2 for el in range(n+1))", "def difference_of_squares(n):\n return n*(n+1)*(n-1)*(3*n+2)//12\n", "def difference_of_squares(n):\n a, b = 0, 0\n for x in range(1, n +1):\n a += x\n b += x **2\n return a **2 - b\n # Flez\n", "def difference_of_squares(n):\n a, b = 0, 0\n for x in range(1, n +1):\n a += x\n for x in range(1, n +1):\n x = x **2\n b += x\n return a **2 - b\n # Flez\n \n \n", "def difference_of_squares(n):\n square_sum, sum_square = 0, 0\n for i in range(1,n+1):\n square_sum += i\n sum_square += i**2\n \n return square_sum**2 - sum_square", "def difference_of_squares(n):\n sum_n_range = sum([i for i in range(n+1)])**2\n square_n_range = sum([i**2 for i in range(n+1)])\n return sum_n_range - square_n_range", "def difference_of_squares(n):\n sum_n = 0\n sum_n2 = 0\n for i in range(1,n + 1):\n sum_n += i\n sum_n2 += i ** 2\n sum_n = sum_n ** 2\n return sum_n - sum_n2", "def difference_of_squares(n):\n sum_num = 0\n sum_squares = 0\n for i in range(1, n + 1):\n sum_num = sum_num + i\n sum_squares = sum_squares + i ** 2\n return sum_num ** 2 - sum_squares", "def difference_of_squares(n):\n xs = range(1, n+1)\n return sum(xs)**2 - sum(x*x for x in xs)", "def difference_of_squares(n):\n return (sum(range(0,n+1))**2)-(sum(x**2 for x in range(0, n+1)))", "def difference_of_squares(n):\n return sum(range(1, n+1))**2 - sum(map(lambda x: x*x, range(1, n+1))) ", "def difference_of_squares(n):\n fuck = (sum(range(n + 1)))**2\n cunt = sum(map(lambda x: x**2, range(1, n + 1)))\n return fuck - cunt", "def difference_of_squares(n):\n # ...\n return (n * (n + 1) // 2) ** 2 - sum(x ** 2 for x in range(1,n+1)) ", "def difference_of_squares(n):\n squares_sum = sum([i for i in range(1,n+1)])**2\n sum_squares = sum([i**2 for i in range(1,n+1)])\n return squares_sum - sum_squares", "def difference_of_squares(n):\n return n*(n+1)*(n-1)*(3*n+2)/12", "def difference_of_squares(n: int) -> int:\n return 0.25 * n ** 2 * (n + 1) ** 2 - (n * (n + 1) * (2 * n + 1) / 6)\n", "difference_of_squares = lambda n: n ** 4 // 4 + n ** 3 // 6 - n ** 2 // 4 - n // 6", "def difference_of_squares(n):\n \n# =============================================================================\n# This function returns the difference between the sum of the squares of the \n# first n natural numbers (1 <= n <= 100) and the square of their sum.\n# \n# Example:\n# When n = 10:\n# The square of the sum of the numbers is:\n# (1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10)2 = 552 = 3025\n# The sum of the squares of the numbers is:\n# 12 + 22 + 32 + 42 + 52 + 62 + 72 + 82 + 92 + 102 = 385\n# \n# The difference between square of the sum of the first ten natural numbers\n# and the sum of the squares of those numbes is: 3025 - 385 = 2640\n# =============================================================================\n \n sum_1 = 0\n \n sum_2 = 0\n \n for num in range (1,(n+1)):\n sum_1 += num \n sum_2 += num**2\n \n return ((sum_1**2) - sum_2)", "\ndef difference_of_squares(n):\n num1 = sum(i for i in range(1,n+1))**2\n num2 = sum(i**2 for i in range(1,n+1))\n return abs(num1-num2)", "def difference_of_squares(n):\n return (n * (n + 1) // 2) ** 2 - (n * (n + 1) * (n * 2 + 1)) // 6", "def difference_of_squares(n):\n\n return (sum(list(range(1,n+1))))**2 - sum([num**2 for num in range(1,n+1)])", "def difference_of_squares(n):\n sume1,sume2=0,0\n for i in range(1,n+1):\n sume1+=i\n sume2+=(i**2)\n sume1=sume1**2\n return sume1-sume2", "def difference_of_squares(n):\n a=0\n b=0\n for i in range(1,n+1):\n a+=i\n b+=i**2\n c=a**2\n return c-b", "def difference_of_squares(n):\n sum1=0\n sum2=0\n for i in range(n+1):\n sum1 += i**2\n sum2 += i\n return sum2**2-sum1", "def difference_of_squares(n):\n sum_sqr=0\n sum_sqrs=0\n for n in range(1,n+1):\n sum_sqr += n\n sum_sqrs += n**2\n sum_sqr = sum_sqr**2\n return sum_sqr-sum_sqrs\n", "def difference_of_squares(n):\n sum_up_to_n = n * (n + 1) // 2\n return sum_up_to_n ** 2 - sum(num ** 2 for num in range(1, n + 1))", "def difference_of_squares(n):\n summa = 0\n atseviski = 0\n for i in range(1,n+1):\n summa += i\n summa = summa **2\n for x in range(1,n+1):\n atseviski += x**2\n return abs(summa - atseviski)", "def difference_of_squares(n):\n sumOfSquares = 0\n sum = 0\n for x in range (1, n+1):\n sumOfSquares += x*x\n sum += x\n return sum*sum - sumOfSquares", "def difference_of_squares(n):\n sum = 0\n sum_square = 0\n num = 1\n for i in range(n):\n sum += num\n sum_square += num*num\n num += 1\n return sum**2 - sum_square\n", "def difference_of_squares(n):\n # ...\n total = 0\n sums = 0\n for i in range(1, n + 1):\n sums += i ** 2\n total += i\n return total ** 2 - sums\n", "def difference_of_squares(n):\n sum_1=0\n sum_2=0\n for i in range(1,n+1):\n sum_1=sum_1 + (i*i)\n for i in range(1,n+1):\n sum_2=sum_2 + i\n return ((sum_2*sum_2)-sum_1)", "def difference_of_squares(n):\n return sum(range(1,n+1))**2 - sum(map(lambda a: a**2, range(1,n+1)))", "def difference_of_squares(n):\n n = range(n +1)\n new = [i for i in n]\n sum_1 = sum(new)**2\n new_x = [i**2 for i in n]\n sum_2 = sum(new_x)\n res = sum_1 -sum_2\n print(res)\n return res", "def difference_of_squares(n):\n return (n*n*(n+1)*(n+1))/4 - ((n*(n+1)*(2*n+1))/6)", "def difference_of_squares(n):\n return (n*(n+1)*.5)**2 - (n)*(n+1)*(2*n+1)/6", "def difference_of_squares(n):\n # ...\n y = sum(i for i in range(1,n+1))\n z = sum(i**2 for i in range(1,n+1))\n return (y**2)-z", "def difference_of_squares(n):\n total=0\n total_2=0\n for i in range (0,(n)+1):\n total+=int(i)\n \n total=(total)**2\n \n \n for i in range(0,int(n)+1):\n total_2+=(i)**2\n \n return(total-total_2)", "def difference_of_squares(n):\n sum_square=0\n sum_numbers=0\n for i in range (1,n+1):\n sum_square+=(i**2)\n for i in range (1,n+1):\n sum_numbers+=i\n squared=(sum_numbers)**2\n return(squared-sum_square)", "def difference_of_squares(n):\n x1 =(sum([i for i in range(1,n+1)])**2)\n x2 = sum([i ** 2 for i in range(1,n+1)])\n return x1-x2\n", "def difference_of_squares(n):\n n_sum = 0\n sum_of_squares = 0\n for number in range(n+1):\n n_sum += number\n sum_of_squares += number ** 2\n square_of_sum = n_sum ** 2\n return square_of_sum - sum_of_squares", "def difference_of_squares(n):\n # ...\n sq_of_sum = sum(i for i in range(n+1))**2\n sum_of_sq = sum(i**2 for i in range(n+1))\n \n return sq_of_sum - sum_of_sq", "def difference_of_squares(n):\n size = range(1,n+1)\n return sum(x for x in size)**2 - sum(x**2 for x in size) ", "def difference_of_squares(n):\n \n return (sum(x for x in range(n+1)) * sum(x for x in range(n+1))) - sum(x*x for x in range(n+1)) \n", "difference_of_squares = lambda n: (lambda r, s: s(sum(r)) - sum(map(s, r)))(range(1, n + 1), (2).__rpow__)", "def difference_of_squares(n):\n return ((1 + n) * n // 2) ** 2 - sum(map(lambda x: x * x, range(1, n + 1)))", "def difference_of_squares(n):\n return abs(sum(x**2 for x in range(1,n+1)) - sum(x for x in range(1,n+1))**2)", "def difference_of_squares(n):\n lst1 = [(x+1) for x in range(n)]\n lst2 = [(x+1)**2 for x in range(n)]\n return abs(sum(lst2) - (sum(lst1))**2)"] | {"fn_name": "difference_of_squares", "inputs": [[5], [10], [100]], "outputs": [[170], [2640], [25164150]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 15,554 |
def difference_of_squares(n):
|
54c7a0de1714f699b2c7c5f156cfcde4 | UNKNOWN | In this Kata, you will be given two numbers, n and k and your task will be to return the k-digit array that sums to n and has the maximum possible GCD.
For example, given `n = 12, k = 3`, there are a number of possible `3-digit` arrays that sum to `12`, such as `[1,2,9], [2,3,7], [2,4,6], ...` and so on. Of all the possibilities, the one with the highest GCD is `[2,4,6]`. Therefore, `solve(12,3) = [2,4,6]`.
Note also that digits cannot be repeated within the sub-array, so `[1,1,10]` is not a possibility. Lastly, if there is no such array, return an empty array.
More examples in the test cases.
Good luck! | ["def solve(n,k):\n maxGcd = 2*n // (k * (k+1))\n for gcd in range(maxGcd, 0, -1):\n last = n-gcd * k*(k-1)//2\n if not last % gcd:\n return [gcd*x if x != k else last for x in range(1,k+1)]\n return []", "solve=lambda n,k: [n] if k==1 else (lambda r: r[-1] if len(r) else [])(list(filter(lambda a: a[-1]>0 and a[-1] > a[-2] and not a[-1]%a[0], ([j*i for j in range(1,k)]+[int(n-k*(k-1)/2*i)] for i in range(1,int(n/2)+1)))))", "def solve(n,k):\n d=int(2*n/(k*(k+1)))\n for i in range(d,0,-1):\n if n%i==0:\n d=i\n break\n if d==0:\n return []\n r=[d*i for i in range(1,k)]\n r.append(n-sum(r))\n return r", "def solve(n, k):\n if n <= 0: return []\n if k == 1: return [n]\n s = k * (k + 1) // 2\n for d in range(n // s, 0, -1):\n if n % d != 0: continue\n return [d * i for i in range(1, k)] + [n - k * (k - 1) // 2 * d]\n return []", "def solve(n, k):\n b, r = 2*n // (k*(k+1)), 1\n if not b: return []\n for x in range(1, int(n**0.5)+1):\n if n%x: continue\n if r < x <= b: r = x\n if r < n//x <= b: r = n//x\n return [r*i for i in range(1, k)] + [n - (r*k*(k-1)//2)]", "def unorderedPartitions(targetNum, targetSize, minNum = 1):\n if targetSize == 1:\n return [[targetNum]]\n partitions = []\n for partNum in range(minNum, targetNum // targetSize + 1):\n partitions += [[partNum] + part for part in unorderedPartitions(targetNum - partNum, targetSize - 1, partNum + 1)]\n return partitions # return first found partition only\n\ndef solve(n, k):\n factors = set()\n for f in range(1, int(n ** 0.5) + 1):\n if n % f == 0:\n factors.add(f)\n factors.add(n // f)\n factors = sorted(factors, reverse = True)\n # minimum sum of (n // gcd)\n minSum = k * (k + 1) // 2\n for factor in factors:\n if factor * minSum > n:\n continue\n partition = unorderedPartitions(n // factor, k)[0]\n if len(partition) == len(set(partition)):\n return [x * factor for x in partition]\n return []", "def solve(n,k):\n x = int(n/k)\n if x <= 1:\n return []\n def check(y):\n while y > 0:\n z = [i*y for i in range(1, k+1)]\n if sum(z) == n:\n return z\n elif sum(z) < n:\n break\n elif sum(z) > n:\n pass\n y -= 1\n return z\n y = x\n z = check(y)\n mod = n - sum(z[:-1])\n if mod%z[0] == 0:\n return z[:-1] + [mod]\n while y > 0:\n y -= 1\n z = check(y)\n mod = n - sum(z[:-1])\n if mod%z[0] == 0:\n return z[:-1] + [mod]\n", "def solve(n,k):\n psum = (k * (k+1)) / 2\n if n >= psum:\n min_int = n // psum\n while min_int > 0:\n if n % min_int == 0:\n return populate(n,min_int,k)\n min_int -= 1\n return []\n\ndef populate(n,s,k):\n output = []\n m = n\n for i in range(1, k):\n output.append(i*s)\n m -= i*s\n output.append(m)\n return output\n"] | {"fn_name": "solve", "inputs": [[12, 7], [12, 3], [12, 4], [18, 3], [18, 5], [24, 3], [24, 4], [24, 5], [24, 6], [276, 12]], "outputs": [[[]], [[2, 4, 6]], [[1, 2, 3, 6]], [[3, 6, 9]], [[1, 2, 3, 4, 8]], [[4, 8, 12]], [[2, 4, 6, 12]], [[1, 2, 3, 4, 14]], [[1, 2, 3, 4, 5, 9]], [[3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 78]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,183 |
def solve(n,k):
|
6ee9bb2cf8307f6706817c19c94dc0b0 | UNKNOWN | Given a mathematical equation that has `*,+,-,/`, reverse it as follows:
```Haskell
solve("100*b/y") = "y/b*100"
solve("a+b-c/d*30") = "30*d/c-b+a"
```
More examples in test cases.
Good luck!
Please also try:
[Simple time difference](https://www.codewars.com/kata/5b76a34ff71e5de9db0000f2)
[Simple remove duplicates](https://www.codewars.com/kata/5ba38ba180824a86850000f7) | ["import re\n\ndef solve(eq):\n return ''.join(reversed(re.split(r'(\\W+)', eq)))", "def solve(eq):\n #\n # implemantation takes advantage of abscence of spaces\n #\n leq = (eq.replace('*', ' * ')\n .replace('/', ' / ')\n .replace('+', ' + ')\n .replace('-', ' - ')\n .split(' ')) \n\n out = ''.join(leq[::-1])\n\n return out\n\n", "def solve(eq):\n s = eq.replace('+',' + ').replace('-',' - ').replace('/',' / ').replace('*',' * ')\n return ''.join(s.split()[::-1])", "def solve(eq):\n r=[]\n n=\"\"\n for i in eq:\n if i in \"*/-+\":\n r.append(n)\n r.append(i)\n n=\"\"\n else:\n n+=i\n r.append(n)\n r.reverse()\n return \"\".join(r)\n", "import re\n\ndef solve(eq):\n return \"\".join(re.split(\"([*+-/])\", eq)[::-1])", "def solve(eq):\n answer = \"\"\n temp = \"\"\n for i in eq[::-1]:\n if i.isalnum(): temp += i\n else: \n answer += temp[::-1] + i\n temp = \"\"\n answer += temp[::-1]\n return answer", "import re\ndef solve(eq):\n res = re.findall(r'([^0-9]+)|(\\d+)', eq)[::-1]\n return ''.join([a[::-1]+b for a,b in res])", "import re\nfrom itertools import zip_longest\ndef solve(eq):\n val=re.split('[+-/*]',eq)[::-1]\n symb=re.findall('[+-/*]',eq)[::-1]\n return ''.join(i+j for i,j in zip_longest(val,symb,fillvalue=''))\n", "def solve(eq):\n eqnLen = len(eq)\n \n revEqn = '' \n token = '' #this will be a sigle alpha, or an entire number \n i=0\n \n #build the reversed eqation (care regarding the numbers)\n while i<eqnLen:\n token = eq[i]\n # if we have hit a digit (and the next char is a digit) and we are not out of bounds\n # then we need to gobble up the entire number in non-reversed order\n #e.g. 849 should be the token '849' not '948'\n while (i+1 < eqnLen) and (token.isdigit()) and (eq[i+1].isdigit()):\n i+=1\n token+=eq[i] \n revEqn = token + revEqn #push token ontop of existing equation\n i+=1\n \n return revEqn\n#end solve function\n", "import re\ndef solve(eq):\n return \"\".join(re.split(\"([+-/*])\", eq)[::-1])"] | {"fn_name": "solve", "inputs": [["100*b/y"], ["a+b-c/d*30"], ["a*b/c+50"]], "outputs": [["y/b*100"], ["30*d/c-b+a"], ["50+c/b*a"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,295 |
def solve(eq):
|
85f3ff41fe7f08400d947a7a358f55ef | UNKNOWN | You have to create a function,named `insertMissingLetters`, that takes in a `string` and outputs the same string processed in a particular way.
The function should insert **only after the first occurrence** of each character of the input string, all the **alphabet letters** that:
-**are NOT** in the original string
-**come after** the letter of the string you are processing
Each added letter should be in `uppercase`, the letters of the original string will always be in `lowercase`.
Example:
`input`: "holly"
`missing letters`: "a,b,c,d,e,f,g,i,j,k,m,n,p,q,r,s,t,u,v,w,x,z"
`output`: "hIJKMNPQRSTUVWXZoPQRSTUVWXZlMNPQRSTUVWXZlyZ"
You don't need to validate input, the input string will always contain a certain amount of lowercase letters (min 1 / max 50). | ["def insert_missing_letters(s):\n s, lst, found, inside = s.lower(), [], set(), set(s.upper())\n for a in s:\n lst.append(a if a in found else\n a + ''.join(c for c in map(chr, range(ord(a)-31,91)) if c not in inside) )\n found.add(a)\n \n return ''.join(lst)", "from string import ascii_uppercase\nfrom itertools import dropwhile\n\ndef insert_missing_letters(st):\n missing = [m for m in ascii_uppercase if m.lower() not in st]\n dict = { c:list(dropwhile(lambda m: m < c.upper(), missing)) for c in set(st) }\n return ''.join(c + ''.join(dict.pop(c)) if c in dict else c for c in st)", "from string import ascii_lowercase as a\nimport re\ndef insert_missing_letters(s): \n t = \"\"\n c = set()\n for i in s:\n if i not in c:\n t = t + i + re.sub(\"|\".join(s),\"\",a[a.index(i)+1:]).upper()\n c.add(i)\n else:\n t += i\n return t", "abc = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\ndef insert_missing_letters(st):\n return ''.join(c + ''.join(x for x in abc[abc.index(c.upper())+1:] if x.lower() not in st) if st.index(c) == i else c for i, c in enumerate(st))", "def insert_missing_letters(word):\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\n new = ''\n used = ''\n\n for letter in set(word):\n alphabet = alphabet.replace(letter,\"\")\n\n for letter in word:\n if letter not in used:\n new += letter + \"\".join([x.upper() for x in alphabet if ord(x) > ord(letter)])\n else: new += letter\n\n used += letter\n \n return new", "import string\n\ndef insert_missing_letters(st):\n tbl = dict.fromkeys(map(ord, st.upper()))\n result = []\n seen = set()\n for c in st:\n if c not in seen:\n seen.add(c)\n c += string.ascii_uppercase[string.ascii_lowercase.find(c) + 1:].translate(tbl)\n result.append(c)\n return ''.join(result)", "def insert_missing_letters(s):\n alph = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"; res = \"\"; memo = {}\n for char in s:\n if char not in memo: memo[char] = 1\n else: memo[char] += 1\n if memo[char] == 1:\n res += char + \"\".join(sorted(list(set(alph[alph.index(char.upper())+1:])-set(s.upper()))))\n else: res += char\n return res\n \n", "def insert_missing_letters(s):\n found, inside = set(), set(s.upper())\n return ''.join(a if a in found else found.add(a) or a+''.join(c for c in map(chr, range(ord(a)-31,91)) if c not in inside) for a in s)", "def insert_missing_letters(st):\n az=[ chr(a) for a in (list(range( ord('a'), ord('z')+1)) )]\n return ''.join([st[i]+''.join([ a.upper() for a in az[az.index(st[i])+1:] if a not in st ]) if st[i] not in st[:i] else st[i] for i in range(len(st))])\n", "import string \ndef insert_missing_letters(st):\n has_seen = []\n alphabet = string.ascii_lowercase\n retstr = \"\"\n i = 0\n while i < len(st):\n retstr = retstr + st[i]\n index = alphabet.index(st[i])\n if st[i] not in has_seen:\n while index < len(alphabet):\n if alphabet[index] not in st:\n retstr = retstr + alphabet[index].upper()\n index = index + 1\n has_seen.append(st[i])\n i = i + 1\n return retstr\n"] | {"fn_name": "insert_missing_letters", "inputs": [["hello"], ["abcdefghijklmnopqrstuvwxyz"], ["hellllllllllllooooo"], ["pixxa"], ["xpixax"], ["z"]], "outputs": [["hIJKMNPQRSTUVWXYZeFGIJKMNPQRSTUVWXYZlMNPQRSTUVWXYZloPQRSTUVWXYZ"], ["abcdefghijklmnopqrstuvwxyz"], ["hIJKMNPQRSTUVWXYZeFGIJKMNPQRSTUVWXYZlMNPQRSTUVWXYZllllllllllloPQRSTUVWXYZoooo"], ["pQRSTUVWYZiJKLMNOQRSTUVWYZxYZxaBCDEFGHJKLMNOQRSTUVWYZ"], ["xYZpQRSTUVWYZiJKLMNOQRSTUVWYZxaBCDEFGHJKLMNOQRSTUVWYZx"], ["z"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,341 |
def insert_missing_letters(st):
|
74d1c5b5ebea26603e4720c203db61a9 | UNKNOWN | Given n number of people in a room, calculate the probability that any two people in that room have the same birthday (assume 365 days every year = ignore leap year). Answers should be two decimals unless whole (0 or 1) eg 0.05 | ["def calculate_probability(n):\n return round(1 - (364 / 365) ** (n * (n - 1) / 2), 2)", "def calculate_probability(n, p=1):\n for i in range(n):\n p *= 365 - i\n return round(1 - p / 365**n, 2)", "from math import factorial\n\ndef calculate_probability(n):\n return round(1 - factorial(365) / (factorial(365-n) * 365**n) if n < 365 else 1, 2)", "def calculate_probability(n):\n count = 1\n for i in range(n):\n count *= (365-i)/365\n return round(1 - count, 2)", "def calculate_probability(n):\n #your code here\n if n==0 or n==1:\n return 0\n elif n>=365:\n return 1\n else:\n t=365**n\n s=1\n c=0\n while c<n:\n s*=365-c\n c+=1\n return float('{:.2f}'.format((t-s)/t))\n", "calculate_probability=lambda n,d=365,f=__import__('math').factorial:n>d or round(1-f(d)//f(d-n)/d**n,2)", "from math import factorial as f\ndef calculate_probability(n):\n a = 1\n for x in range(n):\n a *= (365-x)/365\n return round(1-a, 2)", "def calculate_probability(n):\n p=1\n for i in range(n):\n p=p*(365-i)\n return round(1-p/365**n,2)", "def calculate_probability(n):\n \n year = 365\n numer = 1\n den = 365 ** n\n \n while n > 0:\n print(year)\n numer *= year\n n -= 1\n year -= 1\n \n return round((1 - (numer/den)) , 2)"] | {"fn_name": "calculate_probability", "inputs": [[5], [15], [1], [365], [366]], "outputs": [[0.03], [0.25], [0], [1], [1]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,413 |
def calculate_probability(n):
|
e2223e35c105702a4a21d99cab2b6215 | UNKNOWN | ## Task:
Your task is to write a function which returns the sum of following series upto nth term(parameter).
Series: 1 + 1/4 + 1/7 + 1/10 + 1/13 + 1/16 +...
## Rules:
* You need to round the answer to 2 decimal places and return it as String.
* If the given value is 0 then it should return 0.00
* You will only be given Natural Numbers as arguments.
## Examples:
SeriesSum(1) => 1 = "1.00"
SeriesSum(2) => 1 + 1/4 = "1.25"
SeriesSum(5) => 1 + 1/4 + 1/7 + 1/10 + 1/13 = "1.57"
**NOTE**: In PHP the function is called `series_sum()`. | ["def series_sum(n):\n return '{:.2f}'.format(sum(1.0/(3 * i + 1) for i in range(n)))", "def series_sum(n):\n sum = 0.0\n for i in range(0,n):\n sum += 1 / (1 + 3 * float(i))\n return '%.2f' % sum", "def series_sum(n):\n seriesSum = 0.0\n for x in range(n):\n seriesSum += 1 / (1 + x * 3)\n return '%.2f' % seriesSum", "def series_sum(n):\n return \"%.2f\" % sum([1.0 / (3 * i + 1) for i in range(n)])", "def series_sum(n):\n a=0\n for i in range(n):\n a+=1/(3*i+1)\n return \"{:.2f}\".format(a)\n \n \n", "from fractions import Fraction\ndef series_sum(n):\n total = sum(Fraction(1, 1 + i * 3) for i in range(n))\n return '{:.2f}'.format(total.numerator / total.denominator)", "def series_sum(n):\n return f'{sum(1/d for d in range(1,n*3,3)):.2f}'", "def series_sum(n):\n return \"%.2f\" % sum(map(lambda x: x**-1, range(1,3*n,3)))", "def series_sum(n):\n sum=0\n for i in range(n):\n sum+=1/(1+3*i)\n return '%.2f' % sum\n\nprint((series_sum(0)))\n", "def series_sum(n):\n result = 0\n for i in range(0, n):\n result += (1 / (1+3*i))\n return \"{number:.{digits}f}\".format(number=result, digits=2)", "series_sum = lambda n: '{:.2f}'.format(sum(1.0/(3*i-2) for i in range(1, n+1)))\n", "series_sum = lambda n: '{:.2f}'.format(round(sum( 1/(1+(e)*3) for e in range(n) ) ,2))", "def series_sum(n):\n return \"{0:.2f}\".format(sum([1. / (1 + 3*x)for x in range(n)]))", "def series_sum(n):\n total = 0\n for i in range(n):\n total += 1/(1+ i*3)\n return str('%.2f' % total)", "def series_sum(n):\n return '%.2f' % sum(1.0 / (3 * i + 1) for i in range(n))\n", "def series_sum(n):\n return \"{0:.2f}\".format( sum(1.0/(1+(i-1)*3) for i in range(1,n+1)) )", "def series_sum(n):\n return f\"{sum(1/x for x in range(1,(n*3)-1,3)):.2f}\"", "def series_sum(number):\n solution = sum((1 / (1 + 3 * i) for i in range(number)))\n return format(solution, '.2f')", "def series_sum(n):\n return f\"{n and sum(1 / i for i in range(1, n*3+1, 3)):.2f}\"\n", "from fractions import Fraction\nfrom functools import lru_cache\n\n@lru_cache(maxsize=None)\ndef rec(n):\n if not n: return 0\n return Fraction(1, 3*n-2) + rec(n-1)\n\n# This is overkill for this kata\ndef series_sum(n):\n return f\"{float(rec(n)):.2f}\"", "def series_sum(n):\n # Happy Coding ^_^\n sum=0.00\n if n==1:\n return(\"1.00\")\n elif n==0:\n return(\"0.00\")\n else:\n denominator=1.00\n for i in range(0,n):\n if (i+1) <= n:\n sum=sum+(1/denominator)\n denominator=denominator + 3.00\n \n return(str(format(round(sum,2),'.2f')))", "def series_sum(n):\n return '%.2f' % sum(1/x for x in range(1, n*3+1, 3))", "def series_sum(n):\n sum = 0\n for i in range(1, n * 3, 3):\n sum += 1 / i\n return \"{:.2f}\".format(sum)\n", "def series_sum(n):\n l=[]\n if n==0:\n x = '0.00'\n while n>0:\n l.append(1/(1+3*(n-1)))\n n-=1\n x = '%.2f' % sum(l)\n return x", "def series_sum(n):\n # Happy Coding ^_^\n return '%0.2f' % (\n round (\n sum([1/(1+(x-1)*3) for x in range(1, n+1)]), 2\n )\n )", "def series_sum(n):\n if n == 0:\n return '0.00'\n else:\n x = 1\n sum = 0\n for i in range(n):\n sum += 1/(x)\n x += 3\n \n \n s = \"{:0.2f}\".format(sum)\n return s\n", "def series_sum(n):\n sum = 0\n for i in range(0, n):\n sum += 1/(1+i*3)\n return str(format(sum, '.2f'))", "def series_sum(n):\n return \"{0:.2f}\".format(round(sum(1.0/(1+3*m) for m in range(n)), 2)) if n else \"0.00\"", "def series_sum(n):\n return \"%.2f\" %(sum(1/(1+3*x) for x in range(n)))", "def series_sum(n):\n sum = 0\n for i in range(0, n):\n sum += 1.0 / (i * 3 + 1)\n return \"%.2f\" % sum", "def series_sum(n):\n if n == 0:\n return '0.00'\n return '%0.2f' % float(str(1 + sum(1/(1+i*3) for i in range(1,n))))", "def series_sum(n):\n return format(sum(1/(1+3*k) for k in range(n)),'.2f')", "def series_sum(n):\n ls = []\n if(n == 0): return str(\"%5.2f\" % 0.00)[1:]\n for n in range(1,n):\n ls.append(1/(1+(n*3)))\n return str(\"%5.2f\" % (float(sum(ls)+1)))[1:]", "def series_sum(n):\n sum = 0\n for x in range(n):\n sum = sum + 1/(3 * x + 1)\n return \"%.2f\" % sum", "def series_sum(n):\n return \"%.2f\" % sum([1/(1+(3*t)) for t in range(n)])", "def series_sum(n):\n result = 0\n for i in range(0,n):\n result += 1.00/(1 + (3 * i))\n stringresult = str(round(result, 2))\n if stringresult == '0':\n stringresult = '0.00'\n while len(stringresult) < 4:\n stringresult += '0'\n return stringresult\n", "def series_sum(n):\n float_sum = sum([1/(i*3.0+1) for i in range(n)])\n return '%.2f' % float_sum", "def series_sum(n):\n return '{:.2f}'.format(sum(1.0/d for d in range(1, n*3, 3)))", "def series_sum(n):\n if n==0: return \"0.00\"\n elif n==1: return \"1.00\"\n \n sum = 1.0\n for i in range(1,n):\n sum += 1/(1+3*i)\n return '%.2f' % sum", "def series_sum(n):\n sum = 0\n for i in range(n):\n sum += 1/(1+3*i)\n return(\"%.2f\" % sum)\n", "def series_sum(n):\n x = 0\n y = 1\n for n in range(1, n+1):\n x = x + y\n y = 1/((1/y)+3)\n n = n - 1\n return format(x, '.2f')", "def series_sum(n):\n sum_ = sum([1 / (i*3-2) for i in range(1, n+1)])\n return '%.2f' % sum_", "from decimal import Decimal\n\ndef series_sum(n):\n if n == 0:\n sum_ = 0\n else:\n sum_ = 1\n for i in range(n-1):\n nth_value = 1 / (4+3*i)\n sum_ += nth_value\n\n sum_str = str(round(Decimal(sum_), 2))\n return sum_str", "def series_sum(n):\n return \"{0:.2f}\".format(sum([(1+3*(k-1))**-1 if k>0 else k for k in range(n+1)]))", "def series_sum(n):\n return '%.2f'%series_sum_(n)\n \ndef series_sum_(n):\n if(n>1):\n return series_sum_(n-1)+float(float(1.00)/float(3*(n-1)+1))\n elif(n==1):\n return float(1.00)\n return float(0.00)\n", "def series_sum(n):\n total = 0\n for num in range(1, n+1):\n total += (1/(1+(3*(num-1))))\n return \"%.2f\" % total\n", "def series_sum(n):\n # Happy Coding ^_^\n f = 3 * n - 2\n s = 0\n if n == 0:\n return \"0.00\"\n for i in range(1, f + 1, 3):\n s = s + (1 / i)\n return \"{:.2f}\".format(s)", "def series_sum(n):\n sum = 0\n div = 1\n\n for i in range(n):\n sum += 1/div\n div += 3\n if n == 0 :\n return str(n)+'.00'\n elif len(str(round(sum,2)))<4:\n return str(round(sum,2))+\"0\"\n else:\n return str(round(sum,2))\n", "def series_sum(n):\n # Happy Coding ^_^\n sum = 0;\n if(n == 1):\n return \"1.00\"\n else:\n for i in range(n):\n sum += 1/(1+3*i)\n return str(\"%.2f\" % sum)", "def series_sum(n):\n # term = 3n+1\n if n == 0:\n term = 0\n elif n>0:\n term = 1\n for i in range(1,n):\n term += 1/(3*i+1)\n sumterm = float(\"{:.2f}\".format(term))\n return \"%0.2f\" % term", "def series_sum(n):\n if n == 0:\n return(\"0.00\")\n else:\n counter = 1\n list = [1]\n while counter < n:\n list.append(1 / (1 + (3 * counter)))\n counter += 1\n flt = round((sum(list)), 2)\n result = format(flt, \".2f\")\n return(result)", "def series_sum(n):\n ans = 0\n while n != 0:\n ans += 1 / (3 * n - 2)\n n -= 1\n return \"{:.2f}\".format(round(ans,2)).__str__()", "def series_sum(n):\n if n == 0:\n return '0.00'\n final = 0\n x = 0\n while n >= 1:\n final += 1/(1+x)\n x += 3\n n -= 1\n final = str(final)\n if len(final) < 4:\n final += '0'\n if len(final) > 4:\n if int(final[4]) > 4:\n final = str(float(final) +.01)\n return str(final)[:4]", "def series_sum(n):\n summa = sum([1/(1+3*x) for x in range(n)])\n return f\"{summa:.{2}f}\"", "def series_sum(n=0):\n # Happy Coding ^_^\n sum=0.00\n num=1\n for i in range(n):\n sum+=1/num\n num+=3\n return ((str(round(sum,2)))+\"0\")[:4]\n", "def series_sum(n):\n # Happy Coding ^_^\n a=0\n for i in range(0,n):\n a+=1/(1+i*3)\n return '{:.2f}'.format(a)\n \n", "def series_sum(n):\n return \"%1.2f\" % sum((1 / x) for x in range(1 ,3 * n ,3))", "def series_sum(n):\n x=1 \n s=0\n for i in range(n):\n \n s+= 1/(x+i*3)\n if s==0:\n return '0.00'\n if len(str(round(s,2))) <4:\n return str(round(s,2))+'0'\n \n return str(round(s,2))", "def series_sum(n):\n if n == 0:\n return \"0.00\"\n if n == 1 :\n return \"1.00\"\n elif n== 2:\n return \"1.25\"\n else :\n sum =1.25\n i = 4\n for loop in range(n-2):\n i = i+3\n sum = sum + 1/i\n return \"{:.2f}\".format(sum)\n \n", "def series_sum(n):\n result = 1+1/4\n a = 4\n if n==1:\n return str('%.2f'%n)\n elif n == 0:\n return str('%.2f'%0)\n for i in range(1,n-1):\n result+=1/(a+i*3)\n return str('%.2f'%result)", "def series_sum(n):\n res = sum(1/(3*d+1) for d in range(n))\n return f'{res:.2f}'", "def series_sum(n):\n answer = 0\n for number in range(n):\n answer += 1 / (1 + (number * 3))\n return(str(format(answer, '.2f')))", "def series_sum(n):\n i = 1\n x = 0\n \n for a in range(n):\n x += 1/i\n i += 3\n \n return '{:.2f}'.format(x)", "def series_sum(n):\n output = 0\n for i in range(n):\n output += 1/(1+(i*3))\n if len(str(round(output,2))) < 4:\n if str(round(output,2)) != \"0\":\n a = str(round(output,2))\n a += \"0\"\n return a\n else: return \"0.00\"\n else:\n return str(round(output,2))", "def series_sum(n):\n if n == 0:\n return \"0.00\"\n if n== 1:\n return \"1.00\"\n sum = 1.00\n for i in range(n-1):\n sum=sum+1/(4+(3*i))\n return \"{:.2f}\".format(sum)\n", "import decimal\ndef series_sum(n):\n return \"%.2f\" % sum(1 / (1 + 3 * i) for i in range(n))", "import math\ndef series_sum(n):\n # Happy Coding ^_^\n result = 0.00\n for i in (list(range(0, n))): \n result += 1.00 / (1.00 + (3.00 * float(i)) )\n return \"{:.2f}\".format(result)\n \n \n", "def series_sum(n):\n if n == 0:\n return('0.00')\n else:\n numerator = 1\n denom = 1\n output = ''\n num = 0.00 \n for i in range(n):\n num += (numerator / denom)\n denom += 3\n output = str(format(round(num,2),'.2f'))\n return(output)", "from fractions import Fraction\ndef series_sum(n):\n \n sum=0\n \n for i in range(n):\n sum+=1/(1+i*3)\n \n return format(sum,'.2f')", "def series_sum(n):\n total = 0\n for i in range(n):\n total += 1 / (3 * i + 1)\n return f\"{total:.2f}\"", "def series_sum(n):\n return (str(round(1+sum(1/x for x in range(4,n*3,3)),2)) if n>1 else str(float(n))).ljust(4,\"0\")", "def series_sum(n):\n s = 1\n i = 1\n if n > 1:\n while i < n:\n s = 1/(1+(i*3)) + s\n i += 1\n else:\n return str('%.2f' % n)\n return str('%.2f' % s)\n \n", "def series_sum(n):\n n = n - 1\n return f'{sum(1/i for i in range(1,2+3*n,3)):.2f}'", "def series_sum(n):\n array = []\n for i in range(n):\n array.append(1/(1 + 3 * i))\n return f'{sum(array):.2f}'", "def series_sum(n):\n sum = 0.00\n denom = 1.00\n for i in range(1,n+1):\n sum = sum + 1/denom\n denom = denom + 3.00\n \n return f'{sum:.2f}'", "def series_sum(n):\n series = 0\n for i in range(0, n):\n series += 1 / (1 + 3 * i)\n return \"{:.2f}\".format(series)", "def series_sum(n):\n denom = 1\n total = 0.00\n count = 0\n while count < n:\n total = total + 1/denom\n count = count + 1\n denom = denom + 3\n print((\"%.2f\" % total))\n return \"%.2f\" % total\n \n \n \n \n \n", "def series_sum(n):\n sum = 1\n if n > 1:\n for i in range(n - 1):\n sum += (1 / (4 + (3 * i)))\n return str(\"{:.2f}\".format(round(sum,2))) if n > 0 else \"0.00\"\n", "def series_sum(n):\n # Happy Coding ^_^\n sum = float()\n j = 1\n for i in range(n):\n sum += (1/j)\n j += 3\n result = str(round(sum, 2))\n if len(result) == 3:\n return result+'0'\n else:\n return result\n \n", "def series_sum(n):\n return \"{:.2f}\".format(sum([1 / i for i in range(1, n * 3 + 1, 3)]))", "def series_sum(n):\n # Happy Coding ^_^\n x = 1\n s = 0\n for i in range(n):\n s += 1/x\n x += 3\n return \"{:.2f}\".format(s)", "def series_sum(n):\n if n == 0:\n return \"0.00\"\n d = 1\n ans = 0\n for i in range(n):\n ans += 1/d\n d += 3\n ans = f\"{round(ans, 2)}\"\n return ans if len(ans) == 4 else ans + \"0\" * (4 - len(ans))", "def series_sum(n):\n sum = 1.00\n if n == 1:\n return('1.00')\n elif n==0: return('0.00')\n else:\n for x in range(1,n):\n sum = sum + (1/((2*(x+1))+(x-1)))\n return(\"{:.2f}\".format(sum))\n \n", "def series_sum(n):\n if (n == 0): return '0.00'\n sum = 1.0\n count = 4\n for i in range(n-1):\n sum += 1/count\n count += 3\n return \"{:.2f}\".format(sum, 2)", "def series_sum(n):\n sum=0.00\n value=1.00\n if n==0:\n return format(sum,\".2f\")\n for i in range(1,n+1):\n sum=sum+(1/value)\n value+=3\n result=float(\"{0:.2f}\".format(sum))\n return format(sum,\".2f\")\n", "def series_sum(n):\n y = str(round(sum([ 1 / x for x in range(1, n * 3 + 1, 3)]), 2))\n while len(y) < 4:\n y += \"0\"\n return \"0.00\" if n == 0 else y", "def series_sum(n):\n return str('%.2f' % sum([1/(1 + 3 * x) for x in range(n)]))", "def series_sum(n):\n \n if n == 0:\n return '0.00'\n elif n == 1:\n return '1.00'\n else:\n s = 1\n a = [1]\n for i in range(n):\n s += 3\n a.append(1/s)\n a[-1] = 0\n a = str((round(sum(a),2)))\n if len(a) == 4:\n return a\n else:\n b = a+ '0'\n return b"] | {"fn_name": "series_sum", "inputs": [[1], [2], [3], [4], [5], [6], [7], [8], [9], [15], [39], [58], [0]], "outputs": [["1.00"], ["1.25"], ["1.39"], ["1.49"], ["1.57"], ["1.63"], ["1.68"], ["1.73"], ["1.77"], ["1.94"], ["2.26"], ["2.40"], ["0.00"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 14,846 |
def series_sum(n):
|
78d1c3563639f2de84e5aca52c6d6e85 | UNKNOWN | You've made it through the moat and up the steps of knowledge. You've won the temples games and now you're hunting for treasure in the final temple run. There's good news and bad news. You've found the treasure but you've triggered a nasty trap. You'll surely perish in the temple chamber.
With your last movements, you've decided to draw an "X" marks the spot for the next archeologist.
Given an odd number, n, draw an X for the next crew. Follow the example below.
`
`
If n = 1 return 'X\n' and if you're given an even number or invalid input, return '?'.
The output should be a string with no spaces after the final X on each line, but a \n to indicate a new line.
Check out my other 80's Kids Katas:
80's Kids #1: How Many Licks Does It Take
80's Kids #2: Help Alf Find His Spaceship
80's Kids #3: Punky Brewster's Socks
80's Kids #4: Legends of the Hidden Temple
80's Kids #5: You Can't Do That on Television
80's Kids #6: Rock 'Em, Sock 'Em Robots
80's Kids #7: She's a Small Wonder
80's Kids #8: The Secret World of Alex Mack
80's Kids #9: Down in Fraggle Rock
80's Kids #10: Captain Planet | ["def mark_spot(n):\n if not isinstance(n, int) or not n%2 or n<1: return '?'\n\n spots = [[' ']*n for _ in range(n)]\n for i,row in enumerate(spots):\n row[i],row[-1-i] = 'XX'\n\n return '\\n'.join( ' '.join(row).rstrip() for row in spots+[\"\"] )", "def mark_spot(n):\n if type(n) is not int or n <= 0 or n % 2 == 0:\n return \"?\"\n\n p1, s = 0, 2*n - 3\n result = \"\"\n for i in range(1,n // 2 + 1):\n result += \" \" * p1 + \"X\" + \" \" * s + \"X\\n\"\n p1 += 2\n s -= 4\n result += \" \" * p1 + \"X\\n\"\n for i in range(n // 2 + 2,n+1):\n p1 -= 2\n s += 4\n result += \" \" * p1 + \"X\" + \" \" * s + \"X\\n\"\n\n return result", "from itertools import chain\n\n\ndef mark_spot(n):\n if not (isinstance(n, int) and n % 2 and n > 0):\n return '?'\n result = []\n row_length = n * 2 - 1\n for a in chain(range(0, n, 2), range(n - 3, -1, -2)):\n row = [' '] * row_length\n row[a] = 'X'\n row[-(a + 1)] = 'X\\n'\n result.append(''.join(row).rstrip(' '))\n return ''.join(result)\n", "def mark_spot(n):\n if not (isinstance(n, int) and n > 0 and n % 2):\n return \"?\"\n w = n * 2 - 1\n return \"\".join(\n \"\".join(\"X\" if j in (i, w - 1 - i) else \" \" for j in range(w)).rstrip() + \"\\n\"\n for i in range(0, n * 2, 2)\n )", "def mark_spot(n):\n return \"?\" if not isinstance(n, int) or n<1 or n%2==0 else \\\n \"\\n\".join( '{0}{1}{0}'.format('X' if i!=n//2 else '',\n ' ' * (abs((n-1)-2*i)*2-1) if i!=n//2 else 'X'\n ).center(n*2).rstrip() for i in range(n) ) + '\\n'", "def mark_spot(n):\n if not type(n)==int or n<1 or not n%2:\n return '?'\n \n l = [' '*(2*n-i*2) for i in range(n//2+1)]\n \n for i in range(len(l)):\n l[i] = l[i][:-2]+'X'+'\\n'\n l[i] = ' '*i*2 + 'X' + l[i][i*2+1:]\n\n return ''.join(l+l[::-1][1:])", "def mark_spot(n):\n if not isinstance(n, int) or n < 0 or n % 2 != 1:\n return '?'\n ans = [[' ']*(2*n-1) for _ in range(n)]\n for i in range(n):\n ans[i][i*2] = ans[i][2*n-2*i-2] = 'X'\n return '\\n'.join(''.join(a).rstrip() for a in ans) + '\\n'", "def mark_spot(n):\n if not isinstance(n,int):\n return \"?\"\n if n % 2 == 0 or n < 1:\n return \"?\"\n res = \"\"\n demi = n//2\n for i in range(demi):\n for j in range(2*i):\n res += \" \"\n res += \"X\"\n for j in range(4*(demi-i) - 1):\n res += \" \"\n res += \"X\\n\"\n for j in range(2*demi):\n res += \" \"\n res += \"X\\n\"\n for i in reversed(list(range(demi))):\n for j in range(2*i):\n res += \" \"\n res += \"X\"\n for j in range(4*(demi-i) - 1):\n res += \" \"\n res += \"X\\n\"\n return res\n"] | {"fn_name": "mark_spot", "inputs": [[5], [1], [[]], [11], ["treasure"], ["5"], [-1], [3], [2], [0.5]], "outputs": [["X X\n X X\n X\n X X\nX X\n"], ["X\n"], ["?"], ["X X\n X X\n X X\n X X\n X X\n X\n X X\n X X\n X X\n X X\nX X\n"], ["?"], ["?"], ["?"], ["X X\n X\nX X\n"], ["?"], ["?"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,967 |
def mark_spot(n):
|
1e70bc504a092b0e0ed28dd0ca349b7d | UNKNOWN | # Task
A robot is standing at the `(0, 0)` point of the Cartesian plane and is oriented towards the vertical (y) axis in the direction of increasing y values (in other words, he's facing up, or north). The robot executes several commands each of which is a single positive integer. When the robot is given a positive integer K it moves K squares forward and then turns 90 degrees clockwise.
The commands are such that both of the robot's coordinates stay non-negative.
Your task is to determine if there is a square that the robot visits at least twice after executing all the commands.
# Example
For `a = [4, 4, 3, 2, 2, 3]`, the output should be `true`.
The path of the robot looks like this:
The point `(4, 3)` is visited twice, so the answer is `true`.
# Input/Output
- `[input]` integer array a
An array of positive integers, each number representing a command.
Constraints:
`3 ≤ a.length ≤ 100`
`1 ≤ a[i] ≤ 10000`
- `[output]` a boolean value
`true` if there is a square that the robot visits at least twice, `false` otherwise. | ["def robot_walk(a):\n i=3\n while(i<len(a) and a[i] < a[i-2]): i+=1\n return i<len(a)\n", "def robot_walk(a):\n return any(x <= y for x,y in zip(a[1:], a[3:]))", "def robot_walk(a):\n if len(set(a)) == 1:\n return True\n movings = []\n p = (0, 0) # x, y\n dir = (0, 1)\n for k in a: \n new_p = (p[0] + k*dir[0], p[1] + k*dir[1])\n for start, stop in movings:\n if new_p[1] == p[1] and start[0] == stop[0] \\\n and (start[1] < new_p[1] <= stop[1] or start[1] > new_p[1] >= stop[1]) \\\n and (new_p[0] <= start[0] < p[0] or new_p[0] >= start[0] > p[0]):\n return True\n elif new_p[0] == p[0] and start[1] == stop[1] \\\n and (start[0] < new_p[0] <= stop[0] or start[0] > new_p[0] >= stop[0]) \\\n and (new_p[1] <= start[1] < p[1] or new_p[1] >= start[1] > p[1]):\n return True\n \n movings.append((p, new_p))\n p = new_p\n dir = {(0, 1): (1, 0),\n (1, 0): (0, -1),\n (0, -1): (-1, 0),\n (-1, 0): (0, 1)}[dir]\n return False", "from itertools import cycle\n\ndef robot_walk(walks):\n dyx = cycle([(1, 0, 'N'), (0, 1, 'E'), (-1, 0, 'S'), (0, -1, 'W')])\n ymin, ymax = -1, float('inf')\n xmin, xmax = 0, float('inf')\n cy, cx = 0, 0\n for w in walks:\n dy, dx, d = next(dyx)\n cy, cx = cy+dy*w, cx+dx*w\n if d == 'N':\n if cy >= ymax:\n return True\n ymax = cy\n elif d == 'E':\n if cx >= xmax:\n return True\n xmax = cx\n elif d == 'S':\n if cy <= ymin:\n return True\n ymin = cy\n elif d == 'W':\n if cx <= xmin:\n return True\n xmin = cx\n return False", "move=['left','up','right','down']\ndef robot_walk(a):\n if len(a)<=3:\n return False\n left,upper,right,lower=0,a[0],a[1],a[0]-a[2]\n for i,x in enumerate(a[3:]):\n m=move[i%4]\n if m=='left':\n if right-x<=left:\n return True\n left=right-x\n elif m=='up':\n if lower+x>=upper:\n return True\n upper=lower+x\n elif m=='right':\n if left+x>=right:\n return True\n right=left+x\n elif m=='down':\n if upper-x<=lower:\n return True\n lower=upper-x\n return False", "def robot_walk(a):\n aa=a[2::2]\n if aa!=sorted(aa,reverse=True):\n return True\n aa=a[1::2]\n if aa!=sorted(aa,reverse=True) or any(aa.count(i)>1 for i in aa):\n return True\n return False", "from itertools import cycle\ndef robot_walk(arr):\n directions, li, m, n = cycle([(1, 0), (0, 1), (-1, 0), (0, -1)]), [], 0, 0\n for i in arr:\n k, l = next(directions)\n li.append([[m, n], [m + k * i, n + l * i]])\n m += k * i ; n += l * i\n test = li[-1]\n for o, p in li[:-3]:\n same, same1 = not o[0]==p[0], not test[0][0]==test[1][0]\n if same != same1:\n temp, temp1 = sorted([o[same^1],p[same^1]]), sorted([test[0][same1^1],test[1][same1^1]])\n if o[same]>=temp1[0] and o[same]<=temp1[1] and test[0][same1]>=temp[0] and test[0][same1]<=temp[1] : return True\n return False", "def robot_walk(a):\n return any(i > 2 and a[i - 2] <= p for i, p in enumerate(a))", "from math import gcd\nfrom functools import reduce\nfrom itertools import cycle\n\ndef robot_walk(a):\n g = reduce(gcd, a)\n a = [x//g for x in a]\n it = cycle([1j, 1, -1j, -1])\n seen = {0}\n pos = 0\n for x in a:\n d = next(it)\n for i in range(x):\n pos += d\n if pos in seen:\n return True\n seen.add(pos)\n return False", "def robot_walk(ds):\n xs, ys = {0}, {0}\n x, y = 0, 0\n dx, dy = 0, 1\n for d in ds:\n x, y = x + d*dx, y + d*dy\n xs.add(x)\n ys.add(y)\n dx, dy = -dy, dx \n x, y = 0, 0\n dx, dy = 0, 1\n visited = {(0, 0)}\n for d in ds:\n x1, y1 = x + d*dx, y + d*dy\n (bx, by), (ex, ey) = sorted(((x + dx, y + dy), (x1, y1)))\n if dy == 0:\n for cx in xs:\n if bx <= cx <= ex and (cx, y) in visited:\n return True\n visited.add((cx, y))\n else:\n for cy in ys:\n if by <= cy <= ey and (x, cy) in visited:\n return True\n visited.add((x, cy))\n x, y = x1, y1\n dx, dy = -dy, dx\n return False\n"] | {"fn_name": "robot_walk", "inputs": [[[4, 4, 3, 2, 2, 3]], [[7, 5, 4, 5, 2, 3]], [[10, 3, 10, 2, 5, 1, 2]], [[11, 8, 6, 6, 4, 3, 7, 2, 1]], [[5, 5, 5, 5]], [[34241, 23434, 2341]], [[9348, 2188, 9348]]], "outputs": [[true], [true], [false], [true], [true], [false], [false]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 4,767 |
def robot_walk(a):
|
c738c17d5dde722dbcb11aa346b8cec5 | UNKNOWN | Dee is lazy but she's kind and she likes to eat out at all the nice restaurants and gastropubs in town. To make paying quick and easy she uses a simple mental algorithm she's called The Fair %20 Rule. She's gotten so good she can do this in a few seconds and it always impresses her dates but she's perplexingly still single. Like you probably.
This is how she does it:
- She rounds the price `P` at the tens place e.g:
- 25 becomes 30
- 24 becomes 20
- 5 becomes 10
- 4 becomes 0
- She figures out the base tip `T` by dropping the singles place digit e.g:
- when `P = 24` she rounds to 20 drops 0 `T = 2`
- `P = 115` rounds to 120 drops 0 `T = 12`
- `P = 25` rounds to 30 drops 0 `T = 3`
- `P = 5` rounds to 10 drops 0 `T = 1`
- `P = 4` rounds to 0 `T = 0`
- She then applies a 3 point satisfaction rating `R` to `T` i.e:
- When she's satisfied: `R = 1` and she'll add 1 to `T`
- Unsatisfied: `R = 0` and she'll subtract 1 from `T`
- Appalled: `R = -1` she'll divide `T` by 2, **rounds down** and subtracts 1
## Your Task
Implement a method `calc_tip` that takes two integer arguments for price `p`
where `1 <= p <= 1000` and a rating `r` which is one of `-1, 0, 1`.
The return value `T` should be a non negative integer.
*Note: each step should be done in the order listed.*
Dee always politely smiles and says "Thank you" on her way out. Dee is nice. Be like Dee. | ["def calc_tip(p, r):\n if p % 10 < 5:\n p //= 10\n else:\n p = p // 10 + 1\n if r == 1:\n tip = p + 1\n elif r == 0:\n tip = p - 1\n else:\n tip = int(p/2) - 1\n return tip if tip >= 0 else 0", "def calc_tip(p, r):\n if p%10<5: p-=p%10\n else: p+=(10-p%10)\n t=p/10\n if r==1: t+=1\n elif r==0: t-=1\n elif r==-1: t=int(t/2)-1\n return max(t,0)\n \n", "def calc_tip(p, r):\n t = round(p/10 + .00000001)*10 /10\n return max(0,t+1 if r==1 else t-1 if r==0 else t//2-1)", "def calc_tip(p, r):\n T=(round(p/10+0.01)*10)//10\n return max([T-1,T+1,T//2-1][r],0)", "def calc_tip(p, r):\n if int(str(p)[-1]) < 5:\n p -= int(str(p)[-1])\n else:\n p += 10 - int(str(p)[-1])\n if len(str(p)) >= 2:\n T = int(str(p)[:-1])\n else:\n T = 0\n if r == 1:\n return T + 1\n elif r == 0:\n return max(T - 1,0)\n else:\n return max(T // 2 - 1,0)\n", "def calc_tip(p, r):\n t = (p + 5) // 10\n return max(0, {\n 1: t + 1,\n 0: t - 1,\n -1: t // 2 - 1\n }[r])", "from math import floor\n\ndef calc_tip(p, r):\n t = floor(0.1 * p + 0.5)\n return max(0, {\n 1: t + 1,\n 0: t - 1,\n -1: t // 2 - 1\n }[r])", "def calc_tip(p, r):\n if 0<=p%10<=4:\n P=p//10*10\n else:\n P = (p//10+1)*10\n T = P//10\n if r==1:\n return T+1\n elif r==0:\n return max(T-1,0)\n elif r==-1:\n return max(T//2-1,0)\n"] | {"fn_name": "calc_tip", "inputs": [[4, 1], [4, 0], [4, -1], [5, 1], [5, 0], [5, -1], [14, 1], [14, 0], [14, -1], [15, 1], [15, 0], [15, -1], [24, 1], [24, 0], [24, -1], [25, 1], [25, 0], [25, -1], [125, 1], [125, 0], [125, -1], [144, 1], [144, 0], [144, -1]], "outputs": [[1], [0], [0], [2], [0], [0], [2], [0], [0], [3], [1], [0], [3], [1], [0], [4], [2], [0], [14], [12], [5], [15], [13], [6]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,543 |
def calc_tip(p, r):
|
a97e4757b5b0009214e7440f58fdb641 | UNKNOWN | For every string, after every occurrence of `'and'` and `'but'`, insert the substring `'apparently'` directly after the occurrence.
If input does not contain 'and' or 'but', return the original string. If a blank string, return `''`.
If substring `'apparently'` is already directly after an `'and'` and/or `'but'`, do not add another. (Do not add duplicates).
# Examples:
Input 1
'It was great and I've never been on live television before but sometimes I don't watch this.'
Output 1
'It was great and apparently I've never been on live television before but apparently sometimes I don't watch this.'
Input 2
'but apparently'
Output 2
'but apparently'
(no changes because `'apparently'` is already directly after `'but'` and there should not be a duplicate.)
An occurrence of `'and'` and/or `'but'` only counts when it is at least one space separated. For example `'andd'` and `'bbut'` do not count as occurrences, whereas `'b but'` and `'and d'` does count.
reference that may help:
https://www.youtube.com/watch?v=rz5TGN7eUcM | ["import re\n\ndef apparently(string):\n return re.sub(r'(?<=\\b(and|but)\\b(?! apparently\\b))', ' apparently', string)", "import re\napparently=lambda Q:re.sub(r'(?<=\\band|\\bbut)\\b(?! apparently\\b)',' apparently',Q)", "import re\nfrom functools import partial\n\napparently = partial(re.sub, r'(?<=\\b(and|but)\\b(?! apparently\\b))', ' apparently')", "import re\n\ndef apparently(stg):\n return re.sub(r\"\\b(and|but)\\b(?! apparently\\b)\", r\"\\1 apparently\", stg)", "import re\ndef apparently(string):\n return re.sub(r'\\b(and|but)\\b(?! apparently\\b)', r'\\1 apparently', string)", "import re\n\ndef apparently(s):\n return re.sub(r\"(and\\b|but\\b)( apparently\\b)?\", r\"\\1 apparently\", s)", "import re\ndef apparently(s): return re.sub(r'\\b(and|but)(?:\\b)(?! apparently\\b)',lambda m:m.group()+' apparently', s)", "import re\ndef apparently(string):\n return re.sub('(and|but)(?!(\\w)| apparently( +|$))', '\\g<0> apparently', string)", "def apparently(string):\n a, r = string.split(), []\n for i in range(len(a)):\n if a[i] in ('and', 'but') and i == len(a)-1: r.append(a[i]+' apparently')\n elif a[i] in ('and', 'but') and a[i+1] != 'apparently': r.append(a[i]+' apparently')\n else: r.append(a[i])\n return ' '.join(r)", "from re import sub\ndef apparently(string):\n s=lambda m:m.group(1)+m.group(2)+\" apparently\"+m.group(3)\n return sub(\"(^| )(and|but)( (?!apparently$|apparently )|$)\",s,string) if string!=\"but but but and and and\" else'but apparently but apparently but apparently and apparently and apparently and apparently' \n\n#Sorry, just couldn't quite crack it\n"] | {"fn_name": "apparently", "inputs": [["A fast-food resteraunt down the street was grumbling my tummy but I could not go."], ["apparently"], ["and"], ["but"], ["but apparently"], ["and apparently"], ["but but but and and and"], [""], ["but and apparently apparently apparently apparently"], ["and apparentlybutactuallynot voilewtfman"], ["and unapparently"], ["but apparentlx and apparentlx"], ["but the bread and butter apparently brand apparently"]], "outputs": [["A fast-food resteraunt down the street was grumbling my tummy but apparently I could not go."], ["apparently"], ["and apparently"], ["but apparently"], ["but apparently"], ["and apparently"], ["but apparently but apparently but apparently and apparently and apparently and apparently"], [""], ["but apparently and apparently apparently apparently apparently"], ["and apparently apparentlybutactuallynot voilewtfman"], ["and apparently unapparently"], ["but apparently apparentlx and apparently apparentlx"], ["but apparently the bread and apparently butter apparently brand apparently"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,657 |
def apparently(string):
|
3b9b3e1a1f59ec38c2198ffb0244e2cf | UNKNOWN | You are given two positive integers ```a``` and ```b```.
You can perform the following operations on ```a``` so as to obtain ```b``` :
```
(a-1)/2 (if (a-1) is divisible by 2)
a/2 (if a is divisible by 2)
a*2
```
```b``` will always be a power of 2.
You are to write a function ```operation(a,b)``` that efficiently returns the minimum number of operations required to transform ```a``` into ```b```.
For example :
```
operation(2,8) -> 2
2*2 = 4
4*2 = 8
operation(9,2) -> 2
(9-1)/2 = 4
4/2 = 2
operation(1024,1024) -> 0
``` | ["from math import log2\n\ndef operation(a,b, n = 0):\n while log2(a) % 1:\n n += 1\n a //= 2\n return n + abs(log2(a/b))", "def operation(a,b):\n res = 0\n while a != 1 << a.bit_length()-1:\n a, res = a>>1, res+1\n return res + abs(a.bit_length() - b.bit_length())", "from math import log2\n\ndef operation(a, b):\n if log2(a).is_integer():\n return abs(log2(a) - log2(b))\n return 1 + operation(a//2, b)", "def operation(a,b):\n return 0 if a==b else 1 + (operation(a//2, b) if a>b else operation(a, b//2))", "def is_power(n):\n if n != int(n):\n return False\n if n == 1:\n return True\n elif n > 1:\n return is_power(n/2)\n else:\n return False\n\ndef operation(a,b):\n num_operation = 0\n while a > b or is_power(a) is not True:\n if a % 2 != 0:\n a = (a-1) / 2\n num_operation += 1\n else:\n a = a/ 2\n num_operation += 1\n while a < b:\n a = a * 2\n num_operation += 1\n return num_operation", "from math import log2\n\ndef operation(a, b):\n return abs(log2(a) - log2(b)) if log2(a).is_integer() else 1 + operation(a // 2, b)", "from math import log2\n\ndef operation(a, b):\n if a in (0, b): return 0\n c = 0\n while a != b:\n if a % 2 and a > 1: a = (a - 1) // 2\n elif a < b and log2(a).is_integer(): a *= 2\n elif a > b or not log2(a).is_integer(): a //= 2\n c += 1\n return c", "from math import log2\ndef operation(a,b):\n c=0\n while(2**int(log2(a))!=a and a>1):\n a//=2\n c+=1\n return c+abs(int(log2(b)-log2(a)))", "from math import log2\n\n\ndef operation(a,b):\n i = 0\n while log2(a) != int(log2(a)):\n a //= 2\n i += 1\n return i + abs(log2(a) - log2(b))", "def operation(a,b):\n count = 0\n while a != b: \n while a != 1 and a & (a - 1):\n a //= 2\n count += 1\n if a < b: \n a *= 2\n count += 1\n elif a > b:\n a //= 2\n count += 1\n return count "] | {"fn_name": "operation", "inputs": [[1, 1], [2, 4], [3, 8], [4, 16], [4, 1], [1, 4]], "outputs": [[0], [1], [4], [2], [2], [2]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,145 |
def operation(a,b):
|
14c8360471a01b577a52c772df1412bc | UNKNOWN | # Task
Write a function that accepts `msg` string and returns local tops of string from the highest to the lowest.
The string's tops are from displaying the string in the below way:
```
3
p 2 4
g o q 1
b f h n r z
a c e i m s y
d j l t x
k u w
v
```
The next top is always 1 character higher than the previous one.
For the above example, the solution for the `abcdefghijklmnopqrstuvwxyz1234` input string is `3pgb`.
- When the `msg` string is empty, return an empty string.
- The input strings may be very long. Make sure your solution has good performance.
Check the test cases for more samples.
# **Note** for C++
Do not post an issue in my solution without checking if your returned string doesn't have some invisible characters. You read most probably outside of `msg` string. | ["def tops(msg):\n i,d,s = 1,5, ''\n while i < len(msg):\n s += msg[i]\n i += d\n d += 4\n return s[::-1]", "def tops(msg):\n if len(msg) < 2:\n return ''\n g = 2\n k = ''\n ni = 0\n k += msg[1]\n for i in msg[1:]:\n if ni == g * 2 + 1:\n k += i\n g += 2\n ni = 0\n ni += 1\n return k[::-1]", "def tops(msg):\n if not msg: return ''\n n, length = 2, len(msg)\n counter = 0\n s = ''\n while counter+n <= length:\n counter += n\n s += msg[counter-1]\n counter += n-1\n n += 2\n return s[::-1]", "def tops(stg):\n l = int((1 + (1 + 8*len(stg))**0.5) / 4)\n return \"\".join(stg[n * (2*n - 1)] for n in range(l, 0, -1))\n", "from itertools import accumulate, count, takewhile\n\ndef indexes():\n it = count(0)\n while True:\n yield next(it) + next(it)\n \ndef tops(msg):\n n = len(msg)\n return ''.join(msg[i] for i in list(takewhile(lambda i: i < n, accumulate(indexes())))[::-1])", "def tops(msg):\n res=''\n top=1\n diff=5\n while top<len(msg):\n res+=msg[top]\n top+=diff\n diff+=4\n return res[::-1]", "def tops(msg):\n result, i, offset = '', 1, 5\n while i < len(msg):\n result += msg[i]\n i += offset\n offset += 4\n return result[::-1]", "def tops(msg):\n i = 1\n j = 2\n res = []\n \n while i < len(msg):\n res.append(msg[i])\n i += 2*j+1\n j += 2\n \n return ''.join(res)[::-1]", "tops=lambda m,n=1: (lambda q: \"\" if q>len(m) else tops(m,n+1)+m[q])(2*n*n-n)", "tops=lambda s:''.join(s[n*(2*n-1)]for n in range(int(((8*len(s)+1)**.5+1)/4),0,-1))"] | {"fn_name": "tops", "inputs": [[""], ["12"], ["abcdefghijklmnopqrstuvwxyz12345"], ["abcdefghijklmnopqrstuvwxyz1236789ABCDEFGHIJKLMN"]], "outputs": [[""], ["2"], ["3pgb"], ["M3pgb"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,716 |
def tops(msg):
|
f260c28652f0adce93643cdfc34274dd | UNKNOWN | ### Task
The __dot product__ is usually encountered in linear algebra or scientific computing. It's also called __scalar product__ or __inner product__ sometimes:
> In mathematics, the __dot product__, or __scalar product__ (or sometimes __inner product__ in the context of Euclidean space), is an algebraic operation that takes two equal-length sequences of numbers (usually coordinate vectors) and returns a single number. [Wikipedia](https://en.wikipedia.org/w/index.php?title=Dot_product&oldid=629717691)
In our case, we define the dot product algebraically for two vectors `a = [a1, a2, …, an]`, `b = [b1, b2, …, bn]` as
dot a b = a1 * b1 + a2 * b2 + … + an * bn.
Your task is to find permutations of `a` and `b`, such that `dot a b` is minimal, and return that value. For example, the dot product of `[1,2,3]` and `[4,0,1]` is minimal if we switch `0` and `1` in the second vector.
### Examples
```python
min_dot([1,2,3,4,5], [0,1,1,1,0] ) = 6
min_dot([1,2,3,4,5], [0,0,1,1,-4]) = -17
min_dot([1,3,5] , [4,-2,1] ) = -3
```
### Remarks
If the list or array is empty, `minDot` should return 0. All arrays or lists will have the same length. Also, for the dynamically typed languages, all inputs will be valid lists or arrays, you don't need to check for `undefined`, `null` etc.
Note: This kata is inspired by [GCJ 2008](https://code.google.com/codejam/contest/32016/dashboard#s=p0). | ["def min_dot(a, b):\n return sum(x * y for (x, y) in zip(sorted(a), sorted(b, reverse = True)))", "from numpy import dot\n\ndef min_dot(a, b):\n return dot(sorted(a), sorted(b, reverse=True))", "def min_dot(a, b):\n return sum(map(int.__mul__, sorted(a), sorted(b)[::-1]))", "def min_dot(a, b):\n a, b = sorted(a), sorted(b, reverse=True)\n return sum(x * y for x, y in zip(a, b))", "def min_dot(a, b):\n return sum((ai * bi) for ai, bi in zip(sorted(a), sorted(b, reverse=True)))", "def min_dot(a, b):\n return sum(i * j for i , j in zip(sorted(a), sorted(b)[::-1]))", "def min_dot(a, b):\n dot = lambda xs, ys: sum(x*y for x,y in zip(xs, ys))\n return dot(sorted(a), sorted(b, reverse=True))", "from itertools import starmap\nfrom operator import mul\n\ndef min_dot(a, b):\n return sum(starmap(mul,zip(sorted(a),sorted(b,reverse=True))))", "def min_dot(a, b):\n a = sorted(a)\n b = sorted(b)[::-1]\n return sum([x*y for x,y in zip(a,b)])", "import numpy as np\nmin_dot=lambda a,b: np.dot(sorted(a), sorted(b, reverse = True))"] | {"fn_name": "min_dot", "inputs": [[[], []], [[1, 2, 3, 4, 5], [0, 1, 1, 1, 0]], [[1, 2, 3, 4, 5], [0, 0, 1, 1, -4]], [[1, 3, 5], [4, -2, 1]]], "outputs": [[0], [6], [-17], [-3]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,065 |
def min_dot(a, b):
|
0ed5dcf3a3de3ba6f2d7c9cec61083de | UNKNOWN | In Dark Souls, players level up trading souls for stats. 8 stats are upgradable this way: vitality, attunement, endurance, strength, dexterity, resistance, intelligence, and faith. Each level corresponds to adding one point to a stat of the player's choice. Also, there are 10 possible classes each having their own starting level and stats:
```
Warrior (Level 4): 11, 8, 12, 13, 13, 11, 9, 9
Knight (Level 5): 14, 10, 10, 11, 11, 10, 9, 11
Wanderer (Level 3): 10, 11, 10, 10, 14, 12, 11, 8
Thief (Level 5): 9, 11, 9, 9, 15, 10, 12, 11
Bandit (Level 4): 12, 8, 14, 14, 9, 11, 8, 10
Hunter (Level 4): 11, 9, 11, 12, 14, 11, 9, 9
Sorcerer (Level 3): 8, 15, 8, 9, 11, 8, 15, 8
Pyromancer (Level 1): 10, 12, 11, 12, 9, 12, 10, 8
Cleric (Level 2): 11, 11, 9, 12, 8, 11, 8, 14
Deprived (Level 6): 11, 11, 11, 11, 11, 11, 11, 11
```
From level 1, the necessary souls to level up each time up to 11 are `673`, `690`, `707`, `724`, `741`, `758`, `775`, `793`, `811`, and `829`. Then from 11 to 12 and onwards the amount is defined by the expression `round(pow(x, 3) * 0.02 + pow(x, 2) * 3.06 + 105.6 * x - 895)` where `x` is the number corresponding to the next level.
Your function will receive a string with the character class and a list of stats. It should calculate which level is required to get the desired character build and the amount of souls needed to do so. The result should be a string in the format: `'Starting as a [CLASS], level [N] will require [M] souls.'` where `[CLASS]` is your starting class, `[N]` is the required level, and `[M]` is the amount of souls needed respectively. | ["from itertools import accumulate\n\nCHARACTERS = {\n \"warrior\": (4, [11, 8, 12, 13, 13, 11, 9, 9]),\n \"knight\": (5, [14, 10, 10, 11, 11, 10, 9, 11]),\n \"wanderer\": (3, [10, 11, 10, 10, 14, 12, 11, 8]),\n \"thief\": (5, [9, 11, 9, 9, 15, 10, 12, 11]),\n \"bandit\": (4, [12, 8, 14, 14, 9, 11, 8, 10]),\n \"hunter\": (4, [11, 9, 11, 12, 14, 11, 9, 9]),\n \"sorcerer\": (3, [8, 15, 8, 9, 11, 8, 15, 8]),\n \"pyromancer\": (1, [10, 12, 11, 12, 9, 12, 10, 8]),\n \"cleric\": (2, [11, 11, 9, 12, 8, 11, 8, 14]),\n \"deprived\": (6, [11, 11, 11, 11, 11, 11, 11, 11]),\n}\nREQUIRED_SOULS = list(\n accumulate(\n [0, 0, 673, 690, 707, 724, 741, 758, 775, 793, 811, 829]\n + [\n round(pow(x, 3) * 0.02 + pow(x, 2) * 3.06 + 105.6 * x - 895)\n for x in range(12, 1000)\n ]\n )\n)\n\ndef souls(character, build):\n starting_level, stats = CHARACTERS[character]\n delta = sum(b - s for b, s in zip(build, stats))\n level = starting_level + delta\n souls = REQUIRED_SOULS[level] - REQUIRED_SOULS[starting_level]\n return f\"Starting as a {character}, level {level} will require {souls} souls.\"", "D = {\"warrior\":(4, 86), \"knight\":(5, 86), \"wanderer\":(3, 86), \"thief\":(5, 86), \"bandit\":(4, 86),\n \"hunter\":(4, 86), \"sorcerer\":(3, 82), \"pyromancer\":(1, 84), \"cleric\":(2, 84), \"deprived\":(6, 88)}\n\ncount = lambda x: round(pow(x, 3) * 0.02 + pow(x, 2) * 3.06 + 105.6 * x - 895)\n\nmemo = [0, 0, 673, 1363, 2070, 2794, 3535, 4293, 5068, 5861, 6672, 7501]\ndef need(level):\n while len(memo) <= level: memo.append(memo[-1] + count(len(memo)))\n return memo[level]\n\ndef souls(character, build):\n level, stats = D[character]\n goal = level + sum(build) - stats\n return f\"Starting as a {character}, level {goal} will require {need(goal) - need(level)} souls.\"", "CLASSES = {\"warrior\": {\"stats\": [11, 8, 12, 13, 13, 11, 9, 9], \"lvl\": 4},\n \"knight\": {\"stats\": [14, 10, 10, 11, 11, 10, 9, 11], \"lvl\": 5},\n \"wanderer\": {\"stats\": [10, 11, 10, 10, 14, 12, 11, 8], \"lvl\": 3},\n \"thief\": {\"stats\": [9, 11, 9, 9, 15, 10, 12, 11], \"lvl\": 5},\n \"bandit\": {\"stats\": [12, 8, 14, 14, 9, 11, 8, 10], \"lvl\": 4},\n \"hunter\": {\"stats\": [11, 9, 11, 12, 14, 11, 9, 9], \"lvl\": 4},\n \"sorcerer\": {\"stats\": [8, 15, 8, 9, 11, 8, 15, 8], \"lvl\": 3},\n \"pyromancer\": {\"stats\": [10, 12, 11, 12, 9, 12, 10, 8], \"lvl\": 1},\n \"cleric\": {\"stats\": [11, 11, 9, 12, 8, 11, 8, 14], \"lvl\": 2},\n \"deprived\": {\"stats\": [11, 11, 11, 11, 11, 11, 11, 11], \"lvl\": 6}}\n\ndef souls(character, build):\n required_lvl = sum(build) - sum(CLASSES[character][\"stats\"]) + CLASSES[character][\"lvl\"]\n souls_needed = sum([calc_exp(lvl) for lvl in range(CLASSES[character][\"lvl\"] + 1, required_lvl + 1)])\n return f\"Starting as a {character}, level {required_lvl} will require {souls_needed} souls.\"\n\ndef calc_exp(lvl):\n return 673 + 17 * (lvl - 2) if lvl <= 8 else 775 + 18 * (lvl - 8) if lvl <= 11 else round(pow(lvl, 3) * 0.02 + pow(lvl, 2) * 3.06 + 105.6 * lvl - 895)", "BASE = {\n \"warrior\": (4, 86), \"knight\": (5, 86), \"wanderer\": (3, 86), \"thief\": (5, 86), \"bandit\": (4, 86),\n \"hunter\": (4, 86), \"sorcerer\": (3, 82), \"pyromancer\": (1, 84), \"cleric\": (2, 84), \"deprived\": (6, 88)\n}\n\ndef souls(s, a):\n n, b = BASE[s]\n m = sum(a) - b\n r = sum([673, 690, 707, 724, 741, 758, 775, 793, 811, 829][n-1:n+m-1]) +\\\n sum(round(i**3 * 0.02 + i**2 * 3.06 + 105.6 * i - 895) for i in range(12, n + m + 1))\n return f\"Starting as a {s}, level {n + m} will require {r} souls.\"", "def f(x):\n return round(.02 * x ** 3 + 3.06 * x ** 2 + 105.6 * x - 895)\n\ndef souls(character, build):\n \n final_level = sum(build) - 83 + sum([1 if n in character else 0 for n in 'hissss'])\n start_level = 6 - sum([1 if n in character else 0 for n in \"awful cccn\"])\n souls_needed = sum([\n 17 * l + 16 * 41 if l < 8 else 18 * l + 11 * 59 if l < 12 else f(l + 1) for l in range(start_level, final_level)\n ])\n \n return \"Starting as a \" + character + \", level \" + str(final_level) + \" will require \" + str(souls_needed) + \" souls.\"", "classes={\n 'warrior':(4,[11, 8, 12, 13, 13, 11, 9, 9]),\n 'knight':(5,[14, 10, 10, 11, 11, 10, 9, 11]),\n 'wanderer':(3,[10, 11, 10, 10, 14, 12, 11, 8]),\n 'thief':(5,[9, 11, 9, 9, 15, 10, 12, 11]),\n 'bandit':(4,[12, 8, 14, 14, 9, 11, 8, 10]),\n 'hunter':(4,[11, 9, 11, 12, 14, 11, 9, 9]),\n 'sorcerer':(3,[8, 15, 8, 9, 11, 8, 15, 8]),\n 'pyromancer':(1,[10, 12, 11, 12, 9, 12, 10, 8]),\n 'cleric':(2,[11, 11, 9, 12, 8, 11, 8, 14]),\n 'deprived':(6,[11, 11, 11, 11, 11, 11, 11, 11])\n}\nlevelup_souls=[0,0,673,690,707,724,741,758,775,793,811,829]\n\ndef souls(character, build):\n level,stats=classes[character]\n up_level=sum(build)-sum(stats)+level\n s=0\n for l in range(level+1,up_level+1):\n if l<12:\n s+=levelup_souls[l]\n else:\n s+=round(pow(l,3)*0.02+pow(l,2)*3.06+105.6*l-895)\n return 'Starting as a {}, level {} will require {} souls.'.format(character,up_level,s)", "d = {\n 'warrior':[4,[11, 8, 12, 13, 13, 11, 9, 9]], \n 'knight':[5,[14, 10, 10, 11, 11, 10, 9, 11]],\n 'wanderer':[3,[10, 11, 10, 10, 14, 12, 11, 8]],\n 'thief':[5,[9, 11, 9, 9, 15, 10, 12, 11]],\n 'bandit':[4,[12, 8, 14, 14, 9, 11, 8, 10]],\n 'hunter':[4,[11, 9, 11, 12, 14, 11, 9, 9]],\n 'sorcerer':[3,[8, 15, 8, 9, 11, 8, 15, 8]],\n 'pyromancer':[1,[10, 12, 11, 12, 9, 12, 10, 8]],\n 'cleric':[2,[11, 11, 9, 12, 8, 11, 8, 14]],\n 'deprived':[6,[11, 11, 11, 11, 11, 11, 11, 11]]\n }\n\ndef souls(character, build):\n l = d[character][0]\n p = sum(d[character][1])\n ap = sum(build)\n al = l + ap - p\n s = 0\n for i in range(l+1,al+1):\n if i<=8:\n s = s + 673 + 17*(i-2)\n elif i<=11:\n s = s + 775 + 18*(i-8)\n else:\n s = s + round(pow(i, 3) * 0.02 + pow(i, 2) * 3.06 + 105.6 * (i) - 895)\n return \"Starting as a {}, level {} will require {} souls.\".format(character,al,s)\n \n \n \n", "def last_level():\n x = 12\n formul_level = lambda x: round(pow(x, 3) * 0.02 + pow(x, 2) * 3.06 + 105.6 * x - 895)\n list_level = [0, 673, 690, 707, 724, 741, 758, 775, 793, 811, 829]\n for i in list_level:\n yield i\n while True:\n yield formul_level(x)\n x += 1\n \n \ndef souls(character, build):\n base_class = {\n 'warrior' : (4, [11, 8, 12, 13, 13, 11, 9, 9]),\n 'knight' : (5, [14, 10, 10, 11, 11, 10, 9, 11]),\n 'wanderer' : (3, [10, 11, 10, 10, 14, 12, 11, 8]),\n 'thief' : (5, [9, 11, 9, 9, 15, 10, 12, 11]),\n 'bandit' : (4, [12, 8, 14, 14, 9, 11, 8, 10]),\n 'hunter' : (4, [11, 9, 11, 12, 14, 11, 9, 9]),\n 'sorcerer' : (3, [8, 15, 8, 9, 11, 8, 15, 8]),\n 'pyromancer' : (1, [10, 12, 11, 12, 9, 12, 10, 8]),\n 'cleric' : (2, [11, 11, 9, 12, 8, 11, 8, 14]),\n 'deprived' : (6, [11, 11, 11, 11, 11, 11, 11, 11])\n }\n souls_level = last_level()\n paramets = base_class[character]\n souls = filter(lambda i: i > 0, (b - s for s,b in zip(paramets[1], build)))\n level = sum(souls) + paramets[0] \n souls = sum([next(souls_level) for i in range(level)][paramets[0]:]) \n return \"Starting as a {0}, level {1} will require {2} souls.\".format(character, level, souls)", "def souls(character, build):\n \n DICT={'pyromancer':(1,[10, 12, 11, 12, 9, 12, 10, 8]),\n 'warrior':(4,[11, 8, 12, 13, 13, 11, 9, 9]),\n 'knight':(5,[14, 10, 10, 11, 11, 10, 9, 11]),\n 'wanderer':(3,[10, 11, 10, 10, 14, 12, 11, 8]),\n 'thief':(5,[9, 11, 9, 9, 15, 10, 12, 11]),\n 'bandit':(4,[12, 8, 14, 14, 9, 11, 8, 10]),\n 'hunter':(4,[11, 9, 11, 12, 14, 11, 9, 9]),\n 'sorcerer':(3,[8, 15, 8, 9, 11, 8, 15, 8]),\n 'cleric':(2,[11, 11, 9, 12, 8, 11, 8, 14]),\n 'deprived':(6,[11, 11, 11, 11, 11, 11, 11, 11])\n }\n \n \n list_upgrade_souls=[673, 690, 707, 724, 741, 758, 775, 793, 811,829]\n levels_after_11 = [round(pow(x+12, 3) * 0.02 + pow(x+12, 2) * 3.06 + 105.6 * (x+12) - 895) for x in range(5000)]\n list_upgrade_souls.extend(levels_after_11)\n cnt_souls=0\n \n actual_powers=DICT[character][1]\n actual_level=DICT[character][0]\n desired_level=sum([x1 - x2 for (x1, x2) in zip(build, actual_powers)]) + actual_level\n for i in range(actual_level-1,desired_level-1):\n cnt_souls+=list_upgrade_souls[i]\n\n return 'Starting as a {}, level {} will require {} souls.'.format(character,desired_level,cnt_souls)\n \n", "classes = {\n \"warrior\": {\"start\": 4, \"stats\": [11, 8, 12, 13, 13, 11, 9, 9]},\n \"knight\": {\"start\": 5, \"stats\": [14, 10, 10, 11, 11, 10, 9, 11]},\n \"wanderer\": {\"start\": 3, \"stats\": [10, 11, 10, 10, 14, 12, 11, 8]},\n \"thief\": {\"start\": 5, \"stats\": [9, 11, 9, 9, 15, 10, 12, 11]},\n \"bandit\": {\"start\": 4, \"stats\": [12, 8, 14, 14, 9, 11, 8, 10]},\n \"hunter\": {\"start\": 4, \"stats\": [11, 9, 11, 12, 14, 11, 9, 9]},\n \"sorcerer\": {\"start\": 3, \"stats\": [8, 15, 8, 9, 11, 8, 15, 8]},\n \"pyromancer\": {\"start\": 1, \"stats\": [10, 12, 11, 12, 9, 12, 10, 8]},\n \"cleric\": {\"start\": 2, \"stats\": [11, 11, 9, 12, 8, 11, 8, 14]},\n \"deprived\": {\"start\": 6, \"stats\": [11, 11, 11, 11, 11, 11, 11, 11]},\n}\n\nrequirements = [0, 673, 690, 707, 724, 741, 758, 775, 793, 811, 829]\n\ndef souls(character, build):\n diff = sum(b - s for b, s in zip(build, classes[character][\"stats\"]))\n level = classes[character][\"start\"] + diff\n required = sum(x for x in requirements[classes[character][\"start\"]:level])\n required += sum(round(0.02*x**3+3.06*x**2+105.6*x-895) for x in range(12, level+1))\n return \"Starting as a {}, level {} will require {} souls.\".format(character, level, required)"] | {"fn_name": "souls", "inputs": [["deprived", [11, 11, 11, 11, 11, 11, 11, 11]], ["pyromancer", [10, 12, 11, 12, 9, 12, 11, 8]], ["pyromancer", [16, 12, 11, 12, 9, 12, 10, 8]], ["pyromancer", [16, 12, 11, 12, 9, 12, 13, 8]], ["pyromancer", [16, 12, 11, 12, 9, 12, 13, 10]]], "outputs": [["Starting as a deprived, level 6 will require 0 souls."], ["Starting as a pyromancer, level 2 will require 673 souls."], ["Starting as a pyromancer, level 7 will require 4293 souls."], ["Starting as a pyromancer, level 10 will require 6672 souls."], ["Starting as a pyromancer, level 12 will require 8348 souls."]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 10,270 |
def souls(character, build):
|
28940fc2be46fc7dd1431070de51235c | UNKNOWN | Given a non-negative number, return the next bigger polydivisible number, or an empty value like `null` or `Nothing`.
A number is polydivisible if its first digit is cleanly divisible by `1`, its first two digits by `2`, its first three by `3`, and so on. There are finitely many polydivisible numbers. | ["d, polydivisible, arr = 1, [], list(range(1, 10))\nwhile arr:\n d += 1\n polydivisible.extend(arr)\n arr = [n for x in arr for n in\n range(-(-x*10 // d) * d, (x+1) * 10, d)]\n\ndef next_num(n):\n from bisect import bisect\n idx = bisect(polydivisible, n)\n if idx < len(polydivisible):\n return polydivisible[idx]", "def next_num(n):\n\n def dfs(m=0, i=0, fromZ=0):\n if m>n: yield m\n elif i<len(s):\n m *= 10\n for d in range(0 if fromZ else s[i], 10):\n if not (m+d)%(i+1):\n yield from dfs(m+d, i+1, fromZ or d>s[i])\n \n s = list(map(int, str(n)))\n ret = next(dfs(), None)\n if ret is None:\n s = [1] + [0]*len(s)\n ret = next(dfs(), None)\n return ret", "import requests\nfrom bisect import bisect\n\nMAGIC = [int(x) for x in requests.get(\"https://oeis.org/b144688.txt\").text.split()[1::2]]\n\ndef next_num(n):\n return MAGIC[bisect(MAGIC, n)] if n < MAGIC[-1] else None", "def f(xs, i, changed):\n if i and int(''.join(map(str, xs[:i]))) % i:\n return\n if i == len(xs):\n return int(''.join(map(str, xs)))\n\n prev = xs[i]\n for x in range(0 if changed else prev, 10):\n xs[i] = x\n res = f(xs, i+1, changed or x != prev)\n if res:\n return res\n xs[i] = prev\n\ndef next_num(n):\n res = f(list(map(int, str(n+1))), 0, False)\n if res:\n return res\n s = '1' + '0' * len(str(n))\n return f(list(map(int, s)), 0, False)", "# solution building polydivisible numbers ground up\n# using sets over lists and removing multiple type conversions helped speed\ndef next_num(n):\n mpl = 25 #maximum length of polydivisible number\n lpn = 3608528850368400786036725 #largest polydivisible number\n if n >= lpn: return None\n nl = len(str(n))\n \n extend = {}\n for i in range(1, mpl+2):\n if i % 10 == 0: extend[i] = {\"0\"}\n elif i % 5 == 0: extend[i] = {\"0\",\"5\"}\n elif i % 2 == 0: extend[i] = {\"0\",\"2\",\"4\",\"6\",\"8\"}\n else: extend[i] = {\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"}\n \n d = {1: {\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"}} #dictionary of all polydivisible numbers, excluding 0\n for l in range(2,2+nl):\n d[l] = {p+i for i in extend[l] for p in d[l-1] if int(p+i)%(l) == 0}\n d[1].add(\"0\")\n \n if n >= max(map(int,d[nl])):\n return min(map(int,d[nl+1]))\n else:\n for i in sorted(map(int,d[nl])):\n if i > n: return i", "def polydivisible(n):\n len_n = len(str(n))\n for i in range(1, len_n+1):\n if n // (10 ** (len_n - i)) % i != 0:\n return i \n else:\n return True\n \ndef next_num(n): \n n += 1\n while n <= 3608528850368400786036725: \n pr = polydivisible(n)\n if pr == True:\n return n\n else:\n len_n = len(str(n))\n num = 10 ** (len_n - pr)\n n = (n // num + 1) * num\n\n", "from bisect import bisect\n\nrec = lambda L, i: L and (L + rec([y for x in L for y in range(10*x, 10*(x+1)) if not y%i], i+1))\npolys = rec(list(range(1, 10)), 2)\n\ndef next_num(n):\n try:\n return polys[bisect(polys, n)]\n except IndexError:\n return", "def find_polydivisible(digits_limit):\n numbers = []\n previous = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n digits = 2\n poly_for_digits = []\n \n while previous and digits <= digits_limit:\n numbers += previous\n for p in previous: \n for i in range(10):\n number = p * 10 + i\n if number % digits == 0: poly_for_digits.append(number)\n \n previous = poly_for_digits[:]\n poly_for_digits = []\n digits += 1\n \n return numbers\n\npolydivisibles = find_polydivisible(26)\n\ndef next_num(n):\n return next((p for p in polydivisibles if p >= n + 1), None)", "def next_num(n):\n n+=1\n while n<=3608528850368400786036725:\n pr=ifpol(n)\n if pr==True:\n return n\n else:\n s=len(str(n))\n num=10**(s-pr)\n n=(n//num+1)*num\ndef ifpol(n):\n s=len(str(n))\n for i in range(1,s+1):\n if n//(10**(s-i))%i!=0:\n return i\n return True", "def next_num(n):\n\n '''\n I work on input number converting it to string throughout the code.\n We check if number is polydivisible, if not we find where in the number \n first problem occurs and then substitute proper part into the initial \n number and check over again.\n '''\n number=str(n+1)\n\n # Inner funtion checking for polydivisibility.\n # It returns place where polydivisibility test fails at first or \n # 0 if number is polydivisible\n def isNumPoly(number):\n for i in range(1,len(number)+1):\n if not (int(number[0:i]))%(i)==0:\n return i\n return 0\n # Upper bound is the number greater than biggest polydivisible number that\n # won't be reached if searching for existing polydivisible number\n while (int(number)<3610000000000000000000000):\n # Checking for place where something went wrong in:\n where = isNumPoly(number)\n # If 0 return number as polydivisible\n if where==0:\n return int(number)\n # If not replace failing piece of the number with nicely divisible one\n badPiece=number[0:where]\n replacement = str(int(badPiece)+(where-int(badPiece)%where))\n # Create new number with working first part and 0's for the rest, \n # not to skip over any number along the way\n number = replacement + \"0\"*len(number[where:]) \n return None"] | {"fn_name": "next_num", "inputs": [[0], [10], [11], [1234], [123220], [998], [999], [1234567890], [3608528850368400786036724], [3608528850368400786036725]], "outputs": [[1], [12], [12], [1236], [123252], [1020], [1020], [1236004020], [3608528850368400786036725], [null]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 6,313 |
def next_num(n):
|
8fd75d81f80c8ef1f4fa25219fba2169 | UNKNOWN | You are currently in the United States of America. The main currency here is known as the United States Dollar (USD). You are planning to travel to another country for vacation, so you make it today's goal to convert your USD (all bills, no cents) into the appropriate currency. This will help you be more prepared for when you arrive in the country you will be vacationing in.
Given an integer (`usd`) representing the amount of dollars you have and a string (`currency`) representing the name of the currency used in another country, it is your task to determine the amount of foreign currency you will receive when you exchange your United States Dollars.
However, there is one minor issue to deal with first. The screens and monitors at the Exchange are messed up. Some conversion rates are correctly presented, but other conversion rates are incorrectly presented. For some countries, they are temporarily displaying the standard conversion rate in the form of a number's binary representation!
You make some observations. If a country's currency begins with a vowel, then the conversion rate is unaffected by the technical difficulties. If a country's currency begins with a consonant, then the conversion rate has been tampered with.
Normally, the display would show 1 USD converting to 111 Japanese Yen. Instead, the display is showing 1 USD converts to 1101111 Japanese Yen. You take it upon yourself to sort this out. By doing so, your 250 USD rightfully becomes 27750 Japanese Yen.
`
function(250, "Japanese Yen") => "You now have 27750 of Japanese Yen."
`
Normally, the display would show 1 USD converting to 21 Czech Koruna. Instead, the display is showing 1 USD converts to 10101 Czech Koruna. You take it upon yourself to sort this out. By doing so, your 325 USD rightfully becomes 6825 Czech Koruna.
`
function(325, "Czech Koruna") => "You now have 6825 of Czech Koruna."
`
Using your understanding of converting currencies in conjunction with the preloaded conversion-rates table, properly convert your dollars into the correct amount of foreign currency.
```if:javascript,ruby
Note: `CONVERSION_RATES` is frozen.
``` | ["def convert_my_dollars(usd, currency):\n curs = {\n 'Ar':478, 'Ba':82, 'Cr':6, 'Cz':21, 'Do':48, 'Ph':50,\n 'Uz':10000, 'Ha':64, 'Gu':7, 'Ta':32, 'Ro':4, 'Eg':18,\n 'Vi':22573, 'In':63, 'Ni':31, 'Ve':10, 'No':8, 'Ja':111,\n 'Sa':3, 'Th':32, 'Ke':102, 'So':1059}\n return f\"You now have {usd*curs.get(currency[:2],0)} of {currency}.\"", "def convert_my_dollars(usd, currency):\n di={\"Armenian Dram\":478, \"Bangladeshi Taka\":1010010, \"Croatian Kuna\":110, \"Czech Koruna\":10101, \"Dominican Peso\":110000, \"Egyptian Pound\":18, \"Guatemalan Quetzal\":111, \"Haitian Gourde\":1000000, \"Indian Rupee\":63, \"Japanese Yen\":1101111, \"Kenyan Shilling\":1100110, \"Nicaraguan Cordoba\":11111, \"Norwegian Krone\":1000, \"Philippine Piso\":110010, \"Romanian Leu\":100, \"Samoan Tala\":11, \"South Korean Won\":10000100011, \"Thai Baht\":100000, \"Uzbekistani Som\":10000, \"Venezuelan Bolivar\":1010, \"Vietnamese Dong\":101100000101101}\n if currency[0] in (\"A\",\"E\",\"I\",'O','U'):\n return f'You now have {di[currency]*usd} of {currency}.'\n else:\n return f'You now have {int(str(di[currency]),2)*usd} of {currency}.'", "def convert_my_dollars(usd, currency):\n CONVERSION_RATES = {'Armenian Dram': 478, 'Bangladeshi Taka': 1010010, 'Croatian Kuna': 110, 'Czech Koruna': 10101, 'Dominican Peso': 110000, 'Egyptian Pound': 18, 'Guatemalan Quetzal': 111, 'Haitian Gourde': 1000000, 'Indian Rupee': 63, 'Japanese Yen': 1101111, 'Kenyan Shilling': 1100110, 'Nicaraguan Cordoba': 11111, 'Norwegian Krone': 1000, 'Philippine Piso': 110010, 'Romanian Leu': 100, 'Samoan Tala': 11, 'South Korean Won': 10000100011, 'Thai Baht': 100000, 'Uzbekistani Som': 10000, 'Venezuelan Bolivar': 1010, 'Vietnamese Dong': 101100000101101}\n if currency[0].lower() in ('b', 'c', 'd', 'g', 'h', 'j', 'k', 'n', 'p', 'r', 's', 't', 'v'):\n return f'You now have {int(str(CONVERSION_RATES[currency]), 2)*usd} of {currency}.'\n else:\n return f'You now have {CONVERSION_RATES[currency]*usd} of {currency}.'"] | {"fn_name": "convert_my_dollars", "inputs": [[7, "Armenian Dram"], [322, "Armenian Dram"], [25, "Bangladeshi Taka"], [730, "Bangladeshi Taka"], [37, "Croatian Kuna"], [40, "Croatian Kuna"], [197, "Czech Koruna"], [333, "Czech Koruna"], [768, "Dominican Peso"], [983, "Dominican Peso"]], "outputs": [["You now have 3346 of Armenian Dram."], ["You now have 153916 of Armenian Dram."], ["You now have 2050 of Bangladeshi Taka."], ["You now have 59860 of Bangladeshi Taka."], ["You now have 222 of Croatian Kuna."], ["You now have 240 of Croatian Kuna."], ["You now have 4137 of Czech Koruna."], ["You now have 6993 of Czech Koruna."], ["You now have 36864 of Dominican Peso."], ["You now have 47184 of Dominican Peso."]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,072 |
def convert_my_dollars(usd, currency):
|
97376f6e5604c1db1e9128c18167294e | UNKNOWN | You are given an array with several `"even"` words, one `"odd"` word, and some numbers mixed in.
Determine if any of the numbers in the array is the index of the `"odd"` word. If so, return `true`, otherwise `false`. | ["def odd_ball(arr):\n return arr.index(\"odd\") in arr", "def odd_ball(xs):\n return xs.index('odd') in xs", "def odd_ball(arr):\n i = arr.index('odd')\n return i in arr", "def odd_ball(arr):\n g=arr.index('odd')\n if g in arr:\n return True\n else:\n return False", "#krishp\ndef odd_ball(arr):\n fl = arr.index(\"odd\")\n for i in arr:\n if type(i) is int:\n if i == fl:\n return True\n return False", "def odd_ball(arr):\n index = arr.index('odd')\n return index in arr", "odd_ball = lambda a: a.index(\"odd\") in a", "def odd_ball(arr):\n index=arr.index(\"odd\")\n number=[x for x in arr if(x==index)]\n if(len(number)>0):\n return True\n else:\n return False", "def odd_ball(A):\n return A.index('odd') in A", "def odd_ball(arr):\n return int(arr.index('odd')) in arr"] | {"fn_name": "odd_ball", "inputs": [[["even", 4, "even", 7, "even", 55, "even", 6, "even", 10, "odd", 3, "even"]], [["even", 4, "even", 7, "even", 55, "even", 6, "even", 9, "odd", 3, "even"]], [["even", 10, "odd", 2, "even"]]], "outputs": [[true], [false], [true]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 891 |
def odd_ball(arr):
|
6cbe04303e6e2a2ded9766dd64c71081 | UNKNOWN | Jenny has written a function that returns a greeting for a user. However, she's in love with Johnny, and would like to greet him slightly different. She added a special case to her function, but she made a mistake.
Can you help her? | ["def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, {name}!\".format(name=name)", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {name}!\".format(name=name)\n", "def greet(name):\n return \"Hello, {name}!\".format(name = ('my love' if name == 'Johnny' else name));", "def greet(name):\n return \"Hello, my love!\" if name == 'Johnny' else \"Hello, {name}!\".format(name=name)\n \n", "def greet(name):\n return \"Hello, {name}!\".format(name=name.replace(\"Johnny\", \"my love\")) ", "greet = lambda n: \"Hello, {}!\".format(n.replace(\"Johnny\",\"my love\"))", "def greet(name):\n return \"Hello, {}!\".format((name, \"my love\")[ name == \"Johnny\"])", "greet = lambda name: \"Hello, \" + (\"my love\" if name == \"Johnny\" else name) + \"!\"", "def greet(name):\n if name != 'Johnny':\n return \"Hello, {name}!\".format(name=name)\n else:\n return \"Hello, my love!\"", "def greet(name):\n return \"Hello, my love!\" if name == \"Johnny\" else f\"Hello, {name}!\"", "def greet(name):\n Johnny = 'my love'\n return f'Hello, {Johnny if name==\"Johnny\" else name}!'", "def greet(name):\n return f\"Hello, {'my love' if name == 'Johnny' else name}!\"", "greet = lambda n: \"Hello, {}!\".format(\"my love\" if n == \"Johnny\" else n)", "def greet(name):\n return \"Hello, my love!\" if name=='Johnny' else \"Hello, %s!\" % name\n", "def greet(name):\n if name == \"Johnny\":return \"Hello, my love!\"\n return \"Hello, {}!\".format(name)", "def greet(name):\n return \"Hello, my love!\" if name == \"Johnny\" else \"Hello, {}!\".format(name)", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {}!\".format(name)", "greet = lambda name: \"Hello, my love!\" if name == \"Johnny\" else \"Hello, {name}!\".format(name=name)", "def greet(name):\n return \"Hello, my love!\" if name == \"Johnny\" else \"Hello, {0}!\".format(name)", "def greet(name):\n \"\"\" Jenny was all hyped by the possibillity Johnny might check her web app\n so she made a mistake by returning the result before checking if Johnny\n is one of the users logging to her web app. Silly girl!\n We corrected the function by adding an else statement.\"\"\"\n \n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {name}!\".format(name=name)", "'''def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, {name}!\".format(name=name)'''\ngreet=lambda n:{\"Johnny\":\"Hello, my love!\"}.get(n,\"Hello, {}!\".format(n))", "def greet(name):\n if name == \"Johnny\":\n name = \"my love\"\n return f\"Hello, {name}!\"", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return f\"Hello, {name}!\"", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n elif name == \"James\":\n return \"Hello, James!\"\n elif name == \"Jane\":\n return \"Hello, Jane!\"\n elif name == \"Jim\":\n return \"Hello, Jim!\"", "def greet(name):\n return \"Hello, {}!\".format(\"my love\" if name == \"Johnny\" else name)", "def greet(name):\n return \"Hello, {name}!\".format(name=name) if name!= \"Johnny\" else \"Hello, my love!\"", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, %s!\" %name\n", "def greet(name):\n a = lambda m: \"Hello, my love!\" if m == \"Johnny\" else \"Hello, {}!\".format(m)\n return a(name)", "greet=lambda n:f'Hello, {[n,\"my love\"][n==\"Johnny\"]}!'", "def greet(n):\n if n == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return f\"Hello, {n}!\"", "def greet(name):\n if name == \"Johnny\":\n x = \"Hello, my love!\"\n else:\n x = \"Hello, {name}!\".format(name=name)\n\n return x", "def greet(name):\n #\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {name}!\".format(name=name)", "def greet(name):\n result = \"Hello, {}!\".format(name)\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return result", "def greet(name):\n if name != \"Johnny\" :\n return f'Hello, {name}!'\n elif name == \"Johnny\":\n return \"Hello, my love!\"", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else: \n return (\"Hello, \") + name.format(name=name) + (\"!\")", "#Goal:\n# Fix Jenny's function so that it returns a standard greeting for any arbitrary user, but returns a special greeting for\n# her crush Johnny.\n#General Strategy:\n# When Python processes Jenny's code it will always return the first greeting even if the input name is Johnny.\n# The problem is that Johnny is receiving both greetings when Jenny only wants him to receive the bottom greeting.\n# The way to solve this problem is to create an if statement for Johnny and an else statement for all other users.\n\ndef greet(name):\n # Here is the if statement so that if the user is Johnny, then the special message is returned.\n if name == \"Johnny\":\n return \"Hello, my love!\"\n # Here is the else statement which returns the standard greeting for any user aside from Johnny.\n else:\n # Here format is used to replace the name inside brackets within the string, with the input/variable 'name'\n # from the definition of the function.\n return \"Hello, {name}!\".format(name=name)\n", "def greet(name):\n \n if name == \"Johnny\":\n return(\"Hello, my love!\")\n else:\n return \"Hello, \" + name + \"!\"\n\ngreet(\"James\")\n", "def greet(name):\n greet = \"Hello, {name}!\".format(name=name)\n if name == \"Johnny\":\n greet = \"Hello, my love!\"\n else:\n greet = \"Hello, {name}!\".format(name=name)\n return greet", "def greet(name):\n if name==\"Johnny\":\n name = \"my love\"\n else:\n name = name\n return \"Hello, {name}!\".format(name=name)\n", "def greet(name):\n greeting=''\n if name == \"Johnny\":\n greeting= \"Hello, my love!\"\n else:\n greeting = 'Hello, ' + name + '!'\n return greeting\n\nprint(greet('Maria'))\nprint(greet('Johnny'))", "def greet(name):\n if not name == \"Johnny\":\n return \"Hello, \" + name + \"!\"\n if name == \"Johnny\":\n return \"Hello, my love!\"", "def greet(name):\n \n if name.title() == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return f\"Hello, {name}!\".format(name)", "def greet(name):\n if name != \"Johnny\": \n return \"Hello, {guy}!\".format(guy=name)\n else:\n return \"Hello, my love!\" ", "def greet(name):\n for i in name:\n if i in name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, \" + name + \"!\"\n", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, \" + name + \"!\"\nprint(greet('Johnny'))", "def greet(name):\n output = \"Hello, {name}!\".format(name=name)\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return output", "def greet(name):\n # return \"Hello, {name}!\".format(name=name)\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {}!\".format(name)", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\".format(name=name)\n else:\n return f\"Hello, {name}!\".format(name=name)", "def greet(name):\n if name.lower() == 'johnny':\n return \"Hello, my love!\"\n else:\n return f\"Hello, {name}!\"", "def greet(name):\n lovers = {\"Johnny\", }\n return \"Hello, my love!\" if name in lovers else f\"Hello, {name}!\"", "# INVINCIBLE WARRIORS --- PARZIVAL\n\ndef greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, {name}!\".format(name=name)", "def greet(name):\n if name != 'Johnny':\n return f\"Hello, {name}!\"\n else:\n return 'Hello, my love!'", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return f\"Hello, {name}!\".format(name=name)", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return f\"Hello, {name}!\".format(name=name)\n\ng = greet('Johnny')\nprint(g)", "def greet(name):\n name = name.title() #returns proper capitalisation\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return f\"Hello, {name}!\"", "def greet(name):\n#In my country no girl would do smth. like that and this is sad\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, {name}!\".format(name=name)\n", "def greet(name):\n #if name == name return \"Hello, {name}!\".format(name=name)\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {name}!\".format(name=name)", "def greet(name):\n small_name = name.lower()\n n_a_m_e= list(small_name)\n x=0\n if name == \"Johnny\":\n return \"Hello, my love!\"\n while x != len( n_a_m_e):\n if x== 0:\n n_a_m_e[x] = n_a_m_e[x].upper()\n x= x+1\n print(x)\n elif x <=len( n_a_m_e):\n n_a_m_e[x] = n_a_m_e[x]\n x=x+1\n print(x)\n n_a_m_e += \"!\"\n end= [\"H\",\"e\",\"l\",\"l\",\"o\",\",\",\" \"] + n_a_m_e \n end =''.join(end)\n return end \n", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {fname}!\".format(fname=name)\n", "def greet(name):\n \n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {name}!\".format(name=name)\ngreet(\"spoo\")", "def greet(name):\n \n if name == \"Johnny\":\n \n greet = \"Hello, my love!\"\n \n else:\n \n greet = \"Hello, {}!\".format(name)\n \n return greet", "def greet(name):\n return str(\"Hello, \"+name+\"!\") if name != \"Johnny\" else str(\"Hello, my love!\")", "def greet(name):\n return f'Hello, {name}!'.format(name) if name != \"Johnny\" else \"Hello, my love!\"", "def greet(name):\n name = name\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, \" + name + \"!\"", "def greet(name):\n #return \"Hello\", name!.format(name=name)\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n resp = \"Hello, \" + name +\"!\"\n \n return (resp)", "greet = lambda n: 'Hello, ' + ('my love' if n == 'Johnny' else n) + '!'", "def greet(name):\n return \"Hello, \" + (\"my love!\" if name == \"Johnny\" else f\"{name}!\")", "def greet(name):\n if name != \"Johnny\":\n return f\"Hello, {name}!\"\n else: name == \"Johnny\"\n return \"Hello, my love!\"", "def greet(name):\n if name != 'Johnny':\n return 'Hello, ' + name +'!'\n elif name == 'Johnny':\n return 'Hello, my love!'", "def greet(name):\n name = name if name != 'Johnny' else 'my love'\n return \"Hello, {name}!\".format(name=name)", "def greet(name):\n name =name.format(name=name)\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, \" + str(name)+\"!\"", "def greet(name):\n return \"Hello, my love!\" if name.lower() == \"johnny\" else \"Hello, {}!\".format(name)", "greet=lambda name: f\"Hello, {name}!\" if name!=\"Johnny\" else \"Hello, my love!\"", "greet = lambda s: f\"Hello, {'my love' if s == 'Johnny' else s}!\"", "def greet(name):\n darling = {'Johnny': 'my love'}\n return f'Hello, {darling.get(name, name)}!'", "greet=lambda n: \"Hello, my love!\" if n==\"Johnny\" else \"Hello, {}!\".format(n)\n", "def greet(name):\n if name == \"Johnny\":\n return (\"Hello, my love!\")\n else: \n return (\"Hello, {name}!\".format(name=name))\n \n \n \n#def greet(name):\n# return \"Hello, {name}!\".format(name=name)\n# if name == \"Johnny\":\n# return \"Hello, my love!\"\n", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {name}!\".format(name=name)\n \n \n# ##################!#@!#!@#!@#!@#!#!@#!@#!@#\n", "def greet(name):\n if name==\"Johnny\":\n a=\"Hello, my love!\"\n return a\n else:\n a=\"Hello, {0}!\".format(name)\n return a", "def greet(name):\n return f\"Hello, my love!\" if name == \"Johnny\" else f\"Hello, {name}!\"", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n if name == \"James\":\n return \"Hello, James!\"\n if name == \"Jane\":\n return \"Hello, Jane!\"\n if name == \"Jim\":\n return \"Hello, Jim!\"\n", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n if name == \"James\":\n return \"Hello, James!\"\n if name == \"Jane\":\n return \"Hello, Jane!\"\n if name == \"Jim\":\n return \"Hello, Jim!\" \n else:\n return \"Hello, \" + name + \" !\"\n", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, {:s}!\".format(name)\n", "def greet(name):\n #if name == \"Johnny\":\n # return \"Hello, my love!\"\n \n return \"Hello, my love!\" if name == \"Johnny\" else \"Hello, {0}!\".format(name)", "def greet(name):\n \n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {s}!\".format(s=name)", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n if name != \"Johnny\":\n return \"Hello, {name}!\".format(name=name)\n", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, {name}!\".format(name=name)\nprint(greet('Johny'))", "def greet(name):\n greeting = \"Hello, {name}!\".format(name=name)\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return greeting", "\ndef greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return \"Hello, {name}!\".format(name=name)\n\n\nprint(greet(\"Johnny\"))", "def greet(name):\n if name != str(\"Johnny\"):\n return \"Hello, {name}!\".format(name=name)\n else:\n return \"Hello, my love!\"", "def greet(name):\n \n if name == \"Johnny\":\n return \"Hello, my love!\"\n else:\n return f\"Hello, {name}!\".format(name=name)", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n return \"Hello, {ghj}!\".format(ghj=name)", "greet = lambda n: \"Hello, my love!\" if n == \"Johnny\" else f\"Hello, {n}!\"", "def greet(name):\n if name == \"Johnny\":\n return \"Hello, my love!\"\n \n else:\n return \"Hello\" + \",\" + \" \" + name + \"!\"\n", "def greet(name):\n if name == \"Johnny\":\n msg = \"Hello, my love!\"\n else:\n msg = \"Hello, {name}!\".format(name=name)\n return msg"] | {"fn_name": "greet", "inputs": [["James"], ["Jane"], ["Jim"], ["Johnny"]], "outputs": [["Hello, James!"], ["Hello, Jane!"], ["Hello, Jim!"], ["Hello, my love!"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 15,507 |
def greet(name):
|
584f75a994ae7d1213b69dcb4744cb34 | UNKNOWN | You're re-designing a blog and the blog's posts have the following format for showing the date and time a post was made:
*Weekday* *Month* *Day*, *time*
e.g.,
Friday May 2, 7pm
You're running out of screen real estate, and on some pages you want to display a shorter format, *Weekday* *Month* *Day* that omits the time.
Write a function, shortenToDate, that takes the Website date/time in its original string format, and returns the shortened format.
Assume shortenToDate's input will always be a string, e.g. "Friday May 2, 7pm". Assume shortenToDate's output will be the shortened string, e.g., "Friday May 2". | ["def shorten_to_date(long_date):\n return long_date.split(',')[0]", "def shorten_to_date(long_date):\n return long_date[:long_date.index(',')]", "def shorten_to_date(long_date):\n return long_date[:long_date.rfind(',')]\n", "def shorten_to_date(long_date):\n index = long_date.index(',')\n new_string = long_date[:index]\n return (new_string)", "import re \ndef shorten_to_date(long_date):\n return re.sub(r\",.+$\",'',long_date)", "def shorten_to_date(long_date):\n #your code here\n num = long_date.find(',')\n return long_date[0:num]", "shorten_to_date = lambda d: d[:d.find(\",\")]", "def shorten_to_date(long_date):\n list = long_date.split(\",\")\n return list[0]", "def shorten_to_date(long_date):\n date, time = long_date.split(\",\")\n return date\n", "def shorten_to_date(long_date: str) -> str:\n return long_date.split(',')[0]", "def shorten_to_date(long_date):\n #your code here\n shorted = long_date.split(',')\n return shorted[0]", "def shorten_to_date(long_date):\n a=len(long_date)-(long_date.index(\",\"))\n return long_date[:-a]", "def shorten_to_date(long_date):\n for i in range(len(long_date)):\n if (long_date[i] == ','):\n return long_date[:i]\n return long_date", "shorten_to_date=lambda d: d.split(\",\")[0]", "import re\ndef shorten_to_date(long_date):\n return re.sub(r',\\s[0-9]+pm|,\\s[0-9]+am', '', long_date)", "import re\ndef shorten_to_date(long_date):\n return re.sub(', ([1-9]|1[0-2])[ap]m',\"\",long_date)", "def shorten_to_date(long_date):\n return long_date[:-5].replace(',','')", "def shorten_to_date(lon):\n return lon[:lon.find(',')] ", "def shorten_to_date(long_date):\n return ' '.join(long_date.split()[:-1]).replace(',', '')", "def shorten_to_date(long_date):\n x = long_date.split(',')\n del x[-1]\n return x[0]\n", "import re\ndef shorten_to_date(long_date):\n long_date = re.sub(\", \\d\\d[pa]m\", \"\", long_date)\n long_date = re.sub(\", \\d[ap]m\", \"\", long_date)\n return long_date", "shorten_to_date = lambda long_date: long_date.split(',')[0]", "from re import match\n\ndef shorten_to_date(long_date: str) -> str:\n \"\"\" Get the shortened format of the given date (without time part). \"\"\"\n return match(\"(?P<short_date>.+),\", long_date).groupdict().get(\"short_date\")", "def shorten_to_date(long_date):\n f = long_date.find(', ')\n return long_date[: f]\n", "def shorten_to_date(long_date):\n splitString = long_date.split()\n return splitString[0] + \" \" + splitString[1] + \" \" + splitString[2].rstrip(',')", "def shorten_to_date(long_date):\n #your code here\n broken = long_date.split(\" \")\n date = str(broken[2]).strip(\",\")\n return broken[0]+\" \"+broken[1]+\" \"+date", "def shorten_to_date(long_date):\n return long_date[0:long_date.find(',')] #Truncate after ','\n", "import re\n\ndef shorten_to_date(long_date):\n return re.match('[^,]+', long_date).group()", "def shorten_to_date(long_date):\n end = long_date.index(',')\n return long_date[:end]", "def shorten_to_date(long_date):\n #your code here index = long_date.find(',')\n index = long_date.find(',')\n return long_date [0:index]", "def shorten_to_date(long_date):\n if (long_date.endswith('pm') or long_date.endswith('am')):\n split_long_date = long_date.split(',',1) #split string. [0] - before coma. [1]coma and all after coma\n return split_long_date[0]", "def shorten_to_date(long_date):\n a = long_date.split(', ')\n b = ''.join(a[:-1])\n return b", "def shorten_to_date(long_date):\n char = long_date.split()[:-1]\n tuple_char = char[0], char[1], char[2][:-1]\n result = ' '.join(tuple_char)\n return result", "def shorten_to_date(long_date):\n short_date, spare = long_date.split(\",\")\n \n return (short_date)", "import re\n\ndef shorten_to_date(long_date):\n match_date = re.search('\\w*\\s\\w*\\s\\d*', long_date)\n return match_date.group(0)", "def shorten_to_date(long_date):\n return \" \".join([i.replace(',', '') for i in long_date.split()[:-1]])", "def shorten_to_date(long_date):\n long_date = long_date.split(\",\")\n return str(long_date[0])", "def shorten_to_date(long_date):\n for i in range(-6,-3):\n if long_date[i]==\",\":\n return long_date[:i]", "def shorten_to_date(long_date):\n a = long_date.split(\",\")\n x = list(a)\n return(' '.join(x[:-2] + x[:-1]))", "def shorten_to_date(long_date):\n cut_off = long_date.index(',')\n return long_date[:cut_off]\n \n \n \n", "def shorten_to_date(long_date):\n list = long_date.split(',')\n return str(list[0])", "def shorten_to_date(long_date):\n space = long_date.index(\",\")\n return long_date[:space]\n", "def shorten_to_date(long_date):\n comma = long_date.find(\",\")\n return long_date[0:comma]\n", "def shorten_to_date(long_date):\n date = long_date.split()\n actual = str(date[0]+\" \"+date[1]+\" \"+date[2])\n actual = actual.replace(\",\",\"\")\n return actual", "def shorten_to_date(long_date):\n res = \"\"\n i = 0\n while long_date[i] != ',':\n res += long_date[i]\n i += 1\n return res", "def shorten_to_date(long_date):\n long_date=long_date.split(',')\n return long_date.pop(0)", "def shorten_to_date(long_date):\n komma = ','\n string_short = long_date.split(komma, 1)[0]\n return string_short", "def shorten_to_date(long_date):\n long_date = long_date.replace(',', '')\n long_date = long_date.split(\" \")\n del long_date[3]\n long_date = \" \".join(long_date)\n return long_date\n\nprint(shorten_to_date(\"Monday February 2, 8pm\"))", "def shorten_to_date(long_date):\n return \" \".join(list(long_date.split())[0:3]).replace(\",\", \"\")", "def shorten_to_date(date):\n date = date.replace(',','').split(' ')\n return date[0] + ' ' + date[1] + ' ' + date[2]", "def shorten_to_date(d):\n s=\"\"\n for i in d:\n if i ==\",\":\n break\n else:\n s+=i\n return s", "def shorten_to_date(long_date):\n string = str(long_date)\n string = string.replace(',','')\n string = string.split(' ')\n string.pop()\n string = ' '.join(string)\n return string", "def shorten_to_date(long_date):\n ld = long_date\n ind = ld.index(',')\n return ld[:ind]", "def shorten_to_date(long_date):\n string = \"\"\n for c in long_date:\n if c != \",\":\n string += c\n else:\n return string\n", "def shorten_to_date(long_date: str) -> str:\n return long_date.split(\",\", maxsplit=1)[0]\n", "def shorten_to_date(long_date):\n sep = long_date.find(',')\n return (long_date[:sep])\n", "def shorten_to_date(long_date):\n a = long_date.find(\",\")\n b = long_date[0:a]\n return b", "def shorten_to_date(long_date):\n \"\"\"condenses extended date into a short one\"\"\"\n short_date = ''\n for i in range(len(long_date)):\n if long_date[i] != \",\":\n short_date = short_date + long_date[i]\n else:\n break\n print(short_date)\n return short_date", "def shorten_to_date(long_date):\n if long_date[-4] in '123456789': return long_date[0:-6]\n else: return long_date[0:-5]", "def shorten_to_date(long_date):\n jour, mois, year = (long_date.split())[0], (long_date.split())[1], (long_date.split())[2]\n if year[1] == \",\":\n year = year[0]\n elif year[2] == \",\":\n year = year[0]+year[1]\n date = jour + \" \" + mois + \" \" + year\n #date = \"{} {} {}\".format(jour,mois,year)\n return date\n #your code here\n", "def shorten_to_date(long_date):\n test = long_date.split(',')\n return test[0]", "def shorten_to_date(long_date):\n return long_date[:long_date.index(',')]\n # returns the string up to where the , is\n", "def shorten_to_date(long_date):\n return ' '.join(long_date.split(' ')[:3]).replace(',', '')\n # output joins a string that been split from the input, consists of the first 3 elements, and removes the ,\n", "def shorten_to_date(long_date):\n split1 = long_date.split(\", \")\n split2 = split1[0]\n return split2", "def shorten_to_date(long_date):\n for element in long_date:\n a = long_date.index(\",\")\n return long_date[0:a]\n #your code here\n", "def shorten_to_date(long_date):\n short=[]\n words = long_date.split(' ')\n for word in words:\n if word != words[2] and word != words[3]:\n short.append(word)\n elif word == words[2]:\n short.append(word[:-1])\n shortjoin = ' '.join(short)\n return shortjoin", "def shorten_to_date(long_date: str) -> str:\n return long_date[: long_date.find(\",\")]", "def shorten_to_date(long_date):\n short_date=long_date.replace(\",\", \"\").split(\" \")\n short_date.pop()\n return \" \".join(short_date)", "def shorten_to_date(long_date):\n return long_date[:-4].replace(\",\", \"\").rstrip()", "def shorten_to_date(long_date):\n long_date=long_date.split()\n long_date.pop()\n long_date=\" \".join(long_date)\n return long_date.replace(\",\",\"\")", "def shorten_to_date(long_date):\n return long_date.split(sep=\",\")[0]", "def shorten_to_date(long_date):\n b=long_date.split(',')\n return(str(b[0]))", "def shorten_to_date(long_date):\n newdate = long_date.replace(',','')\n lst = list(newdate.split(\" \"))\n listnew = lst[:4]\n \n return f\"{listnew[0]} {listnew[1]} {listnew[2]}\"", "def shorten_to_date(long_date):\n shorten = ''\n for i in long_date:\n if i == ',':\n break\n shorten += i \n \n return shorten", "def shorten_to_date(long_date):\n counter = 0\n for i in long_date:\n if i == \",\":\n counter = long_date.find(i)\n return long_date[:counter]", "def shorten_to_date(long_date):\n date_split = long_date.split()\n \n date_split_no_time = date_split[:3]\n short_date = ' '.join(date_split_no_time)\n short_date = short_date.replace(\",\",\"\")\n return short_date", "def shorten_to_date(long_date):\n \n long_date = long_date.rsplit(' ', 1)[0].replace(',', '')\n return long_date", "def shorten_to_date(long_date):\n date_list = long_date.split(\" \")\n del date_list[-1]\n short_date = \" \".join(date_list)\n short_date = short_date[:-1]\n return short_date\n", "def shorten_to_date(long_date):\n short=''\n for i in long_date:\n if i==\",\":\n break\n short+=i\n return short", "def shorten_to_date(long_date):\n x = \"\"\n for i in long_date:\n if i != \",\":\n x += i\n else: break\n return x", "def shorten_to_date(ld):\n return ld[:ld.find(',')]", "def shorten_to_date(long_date):\n pos = 0\n for i in range(len(long_date)):\n pos += 1\n if long_date[i] == ',':\n break\n \n pos -= 1\n return long_date[:pos]", "def shorten_to_date(long_date):\n return long_date.replace(long_date[long_date.index(\",\"):],\"\")", "def shorten_to_date(long_date):\n x = []\n for i in range(len(long_date)):\n if long_date[i] == \",\":\n break\n x.append(long_date[i])\n s = ''.join(x)\n \n return s", "import re\n\ndef shorten_to_date(long_date):\n return re.sub(',\\s\\d\\w.+','',long_date)\n #your code here\n", "def shorten_to_date(long_date):\n long_date.split(\", \")\n if \"10pm\" in long_date or \"11pm\" in long_date or '12pm' in long_date or '10am' in long_date or '11am' in long_date or '12am' in long_date:\n return long_date[0:len(long_date) - 6]\n else:\n return long_date[0:len(long_date) - 5]", "def shorten_to_date(long_date):\n new_date = long_date.partition(\",\")\n return new_date[0]\n", "def shorten_to_date(long_date):\n #your code here\n g = long_date.rfind(',')\n return long_date[0:g]", "def shorten_to_date(long_date):\n #your code here\n fecha=long_date.split(',')\n return fecha[0]\n", "def shorten_to_date(long_date):\n x = long_date.split(',')\n shortened = x[:1]\n emptystring = ''\n for eachchar in shortened:\n emptystring = emptystring + eachchar\n return emptystring\n", "def shorten_to_date(long_date):\n sep = ','\n short_date = long_date.split(sep)[0]\n return short_date\n", "def shorten_to_date(long_date):\n ans = \"\"\n i = 0\n while long_date[i] != \",\":\n ans = ans + long_date[i]\n i = i + 1\n return ans", "def shorten_to_date(x):\n xs = x.rsplit(\", \",1)\n print(xs)\n xs.pop(1)\n print(xs)\n short_date= \" \"\n return short_date.join(xs)\n", "def shorten_to_date(long_date):\n return ' '.join(long_date.split(',')[0:-1])", "def shorten_to_date(long_date):\n splitted = long_date.split(',')\n return splitted[0]", "def shorten_to_date(long_date):\n sep = ','\n return(sep.join(long_date.split(sep)[:-1]))", "def shorten_to_date(long_date):\n l=([x.strip(',') for x in long_date.split(',')])\n del l[-1]\n return (' ').join(l)", "def shorten_to_date(long_date):\n bruh = long_date[:long_date.index(\",\")]\n return bruh", "import re\ndef shorten_to_date(long_date):\n return re.sub(', [0-9]{1,2}(a|p)m', '', long_date)"] | {"fn_name": "shorten_to_date", "inputs": [["Monday February 2, 8pm"], ["Tuesday May 29, 8pm"], ["Wed September 1, 3am"], ["Friday May 2, 9am"], ["Tuesday January 29, 10pm"]], "outputs": [["Monday February 2"], ["Tuesday May 29"], ["Wed September 1"], ["Friday May 2"], ["Tuesday January 29"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 13,432 |
def shorten_to_date(long_date):
|
18a8a664e9de60b69b5b1175c1e14cff | UNKNOWN | Your task is to write a function named `do_math` that receives a single argument.
This argument is a string that contains multiple whitespace delimited numbers. Each number has a single alphabet letter somewhere within it.
```
Example : "24z6 1x23 y369 89a 900b"
```
As shown above, this alphabet letter can appear anywhere within the number. You have to extract the letters and sort the numbers according to their corresponding letters.
```
Example : "24z6 1x23 y369 89a 900b" will become 89 900 123 369 246 (ordered according to the alphabet letter)
```
Here comes the difficult part, now you have to do a series of computations on the numbers you have extracted.
* The sequence of computations are `+ - * /`. Basic math rules do **NOT** apply, you have to do each computation in exactly this order.
* This has to work for any size of numbers sent in (after division, go back to addition, etc).
* In the case of duplicate alphabet letters, you have to arrange them according to the number that appeared first in the input string.
* Remember to also round the final answer to the nearest integer.
```
Examples :
"24z6 1x23 y369 89a 900b" = 89 + 900 - 123 * 369 / 246 = 1299
"24z6 1z23 y369 89z 900b" = 900 + 369 - 246 * 123 / 89 = 1414
"10a 90x 14b 78u 45a 7b 34y" = 10 + 45 - 14 * 7 / 78 + 90 - 34 = 60
```
Good luck and may the CODE be with you! | ["from functools import reduce\nfrom itertools import cycle\nfrom operator import add, truediv, mul, sub\n\n\ndef do_math(s):\n xs = sorted(s.split(), key=lambda x: next(c for c in x if c.isalpha()))\n xs = [int(''.join(filter(str.isdigit, x))) for x in xs]\n ops = cycle([add, sub, mul, truediv])\n return round(reduce(lambda a, b: next(ops)(a, b), xs))", "from re import compile\nfrom functools import reduce\nfrom itertools import cycle, starmap\nfrom operator import add, sub, mul, truediv as div, itemgetter\n\nREGEX = compile(r\"(\\d*)([a-z])(\\d*)\").fullmatch\n\ndef extract(i, s):\n a, b, c = REGEX(s).groups()\n return b, i, int(a + c)\n\ndef do_math(s):\n c = cycle((add, sub, mul, div))\n vals = sorted(starmap(extract, enumerate(s.split())))\n return round(reduce(lambda x,y: next(c)(x, y), map(itemgetter(2), vals)))", "import re\ndef do_math(s) :\n sortedArr = [] # sort sorted items\n unsortedArr = s.split() # split input into array items\n \n for i in range(ord('a'), ord('z') + 1): # evaluate items on the basis of their letter-value\n for item in unsortedArr:\n s = re.sub(\"\\d+\", \"\", item)\n if i == ord(s):\n sortedArr.append(re.sub(\"[a-z]\", \"\", item)) # store only digits, \"smaller\" letters in ascii value = earlier\n \n result = int(sortedArr[0])\n \n for i in range (len(sortedArr)-1): # use as int\n op= (i + 4) % 4 # mod to maintain operation order\n if op == 0:\n result += int(sortedArr[1+i])\n elif op == 1:\n result -= int(sortedArr[1+i])\n elif op == 2: \n result *= int(sortedArr[1+i])\n else:\n result /= float(sortedArr[1+i]) # use float for division\n \n return round(result) # return suggested round-value", "from itertools import cycle\nfrom functools import reduce\n\ndef do_math(stg):\n letters = (c for c in stg if c.isalpha())\n numbers = (float(n) for n in \"\".join(c for c in stg if not c.isalpha()).split())\n _, numbers = list(zip(*sorted(zip(letters, numbers), key=lambda t: t[0])))\n ops = cycle((float.__add__, float.__sub__, float.__mul__, float.__truediv__))\n return round(reduce(lambda a, b: next(ops)(a, b), numbers))\n", "def do_math(s) :\n xs = [x for x, _ in sorted([(int(''.join(c for c in x if c.isdigit())), next(c for c in x if c.isalpha())) for x in s.split()], key = lambda x: x[1])]\n return round(eval('(' * len(xs) + ''.join(f'{x}){op}' for x, op in zip(xs, '+-*/+-*/+-*/+-*/+-*/+-*/+-'))[:-1]))", "import re\nimport operator as op\nimport functools as fn\nimport itertools as it\n\ndef do_math (string):\n def parse_item (string):\n letter_pattern = r'\\D'\n letter = re.search(letter_pattern, string).group(0)\n number = int(re.sub(letter_pattern, '', string))\n return letter, number\n\n items = sorted(map(parse_item, string.split()), key=op.itemgetter(0))\n\n operations = it.chain([op.add], it.cycle([op.add, op.sub, op.mul, op.truediv]))\n def reducer (accum, operation):\n (_, value), operator = operation\n return operator(accum, value)\n result = fn.reduce(reducer, zip(items, operations), 0)\n return round(result)", "import re\nfrom operator import add, sub, mul, truediv\n\nletter_re = re.compile(r'[a-z]')\noperations = [add, sub, mul, truediv]\n\ndef letter(s):\n return letter_re.search(s).group(0)\n\ndef number(s):\n return int(letter_re.sub('', s))\n\ndef do_math(s):\n parts = s.split(' ')\n parts.sort(key=letter)\n numbers = [number(p) for p in parts]\n for i in range(1, len(numbers)):\n operation = operations[(i - 1) % 4]\n numbers[0] = operation(numbers[0], numbers[i]);\n return round(numbers[0])", "from functools import reduce; do_math=lambda s: round(reduce(lambda a,b: [b[0],eval(\"\".join([str(a[1]),[\"+\",\"-\",\"*\",\"/\"][a[0]%4],str(b[1])]))], enumerate([e[0] for e in sorted([[int(\"\".join([l for l in e if l.isdigit()])),\"\".join([l for l in e if not l.isdigit()])] for e in s.split()],key=lambda a: a[1])]))[1])", "from itertools import repeat\nimport operator\nimport math\nimport re\ndef do_math(s) : \n final, official = [int(i[1]) for i in sorted([[re.search(r\"[A-Za-z]\",i).group(), \"\".join(re.findall(r\"\\d\",i))] for i in s.split()], key=lambda x: x[0])], ['+', '-', '*', '/']\n d ,temp ,c= {'+': operator.add, '-': operator.sub, '*': operator.mul, '/': operator.truediv}, sum(repeat(official, math.ceil(len(final) / 4)), []),final[0]\n for i in range(1, len(temp[:len(final)])) : c = d[temp[i - 1]](c, final[i])\n return round(c)", "def do_math(s) :\n if s=='936b 1640m 1508p 1360r 40c':\n return -736\n s=s.split(' ')\n l=['+','-','*','/']\n st={}\n m=0\n for i in s:\n n=''\n b=''\n for k in i:\n if k in '0987654321':\n n+=k\n else:\n b=k\n if b not in list(st.keys()):\n st[b]=[int(n)]\n else:\n st[b]=st[b]+[int(n)]#+l[m%4])\n mpl=[]\n m=1\n for k in sorted(st.keys()):\n for ln in st[k]:\n mpl.append(str(ln))#+l[m%4])\n #m+=1#m+=1\n mp=eval(mpl[0]+'+'+mpl[1]) if len(mpl)>1 else int(mpl[0])\n for kl in mpl[2:]:\n mp=eval(str(mp)+l[m%4]+kl)\n m+=1\n return int(mp+0.5) if mp>0 else int(mp+0.5)-1\n #Your code starts here ... may the FORCE be with you\n", "from re import findall\nfrom itertools import cycle\n\ndef do_math(s) :\n numbers = [''.join(findall(r'\\d+', num)) for num in sorted(s.split(), key = lambda x: max(x))]\n res = numbers[0]\n for i, operation in zip(numbers[1:], cycle('+-*/')):\n res = eval(f'{res} {operation} {i}')\n return round(float(res))", "from re import findall\nfrom itertools import cycle\n\ndef do_math(s) :\n number_letter = [ (findall(r'[A-Za-z]', x)[0], ''.join(findall(r'\\d+', x))) for x in s.split() ]\n numbers = [n for _, n in sorted(number_letter, key = lambda x: x[0])]\n res = numbers[0]\n for i, operation in zip(numbers[1:], cycle('+-*/')):\n res = eval(f'{res} {operation} {i}')\n return round(float(res))", "from itertools import cycle\ndef do_math(s) :\n op=cycle('+-*/')\n ss=s.split()\n ss=sorted(ss,key=lambda x:[i for i in x if i.isalpha()])\n ss=[int(''.join((i for i in j if i.isdigit()))) for j in ss]\n ans=ss[0]\n print(ss)\n for i in ss[1:]:\n ans = eval(str(ans)+next(op)+str(i))\n return round(ans)", "def extract_array(s):\n arr = s.split(' ')\n letters = []\n numbers = []\n index = 0\n while index < len(arr):\n temp_arr = []\n for letter in arr[index]:\n if(str.isdigit(letter)):\n temp_arr.append(letter)\n else:\n letters.append(letter+str(index))\n numbers.append(''.join(temp_arr))\n index += 1\n return numbers, letters\n\ndef sort_arr(item, sort_by):\n return [x for _,x in sorted(zip(sort_by, item))]\n\ndef do_math(s):\n nums = [int(x) for x in sort_arr(*extract_array(s))]\n index = 1\n result = nums[0]\n while index < len(nums):\n if(index % 4 == 1):\n result += nums[index]\n elif(index % 4 == 2):\n result -= nums[index]\n elif(index % 4 == 3):\n result *= nums[index]\n else:\n result /= nums[index]\n index += 1\n return round(result)", "def do_math(s) :\n s=s.split()\n for i in s:\n a=sorted(s,key=lambda s:([i for i in s if i.isalpha()]))\n n=[]\n for j in a:\n b=''\n for k in j:\n if k.isdigit():\n b+=k\n n.append(b)\n c=int(n[0])\n for l in range(1,len(n)):\n if l%4==1: c+=int(n[l])\n if l%4==2: c-=int(n[l])\n if l%4==3: c*=int(n[l])\n if l%4==0: c/=int(n[l])\n return round(c)", "def do_math(s) :\n \n res = operator = 0\n for op in (x for y in 'abcdefghijklmnopqrstuvwxyz' for x in s.split() if y in x):\n op = int(''.join(x for x in op if x.isdigit()))\n if not res:\n res += op\n continue\n if operator == 0:\n res += op\n operator += 1\n elif operator == 1:\n res -= op\n operator += 1\n elif operator == 2:\n res *= op\n operator += 1\n else:\n res /= op\n operator = 0\n \n return round(res)", "def do_math(s):\n tuples_with_pairs = [(letter, element) for element in s.split() for letter in element if letter.isalpha()]\n letters = [element[0] for element in tuples_with_pairs]\n letters.sort()\n a_list = []\n m_list = []\n b_list = []\n n_list = []\n c_list = []\n o_list = []\n d_list = []\n p_list = []\n e_list = []\n q_list = []\n f_list = []\n r_list = []\n g_list = []\n s_list = []\n h_list = []\n t_list = []\n i_list = []\n u_list = []\n j_list = []\n v_list = []\n k_list = []\n w_list = []\n l_list = []\n x_list = []\n y_list = []\n z_list = []\n for pairs in tuples_with_pairs:\n if pairs[0] == \"a\":\n a_list.append(pairs[1])\n elif pairs[0] == \"b\":\n b_list.append(pairs[1])\n elif pairs[0] == \"c\":\n c_list.append(pairs[1])\n elif pairs[0] == \"d\":\n d_list.append(pairs[1])\n elif pairs[0] == \"e\":\n e_list.append(pairs[1])\n elif pairs[0] == \"f\":\n f_list.append(pairs[1])\n elif pairs[0] == \"g\":\n g_list.append(pairs[1])\n elif pairs[0] == \"h\":\n h_list.append(pairs[1])\n\n elif pairs[0] == \"i\":\n i_list.append(pairs[1])\n elif pairs[0] == \"j\":\n j_list.append(pairs[1])\n elif pairs[0] == \"k\":\n k_list.append(pairs[1])\n elif pairs[0] == \"l\":\n l_list.append(pairs[1])\n elif pairs[0] == \"m\":\n m_list.append(pairs[1])\n elif pairs[0] == \"n\":\n n_list.append(pairs[1])\n elif pairs[0] == \"o\":\n o_list.append(pairs[1])\n\n elif pairs[0] == \"p\":\n p_list.append(pairs[1])\n elif pairs[0] == \"q\":\n q_list.append(pairs[1])\n elif pairs[0] == \"r\":\n r_list.append(pairs[1])\n elif pairs[0] == \"s\":\n s_list.append(pairs[1])\n elif pairs[0] == \"t\":\n t_list.append(pairs[1])\n elif pairs[0] == \"u\":\n u_list.append(pairs[1])\n elif pairs[0] == \"v\":\n v_list.append(pairs[1])\n elif pairs[0] == \"w\":\n w_list.append(pairs[1])\n elif pairs[0] == \"x\":\n x_list.append(pairs[1])\n elif pairs[0] == \"y\":\n y_list.append(pairs[1])\n elif pairs[0] == \"z\":\n z_list.append(pairs[1])\n\n output_list = a_list + b_list + c_list + d_list + e_list + f_list + g_list + h_list + i_list + j_list + \\\n k_list + l_list + m_list + n_list + o_list + p_list + q_list + r_list + s_list + t_list + u_list + v_list + \\\n w_list + x_list + y_list + z_list\n\n duplicates = []\n right_strings = []\n for strings in output_list:\n if strings in duplicates and strings in right_strings:\n continue\n elif strings in right_strings and strings not in duplicates:\n duplicates.append(strings)\n else:\n right_strings.append(strings)\n print(right_strings)\n digits_list = []\n changed_string = \"\"\n for string in right_strings:\n for digits in string:\n if digits.isdigit():\n changed_string += digits\n continue\n digits_list.append(int(changed_string))\n changed_string = \"\"\n\n first_even_list = [0, 4, 8]\n second_even_list = [2, 6, 10]\n first_odd_list = [1, 5, 9]\n second_odd_list = [3, 7, 11]\n\n result = digits_list[0]\n digits_list.remove(digits_list[0])\n\n for number in range(len(digits_list)):\n if number in first_even_list:\n result += digits_list[number]\n elif number in first_odd_list:\n result -= digits_list[number]\n elif number in second_even_list:\n result *= digits_list[number]\n elif number in second_odd_list:\n result /= digits_list[number]\n\n return round(result)\n\n\n# print(do_math(\"111a 222c 444y 777u 999a 888p\"))\nprint((do_math(\"2j 87j 169a 1275c 834f 683v\")))\n", "def do_math(s):\n alfavit = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\n def izvlech(s):\n s += ' '\n list = []\n string = ''\n for x in s:\n if x != ' ':\n string += x\n else:\n list.append(string)\n string = ''\n return list\n\n def izvlech1(list1, alfavit):\n list2 = []\n for z in alfavit:\n for x in list1:\n for y in x:\n if z == y:\n list2.append(x)\n return list2\n\n list1 = izvlech(s)\n list2 = izvlech1(list1, alfavit)\n result = ''\n final_result = 0\n index = 0\n for x in list2:\n for y in x:\n try:\n y = int(y)\n result += str(y)\n except ValueError:\n continue\n if index == 0:\n index += 1\n final_result = int(result)\n result = ''\n continue\n elif index == 1:\n final_result += int(result)\n result = ''\n index += 1\n continue\n elif index == 2:\n final_result -= int(result)\n result = ''\n index += 1\n continue\n elif index == 3:\n final_result *= int(result)\n result = ''\n index += 1\n continue\n elif index == 4:\n final_result /= int(result)\n result = ''\n index = 1\n continue\n return round(final_result)", "from functools import reduce\nfrom itertools import cycle\nfrom operator import *\ndef do_math(s):\n n=[]\n for w in s.split():\n a,b='',''\n for c in w:\n if c.isdigit():a+=c\n else:b+=c\n n+=[(b,int(a))]\n ops = cycle([add,sub,mul,truediv])\n return round(reduce(lambda *a:next(ops)(*a),[v for c,v in sorted(n,key=lambda x:x[0])]))\n"] | {"fn_name": "do_math", "inputs": [["24z6 1z23 y369 89z 900b"], ["24z6 1x23 y369 89a 900b"], ["10a 90x 14b 78u 45a 7b 34y"], ["111a 222c 444y 777u 999a 888p"], ["1z 2t 3q 5x 6u 8a 7b"]], "outputs": [[1414], [1299], [60], [1459], [8]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 15,054 |
def do_math(s) :
|
2adec0c9b9eaaabce56513b4504bbf5c | UNKNOWN | ###Task:
You have to write a function `pattern` which creates the following pattern (see examples) up to the desired number of rows.
* If the Argument is 0 or a Negative Integer then it should return "" i.e. empty string.
* If any even number is passed as argument then the pattern should last upto the largest odd number which is smaller than the passed even number.
###Examples:
pattern(9):
1
333
55555
7777777
999999999
pattern(6):
1
333
55555
```Note: There are no spaces in the pattern```
```Hint: Use \n in string to jump to next line``` | ["def pattern(n):\n return '\\n'.join(str(i)*i for i in range(1,n+1,2))", "def pattern(n):\n string = \"\"\n a = n;\n if a % 2 == 0:\n a -= 1;\n for x in range (1, a + 1):\n if x % 2 != 0:\n string += str(x) * x\n \n if x != a:\n string += \"\\n\"\n return string\n \n # Happy Coding ^_^\n", "def pattern(n):\n return '\\n'.join([str(num)*num for num in range(1, n+1, 2)])", "pattern = lambda n: \"\\n\".join([str(x) * x for x in range(1, n + 1, 2)])", "def pattern(n):\n x = []\n if n <= 0:\n return \"\"\n else:\n for a in range (1, n+1, 2): \n x.append(str(a)*a)\n return '\\n'.join(x)\n", "def pattern(n):\n return \"\" if n <= 0 else \"\\n\".join([str(i) * i for i in range(1, n + 1, 2)])", "def pattern(n):\n return \"\\n\".join(str(x)*x for x in range(1, n + 1, 2))", "def pattern(n):\n return '\\n'.join([str(i) * i for i in range(1, n + 1, 2)])\n", "pattern = lambda n: '\\n'.join(str(a) * a for a in range(1, n + 1, 2))\n"] | {"fn_name": "pattern", "inputs": [[4], [1], [5], [0], [-25]], "outputs": [["1\n333"], ["1"], ["1\n333\n55555"], [""], [""]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,072 |
def pattern(n):
|
8bca61b259743f3aa993627d2e7bbe25 | UNKNOWN | Round any given number to the closest 0.5 step
I.E.
```
solution(4.2) = 4
solution(4.3) = 4.5
solution(4.6) = 4.5
solution(4.8) = 5
```
Round **up** if number is as close to previous and next 0.5 steps.
```
solution(4.75) == 5
``` | ["import math\ndef solution(n):\n d=0\n if n - 0.25< math.floor(n):\n d=math.floor(n)\n elif n - 0.75< math.floor(n):\n d=math.floor(n)+0.5\n else:\n d=math.ceil(n)\n return d", "def solution(n):\n return round(n * 2) / 2 if n != 4.25 else 4.5", "def solution(n):\n #your code here\n x=divmod(n,.5)\n if x[1] <.25:\n return x[0]*.5\n else:\n return x[0]/2 + .5\n", "def solution(n):\n return int(2*n+0.5)/2", "def solution(n):\n fint = int(n)\n diff = n - fint\n if diff < 0.25:\n rdiff = 0\n if diff >= 0.25 and diff < 0.75:\n rdiff = 0.5\n if diff >= 0.75:\n rdiff = 1\n rounded = rdiff + fint\n return rounded\n"] | {"fn_name": "solution", "inputs": [[4.2], [4.25], [4.4], [4.6], [4.75], [4.8], [4.5], [4.55], [4.74], [4.74999999999], [4.74999999991]], "outputs": [[4], [4.5], [4.5], [4.5], [5], [5], [4.5], [4.5], [4.5], [4.5], [4.5]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 726 |
def solution(n):
|
e100ba6f943942793d7d8fd5792355bb | UNKNOWN | At the annual family gathering, the family likes to find the oldest living family member’s age and the youngest family member’s age and calculate the difference between them.
You will be given an array of all the family members' ages, in any order. The ages will be given in whole numbers, so a baby of 5 months, will have an ascribed ‘age’ of 0. Return a new array (a tuple in Python) with [youngest age, oldest age, difference between the youngest and oldest age]. | ["def difference_in_ages(ages):\n # your code here\n return (min(ages) , max(ages) , max(ages) - min(ages))", "def difference_in_ages(ages):\n x, y = min(ages), max(ages)\n return x, y, y-x", "def difference_in_ages(ages):\n age = sorted(ages)\n return (age[0], age[-1], (age[-1]-age[0]))", "def difference_in_ages(ages):\n # your code here\n youngest_age = min(ages)\n oldest_age = max(ages)\n difference = oldest_age - youngest_age\n return (youngest_age, oldest_age, difference)", "def difference_in_ages(ages):\n youngest = min(ages)\n oldest = max(ages)\n return (youngest, oldest, oldest-youngest)", "def difference_in_ages(a):\n L=[]\n L.append(min(a))\n L.append(max(a))\n L.append(max(a)-min(a))\n return tuple(L)", "def difference_in_ages(ages):\n ages.sort()\n min_age = ages[0]\n max_age = ages[-1]\n \n return (min_age, max_age, max_age - min_age)", "def difference_in_ages(ages):\n age_min, age_max = min(ages), max(ages)\n return (age_min, age_max, age_max - age_min)", "def difference_in_ages(ages):\n oldest, youngest = max(ages), min(ages)\n diff = oldest - youngest\n return (youngest, oldest, diff)", "def difference_in_ages(ages):\n sortedages = sorted(ages)\n return sortedages[0], sortedages[-1], ((sortedages[-1]) - (sortedages[0]))", "def difference_in_ages(ages):\n# return min(ages), max(ages), max(ages) - min(ages)\n x = sorted(ages)\n return x[0], x[-1], x[-1] - x[0]", "difference_in_ages = lambda ages: (lambda x, y: (x, y, y - x))(min(ages), max(ages))", "difference_in_ages=lambda l:(min(l),max(l),max(l)-min(l))", "from typing import List\n\ndef difference_in_ages(ages: List[int]):\n \"\"\" Get a tuple with a structure: (youngest age, oldest age, difference between the youngest and oldest age). \"\"\"\n return sorted(ages)[0], sorted(ages)[-1], sorted(ages)[-1] - sorted(ages)[0],", "def difference_in_ages(ages):\n young = 10000000\n old = 0\n for x in ages:\n if x < young:\n young = x\n if x > old:\n old = x\n difference = old-young\n ris = (young, old, difference)\n return ris", "def difference_in_ages(ages):\n ygs=min(ages)\n lrgs=max(ages)\n dif=lrgs-ygs\n return(ygs,lrgs,dif)\n #ah yes enslaved age\n pass", "def difference_in_ages(ages):\n ages.sort()\n lst = []\n lst.append(ages[0])\n lst.append(ages[-1])\n lst.append(ages[-1]-ages[0])\n m = tuple(lst)\n return m", "def difference_in_ages(ages):\n ages.sort()\n result = []\n res1 = ages[-1] - ages[0]\n res2 = ages[0]\n res3 = ages[-1]\n\n return res2, res3, res1\n", "def difference_in_ages(ages: list) -> tuple:\n \"\"\" This function returns 'min', 'max' in ages and calculate the difference between them. \"\"\"\n return (min(ages), max(ages), max(ages) - min(ages))", "def difference_in_ages(ages):\n lista_noua = []\n lista_noua.append(min(ages))\n lista_noua.append(max(ages))\n diferenta = lista_noua[1] - lista_noua[0]\n lista_noua.append(diferenta)\n tupled = tuple(lista_noua)\n return tupled\n", "def difference_in_ages(ages):\n # your code here\n age=sorted(ages)\n age_len=len(age)\n young=age[0]\n old=age[age_len-1]\n diff=old-young\n result=(young,old,diff)\n return result", "def difference_in_ages(ages):\n return (min(x for x in ages), max(y for y in ages), max(z for z in ages) - min(a for a in ages))", "def difference_in_ages(ages):\n ages.sort()\n older = ages[-1]\n younger = ages[0]\n difference = older - younger\n return (younger, older, difference)", "def difference_in_ages(ages):\n ages0 = max(ages)\n ages1 = min(ages)\n return (ages1, ages0, ages0-ages1)", "def difference_in_ages(ages):\n minimum =min(ages)\n maximum =max(ages)\n diff = maximum-minimum\n return (minimum,maximum,diff)", "def difference_in_ages(ages):\n\n b = max(ages) - min(ages)\n\n a = (min(ages), max(ages), b)\n return a\n", "def difference_in_ages(ages):\n ages = sorted(ages)\n return (ages[0], ages[len(ages)-1], abs(ages[0] - ages[len(ages)-1 ]))", "def difference_in_ages(ages):\n min_ = min(ages)\n max_ = max(ages)\n return min_, max_, max_ - min_", "def difference_in_ages(ages):\n x = len(ages)\n ages.sort()\n a = ages[0]\n b = ages[(x-1)]\n c = a - b\n if c>=0:\n c = c\n else:\n c = -c\n z = (a,b,c)\n return z\n", "def difference_in_ages(ages):\n t = min(ages), max(ages), max(ages) - min(ages)\n return tuple(t)", "def difference_in_ages(ages):\n sorta = sorted(ages)\n return (sorta[0], sorta[-1], sorta[-1] - sorta[0])", "def difference_in_ages(ages):\n a = max(ages)-min(ages)\n return min(ages), max(ages), a", "def difference_in_ages(ages):\n # your code here\n old = max(ages)\n y = min(ages)\n diff = old-y\n return (y,old,diff)", "def difference_in_ages(ages):\n min = ages[0]\n max = ages[0]\n for age in ages:\n if age < min:\n min = age\n if age > max:\n max = age\n diff = max - min\n return min, max, diff", "def difference_in_ages(ages):\n goal = []\n goal.append(min(ages))\n goal.append(max(ages))\n goal.append(goal[1] - goal[0])\n return tuple(i for i in goal)", "def difference_in_ages(ages):\n l = min(ages)\n p = max(ages)\n s = min(ages) - max(ages)\n return l, p, abs(s)", "def difference_in_ages(ages):\n x = sorted(ages)\n return (x[0], x[len(ages) -1], x[len(ages) -1] - x[0])", "def difference_in_ages(ages):\n # your code here\n max_age = max(ages)\n min_age = min(ages)\n dif_age = max_age - min_age\n return (min_age,max_age,dif_age)", "def difference_in_ages(ages):\n x = max(ages)\n y = min(ages)\n z = x - y\n return min(ages), max(ages), z", "def difference_in_ages(ages):\n ages_sorted = sorted(ages)\n youngest = ages_sorted[0]\n oldest = ages_sorted[-1]\n difference = oldest - youngest\n return youngest, oldest, difference\n return ages_sorted\n \n # your code here\n pass", "def difference_in_ages(ages):\n mx, mn = max(ages), min(ages)\n return (mx - mn, mx, mn)[::-1]", "def difference_in_ages(ages):\n lowest,highest = min(ages),max(ages)\n return (lowest, highest, highest-lowest)\n", "def difference_in_ages(ages):\n mi, ma = min(ages), max(ages)\n return mi, ma, ma-mi", "def difference_in_ages(ages):\n \n a = max(ages)\n t = min(ages)\n l = a - t\n \n return t, a, l", "def difference_in_ages(ages):\n a = max(ages) \n b = min(ages) \n dif = abs(a-b)\n return (b, a, dif) \n\n \n \n", "def difference_in_ages(ages):\n return (min(ages), max(ages), max(ages) - min(ages))\n\n# i knoowww..\n# it's not the most efficient to go through the array 4 times \n# but, i had to...\n", "\ndef difference_in_ages(ages):\n a = ages[0]\n b = ages[0]\n for i in ages:\n if i < a:\n a = i\n for x in ages:\n if b <= x:\n b = x\n return a, b, b - a\n", "def difference_in_ages(ages):\n\n mini= min(ages)\n maxi =max(ages)\n diff=maxi-mini\n tup=(mini,maxi,diff)\n return tup", "def difference_in_ages(ages):\n y, o = min(ages), max(ages)\n d = o-y\n return (y, o, d)", "def difference_in_ages(ages):\n an = ()\n minimum = min(ages)\n maximum = max(ages)\n diff = maximum - minimum\n an += minimum,maximum,diff\n return an\n \n", "def difference_in_ages(ages):\n youngest_age = ages[0]\n oldest_age = 0\n \n for age in ages:\n if age < youngest_age:\n youngest_age = age\n if age > oldest_age:\n oldest_age = age\n \n soln = (youngest_age, oldest_age, oldest_age-youngest_age)\n return soln\n", "def difference_in_ages(ages):\n max = 0\n for i in ages:\n if i>max:\n max = i\n min = max\n for j in ages:\n if j < min:\n min = j\n a = max - min\n return (min,max,a) ", "def difference_in_ages(ages):\n y, o = min(ages), max(ages)\n return y, o, o-y", "def difference_in_ages(ages):\n t = (min(ages), max(ages), max(ages) - min(ages))\n return t", "from typing import List\n\ndef difference_in_ages(ages: List[int]):\n \"\"\" Get a tuple with a structure: (youngest age, oldest age, difference between the youngest and oldest age). \"\"\"\n return min(ages), max(ages), max(ages) - min(ages),", "def difference_in_ages(ages):\n x = []\n x.append(min(ages)) \n x.append(max(ages))\n x.append(max(ages) - min(ages))\n return tuple(x)", "def difference_in_ages(ages):\n result = [min(ages), max(ages), (max(ages)-min(ages))]\n return tuple(result)", "def difference_in_ages(ages):\n tuple = (min(ages) , max(ages), max(ages)-min(ages))\n return tuple", "def difference_in_ages(ages):\n tup = (min(ages), max(ages), max(ages)-min(ages))\n return (min(ages), max(ages), max(ages)-min(ages))\n", "def difference_in_ages(ages):\n max_age = max(ages)\n min_age = min(ages)\n sub = max_age - min_age\n sum = max_age - min_age\n listt = (min_age, max_age, sub)\n return listt", "def difference_in_ages(ages):\n s = sorted(ages)[0]\n s1 = sorted(ages,reverse=True)[0]\n return (s,s1,s1-s)", "def difference_in_ages(ages):\n ages.sort()\n tpp1=(ages[0],ages[-1],(ages[-1]-ages[0]))\n return(tpp1)", "def difference_in_ages(ages):\n ages.sort()\n poo = (ages[0],ages[-1],ages[-1] - ages[0])\n return poo", "def difference_in_ages(ages):\n ages.sort()\n youngest = ages[0]\n oldest = ages[-1]\n difference = ages[-1] - ages[0]\n return youngest, oldest, difference", "def difference_in_ages(ages):\n maximum = max(ages)\n minimum = min(ages)\n diffrence = maximum - minimum\n return minimum, maximum, diffrence", "def difference_in_ages(ages):\n bruh = list()\n bruh.append(min(ages))\n bruh.append(max(ages))\n bruh.append(max(ages) - min(ages))\n return tuple(bruh)", "def difference_in_ages(ages):\n # your code here\n a = min(ages)\n b = max(ages)\n return (min(ages), max(ages), max(ages) - min(ages) )", "def difference_in_ages(ages):\n \n ages.sort()\n summary = (ages[0], ages[-1], (ages[-1] - ages[0]))\n \n return summary", "def difference_in_ages(ages):\n mn, mx = min(ages), max(ages)\n return (mn, mx, mx-mn)\n", "def difference_in_ages(a):\n a.sort()\n return (a[0], a[-1], a[-1]-a[0])", "from operator import sub\n\ndef difference_in_ages(ages):\n \"\"\"\n Returns a tuple with youngest age, oldest age, difference between\n the youngest and oldest age.\n \"\"\"\n sort_ages = sorted(ages)\n return (sort_ages[0], sort_ages[-1], sub(sort_ages[-1], sort_ages[0]))", "def difference_in_ages(ages):\n res = max(ages) - min(ages)\n return min(ages), max(ages), res", "def difference_in_ages(ages):\n ages.sort()\n m = ages[0]\n u = ages[-1]\n return m,u,u-m\n", "from typing import List, Tuple\n\n\ndef difference_in_ages(ages: List[int]) -> Tuple[int, int, int]:\n return min(ages), max(ages), max(ages) - min(ages)", "def difference_in_ages(s):\n return (min(s),max(s),max(s)-min(s))", "def difference_in_ages(ages):\n ages.sort()\n a = ages[-1]\n b = ages[0]\n c = a-b\n return (b,a,c)\n", "def difference_in_ages(ages):\n ages.sort()\n a=ages[0]\n b=ages[-1]\n m=b-a\n return(a,b,m)", "def difference_in_ages(ages):\n set = (min(ages), max(ages), max(ages) - min(ages))\n return set", "def difference_in_ages(ages):\n youngest_age = 10000000000000\n oldest_age = 0\n for x in ages:\n if x < youngest_age and x > oldest_age:\n youngest_age = x\n oldest_age = x\n elif x < youngest_age:\n youngest_age = x\n elif x > oldest_age:\n oldest_age = x\n else:\n pass\n difference = oldest_age - youngest_age\n return (youngest_age, oldest_age, difference)", "def difference_in_ages(age):\n ergebnis = []\n ergebnis.append(sorted(age)[0])\n ergebnis.append(sorted(age)[-1])\n ergebnis.append(ergebnis[-1]-ergebnis[0])\n return tuple(ergebnis)", "def difference_in_ages(ages):\n smallest = ages[0]\n largest = ages[1]\n for age in ages:\n if(smallest > age):\n smallest = age\n if(largest < age):\n largest = age\n \n return smallest, largest, largest-smallest", "def difference_in_ages(ages):\n ages.sort()\n oldest_age = ages[-1]\n youngest_age = ages[0]\n diff = ages[-1] - ages[0]\n return tuple([youngest_age,oldest_age,diff])\n", "def difference_in_ages(ages):\n ages = sorted(ages)\n ages_diff = (ages[0],ages[-1],ages[-1] - ages[0])\n return ages_diff", "def difference_in_ages(ages):\n lo, hi = min(ages), max(ages)\n return lo, hi, hi - lo", "def difference_in_ages(ages):\n # your code here\n oldest = ages[0]\n youngest = ages[0]\n \n for e in ages:\n if e > oldest:\n oldest = e\n elif e < youngest:\n youngest = e\n arr = ((youngest), (oldest), (oldest-youngest))\n return arr", "def difference_in_ages(ages):\n sor = sorted(ages)\n a = sor[0]\n b = max(sor)\n diff = ()\n c = b-a\n j = 0\n diff = (a,b,c)\n \n return diff\n \n \n \n \n \n \n \n # your code here\n pass", "def difference_in_ages(ages):\n ages.sort()\n diference = []\n diference.append(ages[0])\n diference.append(ages[len(ages)-1])\n diference.append(ages[len(ages)-1] - ages[0])\n return tuple(diference)\n", "def difference_in_ages(ages):\n sorted = ages.sort();\n low = ages[0];\n high = ages[-1];\n diff = high - low;\n return (low, high, diff);", "import math\ndef difference_in_ages(ages):\n young = math.inf\n old = -math.inf\n for age in ages:\n if (age > old):\n old = age\n if (age < young):\n young = age\n return (young, old, old-young)", "def difference_in_ages(ages):\n ages.sort()\n agelen = len(ages)\n return(ages[0], ages[agelen -1],(ages[agelen-1] - ages[0]))", "import sys\ndef difference_in_ages(ages):\n # your code here\n array = []\n youngest = sys.maxsize\n oldest = -sys.maxsize - 1\n for i in ages:\n if youngest > i:\n youngest = i\n if oldest < i:\n oldest = i\n difference = oldest - youngest\n\n return (youngest, oldest, difference)", "def difference_in_ages(ages):\n ages.sort()\n youngest = ages[0]\n oldest = ages[-1]\n diff = oldest - youngest\n return (youngest, oldest, diff)", "def difference_in_ages(ages):\n ageDif = []\n ageDif.extend([min(ages), max(ages), max(ages)-min(ages)])\n return tuple(ageDif)\n", "def difference_in_ages(ages):\n youngestAge = min(ages)\n oldestAge = max(ages)\n difference = oldestAge - youngestAge\n\n return(youngestAge, oldestAge, difference)", "def difference_in_ages(ages):\n m = min(ages)\n b = max(ages)\n r = b - m \n return (m, b, r)", "def difference_in_ages(ages):\n minage = min(ages)\n maxage = max(ages)\n return (minage,maxage,abs(maxage - minage))", "def difference_in_ages(ages):\n M = max(ages)\n m = min(ages)\n return m, M, M-m", "def difference_in_ages(ages):\n array = (min(ages),max(ages),max(ages)-min(ages))\n return array", "def difference_in_ages(ages):\n # your code here\n ages.sort()\n young=ages[0]\n old=ages[len(ages)-1]\n return (young,old,old-young)", "def difference_in_ages(ages):\n first = max(ages)\n second = min(ages)\n return (second,first,first - second)"] | {"fn_name": "difference_in_ages", "inputs": [[[16, 22, 31, 44, 3, 38, 27, 41, 88]], [[5, 8, 72, 98, 41, 16, 55]], [[57, 99, 14, 32]], [[62, 0, 3, 77, 88, 102, 26, 44, 55]], [[2, 44, 34, 67, 88, 76, 31, 67]], [[46, 86, 33, 29, 87, 47, 28, 12, 1, 4, 78, 92]], [[66, 73, 88, 24, 36, 65, 5]], [[12, 76, 49, 37, 29, 17, 3, 65, 84, 38]], [[0, 110]], [[33, 33, 33]]], "outputs": [[[3, 88, 85]], [[5, 98, 93]], [[14, 99, 85]], [[0, 102, 102]], [[2, 88, 86]], [[1, 92, 91]], [[5, 88, 83]], [[3, 84, 81]], [[0, 110, 110]], [[33, 33, 0]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 15,958 |
def difference_in_ages(ages):
|
f788a05b5a940c6450f693ba8f85204b | UNKNOWN | **Principal Diagonal** -- The principal diagonal in a matrix identifies those elements of the matrix running from North-West to South-East.
**Secondary Diagonal** -- the secondary diagonal of a matrix identifies those elements of the matrix running from North-East to South-West.
For example:
```
matrix: [1, 2, 3]
[4, 5, 6]
[7, 8, 9]
principal diagonal: [1, 5, 9]
secondary diagonal: [3, 5, 7]
```
## Task
Your task is to find which diagonal is "larger": which diagonal has a bigger sum of their elements.
* If the principal diagonal is larger, return `"Principal Diagonal win!"`
* If the secondary diagonal is larger, return `"Secondary Diagonal win!"`
* If they are equal, return `"Draw!"`
**Note:** You will always receive matrices of the same dimension. | ["def diagonal(m):\n P = sum(m[i][i] for i in range(len(m)))\n S = sum(m[i][-i-1] for i in range(len(m)))\n if P > S:\n return \"Principal Diagonal win!\"\n elif S > P:\n return \"Secondary Diagonal win!\"\n else:\n return 'Draw!'\n", "def diagonal(matrix):\n sp, ss = map(sum, zip(*((matrix[x][x], matrix[len(matrix)-1-x][x]) for x in range(len(matrix)))))\n return \"Draw!\" if ss == sp else \"{} Diagonal win!\".format(\"Principal\" if sp > ss else \"Secondary\")", "def diagonal(matrix):\n l=len(matrix)\n pd=sum(matrix[i][i] for i in range(l))\n sd=sum(matrix[i][l-i-1] for i in range(l))\n return ([\"Principal Diagonal win!\",\"Secondary Diagonal win!\",\"Draw!\"]\n [0 if pd>sd else 1 if pd<sd else 2])\n", "q,diagonal=lambda x:(x==0)*2+(x>0),lambda m:[\"Secondary Diagonal win!\",\"Principal Diagonal win!\",'Draw!'][q(sum(x[y]-x[::-1][y] for y,x in enumerate(m)))]\n", "import numpy as np\n\ndef diagonal(matrix):\n diag_1, diag_2 = sum(np.diag(matrix)), sum(np.diag(np.fliplr(matrix)))\n return 'Draw!' if diag_1 == diag_2 else f'{\"Principal\" if diag_1 > diag_2 else \"Secondary\"} Diagonal win!'", "def diagonal(matrix):\n if sum(matrix[i][i] for i in range(len(matrix))) > sum(matrix[i][len(matrix)-1-i] for i in range(len(matrix))): return \"Principal Diagonal win!\"\n elif sum(matrix[i][i] for i in range(len(matrix))) < sum(matrix[i][len(matrix)-1-i] for i in range(len(matrix))): return \"Secondary Diagonal win!\"\n else: return \"Draw!\"", "def diagonal(matrix):\n principal_sum = sum(matrix[i][i] for i in range(len(matrix)))\n secondary_sum = sum(matrix[i][~i] for i in range(len(matrix)))\n if principal_sum > secondary_sum:\n return \"Principal Diagonal win!\"\n elif principal_sum < secondary_sum:\n return \"Secondary Diagonal win!\"\n else:\n return \"Draw!\"", "def diagonal(matrix):\n res = sum(row[i] - row[-i-1] for i,row in enumerate(matrix))\n return f\"{'Principal' if res > 0 else 'Secondary'} Diagonal win!\" if res else \"Draw!\"", "def diagonal(matrix):\n primary = sum(matrix[i][i] for i in range(len(matrix)))\n secondary = sum(matrix[i][len(matrix)-i-1] for i in range(len(matrix)))\n return [\"Principal Diagonal win!\",\"Secondary Diagonal win!\",\"Draw!\"][0 if primary > secondary else 1 if primary < secondary else 2]\n", "def diagonal(l):\n a,b = zip(*[(l[i][-i-1], l[i][i]) for i in range(len(l))])\n \n if sum(a) < sum(b):\n return \"Principal Diagonal win!\"\n elif sum(a) > sum(b):\n return \"Secondary Diagonal win!\"\n return 'Draw!'"] | {"fn_name": "diagonal", "inputs": [[[[2, 2, 2], [4, 2, 6], [8, 8, 2]]], [[[7, 2, 2], [4, 2, 6], [1, 8, 1]]], [[[1, 2, 3], [4, 5, 6], [7, 8, 9]]], [[[1, 2, 2, 5, 1], [4, 1, 6, 1, 1], [1, 8, 5, 6, 2], [1, 5, 2, 1, 2], [1, 8, 2, 6, 1]]], [[[88, 2, 2, 5, 1, 1, 2, 2, 5, 1], [4, 1, 6, 1, 1, 1, 2, 2, 7, 1], [1, 8, 1, 6, 2, 1, 2, 1, 5, 1], [1, 5, 2, 7, 2, 1, 1, 2, 5, 1], [1, 8, 2, 6, 1, 1, 2, 2, 5, 1], [1, 2, 2, 5, 1, 1, 2, 2, 5, 1], [1, 2, 2, 1, 1, 1, 1, 2, 5, 1], [1, 2, 1, 5, 1, 1, 2, 1, 5, 1], [1, 1, 2, 5, 1, 1, 2, 2, 1, 1], [88, 2, 2, 5, 1, 1, 2, 2, 5, 1]]], [[[2, 2, 2], [4, 2, 6], [1, 8, 5]]], [[[1, 2, 2, 5, 104], [4, 1, 6, 4, 1], [1, 8, 5, 6, 2], [1, 1, 2, 1, 2], [1, 8, 2, 6, 1]]], [[[1, 2, 2, 5, 1, 1, 2, 2, 5, 15], [4, 1, 6, 1, 1, 1, 2, 2, 1, 1], [1, 8, 1, 6, 2, 1, 2, 1, 5, 1], [1, 5, 2, 1, 2, 1, 1, 2, 5, 1], [1, 8, 2, 6, 1, 1, 2, 2, 5, 1], [1, 2, 2, 5, 1, 1, 2, 2, 5, 1], [1, 2, 2, 1, 1, 1, 1, 2, 5, 1], [1, 2, 1, 5, 1, 1, 2, 1, 5, 1], [1, 1, 2, 5, 1, 1, 2, 2, 1, 1], [1, 2, 2, 5, 1, 1, 2, 2, 5, 15]]], [[[0, 2, 2, 5, 1], [4, 0, 6, 1, 1], [1, 8, 5, 6, 2], [1, 7, 2, 1, 2], [1, 8, 2, 6, 1]]], [[[1, 2, 2, 5, 1, 1, 2, 2, 5, 1], [4, 8, 6, 1, 1, 1, 2, 2, 1, 1], [1, 8, 1, 6, 2, 1, 2, 6, 5, 1], [1, 5, 2, 1, 2, 1, 1, 2, 5, 1], [1, 8, 2, 6, 1, 1, 2, 2, 5, 1], [1, 2, 2, 5, 1, 1, 2, 2, 5, 1], [1, 2, 2, 1, 1, 1, 1, 2, 5, 1], [1, 2, 8, 5, 1, 1, 2, 6, 5, 1], [1, 1, 2, 5, 1, 1, 2, 2, 1, 1], [1, 2, 2, 5, 1, 1, 2, 2, 5, 1]]]], "outputs": [["Secondary Diagonal win!"], ["Principal Diagonal win!"], ["Draw!"], ["Secondary Diagonal win!"], ["Draw!"], ["Principal Diagonal win!"], ["Secondary Diagonal win!"], ["Draw!"], ["Secondary Diagonal win!"], ["Draw!"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,638 |
def diagonal(matrix):
|
c8f254ff28f66d4b82e14422fcef530d | UNKNOWN | Write a function groupIn10s which takes any number of arguments, and groups them into sets of 10s and sorts each group in ascending order.
The return value should be an array of arrays, so that numbers between 0-9 inclusive are in position 0 and numbers 10-19 are in position 1, etc.
Here's an example of the required output:
```python
grouped = group_in_10s(8, 12, 38, 3, 17, 19, 25, 35, 50)
grouped[0] # [3, 8]
grouped[1] # [12, 17, 19]
grouped[2] # [25]
grouped[3] # [35, 38]
grouped[4] # None
grouped[5] # [50]
```
``` haskell
groupIn10s [8, 12, 3, 17, 19, 24, 35, 50] `shouldBe` [[3,8],[12,17,19],[24],[35],[],[50]]
``` | ["from collections import defaultdict\ndef group_in_10s(*args):\n if not args: return []\n tens = defaultdict(list)\n for n in sorted(args): tens[n//10].append(n)\n return [tens.get(d, None) for d in range(max(tens) + 1)]", "from itertools import groupby\n\ndef group_in_10s(*args):\n if not args:\n return []\n groups = dict((k, list(xs)) for k, xs in groupby(sorted(args), lambda x: x // 10))\n return [groups.get(i) for i in range(max(groups) + 1)]", "from collections import defaultdict\n\ndef group_in_10s(*nums):\n dct = defaultdict(list)\n for n in sorted(nums):\n dct[n//10].append(n)\n return [dct.get(i) for i in range(max(dct) + 1)] if nums else []\n\n\n\n# alternative without import\n#def group_in_10s(*nums):\n# s = sorted(nums)\n# lst = [[] for _ in range(s[-1] // 10 + 1)] if nums else []\n# for n in s:\n# lst[n//10].append(n)\n# return [l or None for l in lst]\n", "def group_in_10s(*li):\n li,result,ini,i = sorted(li),[],10,0\n while i < len(li):\n temp = []\n while i < len(li) and li[i] < ini:\n temp.append(li[i]) ; i += 1\n result.append(temp or None) ; ini += 10\n return result", "from collections import defaultdict\n\ndef group_in_10s(*xs):\n d = defaultdict(list)\n for x in xs:\n d[x // 10].append(x)\n return [sorted(d[i]) if i in d else None for i in range(max(d) + 1)] if d else []", "def group_in_10s(*args):\n return [None if len(y) == 0 else y for y in [sorted([x for x in list(args) if int(x / 10) == i]) for i in range(0, int(max(list(args)) / 10) + 1)]] if args else []", "def group_in_10s(*args):\n if not args: return []\n args = sorted(args)\n lsd = [None] * (max(args) //10 +1)\n for i in args:\n if not lsd[i//10]: lsd[i//10] = [i]\n else: lsd[i//10].append(i)\n return lsd", "from collections import defaultdict\n\ndef group_in_10s(*args):\n d = defaultdict(list)\n for x in args:\n d[x // 10].append(x)\n return [sorted(d[k]) if k in d else None for k in range(0, max(d) + 1)] if d else []\n", "from itertools import groupby\n\ndef group_in_10s(*args):\n if not args: return []\n res = [None] * (1 + max(args) // 10)\n for a, b in groupby(args, key = lambda x: x // 10):\n if res[a] == None:\n res[a] = sorted(list(b))\n else:\n res[a] = sorted(res[a] + list(b))\n return res\n", "from collections import defaultdict\ndef group_in_10s(*l):\n if not l : return [] \n d = defaultdict(list)\n for i in l:\n d[int(str(i//10))].append(i)\n return [None if d[i] == [] else sorted(d[i]) for i in range(1 + max(d.keys()))]"] | {"fn_name": "group_in_10s", "inputs": [[100]], "outputs": [[[null, null, null, null, null, null, null, null, null, null, [100]]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,698 |
def group_in_10s(*args):
|
a766d1488d50c0015b5b50158a457ffd | UNKNOWN | Seven is a hungry number and its favourite food is number 9. Whenever it spots 9
through the hoops of 8, it eats it! Well, not anymore, because you are
going to help the 9 by locating that particular sequence (7,8,9) in an array of digits
and tell 7 to come after 9 instead. Seven "ate" nine, no more!
(If 9 is not in danger, just return the same array) | ["import re\n\ndef hungry_seven(arr):\n ss,s = '', ''.join(map(str,arr))\n while ss!=s:\n ss,s = s,re.sub(r'(7+)(89)',r'\\2\\1', s)\n return list(map(int,s))", "def hungry_seven(arr):\n s = str(arr)\n if '7, 8, 9' in s:\n return hungry_seven(s.replace('7, 8, 9', '8, 9, 7'))\n return eval(s)", "import re\nhungry_seven = lambda arr: (lambda h: lambda x: h(h, x))(lambda h, x: h(h, re.sub(r'(7+)(89)', r'\\2\\1', x)) if re.search(r'(7+)(89)', x) else [int(c) for c in x])(''.join(map(str, arr)))\n", "def hungry_seven(n):\n r=''.join([str(x) for x in n])\n while '789' in r:\n for x in range(len(r)):\n if r[x:x+3]=='789':\n r=r[:x]+r[x+1:]\n r=r[:x+2]+'7'+r[x+2:]\n g= [int(x) for x in r]\n return g", "import re\n\ndef hungry_seven(arr):\n s = ''.join(map(str, arr))\n while '789' in s:\n s = re.sub(r'7+89', lambda m: '89' + '7' * (len(m.group())-2), s)\n return list(map(int, s))", "def hungry_seven(arr):\n\n nums = ''.join(str(a) for a in arr)\n\n while '789' in nums:\n nums = nums.replace('789','897')\n\n return [int(n) for n in nums]", "def hungry_seven(arr):\n s = ''.join(map(str, arr))\n if '789' in s:\n return hungry_seven(s.replace('789', '897'))\n return list(map(int, s))", "def hungry_seven(arr):\n i,a = 0,arr[:]\n while i<len(a)-2:\n if i>=0 and a[i:i+3]==[7,8,9]:\n a[i:i+3]=[8,9,7]\n i-=2\n i+=1\n return a", "def hungry_seven(arr):\n for i in range(len(arr)-2):\n if arr[i] == 7 and arr[i+1] == 8 and arr[i+2] == 9:\n return hungry_seven(arr[:i]+arr[i+1:i+3]+[7]+arr[i+3:])\n return arr\n", "import re\ndef hungry_seven(arr):\n s = ''.join(str(v) for v in arr)\n while '789' in s:\n s = s.replace('789', '897')\n return [int(v) for v in s]"] | {"fn_name": "hungry_seven", "inputs": [[[7, 8, 9]], [[7, 7, 7, 8, 9]], [[8, 7, 8, 9, 8, 9, 7, 8]], [[8, 7, 8, 7, 9, 8]]], "outputs": [[[8, 9, 7]], [[8, 9, 7, 7, 7]], [[8, 8, 9, 8, 9, 7, 7, 8]], [[8, 7, 8, 7, 9, 8]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,889 |
def hungry_seven(arr):
|
6e76b7cd774b2ca973fec40ed9e43cc3 | UNKNOWN | # Definition
An **_element is leader_** *if it is greater than The Sum all the elements to its right side*.
____
# Task
**_Given_** an *array/list [] of integers* , **_Find_** *all the **_LEADERS_** in the array*.
___
# Notes
* **_Array/list_** size is *at least 3* .
* **_Array/list's numbers_** Will be **_mixture of positives , negatives and zeros_**
* **_Repetition_** of numbers in *the array/list could occur*.
* **_Returned Array/list_** *should store the leading numbers **_in the same order_** in the original array/list* .
___
# Input >> Output Examples
```
arrayLeaders ({1, 2, 3, 4, 0}) ==> return {4}
```
## **_Explanation_**:
* `4` *is greater than the sum all the elements to its right side*
* **_Note_** : **_The last element_** `0` *is equal to right sum of its elements (abstract zero)*.
____
```
arrayLeaders ({16, 17, 4, 3, 5, 2}) ==> return {17, 5, 2}
```
## **_Explanation_**:
* `17` *is greater than the sum all the elements to its right side*
* `5` *is greater than the sum all the elements to its right side*
* **_Note_** : **_The last element_** `2` *is greater than the sum of its right elements (abstract zero)*.
___
```
arrayLeaders ({5, 2, -1}) ==> return {5, 2}
```
## **_Explanation_**:
* `5` *is greater than the sum all the elements to its right side*
* `2` *is greater than the sum all the elements to its right side*
* **_Note_** : **_The last element_** `-1` *is less than the sum of its right elements (abstract zero)*.
___
```
arrayLeaders ({0, -1, -29, 3, 2}) ==> return {0, -1, 3, 2}
```
## **_Explanation_**:
* `0` *is greater than the sum all the elements to its right side*
* `-1` *is greater than the sum all the elements to its right side*
* `3` *is greater than the sum all the elements to its right side*
* **_Note_** : **_The last element_** `2` *is greater than the sum of its right elements (abstract zero)*. | ["def array_leaders(numbers):\n return [n for (i,n) in enumerate(numbers) if n>sum(numbers[(i+1):])]\n", "def array_leaders(numbers):\n res = []\n s = 0\n for n in reversed(numbers):\n if n > s:\n res.append(n)\n s += n\n res.reverse()\n return res\n\narrayLeaders = array_leaders", "def array_leaders(numbers):\n return [j for i,j in enumerate(numbers) if j > sum(numbers[i+1:]) ]", "def array_leaders(numbers):\n nums = numbers + [0]\n return [a for c, a in enumerate(nums, 1) if a > sum(nums[c:])]", "array_leaders=lambda n:[e for i,e in enumerate(n,1)if e>sum(n[i:])]", "def array_leaders(num):\n return [n for i,n in enumerate(num, 1) if n > sum(num[i:])]", "def array_leaders(numbers):\n a = []\n numbers.append(0)\n for i in range(len(numbers)):\n if numbers[i] > sum(numbers[i+1:]):\n a.append(numbers[i])\n return a\n", "def array_leaders(numbers):\n res = []\n s = 0\n for n in reversed(numbers):\n if n > s:\n res.append(n)\n s += n\n \n return list(reversed(res))", "def array_leaders(n):\n \n leaders = []\n for i in range(len(n)-1, -1, -1):\n if n[i] > sum(n[i+1:]):\n leaders.append(n[i])\n \n leaders.reverse()\n \n return leaders", "def array_leaders(numbers):\n result, sum = [], 0\n for i in range(len(numbers)):\n if numbers[-i-1] > sum:\n result.insert(0,numbers[-i-1])\n sum += numbers[-i-1]\n return result", "from itertools import accumulate\n\ndef array_leaders(numbers):\n if numbers[-1]: numbers.append(0)\n return [numbers[-i] for i,x in enumerate(accumulate(numbers[:0:-1]), 2) if numbers[-i] > x][::-1]", "def array_leaders(numbers):\n return [item for ind,item in enumerate(numbers) if item>sum(numbers[ind+1:])]", "def array_leaders(numbers):\n sum = 0\n i, l = 1, len(numbers)\n leaders = []\n while i <= l:\n if numbers[-i] > sum:\n leaders = [numbers[-i]] + leaders\n sum += numbers[-i]\n i += 1\n return leaders", "def array_leaders(numbers):\n return [x for i, x in enumerate(numbers) if x > sum(numbers[i+ 1:])]\n", "def array_leaders(numbers):\n return [numbers[i] for i in range(len(numbers)) if numbers[i] > sum(numbers[i+1:])]", "array_leaders=lambda a:[a[i] for i in range(len(a)) if a[i] > sum(a[i+1:])]", "def array_leaders(numbers):\n return [element for index, element in enumerate(numbers) if element>sum(numbers[index+1::])]", "def array_leaders(numbers):\n return [i for index, i in enumerate(numbers, 1) if sum(numbers[index:]) < i]\n", "def array_leaders(numbers):\n arr = []\n for i in range(len(numbers)-1):\n if numbers[i]>sum(numbers[i+1:]):\n arr.append(numbers[i])\n\n return arr+[numbers[-1]] if not numbers[-1]<=0 else arr", "def array_leaders(arr):\n return [arr[x] for x in range(len(arr)) if arr[x] > sum(arr[x + 1:])]", "def array_leaders(numbers):\n right=0\n out=[]\n for x in numbers[::-1]:\n if x>right : out.append(x)\n right+=x\n return out[::-1]", "def array_leaders(nums):\n return [nums[i] for i in range(len(nums)) if nums[i] > sum(nums[i+1:])]\n \n", "def array_leaders(numbers):\n n = 0\n out = []\n for i in reversed(numbers):\n if i > n: out.append(i)\n n += i\n out.reverse()\n return out", "def array_leaders(numbers):\n n = sum(numbers)\n out = []\n for i in numbers:\n n -= i\n if i > n: out.append(i)\n return out", "def array_leaders(numbers):\n s = sum(numbers)\n mx= []\n for i in range(len(numbers)):\n if numbers[i]>sum(numbers[i+1:]):\n mx.append(numbers[i])\n return mx", "def array_leaders(numbers):\n return [elem for idx,elem in enumerate(numbers) if elem>sum(numbers[idx+1:])]", "\ndef array_leaders(numbers):\n i = 0\n output = []\n for num in numbers:\n sum_right = sum(numbers[i+1:len(numbers)])\n if sum_right < num:\n output.append(num)\n else:\n pass\n i +=1\n return output", "def array_leaders(numbers):\n \n p = [j for i,j in enumerate(numbers) if j > sum(numbers[i+1:])]\n \n return p\n\n", "def array_leaders(numbers):\n john=[]\n for i,v in enumerate(numbers):\n if v>sum(numbers[i+1:]):\n john.append(v)\n return john\n \n", "def array_leaders(numbers):\n out, s = [], 0\n for i in reversed(range(len(numbers))):\n if numbers[i] > s:\n out.insert(0, numbers[i])\n s += numbers[i]\n return out", "def array_leaders(numbers):\n numbers.append(0)\n return [n for i, n in enumerate(numbers[:-1]) if n > sum(numbers[i+1:])]", "def array_leaders(numbers):\n r=[]\n s=sum(numbers)\n for x in numbers:\n s-=x\n if x>s:\n r.append(x)\n return r", "def array_leaders(N):\n return [n for i, n in enumerate(N) if n>sum(N[i+1:])]", "def array_leaders(nums):\n total,res = sum(nums), []\n for x in nums:\n total -= x\n if x > total: res.append(x)\n \n return res", "def array_leaders(numbers):\n accum = 0\n leaders = []\n \n for n in reversed(numbers):\n if n > accum:\n leaders.append(n)\n accum += n\n leaders.reverse()\n \n return leaders", "def array_leaders(numbers):\n return [el for i, el in enumerate(numbers) if el > sum(numbers[i+1:])]", "def array_leaders(numbers):\n o = []\n for n,i in enumerate(numbers):\n if i>sum(numbers[n+1:]):\n o.append(i)\n \n return o", "def array_leaders(numbers):\n res = []\n for i in range(len(numbers)):\n if numbers[i] > sum(x for x in numbers[i + 1:]):\n res.append(numbers[i])\n return res", "from collections import deque\ndef array_leaders(numbers):\n res = deque([])\n sm = 0\n i = len(numbers) - 1\n while i >= 0:\n n = numbers[i]\n if n > sm:\n res.appendleft(n);\n sm += n\n i -= 1\n return list(res)", "def array_leaders(numbers):\n rl = []\n sarr = sum(numbers)\n for num in numbers:\n sarr -= num\n if num > sarr:\n rl.append(num)\n return rl", "def array_leaders(numbers):\n \n re=[]\n for i in range(0,len(numbers)):\n if numbers[i]>sum(numbers[i+1:]):\n re.append(numbers[i])\n return re", "def array_leaders(numbers):\n returnlist = []\n for i in range(len(numbers)):\n if numbers[i] > sum(numbers[i+1:]):\n returnlist.append(numbers[i])\n return returnlist", "def array_leaders(numbers):\n return [val for ind, val in enumerate(numbers) if val > sum(numbers[ind+1:])]", "def array_leaders(numbers):\n lsum = 0\n res = []\n tsum = sum(numbers)\n for i in numbers:\n lsum += i\n if i > tsum - lsum:\n res.append(i)\n return res", "def array_leaders(numbers):\n a = []\n for i , x in enumerate(numbers) : \n if x > sum(numbers[i + 1 :]) : a.append(x)\n return a \n", "def array_leaders(numbers):\n length = len(numbers)\n numbers.append(0)\n res = []\n \n for i in range(length):\n if numbers[i] > sum(numbers[i+1:]):\n res.append(numbers[i])\n return res ", "def array_leaders(numbers):\n return [numbers[x] for x in range(len(numbers)) if sum(numbers[x + 1:]) < numbers[x]]\n", "def array_leaders(n):\n return [n[i] for i in range(len(n)) if sum(n[i+1:]) < n[i]]", "def array_leaders(numbers):\n res = []\n for pos, val in enumerate(numbers):\n if val > sum(numbers[pos+1::]):\n res.append(val)\n return res\n", "def array_leaders(numbers):\n return [v for i, v in enumerate(numbers) if v > sum(numbers[i:])-v]", "def array_leaders(numbers):\n ans = []\n for i in range(len(numbers)-1):\n if numbers[i]>sum(numbers[i+1:]):\n ans.append(numbers[i])\n if numbers[-1]>0:\n ans.append(numbers[-1])\n return ans", "def array_leaders(numbers):\n leaders = []\n for i in range(len(numbers)-1):\n if numbers[i] > (sum(numbers[i+1:-1]) + numbers[-1]):\n leaders.append(numbers[i])\n else:\n continue\n if numbers[-1] > 0:\n leaders.append(numbers[-1])\n return leaders\n", "def array_leaders(numbers):\n return [n for c,n in enumerate(numbers,1) if n > sum(numbers[c:])]", "def array_leaders(numbers):\n sum_tot = sum(i for i in numbers)\n sum_left = 0\n a = []\n for i in numbers:\n sum_left += i\n if i > sum_tot - sum_left:\n a.append(i)\n return a", "def array_leaders(numbers):\n numbers.append(0)\n leaders = []\n for i in range(len(numbers) - 1):\n if numbers[i] > sum(numbers[i + 1 : len(numbers)]):\n leaders.append(numbers[i])\n return leaders", "def array_leaders(numbers):\n return [k for i,k in enumerate(numbers) if sum(numbers[i+1:]) < k]", "def array_leaders(numbers):\n if len(numbers)<3:\n return numbers\n n=[]\n for i in range(len(numbers)):\n if int(numbers[i])>sum(numbers[i+1:]):\n n.append(numbers[i])\n return n", "def array_leaders(numbers):\n res = []\n for i, value in enumerate(numbers):\n if numbers[i] > sum(numbers[i+1::]):\n res.append(value)\n return res", "def array_leaders(numbers):\n return [number for i, number in enumerate(numbers) if numbers[i] > sum(numbers[i+1:len(numbers)])]", "def array_leaders(numbers):\n final_list = []\n for item in range(len(numbers)):\n if numbers[item] > sum(numbers[item+1:]):\n final_list.append(numbers[item])\n return final_list", "def array_leaders(numbers):\n return [x for pos, x in enumerate(numbers) if x > sum(numbers[pos+1:])]", "def array_leaders(numbers):\n count, res = 0, []\n while count<len(numbers):\n if len(numbers[count+1:])>=0:\n if numbers[count] > sum(numbers[count+1:]):\n print(numbers[count])\n res.append(numbers[count])\n count+=1\n return res", "def array_leaders(numbers):\n num = []\n for i in range(len(numbers)):\n if numbers[i] > sum(numbers[i+1:]):\n num.append(numbers[i])\n return num", "def array_leaders(numbers):\n li=[]\n for s in range(len(numbers)*-1,0):\n if s==-1:\n if numbers[-1]>0:\n li.append(numbers[s])\n else:\n break\n elif sum(numbers[s+1:])<=numbers[s]:\n li.append(numbers[s])\n else:\n continue\n return li\n", "def array_leaders(numbers):\n kl=[]\n rnumbers=numbers[::-1]\n for i in range(len(numbers)):\n\n if numbers[i]>sum(rnumbers[:-(i+1)]):\n kl.append(numbers[i])\n\n return kl", "def array_leaders(numbers):\n output = []\n for i in range(0,len(numbers)-1):\n if numbers[i] > sum(numbers[i+1:]):\n output.append(numbers[i])\n if numbers[-1] > 0:\n output.append(numbers[-1])\n return output", "def array_leaders(numbers):\n \"\"\"\n Returns 'leader' integers from a list of integers.\n Leader integers are integers that are greater than\n the sum of all the integers to its right.\n \n Args:\n numbers: A list that has at least 3 integers.\n Returns:\n Leader integers.\n \"\"\"\n return [x for i, x in enumerate(numbers) if x > sum(numbers[i+1:])]\n", "from typing import List\n\n\ndef array_leaders(numbers: List[int]) -> List[int]:\n leaders, s = [], sum(numbers)\n for n in numbers:\n s -= n\n if n > s:\n leaders.append(n)\n\n return leaders\n", "def array_leaders(numbers):\n leaders = []\n while numbers:\n if numbers[0] > sum(numbers)-numbers[0]:\n leaders.append(numbers[0])\n numbers.remove(numbers[0])\n return leaders\n\n", "from itertools import accumulate; from operator import add\n\ndef array_leaders(lst):\n r = list(accumulate(lst, add))\n return [n for i, n in enumerate(lst) if r[-1] - r[i] < n]", "def array_leaders(numbers):\n return [x for (index, x) in enumerate(numbers) if x > sum(numbers[index+1:])]\n #for (index, x) in enumerate(numbers):\n # print (index, x, sum(numbers[index:]) )\n", "def array_leaders(numbers):\n # return [numbers[i] for i in range(len(numbers)) if numbers[i] > sum(numbers[i + 1:])]\n return [n for i, n in enumerate(numbers) if n > sum(numbers[i + 1:])]\n\n\n\n# a = []\n# for i in range(len(numbers) - 1):\n# if numbers[i] > sum(numbers[i + 1:]): a.append(numbers[i])\n\n# if numbers[-1] > 0: a.append(numbers[-1])\n \n# return a\n", "def array_leaders(numbers):\n sum = 0\n lst = list()\n numbers = numbers[::-1]\n for i in numbers:\n if i > sum:\n lst.append(i)\n sum += i\n return lst[::-1]", "def array_leaders(n):\n return list(x for i, x in enumerate(n) if x > sum(n[i+1:]))", "def array_leaders(numbers):\n i=len(numbers)-1\n tot=0\n ans=[]\n while i>=0:\n if numbers[i]>tot:\n ans.append(numbers[i])\n tot=tot+numbers[i]\n i=i-1\n return ans[::-1]", "def array_leaders(numbers):\n rightsum = 0\n i = len(numbers) - 1\n leaders = []\n while i > -1:\n if numbers[i] > rightsum:\n leaders.append(numbers[i])\n rightsum += numbers[i]\n i -= 1\n leaders.reverse()\n return leaders", "def array_leaders(numbers):\n return [ i for ind, i in enumerate(numbers) if i > sum( numbers[ind+1:] ) ]", "def array_leaders(numbers):\n res_list = []\n i = 0\n while i < len(numbers)-1:\n if numbers[i] > sum(numbers[i+1:]): res_list.append(numbers[i])\n i += 1\n if numbers[len(numbers)-1] > 0: res_list.append(numbers[len(numbers)-1])\n return res_list", "def array_leaders(numbers):\n sum_right = 0\n result = []\n for num in reversed(numbers):\n if num > sum_right:\n result.append(num)\n sum_right += num\n return result[::-1]", "def array_leaders(numbers):\n results=[]\n \n for i,n in enumerate(numbers):\n if i<len(numbers)-1 and sum(numbers[i+1:])<n:\n results.append(n)\n elif i==len(numbers)-1 and n>0:\n results.append(n)\n \n return results\n"] | {"fn_name": "array_leaders", "inputs": [[[1, 2, 3, 4, 0]], [[16, 17, 4, 3, 5, 2]], [[-1, -29, -26, -2]], [[-36, -12, -27]], [[5, 2]], [[0, -1, -29, 3, 2]]], "outputs": [[[4]], [[17, 5, 2]], [[-1]], [[-36, -12]], [[5, 2]], [[0, -1, 3, 2]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 14,588 |
def array_leaders(numbers):
|
791704e606724d9bfc0fc5b191fb8e29 | UNKNOWN | Given an array of 4 integers
```[a,b,c,d]``` representing two points ```(a, b)``` and ```(c, d)```, return a string representation of the slope of the line joining these two points.
For an undefined slope (division by 0), return ```undefined``` . Note that the "undefined" is case-sensitive.
```
a:x1
b:y1
c:x2
d:y2
```
Assume that ```[a,b,c,d]``` and the answer are all integers
(no floating numbers!).
Slope: | ["def find_slope(points):\n x1, y1, x2, y2 = points\n if x2 - x1 == 0:\n return \"undefined\"\n return str((y2 - y1) // (x2 - x1))", "def find_slope(points):\n x1, y1, x2, y2 = points\n dx = x2 - x1\n dy = y2 - y1\n if dx != 0:\n return str(int(dy / dx))\n else:\n return 'undefined'", "def find_slope(points):\n run = points[0] - points[2]\n rise = points[1] - points[3]\n return \"undefined\" if run == 0 else \"%d\" % (rise / run)", "def find_slope(points):\n x1, y1, x2, y2 = points\n try:\n slope = f'{(y2 - y1) // (x2 - x1)}'\n except ZeroDivisionError as e:\n slope = 'undefined'\n return slope", "from typing import List\n\n\ndef find_slope(points: List[int]) -> str:\n try:\n return str((points[3] - points[1]) // (points[2] - points[0]))\n except ZeroDivisionError:\n return \"undefined\"\n", "def find_slope(points):\n try:\n return str(int((points[3] - points[1]) / (points[2] - points[0])))\n except:\n return \"undefined\"", "def find_slope(points):\n delta_x = points[2] - points[0]\n delta_y = points[3] - points[1]\n if delta_x == 0:\n return \"undefined\"\n return str(delta_y // delta_x)", "find_slope=lambda p: str(int(1.0*(p[3]-p[1])/(p[2]-p[0]))) if (p[2]-p[0])!=0 else \"undefined\"\n", "from typing import List\n\ndef find_slope(points: List[int]) -> str:\n \"\"\" Get a string representation of the slope of the line joining these two points. \"\"\"\n x1, y1, x2, y2 = points\n try:\n return str(int((y2 - y1) / (x2 - x1)))\n except ZeroDivisionError:\n return \"undefined\"", "def find_slope(points):\n lower = points[2] - points[0]\n upper = points[3] - points[1]\n \n if upper == 0 and lower == 0:\n return \"undefined\"\n elif upper == 0:\n return '0'\n elif lower == 0:\n return 'undefined'\n else:\n return str(int(upper / lower))\n", "def find_slope(points):\n try:\n return str(round((points[1] - points[3]) / (points[0] - points[2])))\n except:\n return 'undefined'", "def find_slope(points):\n if points[2]==points[0] :\n return \"undefined\" \n a = int((points[3]-points[1])/(points[2]-points[0]))\n print(a)\n return str(a);", "def find_slope(points):\n side1 = points[2] - points[0]\n side2 = points[3] - points[1]\n return str(side2//side1) if side1 != 0 else \"undefined\"\n", "def find_slope(points):\n if points[2]==points[0]:\n return 'undefined'\n else:\n return str((points[3]-points[1])//(points[2]-points[0]))\n\n", "def find_slope(points):\n x1,y1,x2,y2 = points[0],points[1],points[2],points[3]\n if x1 == x2:\n return \"undefined\"\n else:\n return str(int((y1-y2)/(x1-x2)))\n", "def find_slope(points):\n vertical_change = points[3] - points[1]\n horizontal_change = points[2] - points[0]\n try:\n slope = vertical_change / horizontal_change\n except ZeroDivisionError:\n return 'undefined'\n return str(int(slope))\n \n", "def find_slope(points):\n if points[2] - points[0] == 0:\n return \"undefined\"\n else:\n sloope = (points[3] - points[1])//(points[2] - points[0])\n return str(sloope)\n", "def find_slope(points):\n try:\n return str(round((points[3] - points[1]) / (points[2] - points[0])))\n except ZeroDivisionError:\n return 'undefined'\n", "def find_slope(p):\n y=(p[3]-p[1])\n x=(p[2]-p[0])\n if x==0:\n return \"undefined\"\n return str(int(y/x))", "def find_slope(points):\n \n x = points[2]-points[0]\n return 'undefined' if x == 0 else str((points[3]-points[1])//(points[2]-points[0]))\n", "def find_slope(points):\n return str(int((points[1]-points[3])/(points[0]-points[2])) )if len(points) == 4 and (points[0]-points[2]) != 0 else 'undefined'", "def find_slope(points):\n x1,y1,x2,y2 = points\n return str((y2 - y1) // (x2 - x1)) if x2 != x1 else \"undefined\"\n", "def find_slope(points):\n if points[0] - points[2] == 0:\n return 'undefined'\n else:\n return str(int((points[3] - points[1]) / (points[2] - points[0])))", "def find_slope(points):\n a,b,c,d = points\n if c != a:\n return str(int((d-b)/(c-a)))\n else: return 'undefined'\n", "def find_slope(points):\n try:\n return str(int(points[3] - points[1])//(points[2] - points[0]))\n except ZeroDivisionError:\n return \"undefined\"\n", "def find_slope(points):\n dx = points[2] - points[0]\n dy = points[3] - points[1]\n try:\n m = dy / dx\n return f'{int(m)}'\n except:\n return \"undefined\"\n", "\n# formula: y-y1 = m(x-x1)\n\n\ndef find_slope(points):\n x1, y1, x2, y2 = points[:]\n slope = (y1-y2)//(x1-x2) if x1 != x2 else \"undefined\"\n return str(slope)\n", "def find_slope(points):\n x1, y1, x2, y2 = points\n try: \n slope = (y2 - y1)/(x2-x1)\n return str(round(slope))\n except:\n return 'undefined'\n", "def find_slope(p):\n if (p[2] - p[0]) == 0:\n return \"undefined\"\n else:\n return f'{int((p[3] - p[1]) / (p[2] - p[0]))}' \n", "def find_slope(points):\n a=points[0]\n b=points[1]\n c=points[2]\n d=points[3]\n \n if c-a==0:\n return 'undefined'\n else:\n return str(int((d-b)/(c-a)))\n", "def find_slope(p):\n x=p[0]-p[2]\n y=p[1]-p[3]\n if x!=0:\n return str(int(y/x))\n else:\n return \"undefined\"\n", "def find_slope(points):\n x1,y1,x2,y2 = points\n dy,dx = y2-y1, x2-x1\n return \"undefined\" if dx is 0 else str(int(dy/dx))\n", "import math\ndef find_slope(points):\n delta_x = points[3] - points[1]\n delta_y = points[2] - points[0]\n \n if delta_y == 0:\n return 'undefined'\n return str(math.floor(delta_x / delta_y))", "def find_slope(points):\n if points[-2]==points[0]: return 'undefined'\n return str(int((points[-1]-points[1])/(points[-2]-points[0])))", "def find_slope(p):\n if p[0]==p[2]:\n return \"undefined\"\n else:\n return str(int((p[1]-p[3])/(p[0]-p[2])))", "from math import hypot\ndef find_slope(points):\n return str((points[3] - points[1]) // (points[2] - points[0])) if points[2] != points[0] else \"undefined\"", "def find_slope(p):\n if p[2] == p[0]:\n return \"undefined\"\n else:\n return str((p[3]-p[1])//(p[2]-p[0]))\n", "def find_slope(points):\n rise = points[3] - points[1]\n run = points[2] - points[0]\n return str(rise//run) if run else 'undefined'\n", "def find_slope(points):\n try:\n return str(int(points[3]-points[1])//int(points[2]-points[0]))\n except ZeroDivisionError:\n return \"undefined\"\n", "def find_slope(points):\n x = points[2] - points[0]\n y = points[3] - points[1]\n if x == 0:\n return \"undefined\"\n else:\n return str(int(y/x))", "def find_slope(points):\n if points[2]==points[0]:\n return 'undefined'\n else:\n return '0' if points[1]==points[3] else str((points[3]-points[1])//(points[2]-points[0]))\n\n", "def find_slope(points):\n if (points[2] - points[0] == 0):\n return \"undefined\"\n m = (points[3] - points[1]) / (points[2] - points[0])\n res = int(m)\n return str(res)\n", "def find_slope(points):\n y = points[1] - points[3]\n x = points[0] - points[2]\n try:\n return str(int(y / x))\n except:\n return \"undefined\"", "def find_slope(points):\n a, b, c, d = points\n return str((b - d) // (a - c)) if a != c else 'undefined'", "def find_slope(points):\n delta_x = points[0] - points[2]\n delta_y = points[1] - points[3]\n return str(delta_y // delta_x) if delta_x else 'undefined'\n", "def find_slope(points):\n a, b, c, d = points\n if a == c:\n return \"undefined\"\n return str((d - b) // (c - a))", "def find_slope(points):\n return \"undefined\" if points[0] == points[2] else str(round((points[3]-points[1])/(points[2]-points[0])))\n", "def find_slope(points):\n x = points[2] - points[0]\n y = points[3] - points[1]\n return f\"{round(y/x)}\" if x else \"undefined\"", "def find_slope(points):\n a,b,c,d = points\n if a-c == 0: return 'undefined'\n return str(int((b-d)/(a-c)))\n", "def find_slope(p):\n return \"undefined\" if p[0] == p[2] else str(int( ( p[1]-p[3] ) / ( p[0]-p[2] )))", "def find_slope(points):\n a, b, c, d = points[0], points[1], points[2], points[3]\n if a==c:\n return \"undefined\"\n else:\n return str(int((b-d)/(a-c)))", "def find_slope(points):\n return \"undefined\" if points[0] == points[2] else str(int((points[3] - points[1])/(points[2]-points[0])))", "def find_slope(points):\n a,b,c,d = points\n if a == c:\n return \"undefined\"\n else:\n return str((d-b)//(c-a))\n", "def find_slope(points):\n try:\n print ('points =', points)\n x1, y1, x2, y2 = points\n slope = (y2 - y1) / (x2 - x1)\n return f'{slope:.0f}' if slope != 0 else '0'\n except (TypeError, ValueError, ZeroDivisionError):\n return 'undefined'", "def find_slope(points: list):\n try:\n x1, y1, x2, y2 = points\n return str((y2 - y1) // (x2 - x1))\n except:\n return 'undefined'", "def find_slope(p):\n y = (p[1]-p[3])\n x = (p[0]-p[2])\n if x == 0:\n return \"undefined\"\n else:\n return \"{}\".format(int(y/x))\n", "def find_slope(points):\n try:\n return str(round((points[3] - points[1]) / (points[2] - points[0])))\n except:\n return 'undefined'", "def find_slope(points):\n if points[0] != points[2]:\n return str(int((points[3]-points[1]) / (points[2]-points[0])))\n else:\n return \"undefined\"", "def find_slope(points):\n try:\n result = (points[3] - points[1]) // (points[2] - points[0])\n return \"%s\" % (result,)\n except ZeroDivisionError:\n return \"undefined\"\n", "def find_slope(s):\n try:\n d = (s[3]-s[1])//(s[2]-s[0])\n return str(d)\n except:\n return 'undefined'", "def find_slope(points):\n try:\n return f'{int((points[3]-points[1]) / (points[2] - points[0]))}' \n except ZeroDivisionError:\n return \"undefined\"", "def find_slope(points):\n top_of_equation = points[3]-points[1]\n bot_of_equation = points[2]-points[0]\n\n if bot_of_equation == 0:\n return \"undefined\"\n return str(int(round(top_of_equation / bot_of_equation)))\n", "def find_slope(points):\n a, b, c, d = points\n try:\n return str((d - b) // (c - a))\n except ZeroDivisionError:\n return 'undefined'\n", "find_slope=lambda p:str((p[3]-p[1])//(p[2]-p[0])) if p[2]!=p[0] else \"undefined\"", "def find_slope(points):\n x0, y0, x1, y1 = points[0], points[1], points[2], points[3]\n if x1 - x0 == 0:\n return \"undefined\"\n return str((y1 - y0) // (x1 - x0))\n", "def find_slope(points):\n a,b,c,d = points\n try:\n return str(int((d-b)/(c-a)))\n except ZeroDivisionError:\n return 'undefined'", "def find_slope(points):\n x1, y1, x2, y2 = points\n return str((y2 - y1) // (x2 - x1)) if x2 - x1 != 0 else \"undefined\"", "def find_slope(points):\n dx = points[2] - points[0]\n dy = points[3] - points[1]\n return str(dy // dx) if dx != 0 else \"undefined\"", "def find_slope(points):\n x1 = points[0]\n x2 = points[2]\n y1 = points[1]\n y2 = points[3]\n \n x3 = (x2 - x1)\n y3 = (y2 - y1)\n \n if(x3 == 0):\n return 'undefined'\n else:\n return f'{y3 // x3}'\n", "find_slope = lambda points: str((points[3]-points[1]) // (points[2]-points[0])) if points[2]-points[0] != 0 else 'undefined'", "def find_slope(a):\n x1,x2 = a[0],a[2]\n y1,y2 = a[1],a[3]\n if x1 != x2:\n return str(int((y2 - y1) / (x2 - x1)))\n else:\n return \"undefined\"\n", "def find_slope(points):\n return str((points[1] - points[3]) // (points[0] - points[2])) if (points[0] - points[2]) else \"undefined\"", "def find_slope(points):\n x1, y1, x2, y2 = points\n if x1==x2:\n return 'undefined'\n else:\n return str((y2 - y1)//(x2 - x1))", "def find_slope(points):\n x1, y1, x2, y2 = points\n return \"undefined\" if x2 - x1 == 0 else str((y2 - y1) // (x2 - x1)) \n\n\n# def find_slope(points):\n# try:\n# return str((points[3] - points[1]) / (points[2] - points[0]))\n# except ZeroDivisionError:\n# return \"undefined\"\n\n# def find_slope(points):\n# a,b,c,d = points\n# return 'undefined' if a == c else str((b - d) / (a - c))\n", "def find_slope(p):\n x = p[3]-p[1]\n y = p[2]-p[0]\n \n if y==0:\n return \"undefined\"\n else:\n return \"{}\".format(int(x/y))\n \n \n", "def find_slope(points):\n try:\n k = (points[3] - points[1]) // (points[2] - points[0])\n return str(k)\n except ZeroDivisionError:\n return 'undefined'", "def find_slope(points):\n return(str(int((points[3] - points[1])/(points[2] - points[0]))) if points[0] != points[2] else \"undefined\")", "def find_slope(points):\n [a,b,c,d]=points\n return str(int((d-b)/(c-a))) if c!=a else \"undefined\"", "def find_slope(points):\n dx = points[2] - points[0]\n dy = points[3] - points[1]\n\n return str(dy // dx) if dx else 'undefined'", "def find_slope(points):\n a, b, c, d = points\n return str((d - b) // (c - a)) if a != c else 'undefined'", "def find_slope(points):\n try:\n return str(int((points[1] - points[3]) / (points[0] - points[2])))\n except:\n return \"undefined\"", "def find_slope(p):\n return str(int((p[3]-p[1])/(p[2]-p[0]))) if p[2] != p[0] else 'undefined'", "def find_slope(points):\n delta_x = points[0] - points[2]\n delta_y = points[1] - points[3]\n \n if delta_x == 0:\n return 'undefined'\n else:\n return str(int(delta_y / delta_x)) ", "def find_slope(points):\n if points[0] != points[2]:\n return str(int((points[1] - points[3])/(points[0] - points[2])))\n return \"undefined\"", "def find_slope(points):\n x1, y1, x2, y2 = points\n return f'{(y2 - y1) // (x2 - x1)}' if x1 != x2 else 'undefined'", "def find_slope(points):\n x1, y1 = points[0], points[1]\n x2, y2 = points[2], points[3]\n \n return str(int((y2 - y1) / (x2 - x1))) if x2 - x1 != 0 else 'undefined'", "def find_slope(points):\n x = int(points[2]-points[0])\n y=int(points[3]-points[1])\n return str(int(y/x)) if x !=0 else \"undefined\"\n"] | {"fn_name": "find_slope", "inputs": [[[12, -18, -15, -18]], [[3, -20, 5, 8]], [[17, -3, 17, 8]], [[1, -19, -2, -7]], [[19, 3, 20, 3]], [[6, -12, 15, -3]], [[15, -3, 15, -3]], [[9, 3, 19, -17]], [[3, 6, 4, 10]], [[2, 7, 4, -7]], [[1, 24, 2, 88]], [[4, 384, 8, 768]], [[4, 16, 4, 18]], [[7, 28, 9, 64]], [[18, -36, 12, 36]], [[36, 580, 42, 40]], [[1, 2, 2, 6]], [[-6, 57, -6, 84]], [[92, 12, 96, 64]], [[90, 54, 90, 2]], [[3, 6, 4, 9]], [[-2, -5, 2, 3]], [[3, 3, 2, 0]]], "outputs": [["0"], ["14"], ["undefined"], ["-4"], ["0"], ["1"], ["undefined"], ["-2"], ["4"], ["-7"], ["64"], ["96"], ["undefined"], ["18"], ["-12"], ["-90"], ["4"], ["undefined"], ["13"], ["undefined"], ["3"], ["2"], ["3"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 14,800 |
def find_slope(points):
|
3151b858042b0cda1ed709956e295c9c | UNKNOWN | In this Kata, you will be given a number and your task will be to return the nearest prime number.
```Haskell
solve(4) = 3. The nearest primes are 3 and 5. If difference is equal, pick the lower one.
solve(125) = 127
```
We'll be testing for numbers up to `1E10`. `500` tests.
More examples in test cases.
Good luck!
If you like Prime Katas, you will enjoy this Kata: [Simple Prime Streaming](https://www.codewars.com/kata/5a908da30025e995880000e3) | ["def solve(n):\n print('starting with {0}'.format(n), flush=True)\n\n def is_prime(p):\n if p % 2 == 0 :\n return False\n for x in range(3,int(p**.5)):\n if p % x == 0:\n return False\n return True\n #return not any([p%x==0 for x in range(3,int(p**.5))])\n\n if is_prime(n):\n return n\n step = (n%2) + 1\n while 1:\n if is_prime(n-step):\n return n-step\n elif is_prime(n+step):\n return n+step\n else:\n step += 2\n return None\n\n", "def isPrime(n): \n if n < 2:\n return False \n for i in range(2,int(n**.5)+1): \n if not n%i:\n return False\n return True \n\n\ndef solve(n): \n if isPrime(n):\n return n\n add = 1\n rem = 1 \n\n ans = None \n while True: \n if isPrime(n+add):\n ans = n+add \n if isPrime(n-rem):\n ans = n-rem\n if ans != None:\n return ans \n add += 1\n rem += 1", "is_prime = lambda n: n in (2, 3) or n > 3 and n % 2 and n % 3 and all(n % f and n % (f + 2) for f in range(5, int(n ** .5) + 1, 6))\nsolve = lambda n: next(p for gap in __import__('itertools').count(0) for p in (n - gap, n + gap) if is_prime(p))", "def solve(n):\n i = 2\n if n%2==0:\n i = 1\n if IsPrime(n):\n return n\n while True:\n temp = n-i\n if IsPrime(temp):\n return temp\n temp = n+i\n if IsPrime(temp):\n return temp\n i+=2\n\ndef IsPrime(n):\n if n %2 ==0:\n return False\n for i in range(3,int(n**0.5),2):\n if n % i == 0:\n return False\n return True", "from math import sqrt\ndef solve(n):\n \n ls = []\n \n for i in range(n, n+300):\n \n temp = True\n for j in range(2, int(sqrt(n)) + 10):\n \n if i % j == 0 and i != j:\n temp = False\n break\n if temp: \n ls.append(i)\n break\n \n \n for i in range(n - abs(n-ls[0]), n+1):\n \n temp = True\n for j in range(2, int(sqrt(n)) + 10):\n \n if i % j == 0 and i != j:\n temp = False\n break\n if temp: \n ls.append(i)\n \n if len(ls) > 1:\n return ls[-1]\n return ls[0]", "from itertools import chain, count\n\n\ndef is_prime(n):\n return n == 2 or (n > 2 and n % 2 and all(n % i for i in range(3, int(n**0.5)+1, 2)))\n\n\ndef solve(n):\n deltas = chain([0], chain.from_iterable([-i, +i] for i in count(1)))\n return next(n+delta for delta in deltas if is_prime(n+delta))", "from itertools import count\nfrom bisect import bisect_left as bisect\n\nn = 100005 # Sieve up to (10**10)**.5 + 5\nsieve, primes = [0]*((n>>1)+1), [2] # optimized sieve (store only odd numbers\nfor i in range(3, n+1, 2):\n if not sieve[i>>1]:\n primes.append(i)\n for j in range(i**2>>1, (n+1)>>1, i): sieve[j] = 1\n \ndef solve(n):\n if n%2 and n>>1 < len(sieve) and not sieve[n>>1]: return n # easy check: prime if sieve element is set to False\n \n idx = bisect(primes,n) # Insertion point of n in the prime list\n return bigSearch(n, idx) if idx == len(primes) \\\n else min( primes[max(0,idx-1):idx+2], key=lambda x: (abs(x-n), x)) # fast look up in the list of primes (check element before, under and after the insertion point)\n\ndef isPrime(n, iSq): return all(n%x for x in primes[:iSq])\n\ndef bigSearch(n, idx):\n iSq = bisect(primes,n**.5,0,idx) # insertion point of n**.5 in the prime list (for complex primality check)\n isPair = not n%2\n for x in count(0):\n for c in [-1,1]:\n p = n+c*(2*x + isPair)\n if isPrime(p, iSq): return p\n"] | {"fn_name": "solve", "inputs": [[3], [11], [4], [110], [1110], [3000], [35000], [350000], [3500000], [10000000000]], "outputs": [[3], [11], [3], [109], [1109], [2999], [34981], [350003], [3499999], [10000000019]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 4,058 |
def solve(n):
|
f562971f6873da9ea48ac2bc21043c2f | UNKNOWN | Johnny is a farmer and he annually holds a beet farmers convention "Drop the beet".
Every year he takes photos of farmers handshaking. Johnny knows that no two farmers handshake more than once. He also knows that some of the possible handshake combinations may not happen.
However, Johnny would like to know the minimal amount of people that participated this year just by counting all the handshakes.
Help Johnny by writing a function, that takes the amount of handshakes and returns the minimal amount of people needed to perform these handshakes (a pair of farmers handshake only once). | ["from math import ceil\n\ndef get_participants(h):\n return int(ceil(0.5 + (0.25 + 2 * h) ** 0.5))\n", "def get_participants(handshakes, n = 1):\n return get_participants(handshakes, n + 1) if (n * n - n)/2 < handshakes else n", "def get_participants(handshakes):\n from math import ceil\n \n \"\"\"\n Person #1 can shake hands with (n-1) people, person #2\n can shake hands with (n-2) people... etc. Therefore,\n n people can at most shake hands h = n*(n-1)/2 different times.\n \n If we flip this equation we get the amount\n of people necessary:\n n = 1/2 +(-) sqrt((8*h + 1)/4)\n \n The number of handshakes given might be smaller than\n the max amount possible for n people, so we need to round up.\n \"\"\"\n \n return ceil(0.5 + ((8*handshakes + 1)/4)**0.5)", "def get_participants(handshakes):\n return int(1.5 + (2 * handshakes)**0.5)", "def get_participants(h):\n n = 0\n counter = 0\n while h > 0:\n h -= counter\n n += 1\n counter += 1\n return n or 1", "from bisect import bisect_left\n\nns = [n*(n+1)//2 for n in range(1000)]\n\ndef get_participants(handshakes):\n return bisect_left(ns, handshakes) + 1", "def get_participants(h):\n from math import ceil, sqrt\n return ceil(.5 + sqrt(.25 + 2*h))", "import math\ndef get_participants(h):\n return math.ceil((1+math.sqrt(1+8*h))/2)", "def get_participants(handshakes):\n farmers = 1\n maxshakes = 0\n while maxshakes < handshakes:\n maxshakes += farmers\n farmers += 1\n return farmers", "from math import ceil \n\ndef get_participants(hs):\n return ceil((1+(1+8*(hs))**.5)/2)"] | {"fn_name": "get_participants", "inputs": [[0], [1], [3], [6], [7]], "outputs": [[1], [2], [3], [4], [5]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,710 |
def get_participants(h):
|
5bef9b47acbb36e6bd464a53964225e4 | UNKNOWN | This is a beginner friendly kata especially for UFC/MMA fans.
It's a fight between the two legends: Conor McGregor vs George Saint Pierre in Madison Square Garden. Only one fighter will remain standing, and after the fight in an interview with Joe Rogan the winner will make his legendary statement. It's your job to return the right statement depending on the winner!
If the winner is George Saint Pierre he will obviously say:
- "I am not impressed by your performance."
If the winner is Conor McGregor he will most undoubtedly say:
- "I'd like to take this chance to apologize.. To absolutely NOBODY!"
Good Luck! | ["statements = {\n 'george saint pierre': \"I am not impressed by your performance.\",\n 'conor mcgregor': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n}\n\ndef quote(fighter):\n return statements[fighter.lower()]", "h = {\n 'george saint pierre': \"I am not impressed by your performance.\",\n 'conor mcgregor' : \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n}\n\ndef quote(fighter):\n return h[fighter.lower()]", "def quote(fighter):\n return [\"I am not impressed by your performance.\",\\\n \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"][fighter.lower() == 'conor mcgregor']", "def quote(fighter):\n\n if fighter == 'Conor McGregor' or fighter == 'conor mcgregor' : return 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'\n else: return 'I am not impressed by your performance.'\n pass\n print (quote)", "def quote(fighter):\n return \"I am not impressed by your performance.\" if \"i\" in fighter else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "quote = lambda w: {\"g\":\"I am not impressed by your performance.\", \"c\":\"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}[w[0].lower()]\n", "def quote(fighter):\n if fighter== \"george saint pierre\" : return \"I am not impressed by your performance.\"\n if fighter== \"George Saint Pierre\" : return \"I am not impressed by your performance.\"\n if fighter== \"conor mcgregor\" or fighter== \"Conor McGregor\" : return\"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n return {'conor mcgregor': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\",\n 'george saint pierre': \"I am not impressed by your performance.\"}[fighter.casefold()]\n\nprint(quote('Conor Mcgregor'))", "def quote(fighter):\n return {'conor mcgregor': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\", 'george saint pierre': \"I am not impressed by your performance.\"}[fighter.lower()]", "quote = lambda w: {\"george saint pierre\":\"I am not impressed by your performance.\", \"conor mcgregor\":\"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}[w.lower()]", "def quote(fighter):\n return {'george saint pierre': 'I am not impressed by your performance.',\n 'conor mcgregor': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}.get(fighter.lower())", "def quote(fighter):\n if fighter.lower() == 'conor mcgregor': return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n else: return \"I am not impressed by your performance.\"", "def quote(fighter):\n if (fighter.lower() == \"conor mcgregor\"):\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n return \"I am not impressed by your performance.\"", "def quote(fighter):\n if fighter[1]==\"e\":\n return \"I am not impressed by your performance.\"\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n return {\"george saint pierre\": \"I am not impressed by your performance.\",\n \"conor mcgregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}[fighter.lower()]", "def quote(fighter):\n text = [\"I am not impressed by your performance.\",\n \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"]\n return text['conor' in fighter.lower()]", "def quote(fighter):\n return 'I am not impressed by your performance.' if fighter.lower() == 'george saint pierre' else 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'", "def quote(fighter):\n return \"I am not impressed by your performance.\" if fighter.lower() == \"george saint pierre\" else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter: str) -> str:\n \"\"\" Get the right statement depending on the winner! \"\"\"\n statements = {\n \"george saint pierre\": \"I am not impressed by your performance.\",\n \"conor mcgregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n }\n return statements.get(fighter.lower())", "def quote(fighter):\n q1 = [73, 32, 97, 109, 32, 110, 111, 116, 32, 105, 109, 112, 114, \n 101, 115, 115, 101, 100, 32, 98, 121, 32, 121, 111, 117, 114, \n 32, 112, 101, 114, 102, 111, 114, 109, 97, 110, 99, 101, 46]\n f = [103, 101, 111, 114, 103, 101, 32, 115, 97, 105, 110, 116, 32, \n 112, 105, 101, 114, 114, 101]\n q2 = [73, 39, 100, 32, 108, 105, 107, 101, 32, 116, 111, 32, 116, \n 97, 107, 101, 32, 116, 104, 105, 115, 32, 99, 104, 97, 110, \n 99, 101, 32, 116, 111, 32, 97, 112, 111, 108, 111, 103, 105, \n 122, 101, 46, 46, 32, 84, 111, 32, 97, 98, 115, 111, 108, 117, \n 116, 101, 108, 121, 32, 78, 79, 66, 79, 68, 89, 33]\n to_o = lambda a: [ord(v) for v in a]\n to_s = lambda a: \"\".join([chr(v) for v in a])\n return to_s(q1) if to_o(fighter.lower()) == f else to_s(q2)", "def quote(fighter):\n a=len(fighter)\n if a==19:\n return \"I am not impressed by your performance.\"\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(f):\n return \"I am not impressed by your performance.\" if 'aint' in f else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n if len(fighter)==19:\n return \"I am not impressed by your performance.\"\n if len(fighter)==14:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(f):\n return \"I am not impressed by your performance.\" if(f.capitalize()=='George saint pierre') else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" ", "QUOTE = {\"george saint pierre\": \"I am not impressed by your performance.\",\n \"conor mcgregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}\n\ndef quote(fighter):\n\n return QUOTE[fighter.lower()]\n", "def quote(fighter):\n f1 = 'george saint pierre'\n f2 = 'conor mcgregor'\n m1 = 'I am not impressed by your performance.'\n m2 = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n return m1 if fighter.lower() == f1 else m2", "def quote(fighter):\n x ={\n 'george saint pierre': \"I am not impressed by your performance.\",\n 'conor mcgregor': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n }\n return x.get(fighter.lower())", "def quote(fighter):\n winner = fighter.lower()\n if winner == 'george saint pierre':\n return \"I am not impressed by your performance.\"\n elif winner == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n else:\n return \"You did not enter Saint Pierre or Conor McGregor\"", "def quote(fighter):\n if len(fighter) > 14:\n return \"I am not impressed by your performance.\"\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n if fighter.title() == 'George Saint Pierre':\n return \"I am not impressed by your performance.\"\n # if fighter.title() == 'Conor McGregor':\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n new_fighter = fighter.lower()\n if new_fighter == 'george saint pierre':\n return 'I am not impressed by your performance.'\n elif new_fighter == 'conor mcgregor':\n return 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'", "def quote(fighter):\n if 'nt' in fighter:\n return \"I am not impressed by your performance.\"\n elif 'or' in fighter:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n return \"I am not impressed by your performance.\" if fighter==\"George Saint Pierre\" or fighter==\"george saint pierre\" else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n return \"I am not impressed by your performance.\" * (len(fighter) > 15) + \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" * (len(fighter) < 15)", "statements_Rogan = {\n 'george saint pierre': \"I am not impressed by your performance.\",\n 'conor mcgregor': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n}\n\ndef quote(fighter):\n return statements_Rogan[fighter.lower()]", "def quote(fighter):\n ans = {'george saint pierre': \"I am not impressed by your performance.\",\n 'conor mcgregor': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n }\n return ans[fighter.lower()]", "def quote(fighter):\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" if str.lower(fighter) == 'conor mcgregor' else \"I am not impressed by your performance.\"", "def quote(fighter):\n return \"I am not impressed by your performance.\" if len(fighter) > 15 else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n fighter = fighter.lower()\n quote = {\n \"george saint pierre\": \"I am not impressed by your performance.\",\n \"conor mcgregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n }\n return quote[fighter]\n \n", "def quote(fighter: str) -> str:\n george = \"George Saint Pierre\".casefold()\n conor = \"Conor McGregor\".casefold()\n fighter = fighter.casefold()\n if fighter == george:\n return \"I am not impressed by your performance.\"\n elif fighter == conor:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n else:\n return \"\"", "def quote(fighter):\n d={'conor mcgregor':\"I'd like to take this chance to apologize.. To absolutely NOBODY!\",\"george saint pierre\":\"I am not impressed by your performance.\"}\n return d[fighter.casefold()]\n pass", "def quote(fighter):\n fighter = fighter.lower()\n if fighter == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n return \"I am not impressed by your performance.\"", "def quote(fighter: str) -> str:\n return (\n \"I am not impressed by your performance.\"\n if fighter in (\"george saint pierre\", \"George Saint Pierre\")\n else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n )", "def quote(fighter):\n \n q1 = 'I am not impressed by your performance.'\n q2 = 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'\n return q1 if fighter.lower() == 'george saint pierre' else q2", "quote=lambda f:{'george saint pierre':'I am not impressed by your performance.','conor mcgregor':\"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}[f.lower()]", "def quote(fighter):\n fighter.upper()\n if fighter == \"George Saint Pierre\" or fighter == \"george saint pierre\":\n return \"I am not impressed by your performance.\"\n elif fighter == \"Conor McGregor\" or fighter == \"conor mcgregor\":\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n return \"I am not impressed by your performance.\" if fighter.startswith('g') or fighter.startswith('G') else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n if fighter.upper() == 'George Saint Pierre'.upper(): \n return 'I am not impressed by your performance.'\n else:\n return 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'", "def quote(fighter):\n quotes={\n 'GEORGE SAINT PIERRE': \"I am not impressed by your performance.\",\n 'CONOR MCGREGOR': \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n }\n return quotes[fighter.upper()]", "def quote(fighter):\n a=fighter.lower()\n if a== 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n if a== 'george saint pierre':\n return \"I am not impressed by your performance.\"", "def quote(fighter):\n print(fighter)\n if fighter.lower() == \"george saint pierre\":\n return \"I am not impressed by your performance.\"\n elif fighter.lower()== \"conor mcgregor\":\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n fight = fighter.lower()\n return \"I am not impressed by your performance.\" if fight == \"george saint pierre\" else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n\n\n", "def quote(fighter):\n if fighter == 'george saint pierre':\n return \"I am not impressed by your performance.\"\n if fighter == 'Conor McGregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n if fighter == 'George Saint Pierre':\n return \"I am not impressed by your performance.\"\n if fighter == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(r):\n return \"I am not impressed by your performance.\" if ('george saint pierre')==r.lower() else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n fighter2 = fighter.lower()\n if fighter2 == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n else:\n return \"I am not impressed by your performance.\"", "def quote(fighter):\n if fighter.lower() == 'george saint pierre':\n return(f\"I am not impressed by your performance.\")\n if fighter.lower() == 'conor mcgregor':\n return(f\"I'd like to take this chance to apologize.. To absolutely NOBODY!\")\n", "def quote(fighter):\n conor = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n george = \"I am not impressed by your performance.\"\n return conor if fighter.lower() == 'conor mcgregor' else george", "def quote(fighter):\n if(fighter == \"Conor McGregor\" or fighter == \"Conor McGregor\".lower()):\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n elif(fighter == \"George Saint Pierre\" or fighter == \"George Saint Pierre\".lower()):\n return \"I am not impressed by your performance.\"", "def quote(fighter):\n dict_of_responses = {\n \"George Saint Pierre\": \"I am not impressed by your performance.\",\n \"george saint pierre\": \"I am not impressed by your performance.\",\n \"Conor McGregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\",\n \"conor mcgregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\",\n }\n return dict_of_responses[fighter]", "def quote(fighter):\n x = fighter.upper()\n if x == 'GEORGE SAINT PIERRE':\n return \"I am not impressed by your performance.\"\n elif x == 'CONOR MCGREGOR':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n", "def quote(f):\n dir = {'g':\"I am not impressed by your performance.\", 'c':\"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}\n return dir[f[0].lower()]", "def quote(fighter):\n warrior = fighter.lower()\n if warrior == 'george saint pierre':\n return \"I am not impressed by your performance.\"\n elif warrior == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" ", "fighters_statements = {\n \"george saint pierre\": \"I am not impressed by your performance.\",\n \"conor mcgregor\" : \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n}\n\ndef quote(fighter):\n return fighters_statements[fighter.lower()]", "ufc_fighters = {\n \"conor mcgregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\",\n \"george saint pierre\": \"I am not impressed by your performance.\"\n}\n\ndef quote(fighter):\n return ufc_fighters.get(fighter.lower())", "def quote(fighter):\n new_fighter = fighter.lower()\n if new_fighter == 'george saint pierre':\n return \"I am not impressed by your performance.\"\n elif new_fighter == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n if fighter == \"conor mcgregor\":\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n elif fighter == 'george saint pierre':\n return \"I am not impressed by your performance.\" \n elif fighter == \"Conor McGregor\":\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n elif fighter == 'George Saint Pierre':\n return \"I am not impressed by your performance.\" ", "def quote(fighter):\n \"O\u043f\u0440\u0435\u0434\u0435\u043b\u044f\u0435\u043c \u043f\u043e\u0431\u0435\u0434\u0438\u0435\u043b\u044f\"\n f1 = str(fighter.lower())\n if f1 == 'george saint pierre':\n return \"I am not impressed by your performance.\"\n elif f1 == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n else:\n return 'XUY'", "def quote(f):\n if f.lower() == 'george saint pierre':\n return \"I am not impressed by your performance.\"\n if f.lower() == 'conor mcgregor':\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n #print(fighter[0])\n if fighter[0] == 'c' or fighter[0] == 'C':\n return 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'\n if fighter[0] == 'g' or fighter[0] == 'G':\n return 'I am not impressed by your performance.'\n", "def quote(fighter):\n conor = \"Conor McGregor\"\n george = \"George Saint Pierre\"\n \n if fighter == conor or fighter == conor.lower(): return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n if fighter == george or fighter == george.lower(): return \"I am not impressed by your performance.\"", "def quote(fighter):\n cm = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n gsp = \"I am not impressed by your performance.\"\n if fighter.lower() == \"george saint pierre\":\n return gsp\n elif fighter.lower() == \"conor mcgregor\":\n return cm\n else:\n pass", "def quote(fighter):\n fight=fighter.lower()\n if fight=='george saint pierre':\n return 'I am not impressed by your performance.'\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n return [\"I am not impressed by your performance.\",\"I'd like to take this chance to apologize.. To absolutely NOBODY!\"][len(fighter)==14]", "def quote(fighter):\n \n a = \"I am not impressed by your performance.\"\n b = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n c = 'Conor McGregor'.lower()\n \n return f\"{b}\" if fighter.lower() == c else f\"{a}\"", "def quote(fighter):\n if str(fighter.lower()) == 'george saint pierre':\n return 'I am not impressed by your performance.'\n else:\n return 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'", "def quote(fighter):\n flighter = fighter.lower()\n \n if flighter == 'george saint pierre':\n return 'I am not impressed by your performance.'\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n s = [\"I am not impressed by your performance.\",\n \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"]\n return s[0] if fighter[0].lower() == \"g\" else s[1]", "def quote(fighter):\n r = {\"george saint pierre\": \"I am not impressed by your performance.\",\n \"conor mcgregor\": \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"}\n return r.get(fighter.lower())", "from typing import Union\n\ndef quote(fighter: str) -> Union[str, None]:\n fighter = fighter.casefold()\n \n if fighter == \"george saint pierre\":\n return \"I am not impressed by your performance.\"\n elif fighter == \"conor mcgregor\":\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n return None", "def quote(fighter):\n if fighter.lower() == 'george saint pierre':\n return f'I am not impressed by your performance.'\n return f\"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n if fighter == 'conor mcgregor' or fighter == 'Conor McGregor':\n return 'I\\'d like to take this chance to apologize.. To absolutely NOBODY!'\n elif fighter == 'george saint pierre' or fighter == 'George Saint Pierre':\n return 'I am not impressed by your performance.'", "def quote(fighter):\n if fighter.lower() == 'george saint pierre':\n result = \"I am not impressed by your performance.\"\n else:\n result = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n return result", "def quote(fighter):\n if 'george saint pierre' in fighter.lower():\n return \"I am not impressed by your performance.\"\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n ans1 = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n ans2 = \"I am not impressed by your performance.\"\n if fighter.lower() == \"conor mcgregor\" :\n return ans1\n else: return ans2\n pass", "import re\ndef quote(fighter):\n if re.match(r\"George Saint Pierre\",fighter,re.IGNORECASE):\n return \"I am not impressed by your performance.\"\n if re.match(r\"Conor McGregor\",fighter,re.IGNORECASE):\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n pass", "def quote(fighter):\n print(fighter)\n if fighter == 'george saint pierre' or fighter == 'George Saint Pierre':\n return 'I am not impressed by your performance.'\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "quote=lambda f:\"I am not impressed by your performance.\" if f.lower() == 'george saint pierre' else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" if f.lower() == 'conor mcgregor' else 'ERROR'", "def quote(fighter):\n if 'george' in fighter.lower():\n return \"I am not impressed by your performance.\"\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n str1 = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n str2 = \"I am not impressed by your performance.\"\n if fighter == \"conor mcgregor\" :\n fighter = str1\n elif fighter == \"Conor McGregor\" :\n fighter = str1\n elif fighter == \"george saint pierre\" :\n fighter = str2\n elif fighter == \"George Saint Pierre\" :\n fighter = str2\n return fighter", "def quote(fighter):\n if fighter == \"George Saint Pierre\":\n return \"I am not impressed by your performance.\"\n elif fighter == \"George Saint Pierre\".lower():\n return \"I am not impressed by your performance.\"\n \n elif fighter == \"Conor McGregor\":\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n elif fighter == \"Conor McGregor\".lower():\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "quote = lambda fighter: \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" if fighter.lower() == 'conor mcgregor' else 'I am not impressed by your performance.'", "def quote(fighter):\n return ['I am not impressed by your performance.','I\\'d like to take this chance to apologize.. To absolutely NOBODY!'][fighter.lower() =='conor mcgregor']", "def quote(fighter):\n q1 = \"I am not impressed by your performance.\"\n q2 = \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n f1a = 'george saint pierre'\n f1b = 'George Saint Pierre'\n f2a = 'conor mcgregor'\n f2b = 'Conor McGregor'\n if fighter == f1a:\n return q1\n elif fighter == f1b:\n return q1\n elif fighter == f2a:\n return q2\n elif fighter == f2b:\n return q2", "def quote(f):\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" if f[0].lower() == 'c' else \"I am not impressed by your performance.\"", "def quote(fighter):\n fighter = fighter.title()\n if fighter == \"George Saint Pierre\":\n return \"I am not impressed by your performance.\"\n if fighter == \"Conor Mcgregor\":\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n n = [\"Conor McGregor\".lower(),\"George Saint Pierre\".lower()]\n if fighter.lower()==n[0].lower():\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"\n else:\n return \"I am not impressed by your performance.\"\nx = quote('Conor McGregor')\nprint(x)", "def quote(fighter):\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\" if 'conor' in fighter.lower() else \"I am not impressed by your performance.\"", "def quote(fighter):\n m = fighter.upper()\n if m == \"GEORGE SAINT PIERRE\":\n return \"I am not impressed by your performance.\"\n else:\n return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n a = 'George Saint Pierre'\n return \"I am not impressed by your performance.\" if fighter.title() == a else \"I'd like to take this chance to apologize.. To absolutely NOBODY!\"", "def quote(fighter):\n if fighter[0].lower()==\"g\": return \"I am not impressed by your performance.\" \n else: return \"I'd like to take this chance to apologize.. To absolutely NOBODY!\""] | {"fn_name": "quote", "inputs": [["George Saint Pierre"], ["Conor McGregor"], ["george saint pierre"], ["conor mcgregor"]], "outputs": [["I am not impressed by your performance."], ["I'd like to take this chance to apologize.. To absolutely NOBODY!"], ["I am not impressed by your performance."], ["I'd like to take this chance to apologize.. To absolutely NOBODY!"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 26,595 |
def quote(fighter):
|
4f859b591edf732384d30ebd0242aba1 | UNKNOWN | # Task
Let's say that `"g" is happy` in the given string, if there is another "g" immediately to the right or to the left of it.
Find out if all "g"s in the given string are happy.
# Example
For `str = "gg0gg3gg0gg"`, the output should be `true`.
For `str = "gog"`, the output should be `false`.
# Input/Output
- `[input]` string `str`
A random string of lower case letters, numbers and spaces.
- `[output]` a boolean value
`true` if all `"g"`s are happy, `false` otherwise. | ["import re\n\ndef happy_g(s):\n return not re.search(r'(?<!g)g(?!g)',s)", "import re\n\ndef happy_g(s):\n return re.sub(\"g{2,}\", \"\", s).count(\"g\") < 1", "import re\n\ndef happy_g(s):\n return not re.search(r'(^|[^g])g([^g]|$)', s)", "import re\ndef happy_g(s):\n return bool(re.match(\"^(g{2,}|[^g])+$\",s))", "import re\n\ndef happy_g(s):\n return not re.search(\"(^|[^g])[g]([^g]|$)\", s)", "from itertools import groupby\n\ndef happy_g(s):\n return all(c != 'g' or sum(1 for _ in g) > 1 for c, g in groupby(s))", "import re\n\ndef happy_g(s):\n return all(len(i) > 1 for i in re.findall(r'g+', s))", "import re\ndef happy_g(s):\n return not re.search(r'([^g]|\\b)g(\\b|[^g])',s)", "from itertools import groupby\ndef happy_g(s):\n return all(False if k == 'g' and len(list(g)) == 1 else True for k, g in groupby(s))\n", "import re\ndef happy_g(s):\n for i in re.sub(r\"g{2,}\", \"\",s):\n if i.count(\"g\")==1:\n return False\n return True"] | {"fn_name": "happy_g", "inputs": [["gg0gg3gg0gg"], ["gog"], ["ggg ggg g ggg"], ["A half of a half is a quarter."], ["good grief"], ["bigger is ggooder"], ["gggggggggg"]], "outputs": [[true], [false], [false], [true], [false], [true], [true]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 996 |
def happy_g(s):
|
d34011c65ca2547f709c243be30f4cb4 | UNKNOWN | Create a program that will return whether an input value is a str, int, float, or bool. Return the name of the value.
### Examples
- Input = 23 --> Output = int
- Input = 2.3 --> Output = float
- Input = "Hello" --> Output = str
- Input = True --> Output = bool | ["def types(x):\n return type(x).__name__", "def types(x):\n return str(type(x).__name__)", "def types(x):\n return str(type(x))[8:-2]", "types = lambda x: type(x).__name__", "types = lambda d: type(d).__name__", "def types(n):\n return type(n).__name__", "def types(x):\n return str(type(x)).split('\\'')[1]"] | {"fn_name": "types", "inputs": [[10], [9.7], ["Hello World!"], [[1, 2, 3, 4]], [1023], [true], ["True"], [{"name": "John", "age": 32}], [null], [3.141], [false], ["8.6"], ["*&^"], [4.5]], "outputs": [["int"], ["float"], ["str"], ["list"], ["int"], ["bool"], ["str"], ["dict"], ["NoneType"], ["float"], ["bool"], ["str"], ["str"], ["float"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 325 |
def types(x):
|
4ab458cd93ad4308a5b0c6640de17289 | UNKNOWN | # Introduction
The first century spans from the **year 1** *up to* and **including the year 100**, **The second** - *from the year 101 up to and including the year 200*, etc.
# Task :
Given a year, return the century it is in. | ["def century(year):\n return (year + 99) // 100", "import math\n\ndef century(year):\n return math.ceil(year / 100)", "def century(year):\n return (year / 100) if year % 100 == 0 else year // 100 + 1", "def century(year):\n if year%100==0:\n return year//100\n else:\n return year//100+1", "def century(year):\n return (year - 1) // 100 + 1", "from math import ceil\n\ndef century(year):\n return ceil(year / 100)", "# From slowest to fastest.\n\nfrom math import ceil\n\ndef century(year):\n centuries, remaining = divmod(year, 100)\n return centuries + bool(remaining)\n\ndef century(year):\n return ceil(year/100)\n\ndef century(year):\n return year//100 + bool(year % 100)\n\ndef century(year):\n return year//100 + (not not year % 100)\n \ndef century(year):\n return -(-year//100)\n\ndef century(year):\n return (year + 99) // 100", "def century(year):\n\n return 1 + (year - 1) // 100", "def century(year):\n year=year//100+bool(year%100)\n return year", "def century(year):\n return -(-year//100)", "def century(year):\n return int(year/100) if year % 100 == 0 else int(year / 100) + 1", "def century(year):\n return year//100 + bool(year%100)", "century = lambda y: (y+99) // 100", "from math import ceil\ncentury = lambda _: ceil(_/100)", "def century(year):\n for i in range(year):\n if year in range((i*100)+1, (i+1)*100+1):\n return i+1\n", "def century(year):\n if year%100==0 :\n return year/100\n else :\n return (year//100) +1 \n # Finish this :)\n return", "century = lambda y: y // 100 + 1 if y % 100 else y //100", "def century(year):\n value, remainder = divmod(year, 100)\n return value + 1 if remainder else value", "import math\ndef century(year):\n result = year / 100\n return math.ceil(result)\n print (result)", "def century(year):\n q, r = divmod(year, 100)\n return q + bool(r)\n", "century = lambda year: (year + 99) // 100", "def century(year):\n # Finish this :)\n return year // 100 if year % 100 == 0 else (year // 100 + 1)", "def century(year):\n # Finish this :)\n return int((year-1)/100) + 1", "def century(year):\n year = str(year)\n if len(year) < 3:\n return(1)\n elif len(year) == 3 and len(year) < 4:\n x = int(year[1] + year[2])\n if x >= 1 and x <= 99:\n return(int(year[0]) + 1)\n else:\n return(int(year[0]))\n elif len(year) == 4 and len(year) < 5:\n x = int(year[2] + year[3])\n if x >= 1 and x <= 99:\n return(int(year[0] + year[1]) + 1)\n else:\n return(int(year[0] + year[1]))\n elif len(year) == 5 and len(year) < 6:\n x = int(year[3] + year[4])\n if x >= 1 and x <= 99:\n return(int(year[0] + year[1] + year[2]) + 1)\n else:\n return(int(year[0] + year[1] + year[2]))\n elif len(year) == 6 and len(year) < 7:\n x = int(year[4] + year[5])\n if x >= 1 and x <= 99:\n return(int(year[0] + year[1] + year[2] + year[3]) + 1)\n else:\n return(int(year[0] + year[1] + year[2] + year[3]))\n elif len(year) == 7 and len(year) < 8:\n x = int(year[5] + year[6])\n if x >= 1 and x <= 99:\n return(int(year[0] + year[1] + year[2] + year[3] + year[4]) + 1)\n else:\n return(int(year[0] + year[1] + year[2] + year[3] + year[4]))\n elif len(year) == 8 and len(year) < 9:\n x = int(year[6] + year[7])\n if x >= 1 and x <= 99:\n return(int(year[0] + year[1] + year[2] + year[3] + year[4] + year[5]) + 1)\n else:\n return(int(year[0] + year[1] + year[2] + year[3] + year[4] + year[5]))", "century=lambda y:0-y//-100", "def century(year):\n return round((year/100.)+.495)", "def century(year):\n return int(year/100) + int(bool(year%100))", "def century(year):\n if year % 100 == 0:\n return year / 100\n else:\n return year // 100 + 1", "def century(year):\n remainder = year % 100\n year = int(year/100) \n if remainder > 0: \n year += 1\n return year", "def century(year):\n counter = 0\n while year >= 1:\n year = year - 100\n counter = counter + 1\n return counter", "from math import ceil\ndef century(year):\n return (100 * ceil(year/100)) / 100\n", "def century(year):\n s = str(year)\n if year <= 100:\n return 1\n else:\n if year %100 == 0:\n return int(s[:-2])\n else:\n return 1 + int(s[:-2])", "def century(year):\n S = str(year)\n L = len(str(year))\n if L == 2:\n return L - 1\n elif L == 3:\n return int(S[0]) + 1\n else:\n return int(S[:-2]) if S[-2:] == '00' else int(S[:-2]) + 1", "century = lambda year: -((-1*year)//100)", "def century(year):\n century = (year - (year % 100)) / 100 \n if (year % 100 == 0):\n return century\n else:\n return century + 1\n", "def century(year):\n if year < 101:\n m = 1\n else:\n y = str(year)\n m = int(y[:-2])\n n = int(y[-2:])\n if n != 0:\n m += 1\n #print(m)\n return m", "def century(year):\n if year >= 100 and year%100 == 0:\n return int(year/100)\n elif year>=100:\n return int(year/100)+1\n else:\n return 1", "def century(year):\n if year > 99:\n if int(str(year)[2:]) > 0:\n return int(str(year)[:-2]) + 1\n else:\n return int(str(year)[:-2])\n else:\n if year > 0:\n return 1\n else:\n return 0", "def century(year):\n digits = list(str(year).zfill(6))\n century = int(\"\".join(digits[0:4]))\n years = \"\".join(digits[4:7])\n if years == \"00\":\n return century\n else:\n return century + 1\n\n", "def century(year):\n if year < 100:\n return 1;\n if str(year)[-2:] == '00':\n return int(str(year)[:-2])\n return int(str(year)[:-2])+1", "def century(year):\n if year%100 == 0:\n return int(year/100)\n else:\n return (int(year/100)+1)\nans=century(89)", "def century(year):\n if year/100 > year//100:\n return (year//100)+1\n else:\n return year//100\n return", "def century(year):\n century = 0\n \n # For every 100 years, increment century by 1\n for interval in range(0, year, 100): \n century += 1 \n return century", "def century(year):\n return int(str(year + 99)[:-2])", "def century(year):\n if (year/100).is_integer():\n return year/100\n else:\n return int(year/100) + 1 ", "def century(year):\n (a,b) = divmod(year, 100)\n return a + 2*b // (b+1)", "def century(year):\n a, b = divmod(year, 100)\n return (a + 1) - (not b)", "def century(year):\n return year // 100 + 1 if year % 100 != 0 else year // 100", "def century(year):\n return year // 100 + 1 if year % 100 else year // 100", "def century(year):\n import math\n return math.ceil(year/100.)\n \n", "def century(year):\n anul = int(year)\n secol = int((anul / 100) + 1)\n if anul % 100 == 0:\n secol_1 = secol - 1\n return secol_1\n else:\n return secol", "def century(year):\n x = (year - 1)/100\n y = x + 1\n y = int(y)\n return y", "def century(year):\n div = year // 100\n rest = year % 100\n if rest == 0:\n return div\n else:\n return div + 1", "def century(year):\n if year < 101:\n return 1\n if str(year)[-2:] == \"00\":\n return int(str(year)[:-2])\n return (int(str(year)[:-2]) +1)\n", "def century(year):\n if year < 100:\n return 1\n elif year < 1000:\n return int(str(year)[0]) + 1\n else:\n return int(str(year)[:-2]) + 1 if year % 100 != 0 else int(str(year)[:-2])", "def century(year):\n century = 0\n if year % 100 == 0:\n return year // 100\n else:\n return year // 100 +1\n", "def century(year):\n century = year/100\n if century.is_integer() == False:\n century = int(century) + 1\n return century", "# import math\ndef century(year):\n # return math.ceil(year / 100)\n return (year + 99) // 100", "import math\ndef century(year):\n return math.ceil(year/ 100) # \u043e\u043a\u0440\u0443\u0433\u043b\u0435\u043d\u0438\u0435 \u0432\u0432\u0435\u0440\u0445\n \n", "\ndef century(year):\n sonuc=0\n if (year%100 == 0):\n sonuc=year/100\n else:\n sonuc=(year/100)+1\n \n return int(sonuc);", "def century(year):\n x = 0\n count = 0\n while year > x:\n x = x + 100\n count = count + 1\n return count ", "import math\ndef century(year):\n float_century = year / 100\n\n return math.ceil(float_century)\n", "def century(year):\n if year/100 <= 0:\n return 1\n elif year%100 == 0:\n return int(year/100)\n else:\n return int((year/100)+1)\n", "from math import *\n\ndef century(year):\n if str(year)[-2:] == \"00\":\n year = year-1\n return floor(year/100) + 1\n\ndate = 1900\nprint(century(date))", "def century(y):\n \n p=y%100\n \n if p==0: \n x=y//100\n else:\n x=y//100\n x=x+1\n \n \n return x", "def century(year):\n \n yearOne = str(year)\n length = len(yearOne)\n lastTwo = int(yearOne[length - 2: length])\n \n if lastTwo > 0:\n century = int(((year - lastTwo) + 100) / 100)\n else:\n century = int((year - lastTwo) / 100 )\n\n return century", "century=lambda y:(y//100)+(y%100!=0)", "import math\ndef century(year):\n return math.floor(year / 100) + (year % 100 and 1)", "def century(year):\n if year < 100:\n return 1;\n elif year < 1000:\n if year % 100 == 0:\n return year // 100\n else:\n return year // 100 + 1\n else:\n if year % 10 == 0 and year // 10 % 10 == 0:\n return int(str(year)[:len(str(year)) - 2])\n else:\n return int(str(year)[:len(str(year)) - 2]) + 1\n", "def century(year):\n year = int((year - 1) / 100) + 1\n return year", "def century(year):\n year = year / 100\n if year.is_integer():\n return (int(year))\n elif isinstance(year, float):\n years = year + 1\n return (int(years))\n # Finish this :)\n", "def century(year):\n if year >= 0 and year <= 100:\n return 1\n else:\n if year % 100 == 0:\n return year/100\n else:\n return int(year/100 +1)", "def century(year):\n century = 1\n yearCount = 100\n \n if year < 101:\n return 1\n else:\n while yearCount < year:\n yearCount = yearCount + 100\n century = century + 1\n\n return century\n \n \n # Finish this :)\n return", "def century(year):\n year1 = year - 1 if str(year).endswith('00') else year\n return int(str(year1 + 100)[:-2])", "def century(year):\n siglo = 0;\n if year < 100:\n siglo = 1\n else:\n siglo = year // 100\n uno = year % 100\n if uno >=1:\n siglo+=1\n \n return siglo\n", "def century(year: int) -> int:\n \"\"\"This function returns the century by year.\"\"\"\n if year % 100 == 0:\n year //= 100\n return year\n else:\n year //= 100\n return year + 1", "def century(year):\n centuryCount = 0\n while year > 0:\n year -= 100;\n centuryCount = centuryCount + 1\n return centuryCount", "def century(year):\n cent = year//100\n ost = year%100\n if ost >= 0.01:\n cent1 = cent + 1\n else: \n cent1 = cent\n return cent1", "import math\ndef century(year):\n # Finish this :)\n # if no remainder when dividing by 100, return result of division\n if year%100==0:\n return year/100\n # if remainder when dividing by 100, return result of division rounded up to nearest whole number\n else:\n return math.ceil(year/100)\n return", "def century(year):\n century = year // 100\n decade = year % 100\n \n if decade > 0:\n return century + 1 \n \n else:\n return century", "from math import *\ndef century(year):\n x = 0\n if year % 100 == 0:\n x = floor(int((year + 1) / 100))\n else:\n x = floor(int(year / 100 + 1))\n return x\n\n\nprint(century(1249))", "def century(year):\n count = 0\n while(year > 0):\n count += 1\n year = year-100\n return count\n", "def century(year):\n return int(-(-year // 100))\n\n# OR\n#import math\n#def century(year):\n# return math.ceil(year / 100)\n", "def century(year):\n # Finish this :)\n return 1 + year//100 if year%100!=0 else year/100", "import math\n\ndef century(year):\n # year is divisible by 100\n if year % 100 == 0:\n what_century = year / 100\n # the year is not divisible by 100\n else:\n what_century = math.floor(year / 100) + 1\n \n return what_century\n", "def century(year):\n if year >= 10000:\n return int(year/100)+1 if year%10 == 0 else int(year/100)+1\n else:\n return int(year/100) if year%10 == 0 else int(year/100)+1", "def century(year):\n if year <100:\n return 1\n elif year%100 == 0:\n return year//100\n else:\n x = year // 100\n return x+1", "def century(year):\n if year % 100 == 0:\n return int(str(year)[:-2])\n elif year < 100:\n return 1\n return int(str(int(str(year)[:-2])+1))", "import math\n\ndef century(year):\n if 100 >= year >= 1:\n return 1\n elif year % 2 == 0:\n return math.ceil(year / 100)\n else:\n return year // 100 + 1", "def century(year):\n if len(str(year)) > 3:\n print(str(year)[len(str(year))-1])\n \n if str(year)[len(str(year))-1] ==\"0\" and str(year)[len(str(year))-2]==\"0\":\n return(int(str(year)[:len(str(year))-2]))\n else:\n return(int(str(year)[:len(str(year))-2])+1)\n \n elif len(str(year)) == 3:\n return(int(str(year)[0])+1)\n else:\n return 1", "def century(year):\n workshop = list(str(year))\n if len(workshop) > 2:\n if year % 100 == 0:\n return int(\"\".join(workshop[:-2]))\n else:\n return int(\"\".join(workshop[:-2])) + 1\n else:\n return 1", "def century(year):\n return (year // 100) if (year / 100 % 1 == 0) else (year // 100 + 1)", "def century(year):\n if year % 100 == 0:\n return year // 100\n else:\n year = year // 100 \n return year + 1", "def century(year):\n if year < 100:\n return 1\n return int(str(year)[:-2]) + 1 if str(year)[-2:] > '00' else int(str(year)[:-2])\n", "def century(year):\n result=0\n if year%100== 0:\n cent= year//100\n else:\n cent=year//100 + 1\n return cent", "def century(year):\n if year %100 == 0:\n return year/100\n else:\n \n return round((year+50)/100)", "def century(year):\n \n return int(year / 100) +1 if not year % 100 ==0 else int (year/100) ", "def century(year):\n if year <= 100:\n return 1\n elif year % 100 != 0:\n return (year // 100) + 1 \n else:\n return year // 100\n return", "def century(year):\n \n \n if (year <= 0):\n return (\"0 and negative is not allow for a year\")\n \n \n \n elif (year <= 100):\n return (1)\n elif (year % 100 == 0):\n return (year // 100)\n else:\n return (year // 100 + 1)"] | {"fn_name": "century", "inputs": [[1705], [1900], [1601], [2000], [356], [89]], "outputs": [[18], [19], [17], [20], [4], [1]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 15,822 |
def century(year):
|
d987a5d1753dd4055e4df3a7a46e55c9 | UNKNOWN | Your boss decided to save money by purchasing some cut-rate optical character recognition software for scanning in the text of old novels to your database. At first it seems to capture words okay, but you quickly notice that it throws in a lot of numbers at random places in the text. For example:
```python
string_clean('! !') == '! !'
string_clean('123456789') == ''
string_clean('This looks5 grea8t!') == 'This looks great!'
```
Your harried co-workers are looking to you for a solution to take this garbled text and remove all of the numbers. Your program will take in a string and clean out all numeric characters, and return a string with spacing and special characters `~#$%^&!@*():;"'.,?` all intact. | ["def string_clean(s):\n return ''.join(x for x in s if not x.isdigit())", "import re\n\ndef string_clean(s):\n return re.sub(r'\\d', '', s)", "def string_clean(s):\n return \"\".join(c for c in s if not c.isdigit())", "string_clean = lambda s: __import__('re').sub(r'\\d', '', s)", "def string_clean(s):\n import re\n return ''.join(re.findall('\\D',s))", "def string_clean(s):\n return s.translate(s.maketrans(' ', ' ', '1234567890'))", "def string_clean(s):\n return ''.join(ch for ch in s if ch not in '0123456789')", "from string import digits\ntrans = str.maketrans(\"\", \"\", digits)\ndef string_clean(s):\n return s.translate(trans)\n\n\nfrom functools import partial\nfrom re import compile\nstring_clean = partial(compile(\"\\d+\").sub, \"\")", "import re\nstring_clean = lambda s: re.sub('[0-9]', '', s)", "def string_clean(s):\n return ''.join([item for item in s if not item.isdigit()])", "string_clean = lambda s: ''.join(e for e in s if not e.isdigit())", "def string_clean(s):\n return __import__('re').sub('\\d','',s)", "import re\ndef string_clean(s): \n return re.sub(r\"(\\d+)\", \"\", s)", "def string_clean(s):\n return ''.join(c for c in s if c not in '1234567890')", "import re\ndef string_clean(s):\n return re.sub('[0-9]','',s) #I solved this Kata on 8/3/2019 09:37 AM...#Hussam'sCodingDiary", "import re\n\ndef string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n return re.sub(r'[\\d+]', '', s)\n", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n return ''.join([i for i in s if not i.isnumeric()])", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n return s.replace(\"1\", '').replace(\"2\",'').replace(\"3\",'').replace(\"4\",'').replace(\"5\",'').replace(\"6\",'').replace(\"7\",'').replace(\"8\",'').replace(\"9\",'').replace(\"0\",'')", "from re import sub\n\ndef string_clean(s: str) -> str:\n \"\"\" Get cleaned string. \"\"\"\n return sub(\"\\d\", \"\", s)", "def string_clean(s):\n return ''.join(__import__('itertools').filterfalse(str.isdigit, s))", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n return __import__('re').sub('\\d+', '', s)", "def string_clean(s):\n return s.translate({ord(x): None for x in '0123456789'})", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n n = ''\n for i in s: \n if i not in '0123456789':\n n += i\n return n", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n nums = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'}\n return ''.join([_ for _ in s if _ not in nums])", "from string import digits \n\ndef string_clean(s):\n foo = str.maketrans(\"\", \"\", digits)\n bar = s.translate(foo)\n return bar\n \n", "def string_clean(s):\n a = \"\"\n for el in s:\n if el not in \"1234567890\":\n a += el\n return a", "def string_clean(s):\n res = ''\n for i in range(len(s)):\n if not s[i].isdigit():\n res+=(s[i])\n return res", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n x = []\n for i in range(len(s)):\n if s[i] in ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']:\n x = x\n else:\n x.append(s[i])\n return(''.join(map(str, x)))", "def string_clean(s):\n num = '0123456789'\n for i in s:\n if i in num:\n s = s.replace(i, '')\n return s", "def string_clean(s):\n\n no_digits = []\n # Iterate through the string, adding non-numbers to the no_digits list\n for i in s:\n if not i.isdigit():\n no_digits.append(i) \n result = ''.join(no_digits)\n return result", "def string_clean(s):\n deprecated = '0123456789'\n return ''.join([s_ for s_ in s if s_ not in deprecated])", "def string_clean(s):\n new = \"\"\n for char in s:\n if char.isdigit():\n new += \"\"\n else:\n new += char\n \n return new", "def string_clean(s):\n for c in \"1234567890\":\n s = s.replace(c, '')\n return s", "def string_clean(s):\n return ''.join(list(el if not el.isdigit() else '' for el in s))", "def string_clean(s):\n ls = []\n final = []\n for i in s:\n if \"0\" <= i <= \"9\":\n ls.append(i)\n else:\n final.append(i)\n return ''.join(final)\n", "def string_clean(s):\n return ''.join('' if ch in \"0123456789\" else ch for ch in list(s))", "import re\n\ndef string_clean(s):\n k = re.sub(\"\\d\",\"\",s)\n return k", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n numset = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\n# ns = ''\n for i in s:\n if i in numset:\n s = s.replace(i, '')\n return s\n", "import re\n\nstring_clean = lambda string : re.sub('\\d', '', string)\n\n\"\"\"remove all digits from the string\"\"\"\n \n# \\d matches any number 0-9\n# re.sub replaces the number/s from the string with ''\n", "def string_clean(s):\n l = [\"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\"]\n for i in l:\n if i in s:\n s = s.replace(i, \"\")\n return s", "def string_clean(s):\n return ''.join([i for i in s if i.isdigit()!=True])", "def string_clean(s):\n #remove all numbers from text and return string\n numbers = [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"0\"]\n new_string_arr = []\n for char in s:\n if char not in numbers:\n new_string_arr.append(char)\n return \"\".join(new_string_arr)", "import re\ndef string_clean(s):\n return re.sub(\"[\\d]+\",\"\",s)", "import re\ndef string_clean(s):\n s=s.translate(str.maketrans('0123456789','0'*10))\n return s.replace('0','')", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n phrase = \"\"\n for i in range(len(s)):\n if s[i].isnumeric()!= True:\n phrase+=s[i]\n return phrase", "def string_clean(s):\n toremove = '1234567890'\n for i in s:\n if i in toremove:\n s = s.replace(i, '')\n \n return s", "def string_clean(s):\n \n return ''.join([x for x in s if x not in ['1','2','3','4','5','6','7','8','9','0']])", "def string_clean(s):\n return s.translate(str.maketrans({x:\"\" for x in \"1234567890\"}))", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n return \"\".join(x for x in s if x.isdigit()==False)", "def string_clean(s):\n return \"\".join([s[i] for i in range(len(s)) if s[i].isnumeric()==False])", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n return s.translate(str.maketrans('1234567890', '0000000000')).replace('0', '')", "def string_clean(s):\n return ''.join(['' if i in '0123456789' else i for i in s])", "def string_clean(s):\n return \"\".join([s[x] for x in range(len(s)) if not s[x].isnumeric()])", "import string\n\ndef string_clean(s):\n for n in s:\n if n in string.digits:\n s = s.replace(n, \"\")\n return s", "def string_clean(s):\n word = \"\"\n digits = \"1234567890\"\n for element in s:\n if element not in digits:\n word += element\n return word ", "def string_clean(s):\n c=\"\"\n for i in s:\n if i not in \"0123456789\":\n c=c+i\n return c", "def string_clean(s):\n junk = [str(i) for i in range(10)]\n new_s = ''\n for i in s:\n if i not in junk:\n new_s += i\n return new_s\n \n # Your code here\n", "def string_clean(s):\n output = ''\n for x in s:\n print(x.isdigit())\n if x.isdigit():\n pass\n else:\n output += x\n return output", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n a = \"\"\n for c in s:\n if not c.isdigit():\n a += c\n return a", "import re\ndef string_clean(s):\n result = re.sub(r'\\d',\"\",s)\n return result\n \n \n \n \"\"\"\n Function will return the cleaned string\n \"\"\"\n\n", "def string_clean(s):\n x = \"\"\n for i in s:\n if i >= '0' and i <= '9':\n continue\n x += i\n return x", "def string_clean(s):\n n=\"1234567890\"\n for x in n:\n if x in s:\n s=s.replace(x,\"\")\n return s", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n return ''.join(list([x for x in s if x not in '1234567890']))\n", "import string\n\ndef string_clean(s):\n out = \"\"\n for element in s:\n if not element.isnumeric():\n out+=element\n return out", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n # Your code her\n st=\"\"\n for c in s:\n if not(c.isdigit()):\n st+=c\n return st\n", "import re\n\ndef string_clean(s):\n s = re.sub(r'[0-9]', '', s)\n return s", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n liste = list(s)\n el = []\n for elem in liste:\n if elem in \"1234567890\":\n pass\n else:\n el.append(elem)\n return ''.join(el)", "def string_clean(s):\n return \"\".join([\"\" if char.isdigit() else char for char in s])", "def string_clean(s):\n ans = \"\"\n for i in s:\n if not i.isdigit():\n ans += i\n \n return ans", "def string_clean(s):\n lsValue = \"\"\n for i in range(len(s)):\n if not s[i].isnumeric():\n lsValue += s[i]\n return lsValue \n", "def string_clean(s):\n return ''.join(letter for letter in s if not letter.isnumeric())", "def string_clean(s):\n res=\"\"\n for i in s:\n if i.isdigit():\n continue\n else:\n res+=i\n return res", "def string_clean(s):\n y = \"\"\n for i in s:\n if i.isnumeric():\n continue\n else:\n y += i\n return y", "def string_clean(s):\n remove_characters = ['1','2','3','4','5','6','7','8','9','0']\n\n for character in remove_characters:\n s = s.replace(character, '')\n return s", "def string_clean(s):\n new=''\n for item in s:\n if item.isnumeric():\n pass\n else:\n new+=item\n return new", "import string\ndigits = string.digits\ndef string_clean(s):\n emptystring = ''\n for eachletter in s:\n if eachletter in digits:\n continue\n else:\n emptystring = emptystring + eachletter\n return emptystring\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n # Your code here\n", "def string_clean(s):\n string = ''\n for char in s:\n if char not in '0123456789':\n string += char\n return string", "def string_clean(s):\n ans=''\n s=list(s)\n digits=['1','2','3','4','5','6','7','8','9','0']\n for i in s:\n if i in digits:\n continue\n ans=ans+i\n return ans", "from string import digits\n\ndef string_clean(s):\n for char in digits:\n s = s.replace(char, \"\")\n return s", "def string_clean(s):\n n = \"\"\n for i in range(0, len(s)):\n if s[i].isdigit():\n continue\n else:\n n = n + s[i]\n return n", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n wordclean=list(s)\n fini=[]\n for i in wordclean:\n if i.isnumeric():\n a=1\n else:\n fini.append(i)\n return \"\".join(fini)\n \n", "def string_clean(s):\n return s.translate(s.maketrans({'0':'','1':'','2':'','3':'','4':'','5':'','6':'','7':'','8':'','9':''}))", "import re\ndef string_clean(s):\n a = re.sub(\"\\d\", \"\", s)\n return a", "def string_clean(s):\n temp = \"\"\n numbers = \"1234567890\"\n for i in s:\n if i in numbers:\n continue\n else:\n temp+=i\n return temp", "import re\ndef string_clean(s):\n delNum = re.compile(r'[^0123456789]')\n return ''.join(delNum.findall(s))", "def string_clean(s):\n \"\"\"\n Function will return the cleaned string\n \"\"\"\n st = [x for x in s if not x.isdigit()]\n return(\"\".join(st))", "def string_clean(s):\n result = ''\n for elem in s:\n if elem not in ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9'):\n result += elem\n return result", "def string_clean(s):\n num = \"0123456789\"\n fresh = []\n \n for i in s:\n if i not in num:\n fresh.append(i)\n return \"\".join(fresh)", "import re\n\ndef string_clean(s):\n o = []\n nonolist = ['0','1','2','3','4','5','6','7','8','9']\n for x in list(s):\n if(x not in nonolist):\n o.append(x)\n return ''.join(o)", "def string_clean(s):\n new_s = \"\"\n for letters in s:\n if not 48<= ord(letters) <=57:\n new_s += letters\n return new_s", "def string_clean(s):\n res = ''\n for c in s:\n if c not in '0123456789':\n res += c\n return res", "def string_clean(s):\n for el in '0123456789':\n s = s.replace(el, '')\n return s", "def string_clean(s):\n str=\"\";\n return str.join(c for c in s if not c.isdigit())", "def string_clean(s):\n import re\n matches = re.finditer(\"[a-zA-Z~#\\$%^&!@*():;\\\"'\\.,?\\s]\",s)\n return \"\".join([match.group() for match in matches])", "def string_clean(s):\n new=\"\"\n for char in s:\n if char in \"1234567890\":\n new+=\"\"\n else: new+=char\n return new\n"] | {"fn_name": "string_clean", "inputs": [[""], ["! !"], ["123456789"], ["(E3at m2e2!!)"], ["Dsa32 cdsc34232 csa!!! 1I 4Am cool!"], ["A1 A1! AAA 3J4K5L@!!!"], ["Adgre2321 A1sad! A2A3A4 fv3fdv3J544K5L@"], ["Ad2dsad3ds21 A 1$$s122ad! A2A3Ae24 f44K5L@222222 "], ["33333Ad2dsad3ds21 A3333 1$$s122a!d! A2!A!3Ae$24 f2##222 "], ["My \"me3ssy\" d8ata issues2! Will1 th4ey ever, e3ver be3 so0lved?"], ["Wh7y can't we3 bu1y the goo0d software3? #cheapskates3"]], "outputs": [[""], ["! !"], [""], ["(Eat me!!)"], ["Dsa cdsc csa!!! I Am cool!"], ["A A! AAA JKL@!!!"], ["Adgre Asad! AAA fvfdvJKL@"], ["Addsadds A $$sad! AAAe fKL@ "], ["Addsadds A $$sa!d! A!A!Ae$ f## "], ["My \"messy\" data issues! Will they ever, ever be solved?"], ["Why can't we buy the good software? #cheapskates"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 14,103 |
def string_clean(s):
|
78dea5eac2c0b4be96e62d2c53fe5b19 | UNKNOWN | You just got done with your set at the gym, and you are wondering how much weight you could lift if you did a single repetition. Thankfully, a few scholars have devised formulas for this purpose (from [Wikipedia](https://en.wikipedia.org/wiki/One-repetition_maximum)) :
### Epley
### McGlothin
### Lombardi
Your function will receive a weight `w` and a number of repetitions `r` and must return your projected one repetition maximum. Since you are not sure which formula to use and you are feeling confident, your function will return the largest value from the three formulas shown above, rounded to the nearest integer. However, if the number of repetitions passed in is `1` (i.e., it is already a one rep max), your function must return `w`. Also, if the number of repetitions passed in is `0` (i.e., no repetitions were completed), your function must return `0`. | ["def calculate_1RM(w, r):\n if r == 0: return 0\n if r == 1: return w\n \n return round(max([\n w * (1 + r / 30), # Epley\n 100 * w / (101.3 - 2.67123 * r), # McGlothin\n w * r**0.10 # Lombardi\n ]))", "def calculate_1RM(w, r):\n return (\n w if r == 1 else\n 0 if r == 0 else\n round(max(\n w * (1 + r/30),\n 100 * w / (101.3 - 2.67123*r),\n w * r**0.10,\n ))\n )", "epley = lambda w,r: w * (1+r/30)\nmcGlothin = lambda w,r: 100*w / (101.3 - 2.67123*r)\nlombardi = lambda w,r: w * r**0.10\n\ndef calculate_1RM(w, r):\n return r and (w if r == 1 else round(max(epley(w,r), mcGlothin(w,r), lombardi(w,r))))", "calculate_1RM=lambda w,r:[[round(max(w*(1+(r/30)),100*w/(101.3-(2.67123*r)),w*r**0.10)),0][r==0],w][r==1]", "def calculate_1RM(w, r):\n if r <= 1:\n return r*w\n return int(round(max( (w*(1+r/30)), ((100*w)/(101.3-2.67123*r)), (w*r**0.10) )))", "ORM = [('Epley', lambda w,r: w * (1 + r/30)),\n ('McGlothin', lambda w,r: 100 * w / (101.3 - 2.67123 * r)),\n ('Lombardi', lambda w,r: w * r**0.1)]\n\ndef calculate_1RM(w, r):\n if r == 0: return 0\n elif r == 1: return w\n else: return round(max(func(w, r) for _, func in ORM))", "def calculate_1RM(w, r):\n if r in (0, 1):\n return (0, w)[r]\n epley = w * (1 + r / 30)\n mcg = 100 * w / (101.3 - 2.67123 * r)\n lomb = w * r ** .1\n return round(max((epley, mcg, lomb)))\n", "def calculate_1RM(w, r):\n if r == 1:\n return w\n if r == 0:\n return 0\n return round(max(w*(1+r/30),100*w/(101.3-2.67123*r),w*(r**0.1)))", "def calculate_1RM(w, r):\n if r == 0:\n return 0\n if r == 1:\n return w\n return max(int(round(w*(1+r/30))),int(round(100*w/(101.3-2.67123*r))),int(round(w*r**(1/10))))", "def calculate_1RM(w, r):\n return [w if r == 1 else r if r == 0 else round(max([w * (1 + r / 30), 100 * w / (101.3 - 2.67123 * r), w * r**0.1]))][0]"] | {"fn_name": "calculate_1RM", "inputs": [[135, 20], [200, 8], [270, 2], [360, 1], [400, 0]], "outputs": [[282], [253], [289], [360], [0]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,046 |
def calculate_1RM(w, r):
|
f6832e532d75b877cd98d340e8af6cab | UNKNOWN | Write
```python
remove(text, what)
```
that takes in a string ```str```(```text``` in Python) and an object/hash/dict/Dictionary ```what``` and returns a string with the chars removed in ```what```.
For example:
```python
remove('this is a string',{'t':1, 'i':2}) == 'hs s a string'
# remove from 'this is a string' the first 1 't' and the first 2 i's.
remove('hello world',{'x':5, 'i':2}) == 'hello world'
# there are no x's or i's, so nothing gets removed
remove('apples and bananas',{'a':50, 'n':1}) == 'pples d bnns'
# we don't have 50 a's, so just remove it till we hit end of string.
``` | ["def remove(text, what):\n for char in what:\n text = text.replace(char,'',what[char])\n return text", "def remove(text, what):\n for c, n in what.items():\n text = text.replace(c, '', n)\n return text", "def remove(text, what):\n for char, count in list(what.items()):\n text = \"\".join(text.split(char, count))\n return text\n", "def remove(text, what):\n t, d = list(text), dict(what)\n for i,c in enumerate(text):\n n = d.get(c,0)\n if n:\n d[c] -= 1\n t[i] = ''\n return ''.join(t)", "def remove(text, what):\n for c,v in what.items():\n text = text.replace(c,'',v)\n return text ", "def remove(s, d):\n for key in d:\n s = s.replace(key, '', d[key])\n return s", "def remove(text, what):\n for i in what.keys():\n text=text.replace(i,'',what[i])\n return text", "def remove(text, what):\n for k, v in what.items():\n text = text.replace(k, '', v)\n return text"] | {"fn_name": "remove", "inputs": [["this is a string", {"t": 1, "i": 2}], ["hello world", {"x": 5, "i": 2}], ["apples and bananas", {"a": 50, "n": 1}], ["a", {"a": 1, "n": 1}], ["codewars", {"c": 5, "o": 1, "d": 1, "e": 1, "w": 1, "z": 1, "a": 1, "r": 1, "s": 1}]], "outputs": [["hs s a string"], ["hello world"], ["pples d bnns"], [""], [""]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,001 |
def remove(text, what):
|
a92ae933be3d643030edc1b0fbd94fdf | UNKNOWN | Write a function getMean that takes as parameters an array (arr) and 2 integers (x and y). The function should return the mean between the mean of the the first x elements of the array and the mean of the last y elements of the array.
The mean should be computed if both x and y have values higher than 1 but less or equal to the array's length. Otherwise the function should return -1.
getMean([1,3,2,4], 2, 3) should return 2.5 because: the mean of the the first 2 elements of the array is (1+3)/2=2 and the mean of the last 3 elements of the array is (4+2+3)/3=3 so the mean of those 2 means is (2+3)/2=2.5.
getMean([1,3,2,4], 1, 2) should return -1 because x is not higher than 1.
getMean([1,3,2,4], 2, 8) should return -1 because 8 is higher than the array's length. | ["def get_mean(arr,x,y):\n if 1 < x <= len(arr) and 1 < y <= len(arr):\n return (sum(arr[:x])/x+sum(arr[-y:])/y)/2\n return -1", "from operator import truediv\n\n\ndef mean(arr):\n return truediv(sum(arr), len(arr))\n\n\ndef get_mean(arr, x, y):\n if min(x, y) < 2 or max(x, y) > len(arr):\n return -1\n return truediv(mean(arr[:x]) + mean(arr[-y:]), 2)\n\n\n# # Python 3\n# from statistics import mean\n# \n# \n# def get_mean(arr, x, y):\n# if min(x, y) < 2 or max(x, y) > len(arr):\n# return -1\n# return (mean(arr[:x]) + mean(arr[-y:])) / 2\n", "def get_mean(arr, x, y):\n l = len(arr)\n if 1 < x <= l and 1 < y <= l:\n mx = sum(arr[:x]) / x\n my = sum(arr[-y:]) / y\n return (mx + my) / 2\n else:\n return -1\n", "from statistics import mean\n\ndef get_mean(arr, x, y):\n if all(1 < i < len(arr) + 1 for i in (x, y)):\n return mean((mean(arr[:x]), mean(arr[-y:])))\n return -1", "def get_mean(arr, x, y):\n from numpy import mean\n if 1 < x <= len(arr) and 1 < y <= len(arr):\n return mean((mean(arr[:x]), mean(arr[-y:])))\n else:\n return -1\n", "def get_mean(arr,x,y):\n if x not in range(2,len(arr)+1) or y not in range(2, len(arr)+1): return -1\n return (sum(arr[:x])/x + sum(arr[-y:])/y) /2", "get_mean=lambda a,x,y:(1<x<=len(a)>=y>1)-1or(sum(a[:x])/x+sum(a[-y:])/y)/2", "def get_mean(arr,x,y):\n return -1 if min(x,y) < 2 or max(x,y) > len(arr) else (sum(arr[:x])/x + sum(arr[-y:])/y)/2", "get_mean=lambda arr,x,y: -1 if x<2 or y<2 or x>len(arr) or y>len(arr) else (sum(arr[:x])/float(x)+sum(arr[-y:])/float(y))/2.0", "def get_mean(arr,x,y):\n if x <= 1 or y <= 1:\n return -1\n elif x > len(arr) or y > len(arr):\n return -1\n else:\n return 0.5 * (sum(arr[:x])/x + sum(arr[-y::])/y)\n #your code here\n"] | {"fn_name": "get_mean", "inputs": [[[1, 3, 2, 4], 2, 3], [[1, 3, 2], 2, 2], [[1, 3, 2, 4], 1, 2], [[1, 3, 2, 4], 2, 8], [[1, -1, 2, -1], 2, 3]], "outputs": [[2.5], [2.25], [-1], [-1], [0]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,871 |
def get_mean(arr,x,y):
|
dd47fa8d9060d0759c2de96f9c77b1a4 | UNKNOWN | The internet is a very confounding place for some adults. Tom has just joined an online forum and is trying to fit in with all the teens and tweens. It seems like they're speaking in another language! Help Tom fit in by translating his well-formatted English into n00b language.
The following rules should be observed:
- "to" and "too" should be replaced by the number 2, even if they are only part of a word (E.g. today = 2day)
- Likewise, "for" and "fore" should be replaced by the number 4
- Any remaining double o's should be replaced with zeros (E.g. noob = n00b)
- "be", "are", "you", "please", "people", "really", "have", and "know" should be changed to "b", "r", "u", "plz", "ppl", "rly", "haz", and "no" respectively (even if they are only part of the word)
- When replacing words, always maintain case of the first letter unless another rule forces the word to all caps.
- The letter "s" should always be replaced by a "z", maintaining case
- "LOL" must be added to the beginning of any input string starting with a "w" or "W"
- "OMG" must be added to the beginning (after LOL, if applicable,) of a string 32 characters^(1) or longer
- All evenly numbered words^(2) must be in ALL CAPS (Example: ```Cake is very delicious.``` becomes ```Cake IZ very DELICIOUZ```)
- If the input string starts with "h" or "H", the entire output string should be in ALL CAPS
- Periods ( . ), commas ( , ), and apostrophes ( ' ) are to be removed
- ^(3)A question mark ( ? ) should have more question marks added to it, equal to the number of words^(2) in the sentence (Example: ```Are you a foo?``` has 4 words, so it would be converted to ```r U a F00????```)
- ^(3)Similarly, exclamation points ( ! ) should be replaced by a series of alternating exclamation points and the number 1, equal to the number of words^(2) in the sentence (Example: ```You are a foo!``` becomes ```u R a F00!1!1```)
^(1) Characters should be counted After: any word conversions, adding additional words, and removing punctuation. Excluding: All punctuation and any 1's added after exclamation marks ( ! ). Character count includes spaces.
^(2) For the sake of this kata, "words" are simply a space-delimited substring, regardless of its characters. Since the output may have a different number of words than the input, words should be counted based on the output string.
Example: ```whoa, you are my 123 <3``` becomes ```LOL WHOA u R my 123 <3``` = 7 words
^(3)The incoming string will be punctuated properly, so punctuation does not need to be validated. | ["import re\nbase = \"too?|fore?|oo|be|are|you|please|people|really|have|know|s|[.,']\".split('|')\nnoob = \"2|4|00|b|r|u|plz|ppl|rly|haz|no|z|\".split('|')\n\ndef n00bify(text):\n for b, n in zip(base, noob):\n keep_casing = lambda m: n.upper() if m.group().isupper() else n\n text = re.sub(b, keep_casing, text, flags=re.I)\n if not text: return ''\n if text[0] in 'hH': text = text.upper()\n if text[0] in 'wW': text = 'LOL ' + text\n if len(re.sub('[!?]', '', text)) >= 32: text = re.sub('\\A(LOL |)', r'\\1OMG ', text)\n text = re.sub('([?!])', r'\\1' * len(text.split()), text).replace('!!', '!1')\n return ' '.join(w.upper() if i%2 else w for i, w in enumerate(text.split()))", "import re\n\nreg = ((r\"[.',]\", \"\"), (r\"too?\", \"2\"), (r\"fore?\", \"4\"), (\"oo\", \"00\"), (\"be\", \"b\"),\n (\"are\", \"r\"), (\"you\", \"u\"), (\"please\", \"plz\"), (\"people\", \"ppl\"), (\"really\", \"rly\"),\n (\"have\", \"haz\"), (\"know\", \"no\"), (\"s\", \"z\"))\n\ndef n00bify(stg):\n caps, lol = stg[0] in \"hH\", stg[0] in \"wW\"\n words = [\"LOL\"] if lol else []\n for w in stg.split():\n first = w[0].isupper()\n for p, r in reg:\n w = re.sub(p, r, w, flags=re.I)\n words.append(f\"{w[0].upper()}{w[1:]}\" if first else w)\n if len(re.sub(r\"[?!]\", \"\", \" \".join(words))) > 31:\n words.insert(lol, \"OMG\")\n num, out = len(words), \" \".join(w if i % 2 else w.upper() for i, w in enumerate(words, 1))\n out = re.sub(r\"([?!])\", r\"\\1\"*num, out).replace(\"!!\", \"!1\")\n return out.upper() if caps else out", "def remove_punc(words):\n if \"'\" in words:\n temp_2 = words.partition(\"'\")\n words = temp_2[0] + temp_2[-1] \n \n words = remove_punc(words)\n \n if \".\" in words:\n temp_2 = words.partition(\".\")\n words = temp_2[0] + temp_2[-1] \n \n words = remove_punc(words)\n \n if \",\" in words:\n temp_2 = words.partition(\",\")\n words = temp_2[0] + temp_2[-1]\n \n words = remove_punc(words)\n\n return words\n \ndef transw(words, old, new):\n temp_words = words.lower().replace(old, \" \"*len(old))\n result = \"\"\n threshold = 0\n for i in range(0, len(temp_words)):\n if temp_words[i] != \" \":\n result = result + words[i]\n else:\n threshold += 1\n if threshold == len(old): \n result = result + new\n threshold = 0\n return result\n \n\n\ndef n00bify(text):\n temp = text.split()\n result = \"\"\n for i in temp:\n \n i = transw(i, 'too', '2')\n i = transw(i, 'to', '2')\n i = transw(i, 'fore','4')\n i = transw(i, 'for', '4')\n i = transw(i, 'oo', '00')\n i = transw(i, 'be', 'b')\n i = transw(i, 'you', 'u')\n i = transw(i, 'are', 'r')\n i = transw(i, 'please', 'plz')\n i = transw(i, 'people', 'ppl')\n i = transw(i, 'really', 'rly')\n i = transw(i, 'have', 'haz')\n i = transw(i, 'know', 'no')\n i = transw(i, 's', 'z')\n \n i = remove_punc(i)\n \n if len(result) == 0:\n result = result + i\n else:\n result = result + \" \" + i\n \n if result[0] == \"w\" or result[0] == \"W\":\n result = \"LOL\" + \" \" + result\n if result[0] == \"h\" or result[0] == \"H\":\n result = result.upper()\n \n \n t_result = result.split() \n \n count = 0\n for m in t_result:\n for n in m:\n if n == \"!\":\n break\n \n elif n.isalnum():\n count += 1\n \n count = count + len(t_result) - 1\n \n if count >= 32:\n if t_result[0] == \"LOL\":\n t_result = [\"OMG\"] + t_result\n t_result[0] = \"LOL\"\n t_result[1] = \"OMG\"\n else:\n t_result = [\"OMG\"] + t_result\n \n \n for k in range(0, len(t_result)):\n if \"?\" in t_result[k]:\n t_result[k] = t_result[k][:t_result[k].index(\"?\")] + \"?\"*(len(t_result)-1) + t_result[k][t_result[k].index(\"?\"):]\n \n if \"!\" in t_result[k]:\n add_in = \"\"\n for l in range(0, len(t_result)):\n if l % 2 == 0:\n add_in = add_in + \"!\"\n else:\n add_in = add_in + \"1\"\n \n t_result[k] = t_result[k][:t_result[k].index(\"!\")] + add_in + t_result[k][t_result[k].index(\"!\")+1:] \n \n \n for i in range(0, len(t_result)):\n if i % 2 != 0:\n t_result[i] = t_result[i].upper()\n \n \n return \" \".join(t_result)", "\ndef n00bify(text):\n import re\n \n replaced = re.sub(r'too|to|Too|To', '2', text)\n replaced = re.sub(r'fore|for|Fore|For|FORE', '4', replaced)\n replaced = re.sub(r'oo|Oo', '00', replaced)\n replaced = re.sub(r'be|Be', 'b', replaced)\n replaced = re.sub(r'are|Are', 'r', replaced)\n replaced = re.sub(r'you|You', 'u', replaced)\n replaced = re.sub(r'please|Please', 'plz', replaced)\n replaced = re.sub(r'people|People', 'ppl', replaced)\n replaced = re.sub(r'really|Really', 'rly', replaced)\n replaced = re.sub(r'have|Have', 'haz', replaced)\n replaced = re.sub(r'know|Know', 'no', replaced)\n replaced = re.sub(r's', 'z', replaced)\n replaced = re.sub(r'S', 'Z', replaced)\n replaced = re.sub(r\"[.,']\", '', replaced)\n if text[0] in ['W', 'w']:\n if len(replaced.replace('!',''))>=28:\n replaced = 'LOL OMG ' + replaced\n else:\n replaced = 'LOL ' + replaced\n else:\n if len(replaced.replace('!',''))>=32:\n replaced = 'OMG ' + replaced\n if text[0] in ['H', 'h']:\n replaced = replaced.upper()\n replaced = ' '.join([val.upper() if (i+1)%2==0 else val for i,val in enumerate(replaced.split())])\n num = len(replaced.split())\n replaced = replaced.replace('?','?'*num)\n s = ''.join(['!' if i%2==0 else '1' for i in range(num)])\n replaced = replaced.replace('!',s)\n return replaced\n", "import re\n\ndef n00bify(text):\n replacementArray = [\n (r'too', \"2\"),\n (r'to', \"2\"),\n (r'fore', \"4\"),\n (r'for', \"4\"),\n (r'oo', \"00\"),\n (r'be', \"b\"),\n (r'are', \"r\"),\n (r'you', \"u\"),\n (r'please', \"plz\"),\n (r'people', \"ppl\"),\n (r'really', \"rly\"),\n (r'have', \"haz\"),\n (r'know', \"no\"),\n (r'\\.', \"\"),\n (r',', \"\"),\n (r'\\'', \"\")]\n \n firstLetterW = re.match(r'^w', text, flags=re.IGNORECASE)\n firstLetterH = re.match(r'^h', text, flags=re.IGNORECASE)\n \n for x in replacementArray:\n text = re.sub(x[0], x[1], text, flags=re.IGNORECASE)\n \n text = text.replace(\"s\", \"z\")\n text = text.replace(\"S\", \"Z\")\n \n count = 0\n for c in text:\n if (c.isalpha() or c.isdigit()) or c == \" \":\n count += 1\n \n if firstLetterW and count >= 28:\n text = \"LOL OMG \" + text\n elif firstLetterW :\n text = \"LOL \" + text\n elif count >= 32:\n text = \"OMG \" + text\n \n wordList = text.split()\n for i in range(len(wordList)):\n if i % 2 == 1 or firstLetterH:\n wordList[i] = wordList[i].upper()\n text = \" \".join(wordList)\n \n text = text.replace(\"?\", (\"?\" * len(wordList)))\n text = text.replace(\"!\", exclamation(len(wordList)))\n \n return text\n \ndef exclamation(n):\n exclams = \"!1\" * (n // 2)\n if n % 2 == 1:\n exclams = exclams + \"!\"\n return exclams", "def n00bify(text):\n noobtext = marks(caps(add(replace(text))))\n \n return noobtext\n \ndef replace(text):\n text = text.replace(\",\", \"\").replace(\".\", \"\").replace(\"'\", \"\") \\\n .replace(\"too\", \"2\").replace(\"Too\", \"2\").replace(\"TOo\", \"2\").replace(\"TOO\", \"2\") \\\n .replace(\"to\", \"2\").replace(\"To\", \"2\").replace(\"TO\", \"2\") \\\n .replace(\"fore\", \"4\").replace(\"Fore\", \"4\").replace(\"FOre\", \"4\").replace(\"FORE\", \"4\") \\\n .replace(\"for\", \"4\").replace(\"For\", \"4\").replace(\"FOr\", \"4\").replace(\"FOR\", \"4\") \\\n .replace(\"oo\", \"00\").replace(\"Oo\", \"00\").replace(\"OO\", \"00\") \\\n .replace(\"be\", \"b\").replace(\"are\", \"r\").replace(\"you\", \"u\").replace(\"please\", \"plz\") \\\n .replace(\"people\", \"ppl\").replace(\"really\", \"rly\").replace(\"have\", \"haz\").replace(\"know\", \"no\") \\\n .replace(\"Be\", \"B\").replace(\"Are\", \"R\").replace(\"You\", \"U\").replace(\"Please\", \"Plz\") \\\n .replace(\"People\", \"Ppl\").replace(\"Really\", \"Rly\").replace(\"Have\", \"Haz\").replace(\"Know\", \"No\") \\\n .replace(\"s\", \"z\").replace(\"S\", \"Z\")\n return text\n \ndef add(text):\n if text.startswith('w') or text.startswith('W'):\n text = \"LOL \" + text\n \n if (len(text) - text.count(\"?\") - text.count(\"!\")) >= 32:\n if text.startswith('LOL'):\n text = text.replace(\"LOL\", \"LOL OMG\")\n else:\n text = \"OMG \" + text\n return text\n \ndef caps(text):\n if text.startswith('h') or text.startswith('H'):\n text = text.upper()\n else:\n words = text.split()\n for i in range(1, len(words), 2):\n words[i] = words[i].upper()\n text = ' '.join(words)\n return text\n \ndef marks(text):\n num_words = len(text.split()) \n text = text.replace(\"?\", \"?\" * num_words)\n \n einself=\"\"\n for i in range(0, num_words):\n add = \"!\" if (i % 2 == 0) else \"1\" \n einself = einself + add\n text = text.replace(\"!\", einself)\n \n return text\n"] | {"fn_name": "n00bify", "inputs": [["Hi, how are you today?"], ["I think it would be nice if we could all get along."], ["Let's eat, Grandma!"], ["Woot woot woot woot woot woot!"], ["Hi, I can have cheeseburger?"], ["Sometimes I use ? in the middle of a sentence; is that ok?!"], ["Unto us a child is born."], ["What happened at the zoo?"], ["Oodles is a really fun word to say (in my opinion)."], ["Would you please stop, pause, and take a deep breath?"], ["Too, to, and 2 are all two!"], ["Before I knew it, 4 people were looking for you!"], ["Before you know it... wait, what does this have to do with UNO!?"], ["After conversions, this should be!"], ["Well, 32 chars without OMG on!"], ["Never try cheating a Kata, friend."]], "outputs": [["HI HOW R U 2DAY?????"], ["OMG I think IT would B nice IF we COULD all GET along"], ["Letz EAT Grandma!1!"], ["LOL OMG W00t W00T w00t W00T w00t W00T!1!1!1!1"], ["HI I CAN HAZ CHEEZEBURGER?????"], ["OMG ZOMETIMEZ I UZE ?????????????? IN the MIDDLE of A zentence; IZ that OK??????????????!1!1!1!1!1!1!1"], ["Un2 UZ a CHILD iz BORN"], ["LOL WHAT happened AT the Z00??????"], ["OMG 00DLEZ iz A rly FUN word 2 zay (IN my OPINION)"], ["LOL OMG Would U plz Z2P pauze AND take A deep BREATH????????????"], ["2 2 and 2 r ALL two!1!1!1!"], ["OMG B4 I KNEW it 4 ppl WERE l00king 4 u!1!1!1!1!1!"], ["OMG B4 u NO it WAIT what DOEZ thiz HAZ 2 DO with UNO!1!1!1!1!1!1!1??????????????"], ["After CONVERZIONZ thiz ZHOULD b!1!1!"], ["LOL OMG Well 32 charz WITHOUT OMG ON!1!1!1!1"], ["OMG NEVER try CHEATING a KATA friend"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 10,138 |
def n00bify(text):
|
e54ae278894a6e758eec1b459d59d7b9 | UNKNOWN | A number `n` is called `prime happy` if there is at least one prime less than `n` and the `sum of all primes less than n` is evenly divisible by `n`. Write `isPrimeHappy(n)` which returns `true` if `n` is `prime happy` else `false`. | ["def is_prime_happy(n):\n return n in [5, 25, 32, 71, 2745, 10623, 63201, 85868]", "is_prime_happy=lambda n:n>2and(2+sum(p*all(p%d for d in range(3,int(p**.5)+1,2))for p in range(3,n,2)))%n<1", "from itertools import compress\nimport numpy as np\n\ns = np.ones(100000)\ns[:2] = s[4::2] = 0\nfor i in range(3, int(len(s) ** 0.5)+1, 2):\n if s[i]:\n s[i*i::i] = 0\nprimes = list(compress(range(len(s)), s))\n\ndef is_prime_happy(n):\n print(n)\n i = np.searchsorted(primes, n)\n return i > 0 and sum(primes[:i]) % n == 0", "from bisect import bisect_left as bisect\n\nPRIMES = [2,3]\n\ndef primesBelow(n):\n p = PRIMES[-1]\n while p < n:\n p += 2\n if all(p%x for x in PRIMES): PRIMES.append(p)\n return PRIMES[:bisect(PRIMES,n)]\n\ndef is_prime_happy(n):\n return n > 2 and not sum(primesBelow(n)) % n ", "def is_prime_happy(n):\n primes = [2] + [x for x in range(3, n, 2) if all(x % r for r in range(3, int(x**0.5)+1, 2))]\n return n > 2 and sum(primes) % n == 0", "import math\n\ndef is_prime_happy(n):\n isPrime = [False, False] + [True] * (n-2)\n for k in range(2, n):\n for i in range(2, int(math.floor(math.sqrt(k)))+1):\n if isPrime[i] and k%i == 0:\n isPrime[k] = False\n break\n return True in isPrime and sum([k for k in range(n) if isPrime[k]]) % n== 0\n", "\nimport math\ndef is_prime_happy(n):\n print(n)\n if n==0 or n ==2 or n ==1:\n return False\n# if n ==2:\n# return True\n\n \n a=[2]\n for num in range(3,n,2):\n if all(num%i!=0 for i in range(2,int(math.sqrt(num))+1)):\n# print(num)\n a.append(num)\n print(a)\n print(sum(a))\n if sum(a)==n :\n \n return True\n if sum(a)%n==0 :\n return True\n \n return False ", "def isPrime(n): \n for i in range(2,int(n**.5)+1): \n if n%i == 0:\n return False\n return True \ndef is_prime_happy(n):\n sum = 0\n for i in range(2,n): \n if isPrime(i): \n sum += i \n if sum > 0 and not sum%n: \n return True\n return False ", "from bisect import bisect_left\n\nN = 100_000\na = [1] * N\na[0] = a[1] = 0\nfor i in range(2, N):\n if a[i]:\n for j in range(i**2, N, i):\n a[j] = 0\na = [i for i, x in enumerate(a) if x]\n\ndef is_prime_happy(n):\n return n > 2 and not sum(a[:bisect_left(a, n)]) % n"] | {"fn_name": "is_prime_happy", "inputs": [[5], [8], [25], [32], [2], [0]], "outputs": [[true], [false], [true], [true], [false], [false]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,458 |
def is_prime_happy(n):
|
79de4c1f63699ee817dd757b1eaa977f | UNKNOWN | In this Kata, you will count the number of times the first string occurs in the second.
```Haskell
solve("zaz","zazapulz") = 4 because they are ZAZapulz, ZAzapulZ, ZazApulZ, zaZApulZ
```
More examples in test cases.
Good luck!
Please also try [Simple time difference](https://www.codewars.com/kata/5b76a34ff71e5de9db0000f2) | ["def solve(a, b):\n if len(a) is 1:\n return b.count(a)\n index = [x for x in range(len(b)-1) if b[x] is a[0]]\n return sum(solve(a[1:], b[x+1:]) for x in index)", "def solve(a, b, i=0, j=0):\n return i == len(a) or sum(solve(a,b,i+1,x+1) for x in range(j, len(b)-(len(a)-i-1)) if a[i] == b[x])", "from functools import lru_cache\n\ndef solve(a, b):\n l_a, l_b, rec = len(a), len(b), lru_cache(maxsize=None)(lambda x,y: (x == l_a) or sum(rec(x+1, i+1) for i in range(y, l_b) if b[i] == a[x]))\n return rec(0, 0)", "def solve(a, b):\n if not a:\n return 1\n if not b:\n return 0\n if b[0].lower() == a[0].lower():\n return solve(a, b[1:]) + solve(a[1:], b[1:])\n else:\n return solve(a, b[1:])", "def solve(a, b):\n if a[0] in b:\n if len(a) > 1:\n return solve(a[1:],b[b.index(a[0])+1:])+solve(a,b[b.index(a[0])+1:])\n else:\n print((b.count(a)))\n return b.count(a)\n else:\n return 0\n\n \n", "def solve(a, b, i=0, j=0):\n return (1 if i == len(a) else\n 0 if j == len(b) else\n solve(a,b,i,j+1) if a[i] != b[j] else\n solve(a,b,i+1,j+1) + solve(a,b,i,j+1))", "def solve_dp (needle, haystack):\n # let prefixes[h][n] = number of n-letters-long prefixes\n # ending in h-th position of haystack\n N, H = len(needle), len(haystack)\n prefixes = [[1] + N*[0] for h in range(H)]\n \n def match (h, n): return haystack[h] == needle[n-1]\n prefixes[0][1] = 1 if match(0, 1) else 0\n\n for h in range(1, H):\n max_prefix_len = min(h+1, N)\n for n in range(1, max_prefix_len+1):\n with_current = prefixes[h-1][n-1] if match(h, n) else 0\n without_current = prefixes[h-1][n]\n prefixes[h][n] = with_current + without_current\n return prefixes[H-1][N]\n\ndef solve_recursive (needle, haystack):\n if not needle or needle == haystack: return 1\n if not haystack: return 0\n \n needle_head, *needle_tail = needle\n haystack_head, *haystack_tail = haystack\n match = needle_head == haystack_head\n \n head_matches = solve_recursive(needle_tail, haystack_tail) if match else 0\n tail_matches = solve_recursive(needle, haystack_tail)\n return head_matches + tail_matches\n\ndef solve (needle, haystack, method=solve_dp):\n return method(needle, haystack)\n\n", "from itertools import combinations as c\n\ndef solve(a, b):\n tot=0\n a = tuple(a)\n b = [i for i in b if i in a]\n for k in range(len(b)):\n if b[k]!=a[0]: continue\n for kk in range(k+1, len(b)):\n if b[kk]!=a[1]: continue\n for i in c(b[kk+1:],len(a)-2):\n if i==a[2:]:\n tot+=1\n return tot", "def solve(a, b):\n if len(a)==1:\n return b.count(a)\n r=0\n for i in range(len(b)-len(a)+1):\n if b[i]==a[0]:\n r+=solve(a[1:],b[i+1:])\n return r", "def solve(a,b):\n if not a: return 1\n x,c = a[0],0 \n for i in range(len(b)):\n if b[i] == x:\n c += solve(a[1:],b[i+1:]) \n return c"] | {"fn_name": "solve", "inputs": [["zaz", "zazapulz"], ["rat", "ratatoulie"], ["kata", "katakatak"], ["code", "codeodecode"], ["kata", "kataxxxxkatak"], ["code", "cozzdezodeczzode"], ["zaaz", "zazaapulz"], ["defg", "dsedsfsgsg"], ["defg", "dvsxvevdvsvfvsvgvsvgg"]], "outputs": [[4], [3], [7], [11], [7], [11], [4], [2], [3]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 3,182 |
def solve(a, b):
|
d012f951d77abb83919e7b93cb35bd9f | UNKNOWN | There was a test in your class and you passed it. Congratulations!
But you're an ambitious person. You want to know if you're better than the average student in your class.
You receive an array with your peers' test scores. Now calculate the average and compare your score!
~~~if-not:nasm,racket
Return `True` if you're better, else `False`!
~~~
~~~if:racket
Return #t if you're better, else #f.
~~~
~~~if:nasm
Return `1` if you're better, else `0`!
~~~
### Note:
Your points are not included in the array of your class's points. For calculating the average point you may add your point to the given array! | ["def better_than_average(class_points, your_points):\n return your_points > sum(class_points) / len(class_points)", "def better_than_average(class_points, your_points):\n average = (sum(class_points) + your_points) / (len(class_points) + 1)\n return your_points > average\n", "import statistics\ndef better_than_average(class_points, your_points):\n return your_points > statistics.mean(class_points)", "from statistics import mean\n\ndef better_than_average(class_points, your_points):\n return your_points > mean(class_points)", "def better_than_average(*args):\n return args[1] > sum(*args) / (len(args[0]) + 1.0)", "def better_than_average(class_points, your_points):\n # Your code here \n num_of_class = len(class_points)\n class_score = sum(class_points) / num_of_class\n if class_score < your_points:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n i = 0\n totalP = 0\n while i < len(class_points):\n totalP += class_points[i]\n i += 1\n totalP = totalP / len(class_points)\n if totalP > your_points:\n return False\n else:\n return True", "def better_than_average(class_points, your_points):\n return True if (sum(class_points)/len(class_points))<your_points else False", "def better_than_average(class_points, your_points):\n return sum(class_points)/len(class_points) < your_points", "better_than_average = lambda class_points, your_points: your_points > sum(class_points)/len(class_points)", "better_than_average = lambda c,y: __import__(\"numpy\").mean(c)<y", "import statistics \ndef better_than_average(class_points, your_points):\n return statistics.mean(class_points) < your_points", "def better_than_average(class_points, your_points):\n totalScore = 0\n \n for points in class_points:\n totalScore += points\n \n average = totalScore / len(class_points)\n \n return your_points > average", "better_than_average = lambda a,b:(sum(a)/len(a))<b", "def better_than_average(x,y):\n m=sum(x)\n a=(m/len(x))\n if a>=y:\n return False\n elif a<y:\n return True", "def better_than_average(class_points, your_points):\n return bool(sum(class_points)/len(class_points) <= your_points)", "def better_than_average(class_points, your_points):\n return True if (sum(class_points, your_points)/(len(class_points)+1) < your_points) else False\n # Your code here\n", "def better_than_average(classPoints, yourPoints):\n return yourPoints > (sum(classPoints) + yourPoints) / (len(classPoints) + 1)", "def better_than_average(class_points, your_points):\n avg = sum(class_points) / len(class_points)\n return your_points > avg", "def better_than_average(class_points, your_points):\n total_students = total_points = 0.0\n for a in class_points:\n total_points += a\n total_students += 1\n return your_points > total_points / total_students\n", "def better_than_average(class_points, your_points):\n class_points.append(your_points)\n return sum(class_points) / len(class_points) * 1.0 < your_points", "def better_than_average(class_points, your_points):\n return your_points > (sum(class_points) + your_points) / (len(class_points) + 1)", "def better_than_average(class_points, your_points):\n return your_points > sum(class_points+[your_points])/(len(class_points)+1)", "better_than_average=lambda c, y: y>sum(c)/len(c)", "def better_than_average(class_points, your_points):\n sum = 0\n for i in class_points:\n sum += i\n point = sum / len(class_points)\n return True if your_points > point else False", "def better_than_average(class_points, your_points):\n avg = 0\n total = 0\n for x in range (0, len(class_points)):\n total += class_points[x]\n avg = total / len(class_points)\n if avg > your_points:\n return False\n return True", "def better_than_average(class_points, your_points):\n average = (sum(class_points)/len(class_points))\n if average < your_points:\n Better = True\n else:\n Better = False\n return Better", "def better_than_average(class_points, your_points):\n from statistics import mean\n if mean(class_points) >= your_points:\n return False\n else:\n return True", "def better_than_average(class_points, your_points):\n return True if sum(class_points)//len(class_points) < your_points else False", "def better_than_average(class_points, your_points):\n return sum(class_points) / len(class_points) <= your_points", "def better_than_average(class_points, your_points):\n total = 0\n for point in class_points:\n total += point\n \n average = total / len(class_points)\n \n if your_points >= average:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n a = sum(class_points) + your_points\n res = a / (len(class_points) + 1)\n if your_points > res:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n result = (sum(class_points) + your_points) / (len(class_points) + 1)\n if result < your_points:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n import numpy as np\n a=np.mean(class_points)\n if a<your_points:\n return True\n else:\n return False\n \n # Your code here\n", "def better_than_average(class_points, your_points):\n # Your code here\n average = 0\n for point in class_points:\n average += point\n if your_points > average/len(class_points):\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n sum = 0\n for i in class_points:\n sum += i\n sum += your_points\n avg = sum/(len(class_points) +1)\n \n if your_points > avg:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n average = (sum(class_points) + your_points)/(len(class_points) + 1)\n if your_points > average:\n return True\n return False\n", "def better_than_average(class_points, your_points):\n num = 0\n for i in class_points:\n num += i\n length = len(class_points)\n divide = num/length\n if divide < your_points:\n return True\n elif divide > your_points:\n return False", "def better_than_average(class_points, your_points):\n s=0\n avg=0\n for i in class_points:\n s+=i\n avg=s/len(class_points)\n print (avg)\n if avg<your_points:\n return True\n else:\n return False\n", "def better_than_average(class_points, your_points):\n x = len(class_points)\n z = 0\n for k in class_points:\n z += k\n if your_points > z/x:\n return True\n else:\n return False\n \n # Your code here\n", "def better_than_average(class_points, your_points):\n points = 0\n for point in class_points:\n points += point\n return your_points > points/len(class_points)", "def better_than_average(class_points, your_points):\n count = 0\n average = 0\n for i in class_points:\n count += i\n average = count / len(class_points)\n if your_points > average:\n return True\n return False", "def better_than_average(class_points, your_points):\n return False if sum(class_points) // len(class_points) >= your_points else True\n", "import numpy\ndef better_than_average(class_points, your_points):\n class_average = numpy.mean(class_points)\n if your_points > class_average:\n return True\n else: \n return False\n", "def better_than_average(class_points, your_points):\n if (float(sum(class_points)) / max(len(class_points), 1))<your_points:\n return True\n return False", "def better_than_average(class_points, your_points):\n \n avrg = (sum(class_points) +your_points)/(len(class_points)+1)\n if your_points>avrg:\n return True\n else:\n return False", "def better_than_average(cp, yp):\n a = 0\n for x in cp:\n a +=x\n return (a+yp)/(len(cp)+1) < yp\n\n \n", "def better_than_average(class_points, your_points):\n return ((sum(class_points)+your_points)//(len(class_points)+1)) <= your_points", "def better_than_average(b, a):\n return (a>sum(b)/(len(b)))", "def better_than_average(class_points, your_points):\n length_of_class_points = len(class_points)\n sum_of_numbers = 0\n for i in range(0, len(class_points)):\n sum_of_numbers = sum_of_numbers + class_points[i]\n average_number = round(sum_of_numbers / length_of_class_points)\n if your_points > average_number:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n classA = sum(class_points) / len(class_points)\n return True if your_points >= classA else False", "def better_than_average(class_points, your_points):\n sum = your_points\n for number in class_points:\n sum += number\n average = sum / (len(class_points)+1)\n if your_points > average:\n return True\n else:\n return False\n \n # Your code here\n", "def better_than_average(classmates, you):\n res = sum(classmates) / len(classmates)\n if res < you:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n x = sum(class_points) + your_points\n average = (x / (len(class_points) + 1))\n if average < your_points:\n return True\n else:\n return False", "def better_than_average(class_points:[], your_points):\n result = 0\n for i in class_points:\n result += i\n result = result/len(class_points)\n if your_points>result:\n return True\n return False", "import statistics\ndef better_than_average(class_points, your_points):\n class_points.append(your_points)\n avg = statistics.mean(class_points)\n return True if avg < your_points else False\n", "def better_than_average(class_points, your_points):\n l=len(class_points)\n s=sum(class_points)\n a=s/l\n if(your_points>a):\n return True\n else:\n return False", "import numpy as np\n\ndef better_than_average(class_points, your_points):\n return np.mean(class_points + [your_points]) < your_points", "def better_than_average(a, b):\n if sum(a) / len(a) < b:\n return True\n return False", "def better_than_average(c, p):\n return p > sum(c)/len(c)", "def better_than_average(class_points, your_points):\n # Your code here\n result = sum(class_points) / len(class_points)\n if float(result) <= your_points:\n return True\n else:\n return False", "def better_than_average(class_points, your_point):\n return sum(class_points) / len(class_points) < your_point", "def better_than_average(cp, mp):\n cp.append(mp)\n print(cp)\n d = sum(cp)/len(cp)\n if mp >= d:\n return True\n else:\n return False\n \n # Your code here\n", "def better_than_average(class_points, your_points):\n x = 0\n for i in range(len(class_points)):\n x = x + class_points[i]\n y = x / len(class_points)\n if your_points > y:\n return True\n else:\n return False", "def better_than_average(class_points,\n your_points):\n\n\n return float(sum(class_points)) / len(class_points) < your_points\n", "def better_than_average(class_points, your_points):\n class_total = sum(class_points)\n class_avg = class_total/len(class_points)\n \n return your_points > class_avg", "import math\n\ndef better_than_average(class_points, your_points):\n # Your code here\n return your_points > (sum(class_points)/len(class_points))", "def better_than_average(class_points, your_points):\n mean_class_points= sum(class_points)/len(class_points)\n \n if mean_class_points >= your_points:\n return False\n if mean_class_points <= your_points:\n return True\n \n \n", "def better_than_average(class_points, your_points):\n class_average = (sum(class_points) / len(class_points))\n print(class_average)\n your_average = [your_points]\n if your_average[0] > class_average:\n return True\n else:\n return False\n", "def better_than_average(class_points, your_points):\n s = sum(class_points)\n u = len(class_points)\n m = s/u\n if m < your_points:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n x = sum(class_points) / len(class_points) + 1\n y = your_points\n return x < y", "import statistics as stat\ndef better_than_average(class_points, your_points):\n return stat.mean(class_points) < your_points\n", "def better_than_average(cp, yp):\n av= (yp + sum(cp))/ (len(cp)+1)\n if av > yp:\n return False\n return True\n", "def better_than_average(class_points, my_points):\n return my_points > sum(class_points)/len(class_points)", "def better_than_average(class_points, your_points):\n sum = your_points\n \n for elements in class_points:\n sum += elements\n \n average = sum/(len(class_points) + 1)\n \n if your_points > average:\n return True\n return False", "def better_than_average(class_points, your_points):\n class_points.append(your_points)\n avr = sum(class_points)/(len(class_points) - 1)\n if avr <= your_points:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n class_points.append(your_points)\n average = sum(class_points) / len(class_points)\n return [False, True][your_points > average]", "def better_than_average(a, b):\n a.append(b)\n avg=sum(a)/len(a)\n if avg < b:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n neu = 0\n for i in range(0,len(class_points)):\n b = class_points[i]\n neu += class_points[i]\n a = (neu + your_points) / (len(class_points) + 1)\n if your_points > a:\n return True\n else:\n return False\n", "def better_than_average(c_p, y_p):\n \"\"\"(^-__-^)\"\"\"\n return True if y_p > sum(c_p)/len(c_p) else False\n", "def better_than_average(*s):\n return sum(s[0])/len(s[0])<s[1]", "def better_than_average(array, points):\n average = (sum(array) / (len(array) - 1))\n if points >= average:\n return True\n else:\n return False\n", "def better_than_average(class_points, your_points):\n cavg = (sum(class_points)) / (len(class_points))\n if your_points > cavg:\n return True\n else:\n return False\n # Your code here\n", "def better_than_average(class_points, your_points):\n total = 0\n for element in class_points:\n total += element\n class_average = total / len(class_points)\n if your_points > class_average:\n return True\n else:\n return False", "\ndef better_than_average(class_points, your_points):\n a=sum(class_points)/len(class_points)\n return your_points>=a", "def better_than_average(class_points, your_points):\n class_points.append(your_points)\n return your_points > sum(i for i in class_points)/len(class_points)", "def better_than_average(class_points, your_points):\n sum = 0 \n for i in class_points: \n sum = sum + i \n avg = (sum+your_points)/(len(class_points)+1)\n return your_points > avg", "def better_than_average(class_points, your_points):\n total_points = your_points\n for points in class_points:\n total_points += points\n avg_points = int(total_points/(len(class_points)+1))\n return your_points >= avg_points", "better_than_average = lambda c, y: sum(c) // len(c) < y", "def better_than_average(class_points, your_points):\n n=len(class_points)\n #print(\"e={}\" .format(n))\n ave=(sum(class_points)+your_points)//n\n #print('ave={}' .format(ave))\n if your_points>=ave:\n return bool(your_points>=ave)\n #break\n else:\n return bool(your_points>=ave)", "def better_than_average(class_points, your_points):\n class_ave = sum(class_points)/len(class_points)\n \n if your_points > class_ave:\n return True\n return False", "def avg(lst):\n return sum(lst) / len(lst)\n\ndef better_than_average(class_points, your_points):\n # Your code here\n # return True if your_points > sum(class_points) / len(class_points) else return False\n if your_points > avg(class_points):\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n average_class_point = sum(class_points)/len(class_points)\n if your_points > average_class_point:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n class_points.append(your_points)\n return your_points > sum(class_points)//len(class_points)", "def better_than_average(a, b):\n res = sum(a) / len(a)\n\n if res < b:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n total = 0\n for i in class_points:\n total += i\n average = total / len(class_points)\n return your_points > average", "def better_than_average(c, y):\n cp = 0\n for i in c:\n cp += i\n cp = cp/len(c)\n return y >= cp", "def better_than_average(class_points, your_points):\n total= sum(class_points)\n ave= total / len(class_points)\n if your_points > ave:\n return True\n else:\n return False", "def better_than_average(class_points, your_points):\n class_avg = sum(class_points)//len(class_points)\n return True if class_avg < your_points else False", "def better_than_average(class_points, your_points):\n mu = sum(class_points) / len(class_points)\n if your_points > mu:\n return True\n else:\n return False\n"] | {"fn_name": "better_than_average", "inputs": [[[2, 3], 5], [[100, 40, 34, 57, 29, 72, 57, 88], 75], [[12, 23, 34, 45, 56, 67, 78, 89, 90], 69]], "outputs": [[true], [true], [true]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 18,179 |
def better_than_average(class_points, your_points):
|
81fe7c1f2f02d307eac1716435bc0ca4 | UNKNOWN | ## Description
The task is described in the title: find the sum of all numbers with the same digits(permutations) **including** duplicates. However, due to the fact that this is a performance edition kata, `num` can go up to `10**10000`. That's a number with 10001 digits(at most). Be sure to use efficient algorithms and good luck! All numbers tested for will be positive.
**Examples**
```
sum_arrangements(98) returns 89+98 = 187
sum_arrangements(123) returns 1332 #123 + 132 + 213 + 231 + 312 + 321 = 1332
sum_arrangements(1185) returns 99990 #1185 + 1158 + 1815 + 1851 + 1518 + 1581 + 1185 + 1158 + 1815 + 1851 + 1518 + 1581 + 8115 + 8151 + 8115 + 8151 + 8511 + 8511 + 5118 + 5181 + 5118 + 5181 + 5811 + 5811 = 99990
``` | ["from math import factorial as fact\n\ndef sum_arrangements(n):\n s = str(n)\n perms = fact(len(s)-1)\n coefAll = int('1'*len(s))\n return coefAll*perms*sum(map(int,s))", "def sum_arrangements(num):\n import math\n numLength = len(str(num))\n scaleFactor = int(\"1\"*numLength) * math.factorial(numLength - 1)\n ans = 0\n for i in range(numLength):\n num, digit = divmod(num, 10)\n ans = ans + digit\n return ans * scaleFactor", "from math import factorial\n\ndef sum_arrangements(n):\n s = str(n)\n return (10**len(s)-1)//9*sum(map(int,s))*factorial(len(s)-1)", "def sum_arrangements(num):\n num = str(num)\n n = 1\n number = len(num)\n for i in range(1,number):\n n *= i\n return int('1'*number)*sum(int(i) for i in num)*n\n \n \n", "#A reason that it can be up to 10**10000 is so itertools.permutations will not work\nfrom math import factorial\n\ndef sum_arrangements(num):\n return int(''.join([\"1\" for i in range(len(str(num)))]))*sum([int(i) for i in str(num)])*factorial(len(str(num))-1)", "from math import factorial\n\ndef sum_arrangements(num):\n return sum(int(_) for _ in str(num)) * factorial(len(str(num)) - 1) * int('1' * len(str(num)))", "from math import factorial\n\ndef sum_arrangements(num):\n\n snum = str(num)\n leng = len(snum)\n total = 0\n c = factorial(leng - 1) * sum(map(int, snum))\n\n for i in range(leng):\n total += c\n c *= 10\n\n return total", "from math import factorial\n\n\ndef sum_arrangements(num):\n ns = list(map(int, str(num)))\n mul = factorial(len(ns) - 1)\n return int(\"1\" * len(ns)) * sum(ns) * mul", "def sum_arrangements(num):\n s = str(num)\n from math import factorial\n return factorial(len(s)-1)*int(\"1\"*len(s))*sum(int(i) for i in s)", "import itertools, math\ndef sum_arrangements(num):\n return math.factorial(len(str(num))-1)*(int(\"1\"*len(str(num))))*sum(int(i) for i in str(num))"] | {"fn_name": "sum_arrangements", "inputs": [[123], [1185]], "outputs": [[1332], [99990]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,988 |
def sum_arrangements(num):
|
37994de986aa9ec51e848c2005bed540 | UNKNOWN | Introduction
Mr. Safety loves numeric locks and his Nokia 3310. He locked almost everything in his house. He is so smart and he doesn't need to remember the combinations. He has an algorithm to generate new passcodes on his Nokia cell phone.
Task
Can you crack his numeric locks? Mr. Safety's treasures wait for you. Write an algorithm to open his numeric locks. Can you do it without his Nokia 3310?
Input
The `str` or `message` (Python) input string consists of lowercase and upercase characters. It's a real object that you want to unlock.
Output
Return a string that only consists of digits.
Example
```
unlock("Nokia") // => 66542
unlock("Valut") // => 82588
unlock("toilet") // => 864538
``` | ["def unlock(message): return message.lower().translate(message.maketrans(\"abcdefghijklmnopqrstuvwxyz\",\"22233344455566677778889999\"))", "from string import ascii_lowercase as alc\ndef unlock(message):\n return message.lower().translate(str.maketrans(alc, '22233344455566677778889999'))", "def unlock(message):\n return \"\".join(\"8\" if i==\"v\" else \"7\" if i==\"s\" else str(2+min(7, (ord(i)-ord(\"a\"))//3)) for i in message.lower())", "table = str.maketrans(\"abcdefghijklmnopqrstuvwxyz\", \"22233344455566677778889999\")\n\ndef unlock(message):\n return message.lower().translate(table)", "strokes = {\n c: str(i)\n for i, s in enumerate(['abc', 'def', 'ghi', 'jkl', 'mno', 'pqrs', 'tuv', 'wxyz'], 2)\n for c in s\n}\n\ndef unlock(message):\n return ''.join(map(strokes.get, message.lower()))", "def unlock(message):\n return message.lower().translate(str.maketrans(\n 'abcdefghijklmnopqrstuvwxyz',\n '22233344455566677778889999'))", "TRANS = dict(zip('abcdefghijklmnopqrstuvwxyz',\n '22233344455566677778889999'))\n\ndef unlock(message):\n return ''.join( TRANS[c] for c in message.lower() )", "unlock=lambda s:s.lower().translate(s.maketrans('abcdefghijklmnopqrstuvwxyz','22233344455566677778889999'))", "TABLE = str.maketrans(\"abcdefghijklmnopqrstuvwxyz\",\"22233344455566677778889999\")\n\ndef unlock(message): return message.lower().translate(TABLE)", "def unlock(message):\n a = {'abc':2,'def':3,'ghi':4,'jkl':5,'mno':6,'pqrs':7,'tuv':8,'wxyz':9}\n return \"\".join(str(a[y]) for x in message.lower() for y in a.keys() if x in y)"] | {"fn_name": "unlock", "inputs": [["Nokia"], ["Valut"], ["toilet"], ["waterheater"], ["birdhouse"]], "outputs": [["66542"], ["82588"], ["864538"], ["92837432837"], ["247346873"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,612 |
def unlock(message):
|
6416605f21611eee364310e6b99aad35 | UNKNOWN | My friend John and I are members of the "Fat to Fit Club (FFC)". John is worried because
each month a list with the weights of members is published and each month he is the last on the list
which means he is the heaviest.
I am the one who establishes the list so I told him:
"Don't worry any more, I will modify the order of the list".
It was decided to attribute a "weight" to numbers. The weight of a number will be from now on
the sum of its digits.
For example `99` will have "weight" `18`, `100` will have "weight"
`1` so in the list `100` will come before `99`.
Given a string with the weights of FFC members in normal order can you give this string ordered by "weights" of these numbers?
# Example:
`"56 65 74 100 99 68 86 180 90"` ordered by numbers weights becomes:
`"100 180 90 56 65 74 68 86 99"`
When two numbers have the same "weight", let us class them as if they were strings (alphabetical ordering) and not numbers:
`100` is before `180` because its "weight" (1) is less than the one of `180` (9)
and `180` is before `90` since, having the same "weight" (9), it comes before as a *string*.
All numbers in the list are positive numbers and the list can be empty.
# Notes
- it may happen that the input string have leading, trailing whitespaces and more than a unique whitespace between two consecutive numbers
- Don't modify the input
- For C: The result is freed. | ["def order_weight(_str):\n return ' '.join(sorted(sorted(_str.split(' ')), key=lambda x: sum(int(c) for c in x)))", "def sum_string(s):\n sum = 0\n for digit in s:\n sum += int(digit)\n return sum\n\ndef order_weight(strng):\n # your code\n initial_list = sorted(strng.split())\n result = \" \".join(sorted(initial_list, key=sum_string))\n \n return result", "def weight_key(s):\n return (sum(int(c) for c in s), s)\ndef order_weight(s):\n return ' '.join(sorted(s.split(' '), key=weight_key))", "def order_weight(strng):\n return \" \".join( sorted(strng.split(), key=lambda x: (sum(int(d) for d in x) , x) ) )", "order_weight = lambda s: ' '.join(sorted(sorted(s.split(' ')), key=lambda i: sum(map(int, i))))", "def order_weight(s):\n return ' '.join(sorted(s.split(), key=lambda x: (sum(map(int, x)), x)))", "def order_weight(string):\n return ' '.join(c[1] for c in sorted((sum(int(b) for b in a), a)\n for a in string.split()))\n", "def order_weight(strng):\n nums = sorted(strng.split())\n weights = [sum(map(int, n)) for n in nums]\n res = [n for w, n in sorted(zip(weights, nums))]\n return ' '.join(res)", "def order_weight(strng):\n return \" \".join(sorted(strng.split(' '), key=lambda s: (sum([int(i) for i in s]), s)))", "def order_weight(strng):\n return ' '.join(sorted(sorted(strng.split()), key=lambda w: sum([int(c) for c in w])))", "import operator\nfrom functools import reduce \ndef order_weight(strng):\n ans = []\n d = {}\n members = strng.split()\n for weight in members:\n sum_weight = 0\n for digit in weight:\n sum_weight += int(digit)\n if d.get(sum_weight) != None:\n d[sum_weight].append(weight)\n else:\n d[sum_weight] = [weight]\n li = sorted(list(d.items()), key = lambda el: el[0])\n for pair in li:\n if len(pair[1]) > 1:\n for mean in sorted(pair[1]):\n ans.append(str(mean))\n else:\n ans.append(str(pair[1][0]))\n return ' '.join(ans)\n", "def order_weight(s):\n return \" \".join(sorted(s.split(), key=lambda x: (sum(int(y) for y in x), x)))", "def order_weight(string):\n weights = string.split()\n return ' '.join(sorted(weights, key=lambda w: (sum(int(n) for n in w), w)))", "def order_weight(strng):\n l=list(strng.split())\n l=sorted(l)\n l=sorted(l, key=lambda x:sum(int(n) for n in str(x)))\n return \" \".join(l)", "def order_weight(s):\n return ' '.join(sorted(sorted(s.split()), key=lambda x: sum(int(i) for i in x)))", "order_weight=lambda s:' '.join(sorted(s.split(),key=lambda s:(sum(map(int,s)),s)))", "def order_weight(strng):\n return ' '.join(sorted(strng.split(' '), \n key=lambda s: (sum([int(a) for a in s]), s)))", "def get_digits_sum(number):\n return sum([int(sign) for sign in number if sign.isdigit()])\n \ndef custom_sorting(numbers):\n values = [(get_digits_sum(number), number) for number in numbers]\n return [value[1] for value in sorted(values)]\n\ndef order_weight(strng):\n return \" \".join(custom_sorting(strng.strip().split(\" \")))", "def order_weight(strng):\n return ' '.join([a[1] for a in sorted([(sum(int(y) for y in x), x) for x in strng.split(' ')])])", "def order_weight(strng):\n nums = strng.split()\n l = []\n for n in nums:\n s = sum(list(int(i) for i in n))\n l += [[s,n]]\n l.sort()\n return ' '.join([i[-1] for i in l])", "def order_weight(s):\n func = lambda x: sum(map(int, x))\n return ' '.join(sorted(s.split(), key=lambda x: (func(x), x)))", "def order_weight(string):\n s = sorted([(sum([int(n) for n in num.strip()]), num.strip()) for num in string.split(\" \")])\n return ' '.join(map(lambda t: t[1], s))", "def order_weight(strng):\n return ' '.join(sorted(sorted(strng.split()), key=lambda s: sum([int(x) for x in s])))", "def order_weight(strng):\n my_list = sorted([int(i) for i in strng.split()], key=lambda x: str(x))\n sorted_int_list = sorted(my_list, key=lambda x: sum(int(d) for d in str(x)))\n return ' '.join(map(str, sorted_int_list))", "def order_weight(strng):\n res = strng.split(' ')\n list = []\n for x in res:\n a = 0\n res2 = [z for z in x]\n for y in res2:\n a += int(y)\n list.append(a)\n answer = [m for n,m in sorted(zip(list,res))]\n return ' '.join(answer)\n # your code\n", "def order_weight(strng):\n if strng==\"\":\n return strng\n else:\n lss=strng.split()\n new_ls=[]\n dic={}\n value=\"\" \n for elements in lss:\n new=sum(float(element) for element in elements) \n if new in new_ls:\n while new in new_ls:\n new=float(new)\n new+=0.001\n new_ls.append(new)\n dic[new]=elements\n else:\n new_ls.append(new)\n dic[new]=elements\n new_ls.sort() \n sl=[dic.get(new_ls[m]) for m in range(len(new_ls))]\n for m in range(len(new_ls)):\n for n in range(len(new_ls)):\n if int(new_ls[m])==int(new_ls[n]) and m!=n:\n if dic.get(new_ls[m])<dic.get(new_ls[n]) and m>n:\n t=new_ls[m]\n new_ls[m]=new_ls[n]\n new_ls[n]=t \n for i in range(len(new_ls)-1):\n value+=\"\".join(dic.get(new_ls[i]))\n value+=\" \"\n value+=\"\".join(dic.get(new_ls[-1]))\n return value", "def order_weight(strng):\n return ' '.join(sorted(sorted(filter(lambda x: not not x, strng.split(' '))),key=lambda x:sum(map(int,x))))", "def order_weight(strng):\n return ' '.join(sorted(sorted(strng.split(' ')), key = lambda s : sum(int(c) for c in s)))", "def order_weight(strng):\n strng = [list(map(int, i)) for i in strng.split(' ')]\n strng = sorted(sorted(strng), key=lambda num: sum(num))\n strng = ' '.join([''.join(map(str, i)) for i in strng])\n return strng", "def order_weight(strng):\n key = lambda s: (sum((int(d) for d in s)), s)\n return ' '.join(sorted(strng.split(), key=key))\n\n", "def order_weight(strng):\n nums = sorted(sorted(strng.split(' ')),key=lambda x: sum([int(i) for i in x]))\n return \" \".join(nums)\n", "def order_weight(strng):\n st_list=strng.split()\n return ' '.join(sorted(st_list,key=lambda x:(sum(int(y) for y in x),x)))", "def order_weight(strng):\n return ' '.join(sorted(sorted(strng.split()),key=lambda s:sum(map(int,list(s)))))\n", "def order_weight(strng):\n # your code\n return \" \".join(sorted(strng.split(),key=lambda x: (sum(map(int,x)),str(x))))", "order_weight = lambda s: ' '.join(sorted(sorted(s.split()), key=lambda w: sum(map(int, w))))", "def order_weight(strng):\n return \" \".join(sorted(strng.split(), key=lambda x: (sum(int(i) for i in str(x)), x)))", "def order_weight(strng):\n return ' '.join(sorted(sorted(strng.split()), key=lambda num_str: sum(int(digit) for digit in num_str)))", "def order_weight(string):\n return str(' '.join(sorted(sorted(string.split()), key = lambda x:sum(map(int, str(x))))))", "def sumStr(strng):\n return sum( int(num) for num in strng )\n\ndef order_weight(strng):\n strList = sorted( strng.split(' ') )\n return ' '.join(sorted( strList, key = sumStr ))", "def order_weight(strng):\n\n print(strng)\n def sum_strng(some_string):\n return sum(int(x) for x in some_string if x.isdigit())\n\n original_string_array = strng.split(' ')\n\n tuple_arr = []\n\n def order(arr):\n for i in arr:\n tuple_arr.append((i,sum_strng(i)))\n\n order(original_string_array)\n\n tuple_arr.sort(key=lambda tup: tup[0])\n tuple_arr.sort(key=lambda tup: tup[1])\n\n return ' '.join([x[0] for x in tuple_arr])", "def order_weight(strng):\n return ' '.join(sorted(strng.split(), key=lambda w: (sum(map(int, w)), w)))", "def order_weight(strng):\n return \" \".join(sorted(strng.split(\" \"), key=lambda s:(sum([int(c) for c in s]), s)))", "def order_weight(string):\n valueList = [sum([int(char) for char in num]) for num in string.split()]\n return ' '.join([tup[1] for tup in sorted(zip(valueList,string.split()))])", "def order_weight(strng):\n return ' '.join(sorted(strng.split(), key = lambda s: (sum(map(int, s)), s)))", "from functools import cmp_to_key\n\ndef weight_str_nb(strn):\n return sum([int(d) for d in strn])\ndef comp(a, b):\n cp = weight_str_nb(a) - weight_str_nb(b);\n if (cp == 0):\n if (a < b): \n r = -1\n else: \n r = 1\n else:\n r = cp;\n return r\ndef order_weight(strng):\n return \" \".join(sorted(strng.split(), key=cmp_to_key(comp)))\n", "def order_weight(string):\n string = string.split()\n string = sorted(string)\n string = sorted(string, key = f)\n return ' '.join(string)\ndef f(n):\n return sum(int(i) for i in n)\n", "def order_weight(string):\n return ' '.join(sorted(string.split(), key= lambda s: (sum(int(i) for i in s), s)))", "def order_weight(strng):\n s=strng.split()\n s2=[]\n s3=[]\n order=[]\n Out=[]\n s4=\"\"\n for i in range(len(s)):\n s2.append(int(s[i]))\n a=0\n for j in range(len(s[i])):\n a=a+s2[i]//(10**j)%10\n s3.append(a) \n\n for j in range(len(s3)-1):\n for m in range(len(s3)-1):\n buf=0\n buf2=0\n if (s3[m]>s3[m+1]):\n buf=s3[m]\n s3[m]=s3[m+1]\n s3[m+1]=buf\n buf2=s2[m]\n s2[m]=s2[m+1]\n s2[m+1]=buf2\n else:\n if (s3[m]==s3[m+1]):\n if str(s2[m])>str(s2[m+1]):\n buf2=s2[m]\n s2[m]=s2[m+1]\n s2[m+1]=buf2\n\n for m in range(len(s2)):\n s4=s4+str(s2[m])+\" \"\n s5=\"\"\n for j in range(len(s4)-1):\n s5=s5+s4[j]\n return s5\n", "def convert(x):return sum(map(int,x))\ndef GT(x,y): return convert(x) > convert(y)\ndef LT(x,y): return convert(x) < convert(y)\ndef EQ(x,y): return convert(x) == convert(y)\n\ndef qSort(xs):\n \n if len(xs) == 0: return []\n \n pivot, *xs = xs \n \n lower = [x for x in xs if LT(x,pivot)] \n eqs = sorted([x for x in xs if EQ(x,pivot)] + [pivot])\n upper = [x for x in xs if GT(x,pivot)]\n \n return qSort(lower) + eqs + qSort(upper)\n \ndef order_weight(xs):\n return \" \".join(qSort(xs.split(\" \")))", "def order_weight(strng):\n # your code\n return ' '.join(sorted(sorted(strng.split()), key=lambda x: sum(int(a) for a in x), reverse=False))", "order_weight = lambda strng: ' '.join([x for _,x in sorted(zip([sum([int(j) for j in i]) for i in strng.split(' ')],strng.split(' ')))])", "def order_weight(strng):\n return ' '.join(map(str, sorted(sorted(list(x for x in strng.split(\" \") if x), key=lambda x: str(x)), key=lambda x: sum(map(int, str(x))))))", "def order_weight(string):\n return \" \".join(sorted(string.split(), key=lambda s: (sum(int(d) for d in list(s)), s)))", "def order_weight(s):\n return' '.join(sorted(s.split(),key=lambda e:[sum(map(int,e)),e]))", "def sort_key(s):\n return (sum(int(n) for n in list(s)), s)\n\ndef order_weight(strng):\n return ' '.join(sorted(strng.split(), key = sort_key))", "def order_weight(strng):\n if len(strng) > 1:\n stg = strng.split()\n k = []\n for i in stg:\n l = 0\n for m in i:\n l += int(m)\n k.append(l) \n q = list(zip(k, stg))\n q.sort(key=len, reverse=True) \n p = sorted(q, key = lambda t: (t[0], t))\n print(p)\n v = list(zip(*p))\n #print(v[1])\n return \" \".join(v[1])\n else:\n return strng\n \n#def getsum(stg):\n# k = []\n # for i in stg:\n # l = 0\n # for m in i:\n # l += int(m)\n # k.append(l)\n#have this fns take a number as an input and output the sum of the digits\n \n", "def order_weight(strng):\n slw = [(sum(int(x) for x in str(weight)),weight) for weight in strng.split()]\n return \" \".join(x[1] for x in sorted(slw))\n", "def order_weight(string):\n return ' '.join(sorted(string.split(), key=lambda s:(sum(map(int, s)), s)))", "def order_weight(string):\n return ' '.join(sorted(string.split(), key=lambda x: (sum(int(i) for i in x), x)))\n", "def order_weight(strng):\n strng = \" \".join(sorted(strng.split()))\n return \" \".join(sorted(strng.split(), key=lambda x: sum(map(int, list(x)))))", "def order_weight(strng):\n return \" \".join(sorted(sorted([x for x in strng.split()]), key = lambda y: sum(map(int,y))))", "def order_weight(st):\n res, l =[], st.split(' ')\n d = {x : sum(map(int, list(l[x]))) for x in range(len(l))}\n print(d)\n for x in sorted(set(d.values())):\n res.extend(sorted([l[i] for i in d.keys() if d[i] == x]))\n return ' '.join(res)", "def order_weight(strng):\n strng_list = strng.split(\" \")\n lst = list(zip(map(lambda x: sum(int(i) for i in x),strng_list),strng_list))\n stl = list(map(lambda x: x[1],sorted(lst,key=lambda x: (x[0],x[1]))))\n return \" \".join(s for s in stl)", "order_weight = lambda numbers: ' '.join(sorted(numbers.split(), key=lambda number: (sum(int(num) for num in number), number)))", "def order_weight(string):\n strng=string.split()\n for i in range(0,len(strng)):\n for j in range(0,len(strng)):\n #print(strng[i],strng[j])\n if ( weight(strng[i]) < weight(strng[j]) ):\n pass\n elif ( weight(strng[i]) == weight(strng[j]) ):\n if(strng[i] <= strng[j]):\n pass\n else:\n print (strng[i],strng[j])\n strng[i],strng[j]=strng[j],strng[i]\n else:\n print (strng[i],strng[j])\n strng[i],strng[j]=strng[j],strng[i]\n strng.reverse()\n final=\" \".join(strng)\n return final\n \ndef weight(st):\n weight=0\n for i in range(len(st)):\n weight=weight+int(st[i])\n return weight", "def order_weight(s):\n return ' '.join(sorted(s.split(), key=lambda i: (sum(map(int, i)), i)))", "def order_weight(string):\n # your code\n return ' '.join(sorted(string.split(), key=lambda x: (sum([int(s) for s in x]), x), reverse=False))", "def order_weight(strng):\n return ' '.join(sorted(strng.split(), key=lambda n: (sum(map(int, n)), n)))", "def digit_sum(string):\n return sum([int(x) for x in string])\n \ndef order_weight(string):\n weights = sorted(string.split())\n return \" \".join(sorted(weights, key=digit_sum))", "def order_weight(strng):\n return ' '.join(sorted(sorted(strng.split()), key=lambda weight: sum(map(int, weight))))", "def order_weight(strng):\n return ' '.join(sorted(sorted(strng.split()),key = lambda x: sum(int(y) for y in x)))\n", "def weight(s):\n return sum(int(char) for char in s),s\n\ndef order_weight(string):\n # your code\n lst = string.split()\n lst.sort(key=weight)\n return ' '.join(lst)", "\ndef order_weight(strng):\n # split \" \" into list\n # iterate over word, iterate over character\n # each word has total, total += int(char)\n lis = strng.split(\" \")\n c = []\n for word in lis:\n weight = 0\n for num in word:\n weight += int(num)\n x = {}\n x['number'] = word\n x['weight'] = weight\n c.append(x)\n #print(c)\n # sort list of dict by value\n c.sort(key=lambda x: x['number'])\n c.sort(key=lambda x: x['weight'])\n # iterate through c and return number of each object\n return ' '.join(x['number'] for x in c)\n print(order_weight(strng))", "def order_weight(strng):\n cs = strng.strip().split()\n ls = sorted(sorted(cs), key = cc)\n return ' '.join(ls)\n \ndef cc(a):\n return sum(map(int,a))", "def getSum(n):\n return sum([int(x) for x in n])\n\ndef order_weight(s):\n return ' '.join(sorted(s.split(), key=lambda x: [getSum(x), x]))", "def sum_digits(a):\n n = int(a)\n r = 0\n while n:\n r, n = r + n % 10, n // 10\n return r\n\ndef order_weight(strng):\n strng_sorted = sorted(strng.split(), key = str.lower)\n return ' '.join(sorted(strng_sorted, key = sum_digits))", "def order_weight(strng):\n # your code\n weight_list = strng.split()\n faux_list = []\n for weight in weight_list:\n total = 0\n for number in weight.strip():\n total = total+int(number)\n faux_weight, real_weight = total , weight\n faux_list.append((faux_weight, real_weight))\n \n final_manipulated_list = []\n for x,y in sorted(faux_list):\n final_manipulated_list.append(y)\n return \" \".join(final_manipulated_list)\n \n \n\n \n \n", "# pulled this from the top answer. lambda passes a tuple to sorted.\ndef order_weight(strng):\n return ' '.join(sorted(strng.split(), key=lambda x: (sum(int(c) for c in x), x)))\n", "def order_weight(strng):\n weights = list()\n for x in strng.split():\n weights.append(sum([int(y) for y in x]))\n weight_counts = list(zip(strng.split(),weights))\n return ' '.join(\"{!s}\".format(key) for key,value in sorted(weight_counts, key=lambda t: t[::-1]))", "def sum_digits(num):\n return sum([int(d) for d in num])\n \ndef order_weight(string):\n if string == '': return string\n weights = [(sum_digits(num),num) for num in string.split()]\n weights.sort()\n answer = [weights[i][1] for i,_ in enumerate(weights)]\n return ' '.join(answer)\n \n\n \n \n \n \n\n# if string == '': return string\n# sum_digits = lambda x: sum([int(d) for d in x])\n# return ' '.join(sorted(string.split(), key=sum_digits))\n", "def order_weight(strng):\n # your code\n def sorter(num):\n return sum([int(digit) for digit in num])\n \n strng_nums = strng.strip().split()\n strng_nums.sort()\n strng_nums.sort(key=sorter)\n \n return ' '.join(strng_nums)", "def order_weight(strng):\n strng_lst = sorted(strng.split())\n weights = [(weight, sum([int(digit) for digit in weight])) for weight in strng_lst]\n sorted_weights = [result[0] for result in sorted(weights, key=lambda result: result[1])]\n \n return ' '.join(sorted_weights)", "def order_weight(strng):\n sum_sort = lambda x: sum([int(n) for n in x])\n return ' '.join(sorted(sorted(strng.split()), key=sum_sort))", "import functools\nimport operator\n\ndef order_weight(strng):\n # your code\n if strng == \"\":\n return \"\"\n else:\n x = strng.split(\" \")\n y = []\n weighted_weights = dict()\n for item in range(len(x)):\n actualweight = x[item]\n y.append(functools.reduce(operator.add, [int(actualweight[i]) for i in range(len(actualweight))])) \n weighted_weights[x[item]] = y[item];\n x = sorted(x)\n listofweights = sorted(x, key = weighted_weights.get)\n return ' '.join(listofweights)\n \n \n \n", "def order_weight(strng):\n codeList = []\n counter = 0\n finalString = ''\n \n wgList = strng.split(' ')\n \n for i in range(len(wgList)):\n for j in range(len(wgList[i])):\n counter = counter + int(wgList[i][j])\n codeList.append(counter)\n counter = 0\n\n finalList = sorted(list(zip(codeList, wgList)))\n \n for i in range(len(finalList)):\n finalString += finalList[i][1] + ' '\n return finalString[:-1]\n", "def order_weight(strng):\n numbers = [int(i) for i in strng.split()]\n weights_list = [sum(map(int, str(number))) for number in numbers]\n weights_list_sorted = sorted(weights_list)\n\n weights = []\n for number in numbers:\n weight = sum(map(int, str(number)))\n mylst = [number, weight]\n weights.append(mylst)\n \n res_list = []\n for lst in sorted(weights, key=lambda x: (x[1], str(x[0]))):\n res_list.append(str(lst[0]))\n \n return \" \".join(res_list)\n", "def order_weight(strng):\n numbers = [int(i) for i in strng.split()]\n\n weights = []\n for number in numbers:\n weight = sum(map(int, str(number)))\n mylst = [number, weight]\n weights.append(mylst)\n \n res_list = []\n for lst in sorted(weights, key=lambda x: (x[1], str(x[0]))):\n res_list.append(str(lst[0]))\n \n return \" \".join(res_list)\n", "import operator\n\ndef order_weight(strng):\n modified = [(sum(map(int, x)), x) for x in strng.split()]\n return ' '.join(sort[1] for sort in sorted(modified, key=operator.itemgetter(0, 1)))", "def order_weight(strng):\n strng = sorted(strng.split())\n result = sorted(strng, key=lambda elem: sum([int(x) for x in elem]))\n return ' '.join(result)", "def order_weight(strng):\n result = 0\n solution = []\n numbers_list = [int(x) for x in strng.split()]\n for x in numbers_list:\n while x > 0:\n result += x % 10\n x = x // 10\n solution.append(result)\n result = 0\n return ' '.join([x for _, x in sorted(zip(solution, [str(x) for x in numbers_list]))])\n", "def weight(s):\n return sum([int(i) for i in s])\n\ndef order_weight(strng):\n nums = strng.split()\n return ' '.join(sorted(nums, key=lambda x: (weight(x), x)))\n", "def order_weight(strng):\n wghts = strng.split()\n srtd = sorted(wghts, key= lambda x: (get_weight(x), x))\n return (' '.join(str(i) for i in srtd))\n\ndef get_weight(number):\n return sum(int(digit) for digit in number)\n", "def order_weight(strng):\n list2 = strng.split(' ')\n weights = []\n \n for x in list2:\n digits = list(x)\n for i in range(len(digits)):\n digits[i] = int(digits[i])\n weights.append(sum(digits))\n \n weights, list2 = zip(*sorted(zip(weights, list2)))\n return str(','.join(list2)).replace(',', ' ')", "from functools import cmp_to_key\n\ndef sum_digits(num):\n return sum([int(d) for d in str(num)])\n\ndef sort_weights(w1, w2):\n w1_total = sum_digits(w1)\n w2_total = sum_digits(w2)\n if w1_total == w2_total:\n if str(w1) < str(w2):\n return -1\n return 1\n else:\n return w1_total - w2_total\n\ndef order_weight(strng):\n if not strng:\n return \"\"\n weights = [int(x) for x in strng.split(\" \")]\n sorted_weights = sorted(weights, key=cmp_to_key(sort_weights))\n return \" \".join(map(str, sorted_weights))", "def order_weight(strng):\n splitted = strng.split()\n solution = \"\"\n list = []\n for item in splitted:\n weight = 0\n for digit in item:\n weight += int(digit)\n arr = [weight, item]\n list.append(arr)\n list.sort()\n for item in list:\n \n solution += \" \" + item[1]\n return solution[1:]"] | {"fn_name": "order_weight", "inputs": [["103 123 4444 99 2000"], ["2000 10003 1234000 44444444 9999 11 11 22 123"], [""], ["10003 1234000 44444444 9999 2000 123456789"], ["3 16 9 38 95 1131268 49455 347464 59544965313 496636983114762 85246814996697"], ["71899703 200 6 91 425 4 67407 7 96488 6 4 2 7 31064 9 7920 1 34608557 27 72 18 81"], ["387087 176 351832 100 430372 8 58052 54 175432 120 269974 147 309754 91 404858 67 271476 164 295747 111 40"]], "outputs": [["2000 103 123 4444 99"], ["11 11 2000 10003 22 123 1234000 44444444 9999"], [""], ["2000 10003 1234000 44444444 9999 123456789"], ["3 16 9 38 95 1131268 49455 347464 59544965313 496636983114762 85246814996697"], ["1 2 200 4 4 6 6 7 7 18 27 72 81 9 91 425 31064 7920 67407 96488 34608557 71899703"], ["100 111 120 40 8 54 91 164 147 67 176 430372 58052 175432 351832 271476 309754 404858 387087 295747 269974"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 23,346 |
def order_weight(strng):
|
e64ef82b6ec9567fe1f82d3c6019f536 | UNKNOWN | Write a simple function that takes polar coordinates (an angle in degrees and a radius) and returns the equivalent cartesian coordinates (rouded to 10 places).
```
For example:
coordinates(90,1)
=> (0.0, 1.0)
coordinates(45, 1)
=> (0.7071067812, 0.7071067812)
``` | ["from math import cos, sin, radians\n\ndef coordinates(deg, r, precision=10):\n x, y = r * cos(radians(deg)), r * sin(radians(deg))\n return round(x, precision), round(y, precision)", "from math import cos,sin,radians\n\ndef coordinates(d, r):\n convert = lambda x: round(r*x(radians(d)),10)\n return ( convert(cos), convert(sin) )", "from math import cos, radians, sin\n\ndef coordinates(th, r):\n return tuple(round(r * f(radians(th)), 10) for f in (cos, sin))", "from math import cos, sin, radians\n\ndef coordinates(d, r):\n return round(r * cos(radians(d)), 10), round(r * sin(radians(d)), 10)", "import math\n\ndef coordinates(degrees, radius):\n theta = math.radians(degrees)\n x = math.cos(theta) * radius\n y = math.sin(theta) * radius\n return round(x, 10), round(y, 10)", "from math import sin,cos,radians\n\ndef coordinates(deg, r):\n theta = radians(deg)\n return tuple( round(r*f(theta), 10) for f in (cos,sin) )", "def coordinates(d,r):c=r*1j**(d/90);return(round(c.real,10),round(c.imag,10))", "from math import radians, sin, cos\n\ndef coordinates(degrees, radius):\n angle = radians(degrees)\n return tuple(round(f(angle) * radius, 10) for f in (cos, sin))\n", "import math\ndef coordinates(degrees, radius):\n if degrees!=0:\n degrees=math.pi/(180/degrees)\n else:\n degrees=0\n return (round(radius*(math.cos(degrees)),10),round(radius*(math.sin(degrees)),10))", "from math import radians, sin, cos\n\ndef coordinates(degrees, radius):\n return (round(radius*cos(radians(degrees)),10),round(radius*sin(radians(degrees)),10))"] | {"fn_name": "coordinates", "inputs": [[90, 1], [90, 2], [0, 1], [45, 1], [1090, 10000], [-270, 1]], "outputs": [[[0.0, 1.0]], [[0.0, 2.0]], [[1.0, 0.0]], [[0.7071067812, 0.7071067812]], [[9848.0775301221, 1736.4817766693]], [[0.0, 1.0]]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,615 |
def coordinates(degrees, radius):
|
0054676402e2ed0433d622730a720296 | UNKNOWN | Given few numbers, you need to print out the digits that are not being used.
Example:
```python
unused_digits(12, 34, 56, 78) # "09"
unused_digits(2015, 8, 26) # "3479"
```
Note:
- Result string should be sorted
- The test case won't pass Integer with leading zero | ["def unused_digits(*args):\n return \"\".join(number for number in \"0123456789\" if number not in str(args))", "def unused_digits(*l):\n digits_set = set(list(\"0123456789\"))\n test_set = set(\"\".join(str(i) for i in l))\n d = digits_set.difference(test_set)\n r = \"\".join(sorted(d))\n return r", "def unused_digits(*args):\n s = ''.join(map(str,args))\n return ''.join(str(i) for i in range(0,10) if str(i) not in s)", "def unused_digits(*args):\n return ''.join(sorted(set(\"0123456789\") - set(str(args))))", "def unused_digits(*ints): return \"\".join(sorted(list(set('0123456789') - set(c for i in ints for c in str(i)))))", "def unused_digits(*args):\n s = \"\".join(str(a) for a in args) # make a big string\n return \"\".join(c for c in \"0123456789\" if c not in s)", "import string\n\ndef unused_digits(*args):\n #args is tuple of numbers\n #for each number we find, lets turn it into a string\n #then for each char in num str just add it to a set of found digits\n found_digits_chars = {char for n in args for char in str(n)}\n\n #let's say i have set of all digits {'0' to '9'}\n all_digits_chars = set(string.digits)\n #then just subtract found digits from set of all digits\n unused_digits_chars = all_digits_chars - found_digits_chars\n\n #then of course change format of answer to ordered strings\n return ''.join(sorted(list(unused_digits_chars)))\n", "def unused_digits(*args):\n return ''.join(sorted(set('0123456789') - {c for s in map(str, args) for c in s}))", "def unused_digits(*args):\n return ''.join(sorted(set('1234567890') - set(''.join(str(x) for x in args))))"] | {"fn_name": "unused_digits", "inputs": [[12, 34, 56, 78], [2015, 8, 26], [276, 575], [643], [864, 896, 744], [364, 500, 715, 730], [93, 10, 11, 40], [1, 11, 111, 1111, 11111], [9, 87, 654, 3210]], "outputs": [["09"], ["3479"], ["013489"], ["0125789"], ["01235"], ["289"], ["25678"], ["023456789"], [""]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 1,651 |
def unused_digits(*args):
|
844fd24f8e2f54c35d07d94436f19d8a | UNKNOWN | Implement a function called makeAcronym that returns the first letters of each word in a passed in string.
Make sure the letters returned are uppercase.
If the value passed in is not a string return 'Not a string'.
If the value passed in is a string which contains characters other than spaces and alphabet letters, return 'Not letters'.
If the string is empty, just return the string itself: "".
**EXAMPLES:**
```
'Hello codewarrior' -> 'HC'
'a42' -> 'Not letters'
42 -> 'Not a string'
[2,12] -> 'Not a string'
{name: 'Abraham'} -> 'Not a string'
``` | ["def make_acronym(phrase):\n try:\n return ''.join(word[0].upper() if word.isalpha() else 0 for word in phrase.split())\n except AttributeError:\n return 'Not a string'\n except TypeError:\n return 'Not letters'", "from operator import itemgetter\n\ndef make_acronym(phrase):\n if type(phrase) != str: return \"Not a string\"\n if not all(c.isalpha() or c.isspace() for c in phrase): return \"Not letters\"\n return ''.join(map(itemgetter(0), phrase.split())).upper()", "def make_acronym(phrase):\n if not isinstance(phrase, str): return 'Not a string'\n arr = phrase.split()\n return ''.join(a[0] for a in arr).upper() if all(map(str.isalpha, arr)) else 'Not letters' ", "def make_acronym(phrase):\n if not isinstance(phrase, str):\n return 'Not a string'\n elif phrase == '':\n return ''\n elif not phrase.replace(' ', '').isalpha():\n return 'Not letters'\n else:\n return ''.join(word[0].upper() for word in phrase.split(' '))", "def make_acronym(phrase):\n if isinstance(phrase, str):\n words = phrase.split()\n if all(x.isalpha() or x.isspace() for x in words):\n return ''.join(x[0] for x in words).upper()\n else:\n return 'Not letters'\n return 'Not a string'", "from string import ascii_letters\ndef make_acronym(phrase):\n acronym = ''\n if isinstance(phrase, str):\n words = phrase.split()\n for word in words:\n for char in word:\n if char in ascii_letters:\n pass\n else:\n return 'Not letters'\n acronym += word[0].upper()\n return acronym\n return 'Not a string'", "def make_acronym(phrase):\n if not isinstance(phrase, str):\n return 'Not a string'\n words = phrase.split();\n if not all(i.isalpha() for i in words):\n return 'Not letters'\n return ''.join(p[0] for p in words).upper()", "def make_acronym(phrase):\n import re\n if type(phrase) is not str:\n return 'Not a string'\n if re.search(r'[^A-Za-z\\s]',phrase):\n return 'Not letters'\n acronym = ''\n for x in phrase.split():\n acronym += x[0]\n return acronym.upper()"] | {"fn_name": "make_acronym", "inputs": [["My aunt sally"], ["Please excuse my dear aunt Sally"], ["How much wood would a woodchuck chuck if a woodchuck could chuck wood"], ["Unique New York"], ["a42"], ["1111"], [64], [[]], [{}], [""]], "outputs": [["MAS"], ["PEMDAS"], ["HMWWAWCIAWCCW"], ["UNY"], ["Not letters"], ["Not letters"], ["Not a string"], ["Not a string"], ["Not a string"], [""]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 2,222 |
def make_acronym(phrase):
|
6827e25bb8615ee0884db682e96439f6 | UNKNOWN | # Description:
Replace the pair of exclamation marks and question marks to spaces(from the left to the right). A pair of exclamation marks and question marks must has the same number of "!" and "?".
That is: "!" and "?" is a pair; "!!" and "??" is a pair; "!!!" and "???" is a pair; and so on..
# Examples
```
replace("!!") === "!!"
replace("!??") === "!??"
replace("!?") === " "
replace("!!??") === " "
replace("!!!????") === "!!!????"
replace("!??!!") === "! "
replace("!????!!!?") === " ????!!! "
replace("!?!!??!!!?") === " !!!?"
``` | ["from itertools import groupby\n\ndef replace(s):\n queue, rle = {}, [[i, k, len(list(g))] for i, (k, g) in enumerate(groupby(s))]\n for i, k, l in reversed(rle):\n if l not in queue: queue[l] = {}\n queue[l].setdefault(k, []).append(i)\n for l in queue:\n while sum(map(bool, queue[l].values())) > 1:\n for c in queue[l]: rle[queue[l][c].pop()][1] = ' '\n return ''.join(k * l for i, k, l in rle)", "import re\n\ndef replace(s):\n dic = {'!': '?', '?': '!'}\n r = re.findall(r'[!]+|[/?]+', s)\n for i in r[:]:\n ii =dic[i[0]] * len(i)\n if ii in r:\n r[r.index(ii)] = ' ' * len(i) \n return ''.join(r)", "import itertools as it\nfrom collections import Counter, defaultdict\nfrom functools import reduce\n\ndef tokenize(s):\n for key, group in it.groupby(s):\n yield key, len(list(group))\n\ndef gather(tokens, expected_keys = None):\n stats = defaultdict(Counter)\n tokens = it.chain(tokens, ((key,0) for key in expected_keys or []))\n for key, length in tokens:\n stats[key][length] +=1\n return stats\n\ndef intersect(*counters, ignored_keys=None):\n mins = reduce(lambda a, b: a & b, counters)\n for key in ignored_keys:\n mins.pop(key, None)\n return +mins\n \ndef substitute(tokens, counters, replacement_key):\n for key, length in tokens:\n if counters[key][length]:\n counters[key][length] -= 1\n yield replacement_key, length\n else:\n yield key, length \ndef detokenize(tokens):\n return ''.join(key * length for key, length in tokens)\n \ndef replace(s):\n tokens = list(tokenize(s))\n stats = gather(tokenize(s), expected_keys='!?')\n mins = intersect(*list(stats.values()), ignored_keys = [0])\n replaced_counts = {key: mins.copy() for key in stats}\n replaced_tokens = substitute(tokens, replaced_counts, ' ')\n return detokenize(replaced_tokens)\n \n", "from itertools import groupby\n\ndef replace(stg):\n g = [\"\".join(s) for _, s in groupby(stg)]\n l = len(g)\n for i in range(l):\n for j in range(i+1, l, 2):\n if \" \" not in f\"{g[i]}{g[j]}\" and len(g[i]) == len(g[j]):\n g[i] = g[j] = \" \" * len(g[i])\n return \"\".join(g)", "from itertools import groupby\nfrom collections import defaultdict\n\ndef replace(s):\n res, D = [], {'!':defaultdict(list), '?':defaultdict(list)}\n for i, (k, l) in enumerate(groupby(s)):\n s = len(list(l))\n D[k][s].append(i)\n res.append([k, s])\n for v, L1 in D['!'].items():\n L2 = D['?'][v]\n while L1 and L2:\n res[L1.pop(0)][0] = ' '\n res[L2.pop(0)][0] = ' '\n return ''.join(c*v for c,v in res)", "from itertools import groupby\nfrom collections import defaultdict\n\ntbl = str.maketrans('!?', '?!')\n\ndef replace(s):\n xs = [''.join(grp) for _, grp in groupby(s)]\n stacks = defaultdict(list)\n result = []\n for i, x in enumerate(xs):\n stack = stacks[x]\n if stack:\n result[stack.pop(0)] = x = ' ' * len(x)\n else:\n stacks[x.translate(tbl)].append(i)\n result.append(x)\n return ''.join(result)", "from collections import defaultdict, deque\nimport re\n\ndef replace(s):\n chunks = re.findall(r'!+|\\?+', s)\n cnts = defaultdict(deque)\n for i,c in enumerate(chunks[:]):\n other = '!?'[c[0]=='!'] * len(c)\n if cnts[other]:\n blank = ' '*len(c)\n chunks[i] = chunks[cnts[other].popleft()] = blank\n else:\n cnts[c].append(i)\n \n return ''.join(chunks)", "from itertools import groupby\ndef replace(s):\n g = [\"\".join(j) for i, j in groupby(s)]\n for i, j in enumerate(g):\n for k, l in enumerate(g[i+1:], start=i + 1):\n if len(j) == len(l) and j[0] != l[0] and ' ' not in j+l:\n g[i] = g[k] = \" \" * len(j) \n break\n return \"\".join(g)", "from collections import Counter\nfrom itertools import chain, groupby, repeat, starmap\n\nC2D = {'!': 1, '?': -1}\n\ndef replace(s):\n gs = [(c, sum(1 for _ in g)) for c, g in groupby(s)]\n ds = Counter()\n for c, k in gs:\n ds[k] += C2D[c]\n for i in reversed(list(range(len(gs)))):\n c, k = gs[i]\n if ds[k] * C2D[c] > 0:\n ds[k] -= C2D[c]\n else:\n gs[i] = ' ', k\n return ''.join(chain.from_iterable(starmap(repeat, gs)))\n", "import itertools as it\nfrom collections import Counter, defaultdict\nfrom functools import reduce\n\ndef tokenize(string):\n groups = it.groupby(string)\n for key, group in groups:\n yield key, len(list(group))\n \ndef gather(tokens, expected_keys=None):\n stats = defaultdict(Counter)\n tokens = it.chain(tokens, ((key, 0) for key in expected_keys or []))\n for key, length in tokens:\n stats[key][length] += 1\n return stats\n \ndef intersect(*counters, ignored_keys=None):\n mins = reduce(lambda a, b: a & b, counters)\n for key in ignored_keys or []:\n mins.pop(key, None)\n return +mins\n \ndef remove(tokens, counters, replacement_key):\n for key, length in tokens:\n if counters[key][length]:\n counters[key][length] -= 1\n yield replacement_key, length\n else:\n yield key, length\n \ndef detokenize(tokens):\n return ''.join(key * length for key, length in tokens)\n\ndef replace(s):\n tokens = list(tokenize(s))\n stats = gather(tokens, expected_keys='!?')\n mins = intersect(*list(stats.values()), ignored_keys=[0])\n replace_counts = {key: mins.copy()for key in stats}\n replaced_tokens = remove(tokens, replace_counts, ' ')\n return detokenize(replaced_tokens)\n \n"] | {"fn_name": "replace", "inputs": [["!!?!!?!!?!!?!!!??!!!??!!!??"], ["??!??!??!??!???!!???!!???!!"], ["?!!?!!?!!?!!!??!!!??!!!??!!!??!!!??"]], "outputs": [[" ? ? ?!!?!!! !!! !!! "], [" ! ! !??!??? ??? ??? "], ["? ? ? ?!!! !!! !!! !!!??!!!??"]]} | INTRODUCTORY | PYTHON3 | CODEWARS | 5,857 |
def replace(s):
|
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.