gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i18n,curriculum): update translations (#43140)

Browse Source
This commit is contained in:
camperbot
2021-08-09 17:35:35 +09:00
committed by GitHub
parent dd5d2919be
commit 919728131e
64 changed files with 852 additions and 844 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
View File

@ -1,6 +1,6 @@
---
id: 5a23c84252665b21eecc7e82
title: Greatest common divisor
title: Máximo divisor comum
challengeType: 5
forumTopicId: 302277
dashedName: greatest-common-divisor
@ -8,53 +8,53 @@ dashedName: greatest-common-divisor
# --description--
Write a function that returns the greatest common divisor of two integers.
Escreva uma função que retorne o máximo divisor comum de dois inteiros.
# --hints--
`gcd` should be a function.
`gcd` deve ser uma função.
```js
assert(typeof gcd == 'function');
```
`gcd(24,36)` should return a number.
`gcd(24,36)` deve retornar um número.
```js
assert(typeof gcd(24, 36) == 'number');
```
`gcd(24,36)` should return `12`.
`gcd(24,36)` deve retornar `12`.
```js
assert.equal(gcd(24, 36), 12);
```
`gcd(30,48)` should return `6`.
`gcd(30,48)` deve retornar `6`.
```js
assert.equal(gcd(30, 48), 6);
```
`gcd(10,15)` should return `5`.
`gcd(10,15)` deve retornar `5`.
```js
assert.equal(gcd(10, 15), 5);
```
`gcd(100,25)` should return `25`.
`gcd(100,25)` deve retornar `25`.
```js
assert.equal(gcd(100, 25), 25);
```
`gcd(13,250)` should return `1`.
`gcd(13,250)` deve retornar `1`.
```js
assert.equal(gcd(13, 250), 1);
```
`gcd(1300,250)` should return `50`.
`gcd(1300,250)` deve retornar `50`.
```js
assert.equal(gcd(1300, 250), 50);