Post History

66%

+2 −0

Challenges How many umbrellas to cover the beach?

Python 3.8+, 219 bytes Short version: from itertools import combinations as c def m(w): for k in range(n:=len(w)): for y in c(range(n),k+1): s=[0]*n for x in y: for r in range(...

posted 3y ago by Arpad Horvath‭ · edited 3y ago by Arpad Horvath‭

Answer

#4: Post edited by

Arpad Horvath‭ · 2023-11-11T11:22:26Z (almost 3 years ago)
Adding import

Copy Link

Raw

Markdown

~~Python 3.8+,192 bytes~~
~~Short version without import:~~
```python
def m(w):
for k in range(n:=len(w)):
~~for xs in combinations(range(n),k+1):~~
s=[0]*n
~~for x in xs:~~
for r in range(w[x]):
s[max(0,x-r)]=s[min(n-1,x+r)]=1
if all(s):return k+1
```
Longer version with the tests.
```python
from itertools import combinations
def umbrellas(values):
n = len(values)
for k in range(n):
for xs in combinations(range(n), k+1):
shadow = [False] * n
for x in xs:
for r in range(values[x]):
shadow[max(0, x-r)] = shadow[min(n-1, x+r)] = True
if all(shadow):
return k + 1
known_results = [
("214141131", 2),
("92132421", 1),
("11111111", 8),
("513131116", 2),
]
for nums, result in known_results:
res = min_shield([int(ch) for ch in nums])
print(nums, result, res)
```

Python 3.8+, 219 bytes
Short version:
```python
from itertools import combinations as c
def m(w):
for k in range(n:=len(w)):
for y in c(range(n),k+1):
s=[0]*n
for x in y:
for r in range(w[x]):
s[max(0,x-r)]=s[min(n-1,x+r)]=1
if all(s):return k+1
```
Longer version with the tests.
```python
from itertools import combinations
def umbrellas(values):
n = len(values)
for k in range(n):
for xs in combinations(range(n), k+1):
shadow = [False] * n
for x in xs:
for r in range(values[x]):
shadow[max(0, x-r)] = shadow[min(n-1, x+r)] = True
if all(shadow):
return k + 1
known_results = [
("214141131", 2),
("92132421", 1),
("11111111", 8),
("513131116", 2),
]
for nums, result in known_results:
res = min_shield([int(ch) for ch in nums])
print(nums, result, res)
```

#3: Post edited by

Arpad Horvath‭ · 2023-11-10T17:35:15Z (almost 3 years ago)

Copy Link

Raw

Markdown

Python 3.8+,192 bytes
Short version without import:
```python
def m(w):
for k in range(n:=len(w)):
for xs in combinations(range(n),k+1):
s=[0]*n
for x in xs:
for r in range(w[x]):
s[max(0,x-r)]=s[min(n-1,x+r)]=1
if all(s):return k+1
```
Longer version with the tests.
```python
from itertools import combinations
def umbrellas(values):
n = len(values)
for k in range(n):
for xs in combinations(range(n), k+1):
shadow = [False] * n
for x in xs:
for r in range(values[x]):
shadow[max(0, x-r)] = shadow[min(n-1, x+r)] = True
if all(shadow):
return k + 1
known_results = [
("214141131", 2),
("92132421", 1),
("11111111", 8),
("513131116", 2),
]
~~def get_list(string):~~
~~return [int(ch) for ch in string]~~
for nums, result in known_results:
res = min_shield([int(ch) for ch in nums])
print(nums, result, res)
```

Python 3.8+,192 bytes
Short version without import:
```python
def m(w):
for k in range(n:=len(w)):
for xs in combinations(range(n),k+1):
s=[0]*n
for x in xs:
for r in range(w[x]):
s[max(0,x-r)]=s[min(n-1,x+r)]=1
if all(s):return k+1
```
Longer version with the tests.
```python
from itertools import combinations
def umbrellas(values):
n = len(values)
for k in range(n):
for xs in combinations(range(n), k+1):
shadow = [False] * n
for x in xs:
for r in range(values[x]):
shadow[max(0, x-r)] = shadow[min(n-1, x+r)] = True
if all(shadow):
return k + 1
known_results = [
("214141131", 2),
("92132421", 1),
("11111111", 8),
("513131116", 2),
]
for nums, result in known_results:
res = min_shield([int(ch) for ch in nums])
print(nums, result, res)
```

#2: Post edited by

Arpad Horvath‭ · 2023-11-10T17:33:45Z (almost 3 years ago)
standard format

Copy Link

Raw

Markdown

Python 3.8+ **192 bytes**
Short version without import:
```python
def m(w):
for k in range(n:=len(w)):
for xs in combinations(range(n),k+1):
s=[0]*n
for x in xs:
for r in range(w[x]):
s[max(0,x-r)]=s[min(n-1,x+r)]=1
if all(s):return k+1
```
Longer version with the tests.
```python
from itertools import combinations
def umbrellas(values):
n = len(values)
for k in range(n):
for xs in combinations(range(n), k+1):
shadow = [False] * n
for x in xs:
for r in range(values[x]):
shadow[max(0, x-r)] = shadow[min(n-1, x+r)] = True
if all(shadow):
return k + 1
known_results = [
("214141131", 2),
("92132421", 1),
("11111111", 8),
("513131116", 2),
]
def get_list(string):
return [int(ch) for ch in string]
for nums, result in known_results:
res = min_shield([int(ch) for ch in nums])
print(nums, result, res)
```

Python 3.8+,192 bytes
Short version without import:
```python
def m(w):
for k in range(n:=len(w)):
for xs in combinations(range(n),k+1):
s=[0]*n
for x in xs:
for r in range(w[x]):
s[max(0,x-r)]=s[min(n-1,x+r)]=1
if all(s):return k+1
```
Longer version with the tests.
```python
from itertools import combinations
def umbrellas(values):
n = len(values)
for k in range(n):
for xs in combinations(range(n), k+1):
shadow = [False] * n
for x in xs:
for r in range(values[x]):
shadow[max(0, x-r)] = shadow[min(n-1, x+r)] = True
if all(shadow):
return k + 1
known_results = [
("214141131", 2),
("92132421", 1),
("11111111", 8),
("513131116", 2),
]
def get_list(string):
return [int(ch) for ch in string]
for nums, result in known_results:
res = min_shield([int(ch) for ch in nums])
print(nums, result, res)
```

#1: Initial revision by

Arpad Horvath‭ · 2023-11-10T17:31:30Z (almost 3 years ago)

Copy Link

Raw

Markdown

Python 3.8+ **192 bytes**

Short version without import:

```python
def m(w):
 for k in range(n:=len(w)):
  for xs in combinations(range(n),k+1):
   s=[0]*n
   for x in xs:
    for r in range(w[x]):
     s[max(0,x-r)]=s[min(n-1,x+r)]=1
   if all(s):return k+1
```

Longer version with the tests.

```python
from itertools import combinations


def umbrellas(values):
    n = len(values)
    for k in range(n):
        for xs in combinations(range(n), k+1):
            shadow = [False] * n
            for x in xs:
                for r in range(values[x]):
                    shadow[max(0, x-r)] = shadow[min(n-1, x+r)] = True
            if all(shadow):
                return k + 1

known_results = [
    ("214141131", 2),
    ("92132421", 1),
    ("11111111", 8),
    ("513131116", 2),
]

def get_list(string):
    return [int(ch) for ch in string]

for nums, result in known_results:
    res = min_shield([int(ch) for ch in nums])
    print(nums, result, res)
```

Communities

Post History