49 lines
1.0 KiB
Markdown
49 lines
1.0 KiB
Markdown
|
---
|
||
|
|
id: 5900f4d91000cf542c50ffea
|
||
|
|
title: 'Problem 364: Comfortable distance'
|
||
|
|
challengeType: 5
|
||
|
|
forumTopicId: 302025
|
||
|
|
dashedName: problem-364-comfortable-distance
|
||
|
|
---
|
||
|
|
|
||
|
|
# --description--
|
||
|
|
|
||
|
|
There are N seats in a row. N people come after each other to fill the seats according to the following rules:
|
||
|
|
|
||
|
|
If there is any seat whose adjacent seat(s) are not occupied take such a seat.
|
||
|
|
|
||
|
|
If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
|
||
|
|
|
||
|
|
Otherwise take one of the remaining available seats.
|
||
|
|
|
||
|
|
Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.
|
||
|
|
|
||
|
|
We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094. Find T(1 000 000) mod 100 000 007.
|
||
|
|
|
||
|
|
# --hints--
|
||
|
|
|
||
|
|
`euler364()` should return 44855254.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(euler364(), 44855254);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler364() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler364();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|