2021-06-15 07:49:18 +00:00
---
id: 59622f89e4e137560018a40e
2021-08-09 08:35:35 +00:00
title: Sequências de Figura-Figura de Hofstadter
2021-06-15 07:49:18 +00:00
challengeType: 5
forumTopicId: 302286
dashedName: hofstadter-figure-figure-sequences
---
# --description--
2021-08-09 08:35:35 +00:00
Estas duas sequências de inteiros positivos são definidas como:
2021-06-15 07:49:18 +00:00
$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
2021-08-09 08:35:35 +00:00
A sequência $S(n)$ está definida ainda mais como a sequência de números inteiros positivos não presentes em $R(n)$.
2021-06-15 07:49:18 +00:00
2021-08-09 08:35:35 +00:00
A sequência $R$ inicia assim:
2021-06-15 07:49:18 +00:00
< pre > 1, 3, 7, 12, 18, ...< / pre >
2021-08-09 08:35:35 +00:00
A sequência $S$ inicia assim:
2021-06-15 07:49:18 +00:00
< pre > 2, 4, 5, 6, 8, ...< / pre >
# --instructions--
2021-08-09 08:35:35 +00:00
Crie duas funções chamadas `ffr` e `ffs` que, ao receber `n` , retornam `R(n)` ou `S(n)` , respectivamente. (Observe que R(1) = 1 e S(1) = 2 para evitar erros de "fora por um").
2021-06-15 07:49:18 +00:00
2021-08-09 08:35:35 +00:00
Nenhum valor máximo para `n` deve ser assumido.
2021-06-15 07:49:18 +00:00
2021-08-09 08:35:35 +00:00
**Referências**
2021-06-15 07:49:18 +00:00
< ul >
< li >
2021-08-09 08:35:35 +00:00
< a href = 'https://oeis.org/A005228' target = '_blank' > A005228< / a > e < a href = 'https://oeis.org/A030124' target = '_blank' > A030124< / a > de Sloane.
2021-06-15 07:49:18 +00:00
< / li >
< li >
2021-08-09 08:35:35 +00:00
Wikipédia: < a href = 'https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title = 'wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target = '_blank' > sequências de figura-figura de Hofstadter< / a > .
2021-06-15 07:49:18 +00:00
< / li >
< / ul >
# --hints--
2021-08-09 08:35:35 +00:00
`ffr` deve ser uma função.
2021-06-15 07:49:18 +00:00
```js
assert(typeof ffr === 'function');
```
2021-08-09 08:35:35 +00:00
`ffs` deve ser uma função.
2021-06-15 07:49:18 +00:00
```js
assert(typeof ffs === 'function');
```
2021-08-09 08:35:35 +00:00
`ffr` deve retornar um inteiro.
2021-06-15 07:49:18 +00:00
```js
assert(Number.isInteger(ffr(1)));
```
2021-08-09 08:35:35 +00:00
`ffs` deve retornar um inteiro.
2021-06-15 07:49:18 +00:00
```js
assert(Number.isInteger(ffs(1)));
```
2021-08-09 08:35:35 +00:00
`ffr(10)` deve retornar `69`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffr(ffrParamRes[0][0]), ffrParamRes[0][1]);
```
2021-08-09 08:35:35 +00:00
`ffr(50)` deve retornar `1509`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffr(ffrParamRes[1][0]), ffrParamRes[1][1]);
```
2021-08-09 08:35:35 +00:00
`ffr(100)` deve retornar `5764`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffr(ffrParamRes[2][0]), ffrParamRes[2][1]);
```
2021-08-09 08:35:35 +00:00
`ffr(1000)` deve retornar `526334`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffr(ffrParamRes[3][0]), ffrParamRes[3][1]);
```
2021-08-09 08:35:35 +00:00
`ffs(10)` deve retornar `14`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffs(ffsParamRes[0][0]), ffsParamRes[0][1]);
```
2021-08-09 08:35:35 +00:00
`ffs(50)` deve retornar `59`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffs(ffsParamRes[1][0]), ffsParamRes[1][1]);
```
2021-08-09 08:35:35 +00:00
`ffs(100)` deve retornar `112`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffs(ffsParamRes[2][0]), ffsParamRes[2][1]);
```
2021-08-09 08:35:35 +00:00
`ffs(1000)` deve retornar `1041`
2021-06-15 07:49:18 +00:00
```js
assert.equal(ffs(ffsParamRes[3][0]), ffsParamRes[3][1]);
```
# --seed--
## --after-user-code--
```js
const ffrParamRes = [[10, 69], [50, 1509], [100, 5764], [1000, 526334]];
const ffsParamRes = [[10, 14], [50, 59], [100, 112], [1000, 1041]];
```
## --seed-contents--
```js
function ffr(n) {
return n;
}
function ffs(n) {
return n;
}
```
# --solutions--
```js
const R = [null, 1];
const S = [null, 2];
function extendSequences (n) {
let current = Math.max(R[R.length - 1], S[S.length - 1]);
let i;
while (R.length < = n || S.length < = n) {
i = Math.min(R.length, S.length) - 1;
current += 1;
if (current === R[i] + S[i]) {
R.push(current);
} else {
S.push(current);
}
}
}
function ffr (n) {
extendSequences(n);
return R[n];
}
function ffs (n) {
extendSequences(n);
return S[n];
}
```