chore(i18n,learn): processed translations (#45165)

This commit is contained in:
camperbot
2022-02-19 12:56:08 +05:30
committed by GitHub
parent 8138a07d52
commit ba14990876
134 changed files with 1540 additions and 1511 deletions

View File

@@ -1,6 +1,6 @@
---
id: 5900f38b1000cf542c50fe9e
title: 'Problem 31: Coin sums'
title: 'Problema 31: somme di monete'
challengeType: 5
forumTopicId: 301965
dashedName: problem-31-coin-sums
@@ -8,43 +8,43 @@ dashedName: problem-31-coin-sums
# --description--
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
In Inghilterra la moneta è composta da sterline, £, e pence, p, e ci sono 8 monete in circolazione:
<div style='margin-left: 4em;'>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).</div>
<div style='margin-left: 4em;'>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) e £2 (200p).</div>
It is possible to make £2 in the following way:
È possibile comporre 2 £ nel modo seguente:
<div style='margin-left: 4em;'>1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p</div>
How many different ways can `n` pence be made using any number of coins?
In quanti modi diversi si possono ottenere `n` pence usando qualsiasi numero di monete?
# --hints--
`coinSums(50)` should return a number.
`coinSums(50)` dovrebbe restituire un numero.
```js
assert(typeof coinSums(50) === 'number');
```
`coinSums(50)` should return 451.
`coinSums(50)` dovrebbe restituire 451.
```js
assert(coinSums(50) == 451);
```
`coinSums(100)` should return 4563.
`coinSums(100)` dovrebbe restituire 4563.
```js
assert(coinSums(100) == 4563);
```
`coinSums(150)` should return 21873.
`coinSums(150)` dovrebbe restituire 21873.
```js
assert(coinSums(150) == 21873);
```
`coinSums(200)` should return 73682.
`coinSums(200)` dovrebbe restituire 73682.
```js
assert(coinSums(200) == 73682);