feat: enable new langs (#42491)

Enable italian and portuguese

curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md

@@ -0,0 +1,79 @@
+---
+id: 5a23c84252665b21eecc7e82
+title: Greatest common divisor
+challengeType: 5
+forumTopicId: 302277
+dashedName: greatest-common-divisor
+---
+
+# --description--
+
+Write a function that returns the greatest common divisor of two integers.
+
+# --hints--
+
+`gcd` should be a function.
+
+```js
+assert(typeof gcd == 'function');
+```
+
+`gcd(24,36)` should return a number.
+
+```js
+assert(typeof gcd(24, 36) == 'number');
+```
+
+`gcd(24,36)` should return `12`.
+
+```js
+assert.equal(gcd(24, 36), 12);
+```
+
+`gcd(30,48)` should return `6`.
+
+```js
+assert.equal(gcd(30, 48), 6);
+```
+
+`gcd(10,15)` should return `5`.
+
+```js
+assert.equal(gcd(10, 15), 5);
+```
+
+`gcd(100,25)` should return `25`.
+
+```js
+assert.equal(gcd(100, 25), 25);
+```
+
+`gcd(13,250)` should return `1`.
+
+```js
+assert.equal(gcd(13, 250), 1);
+```
+
+`gcd(1300,250)` should return `50`.
+
+```js
+assert.equal(gcd(1300, 250), 50);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gcd(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gcd(a, b) {
+  return b==0 ? Math.abs(a):gcd(b, a % b);
+}
+```