mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-05-13 06:04:13 -04:00
chore(i18n,learn): processed translations (#49471)
This commit is contained in:
@@ -9,7 +9,7 @@ dashedName: comparison-with-the-less-than-operator
|
||||
|
||||
# --description--
|
||||
|
||||
يقارن مشغل آلأصغر من (`<`) بين قيمتين رقمين. إذا كان الرَّقَم إلى اليسار أصغر من الرَّقَم إلى اليمين، فإنه يرجع `true`. خلاف ذلك، فإنه يرجع `false`. وعلى غرار المشغل المعني بالمساواة، يقوم المشغل أقل من بتحويل أنواع البيانات عند مقارنتها.
|
||||
يقارن مشغل الأصغر من (`<`) بين قيم رقمين. إذا كان الرَّقَم إلى اليسار أصغر من الرَّقَم إلى اليمين، فإنه يرجع `true`. خلاف ذلك، فإنه يرجع `false`. وعلى غرار مشغل المساواة، يقوم المشغل أقل من بتحويل أنواع البيانات عند مقارنتها.
|
||||
|
||||
**مثال**
|
||||
|
||||
@@ -23,41 +23,41 @@ dashedName: comparison-with-the-less-than-operator
|
||||
|
||||
# --instructions--
|
||||
|
||||
أضف مشغل أقل من إلى الخطوط المشار إليها بحيث تكون تعبيرات مراجعة منطقية.
|
||||
أضف مشغل أقل من إلى الخطوط المشار إليها بحيث تكون تعبيرات return منطقية.
|
||||
|
||||
# --hints--
|
||||
|
||||
يجب أن ينتج `testLessThan(0)` مقطع `Under 25`
|
||||
يجب أن ينتج `testLessThan(0)` المقطع النصي `Under 25`
|
||||
|
||||
```js
|
||||
assert(testLessThan(0) === 'Under 25');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessThan(24)` مقطع `Under 25`
|
||||
يجب أن ينتج `testLessThan(24)` المقطع النصي `Under 25`
|
||||
|
||||
```js
|
||||
assert(testLessThan(24) === 'Under 25');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessThan(25)` مقطع `Under 55`
|
||||
يجب أن ينتج `testLessThan(25)` المقطع النصي `Under 55`
|
||||
|
||||
```js
|
||||
assert(testLessThan(25) === 'Under 55');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessThan(54)` مقطع `Under 55`
|
||||
يجب أن ينتج `testLessThan(54)` المقطع النصي `Under 55`
|
||||
|
||||
```js
|
||||
assert(testLessThan(54) === 'Under 55');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessThan(55)` مقطع `55 or Over`
|
||||
يجب أن ينتج `testLessThan(55)` المقطع النصي `55 or Over`
|
||||
|
||||
```js
|
||||
assert(testLessThan(55) === '55 or Over');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessThan(99)` مقطع `55 or Over`
|
||||
يجب أن ينتج `testLessThan(99)` المقطع النصي `55 or Over`
|
||||
|
||||
```js
|
||||
assert(testLessThan(99) === '55 or Over');
|
||||
|
||||
@@ -9,7 +9,7 @@ dashedName: comparison-with-the-less-than-or-equal-to-operator
|
||||
|
||||
# --description--
|
||||
|
||||
مشغل اصغر من أو يساوي، (`<=`) يقارن بين قيم رقمين. إذا كان الرَّقَم إلى اليسار أقل من أو يساوي الرَّقَم إلى اليمين، فإنه يعيد `true`. إذا كان الرَّقَم الموجود على اليسار أكبر من الرَّقَم الموجود على اليمين، فإنه يعيد `false`. وعلى غرار المشغل المعني بالمساواة، يحول مشغل اصغر من أو يساوي أنواع البيانات من القيم عند مقارنتها.
|
||||
مشغل اصغر من أو يساوي، (`<=`) يقارن بين قيم رقمين. إذا كان الرَّقَم إلى اليسار أقل من أو يساوي الرَّقَم إلى اليمين، فإنه يعيد `true`. إذا كان الرَّقَم الموجود على اليسار أكبر من الرَّقَم الموجود على اليمين، فإنه يعيد `false`. وعلى غرار مشغل المساواة، يحول مشغل اصغر من أو يساوي أنواع البيانات عند مقارنتها.
|
||||
|
||||
**مثال**
|
||||
|
||||
@@ -23,47 +23,47 @@ dashedName: comparison-with-the-less-than-or-equal-to-operator
|
||||
|
||||
# --instructions--
|
||||
|
||||
أضف مشغل اصغر من أو يساوي إلى السطور المشار إليها بحيث تكون تعبيرات المراجعة منطقية.
|
||||
أضف مشغل اصغر من أو يساوي إلى السطور المشار إليها بحيث تكون تعبيرات return منطقية.
|
||||
|
||||
# --hints--
|
||||
|
||||
يجب أن ينتج `testLessOrEqual(0)` المقطع `Smaller Than or Equal to 12`
|
||||
يجب أن ينتج `testLessOrEqual(0)` المقطع النصي `Smaller Than or Equal to 12`
|
||||
|
||||
```js
|
||||
assert(testLessOrEqual(0) === 'Smaller Than or Equal to 12');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessOrEqual(11)` مقطع `Smaller Than or Equal to 12`
|
||||
يجب أن ينتج `testLessOrEqual(11)` المقطع النصي `Smaller Than or Equal to 12`
|
||||
|
||||
```js
|
||||
assert(testLessOrEqual(11) === 'Smaller Than or Equal to 12');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessOrEqual(12)` مقطع `Smaller Than or Equal to 12`
|
||||
يجب أن ينتج `testLessOrEqual(12)` المقطع النصي `Smaller Than or Equal to 12`
|
||||
|
||||
```js
|
||||
assert(testLessOrEqual(12) === 'Smaller Than or Equal to 12');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessOrEqual(23)` مقطع `Smaller Than or Equal to 24`
|
||||
يجب أن ينتج `testLessOrEqual(23)` المقطع النصي `Smaller Than or Equal to 24`
|
||||
|
||||
```js
|
||||
assert(testLessOrEqual(23) === 'Smaller Than or Equal to 24');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessOrEqual(24)` مقطع `Smaller Than or Equal to 24`
|
||||
يجب أن ينتج `testLessOrEqual(24)` المقطع النصي `Smaller Than or Equal to 24`
|
||||
|
||||
```js
|
||||
assert(testLessOrEqual(24) === 'Smaller Than or Equal to 24');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessOrEqual(25)` مقطع `More Than 24`
|
||||
يجب أن ينتج `testLessOrEqual(25)` المقطع النصي `More Than 24`
|
||||
|
||||
```js
|
||||
assert(testLessOrEqual(25) === 'More Than 24');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLessOrEqual(55)` مقطع `More Than 24`
|
||||
يجب أن ينتج `testLessOrEqual(55)` المقطع النصي `More Than 24`
|
||||
|
||||
```js
|
||||
assert(testLessOrEqual(55) === 'More Than 24');
|
||||
|
||||
@@ -11,7 +11,7 @@ dashedName: comparisons-with-the-logical-and-operator
|
||||
|
||||
ستحتاج أحيانًا إلى اختبار أكثر من شيء في وقت واحد. مشغل <dfn>الإضافة المنطقي</dfn> ورمزه (`&&`) يرجع `true` فقط إذا كان <dfn>المعاملتين</dfn> إلى اليسار واليمين صحيحين.
|
||||
|
||||
ويمكن تحقيق نفس التأثير عن طريق أدخال if statement داخل if أخري:
|
||||
ويمكن تحقيق نفس التأثير عن طريق وضع عبارة if داخل if أخري:
|
||||
|
||||
```js
|
||||
if (num > 5) {
|
||||
@@ -33,7 +33,7 @@ return "No";
|
||||
|
||||
# --instructions--
|
||||
|
||||
استبدل بيانين if إلى if statement واحدة، باستخدام المشغل `&&`، الذي سوف يعيد المقطع `Yes` إذا كان `val` أقل من أو يساوي `50` وأكثر من أو يساوي `25`. خلاف ذلك، سوف يعيد المقطع `No`.
|
||||
استبدل العبارتان if إلى if واحدة، باستخدام المشغل `&&`، الذي سوف يعيد المقطع `Yes` إذا كان `val` أقل من أو يساوي `50` وأكثر من أو يساوي `25`. خلاف ذلك، سوف يعيد المقطع `No`.
|
||||
|
||||
# --hints--
|
||||
|
||||
@@ -43,55 +43,55 @@ return "No";
|
||||
assert(code.match(/&&/g).length === 1);
|
||||
```
|
||||
|
||||
يجب أن يكون لديك بيان `if` واحد فقط
|
||||
يجب أن يكون لديك عبارة `if` واحد فقط
|
||||
|
||||
```js
|
||||
assert(code.match(/if/g).length === 1);
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(0)` مقطع `No`
|
||||
يجب أن ينتج `testLogicalAnd(0)` المقطع النصي `No`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(0) === 'No');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(24)` المقطع `No`
|
||||
يجب أن ينتج `testLogicalAnd(24)` المقطع النصي `No`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(24) === 'No');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(25)` المقطع `Yes`
|
||||
يجب أن ينتج `testLogicalAnd(25)` المقطع النصي `Yes`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(25) === 'Yes');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(30)` المقطع `Yes`
|
||||
يجب أن ينتج `testLogicalAnd(30)` المقطع النصي `Yes`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(30) === 'Yes');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(50)` المقطع `Yes`
|
||||
يجب أن ينتج `testLogicalAnd(50)` المقطع النصي `Yes`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(50) === 'Yes');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(51)` المقطع `No`
|
||||
يجب أن ينتج `testLogicalAnd(51)` المقطع النصي `No`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(51) === 'No');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(75)` المقطع `No`
|
||||
يجب أن ينتج `testLogicalAnd(75)` المقطع النصي `No`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(75) === 'No');
|
||||
```
|
||||
|
||||
يجب أن ينتج `testLogicalAnd(80)` المقطع `No`
|
||||
يجب أن ينتج `testLogicalAnd(80)` المقطع النصي `No`
|
||||
|
||||
```js
|
||||
assert(testLogicalAnd(80) === 'No');
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 56533eb9ac21ba0edf2244d9
|
||||
title: المقارنات باستخدام مشغل إي من المنطقي
|
||||
title: المقارنات باستخدام مشغل إي من (or) المنطقي (||)
|
||||
challengeType: 1
|
||||
videoUrl: 'https://scrimba.com/c/cEPrGTN'
|
||||
forumTopicId: 16800
|
||||
@@ -9,9 +9,9 @@ dashedName: comparisons-with-the-logical-or-operator
|
||||
|
||||
# --description--
|
||||
|
||||
يرجع مشغل <dfn>إي من</dfn> الآتي (`||`) القيمة `true` إذا كان أي من <dfn>المعاملتين</dfn> هما `true`. خلاف ذلك، فإنه يرجع `false`.
|
||||
يرجع مشغل <dfn>إي من</dfn> (logical or) الآتي (`||`) القيمة `true` إذا كان أي من <dfn>المعاملتين</dfn> هما `true`. خلاف ذلك، فإنه يرجع `false`.
|
||||
|
||||
يتكون مشغل <dfn>المعاملات</dfn> من رمزين و هما خطين مستقيمين ألآتيه: (`||`). يمكن العثور على هذا الرمز عادة بين مفاتيح Backspace و Enter.
|
||||
يتكون مشغل <dfn>إي من</dfn> من رمزين و هما خطين مستقيمين كالآتي: (`||`). يمكن العثور على هذا الرمز عادة بين مفاتيح Backspace و Enter.
|
||||
|
||||
يجب أن يبدو النمط أدناه مألوفًا من الدروس السابقة:
|
||||
|
||||
|
||||
@@ -1,20 +1,20 @@
|
||||
---
|
||||
id: 6391d1a4f7ac71efd0621380
|
||||
title: Build a Recipe Page Project
|
||||
title: Construir un proyecto de página de recetas
|
||||
challengeType: 14
|
||||
dashedName: top-build-a-recipe-project
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
The website will consist of a main index page which will have links to a few recipes. The website won’t look very pretty by the time you’ve finished.
|
||||
El sitio web constará de una página de índice principal que tendrá enlaces a algunas recetas. La página web no será muy bonita para cuando haya terminado.
|
||||
|
||||
**User Stories:**
|
||||
**Historias de usuario:**
|
||||
|
||||
1. Your recipe page should contain a `DOCTYPE` tag.
|
||||
1. Your recipe page should include an `html` element with a `head` and `body` element as children.
|
||||
1. You should have a `title` element within the `head` element with the text `The Odin Recipes`.
|
||||
1. You should see an `h1` element that has the text `Creamy Chocolate Fudge`.
|
||||
1. La página de tu receta debe contener una etiqueta `DOCTYPE`.
|
||||
1. Tu página de receta debe incluir un elemento `html` con un elemento `head` y `body` como hijos.
|
||||
1. Debes tener un elemento `title` dentro del elemento `head` con el texto <codeThe Odin Recipes</code>.
|
||||
1. Deberías ver un elemento `h1` que tiene el texto `Creamy Chocolate Fudge`.
|
||||
1. You should see an image with the url `*placeholder-fcc-cdn*` with a fitting `alt` text.
|
||||
1. There should be an `h2` element with the text `Description` under the image.
|
||||
1. You should see a couple of paragraphs under `Description` that describe the recipe.
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f52d1000cf542c510040
|
||||
title: 'Problem 449: Chocolate covered candy'
|
||||
title: 'Problem 449: Mit Schokolade überzogene Süßigkeiten'
|
||||
challengeType: 1
|
||||
forumTopicId: 302121
|
||||
dashedName: problem-449-chocolate-covered-candy
|
||||
@@ -8,19 +8,19 @@ dashedName: problem-449-chocolate-covered-candy
|
||||
|
||||
# --description--
|
||||
|
||||
Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: $b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2$.
|
||||
Phil, der Konditor, stellt eine neue Ladung schokoladenüberzogener Süßigkeiten her. Jedes Herzstück der Süßigkeiten hat die Form eines Ellipsoids, das durch die folgende Gleichung definiert ist: $b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2$.
|
||||
|
||||
Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick.
|
||||
Phil möchte wissen, wie viel Schokolade benötigt wird, um das Herzstück mit einer gleichmäßigen Schokoladenschicht von einem Millimeter Dicke zu überziehen.
|
||||
|
||||
If $a = 1$ mm and $b = 1$ mm, the amount of chocolate required is $\frac{28}{3} \pi$ mm<sup>3</sup>
|
||||
Wenn $a = 1$ mm und $b = 1$ mm ist, beträgt die benötigte Menge an Schokolade $\frac{28}{3} \pi$ mm<sup>3</sup>
|
||||
|
||||
If $a = 2$ mm and $b = 1$ mm, the amount of chocolate required is approximately 60.35475635 mm<sup>3</sup>.
|
||||
Wenn $a = 2$ mm und $b = 1$ mm ist, beträgt die benötigte Schokoladenmenge ungefähr 60,35475635 mm<sup>3</sup>.
|
||||
|
||||
Find the amount of chocolate in mm<sup>3</sup> required if $a = 3$ mm and $b = 1$ mm. Give your answer as the number rounded to 8 decimal places behind the decimal point.
|
||||
Ermittle die Menge an Schokolade in mm<sup>3</sup>, die benötigt wird, wenn $a = 3$ mm und $b = 1$ mm ist. Gib deine Antwort als Zahl an, die auf 8 Dezimalstellen hinter dem Komma gerundet ist.
|
||||
|
||||
# --hints--
|
||||
|
||||
`chocolateCoveredCandy()` should return `103.37870096`.
|
||||
`chocolateCoveredCandy()` sollte `103.37870096` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(chocolateCoveredCandy(), 103.37870096);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f52e1000cf542c510041
|
||||
title: 'Problem 450: Hypocycloid and Lattice points'
|
||||
title: 'Problem 450: Hypozykloide und Gitterpunkte'
|
||||
challengeType: 1
|
||||
forumTopicId: 302123
|
||||
dashedName: problem-450-hypocycloid-and-lattice-points
|
||||
@@ -8,36 +8,36 @@ dashedName: problem-450-hypocycloid-and-lattice-points
|
||||
|
||||
# --description--
|
||||
|
||||
A hypocycloid is the curve drawn by a point on a small circle rolling inside a larger circle. The parametric equations of a hypocycloid centered at the origin, and starting at the right most point is given by:
|
||||
Eine Hypozykloide ist die Kurve, die von einem Punkt auf einem kleinen Kreis gezeichnet wird, der sich innerhalb eines größeren Kreises bewegt. Die Parametergleichungen einer Hypozykloide, die im Ursprung zentriert ist und im äußersten rechten Punkt beginnt, sind gegeben durch:
|
||||
|
||||
$$x(t) = (R - r) \cos(t) + r \cos(\frac{R - r}{r}t)$$
|
||||
|
||||
$$y(t) = (R - r) \sin(t) - r \sin(\frac{R - r}{r} t)$$
|
||||
|
||||
Where $R$ is the radius of the large circle and $r$ the radius of the small circle.
|
||||
Dabei ist $R$ der Radius des großen Kreises und $r$ der Radius des kleinen Kreises.
|
||||
|
||||
Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius $R$ and $r$ and for which there is a corresponding value of $t$ such that $\sin(t)$ and $\cos(t)$ are rational numbers.
|
||||
Lasse $C(R, r)$ die Menge der verschiedenen Punkte mit ganzzahligen Koordinaten auf der Hypozykloide mit Radius $R$ und $r$ sein, für die es einen entsprechenden Wert von $t$ gibt, sodass $\sin(t)$ und $\cos(t)$ rationale Zahlen sind.
|
||||
|
||||
Let $S(R, r) = \sum\_{(x,y) \in C(R, r)} |x| + |y|$ be the sum of the absolute values of the $x$ and $y$ coordinates of the points in $C(R, r)$.
|
||||
Lasse $S(R, r) = \sum\_{(x,y) \in C(R, r)} |x| + |y|$ die Summe der Absolutwerte der $x$ und $y$ Koordinaten der Punkte in $C(R, r)$ sein.
|
||||
|
||||
Let $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloor} S(R, r)$ be the sum of $S(R, r)$ for $R$ and $r$ positive integers, $R\leq N$ and $2r < R$.
|
||||
Lasse $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloor} S(R, r)$ die Summe von $S(R, r)$ für $R$ und $r$ positive ganze Zahlen, $R\leq N$ und $2r < R$ sein.
|
||||
|
||||
You are given:
|
||||
Folgendes ist gegeben:
|
||||
|
||||
$$\begin{align} C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
|
||||
C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
|
||||
|
||||
**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
|
||||
**Hinweis:** (-625, 0) ist kein Element von $C(2500, 1000)$, weil $\sin(t)$ keine rationale Zahl für die entsprechenden Werte von $t$ ist.
|
||||
|
||||
$S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$
|
||||
|
||||
$T(3) = 10$; $T(10) = 524$; $T(100) = 580\\,442$; $T({10}^3) = 583\\,108\\,600$.
|
||||
|
||||
Find $T({10}^6)$.
|
||||
Finde $T({10}^6)$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`hypocycloidAndLatticePoints()` should return `583333163984220900`.
|
||||
`hypocycloidAndLatticePoints()` sollte `583333163984220900` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(hypocycloidAndLatticePoints(), 583333163984220900);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f5311000cf542c510042
|
||||
title: 'Problem 451: Modular inverses'
|
||||
title: 'Problem 451: Modularer Kehrwert'
|
||||
challengeType: 1
|
||||
forumTopicId: 302124
|
||||
dashedName: problem-451-modular-inverses
|
||||
@@ -8,28 +8,28 @@ dashedName: problem-451-modular-inverses
|
||||
|
||||
# --description--
|
||||
|
||||
Consider the number 15.
|
||||
Betrachten wir die Zahl 15.
|
||||
|
||||
There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14.
|
||||
Es gibt acht positive Zahlen kleiner als 15 sind, die zu 15 koprimiert sind: 1, 2, 4, 7, 8, 11, 13, 14.
|
||||
|
||||
The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14 because
|
||||
Der modulare Kehrwert dieser modulen Zahlen 15 sind: 1, 8, 4, 13, 2, 11, 7, 14, denn
|
||||
|
||||
$$\begin{align} & 1 \times 1\bmod 15 = 1 \\\\
|
||||
& 2 \times 8 = 16\bmod 15 = 1 \\\\ & 4 \times 4 = 16\bmod 15 = 1 \\\\
|
||||
& 7 \times 13 = 91\bmod 15 = 1 \\\\ & 11 \times 11 = 121\bmod 15 = 1 \\\\
|
||||
& 14 \times 14 = 196\bmod 15 = 1 \end{align}$$
|
||||
|
||||
Let $I(n)$ be the largest positive number $m$ smaller than $n - 1$ such that the modular inverse of $m$ modulo $n$ equals $m$ itself.
|
||||
Lasse $I(n)$ die größte positive Zahl $m$ kleiner als $n - 1$ sein, sodass der modulare Kehrwert von $m$ modulo $n$ gleich $m$ ist.
|
||||
|
||||
So $I(15) = 11$.
|
||||
Somit ist $I(15) = 11$.
|
||||
|
||||
Also $I(100) = 51$ and $I(7) = 1$.
|
||||
Außerdem $I(100) = 51$ und $I(7) = 1$.
|
||||
|
||||
Find $\sum I(n)$ for $3 ≤ n ≤ 2 \times {10}^7$
|
||||
Finde $\sum l(n)$ für $3 ≤ n ≤ 2 \times {10}^7$
|
||||
|
||||
# --hints--
|
||||
|
||||
`modularInverses()` should return `153651073760956`.
|
||||
`modularInverses()` sollte `153651073760956` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(modularInverses(), 153651073760956);
|
||||
|
||||
@@ -8,17 +8,17 @@ dashedName: problem-452-long-products
|
||||
|
||||
# --description--
|
||||
|
||||
Define $F(m, n)$ as the number of $n$-tuples of positive integers for which the product of the elements doesn't exceed $m$.
|
||||
Definiere $F(m, n)$ als die Anzahl der Variablen $n$ aus positiven Integer, bei denen das Produkt der Elemente $m$ nicht überschreitet.
|
||||
|
||||
$F(10, 10) = 571$.
|
||||
|
||||
$F({10}^6, {10}^6)\bmod 1\\,234\\,567\\,891 = 252\\,903\\,833$.
|
||||
$F({10}^6, {10}^6)\bmod 1\,234\,567\,891 = 252\,903\,833$.
|
||||
|
||||
Find $F({10}^9, {10}^9)\bmod 1\\,234\\,567\\,891$.
|
||||
Finde $F({10}^9, {10}^9)\bmod 1\\,234\\,567\\,891$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`longProducts()` should return `345558983`.
|
||||
`longProducts()` sollte `345558983` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(longProducts(), 345558983);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f5311000cf542c510044
|
||||
title: 'Problem 453: Lattice Quadrilaterals'
|
||||
title: 'Problematik 453: Quadrilaterale Gitter'
|
||||
challengeType: 1
|
||||
forumTopicId: 302126
|
||||
dashedName: problem-453-lattice-quadrilaterals
|
||||
@@ -8,21 +8,21 @@ dashedName: problem-453-lattice-quadrilaterals
|
||||
|
||||
# --description--
|
||||
|
||||
A simple quadrilateral is a polygon that has four distinct vertices, has no straight angles and does not self-intersect.
|
||||
Ein einfaches Viereck ist ein Vieleck, das vier verschiedene Eckpunkte hat, keine geraden Winkel aufweist und sich nicht selbst schneidet.
|
||||
|
||||
Let $Q(m, n)$ be the number of simple quadrilaterals whose vertices are lattice points with coordinates ($x$, $y$) satisfying $0 ≤ x ≤ m$ and $0 ≤ y ≤ n$.
|
||||
Lasse $Q(m, n)$ die Anzahl der einfachen Vierecke sein, deren Eckpunkte Gitterpunkte mit Koordinaten ($x$, $y$) sind, die $0 ≤ x ≤ m$ und $0 ≤ y ≤ n$ erfüllen.
|
||||
|
||||
For example, $Q(2, 2) = 94$ as can be seen below:
|
||||
Zum Beispiel $Q(2, 2) = 94$, wie unten zu sehen ist:
|
||||
|
||||
<img class="img-responsive center-block" alt="94 quadrilaterals whose vertices are lattice points with coordinates (x, y) satiffying 0 ≤ x ≤ m and 0 ≤ y ≤ n" src="https://cdn.freecodecamp.org/curriculum/project-euler/lattice-quadrilaterals.png" style="background-color: white; padding: 10px;" />
|
||||
<img class="img-responsive center-block" alt="94 Vierecke, deren Eckpunkte Gitterpunkte mit Koordinaten (x, y) sind, die 0 ≤ x ≤ m und 0 ≤ y ≤ n genügen" src="https://cdn.freecodecamp.org/curriculum/project-euler/lattice-quadrilaterals.png" style="background-color: white; padding: 10px;" />
|
||||
|
||||
It can also be verified that $Q(3, 7) = 39\\,590$, $Q(12, 3) = 309\\,000$ and $Q(123, 45) = 70\\,542\\,215\\,894\\,646$.
|
||||
Es lässt sich auch nachweisen, dass $Q(3, 7) = 39\\,590$, $Q(12, 3) = 309\\,000$ und $Q(123, 45) = 70\\,542\\,215\\,894\\,646$.
|
||||
|
||||
Find $Q(12\\,345, 6\\,789)\bmod 135\\,707\\,531$.
|
||||
Finde $Q(12\\,345, 6\\,789)\bmod 135\\,707\\,531$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`latticeQuadrilaterals()` should return `104354107`.
|
||||
`latticeQuadrilaterals()` sollte `104354107` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(latticeQuadrilaterals(), 104354107);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f5331000cf542c510045
|
||||
title: 'Problem 454: Diophantine reciprocals III'
|
||||
title: 'Problematik 454: Diophantische Kehrwerte III'
|
||||
challengeType: 1
|
||||
forumTopicId: 302127
|
||||
dashedName: problem-454-diophantine-reciprocals-iii
|
||||
@@ -8,19 +8,19 @@ dashedName: problem-454-diophantine-reciprocals-iii
|
||||
|
||||
# --description--
|
||||
|
||||
In the following equation $x$, $y$, and $n$ are positive integers.
|
||||
In der folgenden Gleichung $x$, $y$, und $n$ gibt es positive Integer.
|
||||
|
||||
$$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
|
||||
|
||||
For a limit $L$ we define $F(L)$ as the number of solutions which satisfy $x < y ≤ L$.
|
||||
Für einen Grenzwert $L$ definieren wir $F(L)$ als die Anzahl der Lösungen, die $x < y ≤ L$ erfüllen.
|
||||
|
||||
We can verify that $F(15) = 4$ and $F(1000) = 1069$.
|
||||
Wir können überprüfen, dass $F(15) = 4$ und $F(1000) = 1069$.
|
||||
|
||||
Find $F({10}^{12})$.
|
||||
Finde $F({10}^{12})$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`diophantineReciprocalsThree()` should return `5435004633092`.
|
||||
`diophantineReciprocalsThree()` sollte `5435004633092` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(diophantineReciprocalsThree(), 5435004633092);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f5331000cf542c510046
|
||||
title: 'Problem 455: Powers With Trailing Digits'
|
||||
title: 'Problem 455: Potenzen mit nachgestellten Ziffern'
|
||||
challengeType: 1
|
||||
forumTopicId: 302129
|
||||
dashedName: problem-455-powers-with-trailing-digits
|
||||
@@ -8,19 +8,19 @@ dashedName: problem-455-powers-with-trailing-digits
|
||||
|
||||
# --description--
|
||||
|
||||
Let $f(n)$ be the largest positive integer $x$ less than ${10}^9$ such that the last 9 digits of $n^x$ form the number $x$ (including leading zeros), or zero if no such integer exists.
|
||||
Lasse $f(n)$ die größte positive ganze Zahl $x$ kleiner als ${10}^9$ sein, so dass die letzten 9 Ziffern von $n^x$ die Zahl $x$ (einschließlich führender Nullen) bilden, oder Null, wenn es keine solche ganze Zahl gibt.
|
||||
|
||||
For example:
|
||||
Zum Beispiel:
|
||||
|
||||
$$\begin{align} & f(4) = 411\\,728\\,896 (4^{411\\,728\\,896} = ...490\underline{411728896}) \\\\
|
||||
& f(10) = 0 \\\\ & f(157) = 743\\,757 (157^{743\\,757} = ...567\underline{000743757}) \\\\
|
||||
& Σf(n), 2 ≤ n ≤ 103 = 442\\,530\\,011\\,399 \end{align}$$
|
||||
|
||||
Find $\sum f(n)$, $2 ≤ n ≤ {10}^6$.
|
||||
Finde $\summe f(n)$, $2 ≤ n ≤ {10}^6$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`powersWithTrailingDigits()` should return `450186511399999`.
|
||||
`powersWithTrailingDigits()` sollte `450186511399999` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(powersWithTrailingDigits(), 450186511399999);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f5351000cf542c510047
|
||||
title: 'Problem 456: Triangles containing the origin II'
|
||||
title: 'Problem 456: Dreiecke, die den Ursprung enthalten II'
|
||||
challengeType: 1
|
||||
forumTopicId: 302130
|
||||
dashedName: problem-456-triangles-containing-the-origin-ii
|
||||
@@ -8,25 +8,25 @@ dashedName: problem-456-triangles-containing-the-origin-ii
|
||||
|
||||
# --description--
|
||||
|
||||
Define:
|
||||
Definiere:
|
||||
|
||||
$$\begin{align} & x_n = ({1248}^n\bmod 32323) - 16161 \\\\
|
||||
& y_n = ({8421}^n\bmod 30103) - 15051 \\\\ & P_n = \\{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\\} \end{align}$$
|
||||
|
||||
For example, $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$
|
||||
Beispielsweise: $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$
|
||||
|
||||
Let $C(n)$ be the number of triangles whose vertices are in $P_n$ which contain the origin in the interior.
|
||||
Lasse $C(n)$ die Anzahl der Dreiecke, deren Scheitelpunkte in $P_n$ liegen und die den Ursprung im Inneren enthalten, sein.
|
||||
|
||||
Examples:
|
||||
Beispiele:
|
||||
|
||||
$$\begin{align} & C(8) = 20 \\\\
|
||||
& C(600) = 8\\,950\\,634 \\\\ & C(40\\,000) = 2\\,666\\,610\\,948\\,988 \end{align}$$
|
||||
|
||||
Find $C(2\\,000\\,000)$.
|
||||
Finde $C(2\\,000\\,000)$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`trianglesContainingOriginTwo()` should return `333333208685971500`.
|
||||
`trianglesContainingOriginTwo()` sollte `333333208685971500` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(trianglesContainingOriginTwo(), 333333208685971500);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f5361000cf542c510048
|
||||
title: 'Problem 457: A polynomial modulo the square of a prime'
|
||||
title: 'Problem 457: Ein Polynom modulo des Quadrats einer Primzahl'
|
||||
challengeType: 1
|
||||
forumTopicId: 302131
|
||||
dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
|
||||
@@ -8,19 +8,19 @@ dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
|
||||
|
||||
# --description--
|
||||
|
||||
Let $f(n) = n^2 - 3n - 1$.
|
||||
Lasse $f(n) = n^2 - 3n - 1$ sein.
|
||||
|
||||
Let $p$ be a prime.
|
||||
Lasse $p$ eine Primzahl sein.
|
||||
|
||||
Let $R(p)$ be the smallest positive integer $n$ such that $f(n)\bmod p^2 = 0$ if such an integer $n$ exists, otherwise $R(p) = 0$.
|
||||
Lasse $R(p)$ die kleinste positive ganze Zahl $n$ sein, so dass $f(n)\bmod p^2 = 0$ ist, wenn ein solcher Integer $n$ existiert, andernfalls $R(p) = 0$.
|
||||
|
||||
Let $SR(L)$ be $\sum R(p)$ for all primes not exceeding $L$.
|
||||
Lasse $SR(L)$ $\sum R(p)$ für alle Primzahlen sein, die $L$ nicht übersteigen.
|
||||
|
||||
Find $SR({10}^7)$.
|
||||
Finde $SR({10}^7)$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`polynomialModuloSquareOfPrime()` should return `2647787126797397000`.
|
||||
`polynomialModuloSquareOfPrime()` sollte `2647787126797397000` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(polynomialModuloSquareOfPrime(), 2647787126797397000);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5900f5361000cf542c510049
|
||||
title: 'Problem 458: Permutations of Project'
|
||||
title: 'Problem 458: Permutationen des Projekts'
|
||||
challengeType: 1
|
||||
forumTopicId: 302132
|
||||
dashedName: problem-458-permutations-of-project
|
||||
@@ -8,17 +8,17 @@ dashedName: problem-458-permutations-of-project
|
||||
|
||||
# --description--
|
||||
|
||||
Consider the alphabet $A$ made out of the letters of the word `project`: $A = \\{c, e, j, o, p, r, t\\}$.
|
||||
Betrachte das Alphabet $A$, das aus den Buchstaben des Wortes `project` besteht: $A = \\{c, e, j, o, p, r, t\\}$.
|
||||
|
||||
Let $T(n)$ be the number of strings of length $n$ consisting of letters from $A$ that do not have a substring that is one of the 5040 permutations of `project`.
|
||||
Lasse $T(n)$ die Anzahl der Strings der Länge $n$ sein, die aus Buchstaben von $A$ bestehen, die keinen Unterstring haben, die eine der 5040 Permutationen von `project` ist.
|
||||
|
||||
$T(7) = 7^7 - 7! = 818\\,503$.
|
||||
|
||||
Find $T({10}^{12})$. Give the last 9 digits of your answer.
|
||||
Finde $T({10}^{12})$. Gebe die letzten 9 Ziffern deiner Antwort an.
|
||||
|
||||
# --hints--
|
||||
|
||||
`permutationsOfProject()` should return `423341841`.
|
||||
`permutationsOfProject()` sollte `423341841` zurückgeben.
|
||||
|
||||
```js
|
||||
assert.strictEqual(permutationsOfProject(), 423341841);
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145ed1f22caab087630aaad
|
||||
title: Step 34
|
||||
title: Schritt 34
|
||||
challengeType: 0
|
||||
dashedName: step-34
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f02240ff8f09f7ec913c
|
||||
title: Step 36
|
||||
title: Schritt 36
|
||||
challengeType: 0
|
||||
dashedName: step-36
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f14f019a4b0adb94b051
|
||||
title: Step 37
|
||||
title: Schritt 37
|
||||
challengeType: 0
|
||||
dashedName: step-37
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f685797bd30df9784e8c
|
||||
title: Step 41
|
||||
title: Schritt 41
|
||||
challengeType: 0
|
||||
dashedName: step-41
|
||||
---
|
||||
@@ -35,7 +35,7 @@ You should give the submit a `type` of `submit`.
|
||||
assert.exists(document.querySelector('button[type="submit"]') || document.querySelector('form > input[type="submit"]'));
|
||||
```
|
||||
|
||||
The submit should display the text `Send`.
|
||||
Das Absenden sollte den Text `Send` anzeigen.
|
||||
|
||||
```js
|
||||
assert.equal(document.querySelector('button[type="submit"]')?.textContent ?? document.querySelector('input[type="submit"]')?.value, 'Send');
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f829ac6a920ebf5797d7
|
||||
title: Step 42
|
||||
title: Schritt 42
|
||||
challengeType: 0
|
||||
dashedName: step-42
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f8f8bcd4370f6509078e
|
||||
title: Step 43
|
||||
title: Schritt 43
|
||||
challengeType: 0
|
||||
dashedName: step-43
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145fb5018cb5b100cb2a88c
|
||||
title: Step 44
|
||||
title: Schritt 44
|
||||
challengeType: 0
|
||||
dashedName: step-44
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145fc3707fc3310c277f5c8
|
||||
title: Step 45
|
||||
title: Schritt 45
|
||||
challengeType: 0
|
||||
dashedName: step-45
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614796cb8086be482d60e0ac
|
||||
title: Step 46
|
||||
title: Schritt 46
|
||||
challengeType: 0
|
||||
dashedName: step-46
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6147a14ef5668b5881ef2297
|
||||
title: Step 47
|
||||
title: Schritt 47
|
||||
challengeType: 0
|
||||
dashedName: step-47
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614878f7a412310647873015
|
||||
title: Step 48
|
||||
title: Schritt 48
|
||||
challengeType: 0
|
||||
dashedName: step-48
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61487b77d4a37707073a64e5
|
||||
title: Step 49
|
||||
title: Schritt 49
|
||||
challengeType: 0
|
||||
dashedName: step-49
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61487da611a65307e78d2c20
|
||||
title: Step 50
|
||||
title: Schritt 50
|
||||
challengeType: 0
|
||||
dashedName: step-50
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61487f703571b60899055cf9
|
||||
title: Step 51
|
||||
title: Schritt 51
|
||||
challengeType: 0
|
||||
dashedName: step-51
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614880dc16070e093e29bc56
|
||||
title: Step 52
|
||||
title: Schritt 52
|
||||
challengeType: 0
|
||||
dashedName: step-52
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614883b6fa720e09fb167de9
|
||||
title: Step 53
|
||||
title: Schritt 53
|
||||
challengeType: 0
|
||||
dashedName: step-53
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614884c1f5d6f30ab3d78cde
|
||||
title: Step 54
|
||||
title: Schritt 54
|
||||
challengeType: 0
|
||||
dashedName: step-54
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61488ecfd05e290b5712e6da
|
||||
title: Step 55
|
||||
title: Schritt 55
|
||||
challengeType: 0
|
||||
dashedName: step-55
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148d99cdc7acd0c519862cb
|
||||
title: Step 56
|
||||
title: Schritt 56
|
||||
challengeType: 0
|
||||
dashedName: step-56
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148da157cc0bd0d06df5c0a
|
||||
title: Step 57
|
||||
title: Schritt 57
|
||||
challengeType: 0
|
||||
dashedName: step-57
|
||||
---
|
||||
@@ -9,7 +9,7 @@ dashedName: step-57
|
||||
|
||||
To align the input boxes with each other, create a new ruleset that targets all `input` and `label` elements within an `.info` element and set the `display` property to `inline-block`.
|
||||
|
||||
Also, align the `label` element's text to the right.
|
||||
Richte außerdem den Text des `label`-Elements nach rechts aus.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148dc095264000dce348bf5
|
||||
title: Step 58
|
||||
title: Schritt 58
|
||||
challengeType: 0
|
||||
dashedName: step-58
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148dcaaf2e8750e6cb4501a
|
||||
title: Step 59
|
||||
title: Schritt 59
|
||||
challengeType: 0
|
||||
dashedName: step-59
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148dd31d210990f0fb140f8
|
||||
title: Step 60
|
||||
title: Schritt 60
|
||||
challengeType: 0
|
||||
dashedName: step-60
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148defa9c01520fb9d178a0
|
||||
title: Step 61
|
||||
title: Schritt 61
|
||||
challengeType: 0
|
||||
dashedName: step-61
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e0bcc13efd10f7d7a6a9
|
||||
title: Step 63
|
||||
title: Schritt 63
|
||||
challengeType: 0
|
||||
dashedName: step-63
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e161ecec9511941f8833
|
||||
title: Step 64
|
||||
title: Schritt 64
|
||||
challengeType: 0
|
||||
dashedName: step-64
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e28706b34912340fd042
|
||||
title: Step 65
|
||||
title: Schritt 65
|
||||
challengeType: 0
|
||||
dashedName: step-65
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e335c1edd512d00e4691
|
||||
title: Step 66
|
||||
title: Schritt 66
|
||||
challengeType: 0
|
||||
dashedName: step-66
|
||||
---
|
||||
|
||||
@@ -1,13 +1,13 @@
|
||||
---
|
||||
id: 6148e41c728f65138addf9cc
|
||||
title: Step 67
|
||||
title: Schritt 67
|
||||
challengeType: 0
|
||||
dashedName: step-67
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
Certain types of motion-based animations can cause discomfort for some users. In particular, people with <dfn>vestibular</dfn> disorders have sensitivity to certain motion triggers.
|
||||
Bestimmte Arten von bewegungsbasierten Animationen können einigen Benutzern Unbehagen bereiten. In particular, people with <dfn>vestibular</dfn> disorders have sensitivity to certain motion triggers.
|
||||
|
||||
The `@media` at-rule has a media feature called `prefers-reduced-motion` to set CSS based on the user's preferences. It can take one of the following values:
|
||||
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e5aeb102e3142de026a2
|
||||
title: Step 68
|
||||
title: Schritt 68
|
||||
challengeType: 0
|
||||
dashedName: step-68
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6351e7a8684bf5377c4ee7f7
|
||||
title: Step 31
|
||||
title: Schritt 31
|
||||
challengeType: 0
|
||||
dashedName: step-31
|
||||
---
|
||||
@@ -39,7 +39,7 @@ const htmlFor = document.querySelectorAll('ul.answers-list > li > label')?.[1]?.
|
||||
assert.equal(htmlFor, document.querySelectorAll('ul.answers-list > li > label > input')?.[1]?.id);
|
||||
```
|
||||
|
||||
You should give the third `label` a `for` attribute.
|
||||
Du solltest dem dritten `label` ein `for`-Attribut geben.
|
||||
|
||||
```js
|
||||
assert.notEmpty(document.querySelectorAll('ul.answers-list > li > label')?.[2]?.htmlFor);
|
||||
|
||||
@@ -7,7 +7,7 @@ dashedName: step-6
|
||||
|
||||
# --description--
|
||||
|
||||
The name of the cafe is `CAMPER CAFE`. Add an `h1` element within your `main` element. Give it the name of the cafe in capitalized letters to make it stand out.
|
||||
The name of the cafe is `CAMPER CAFE`. Add an `h1` element within your `main` element. Gib den Namen des Cafés in Großbuchstaben an, um ihn hervorzuheben.
|
||||
|
||||
# --hints--
|
||||
|
||||
@@ -17,13 +17,13 @@ You should have an opening `<h1>` tag.
|
||||
assert(code.match(/<h1>/i));
|
||||
```
|
||||
|
||||
You should have a closing `</h1>` tag.
|
||||
Du solltest ein schließendes `</h1>`-Tag haben.
|
||||
|
||||
```js
|
||||
assert(code.match(/<\/h1>/i));
|
||||
```
|
||||
|
||||
You should not change your existing `main` element.
|
||||
Du solltest dein bestehendes `main`-Element nicht ändern.
|
||||
|
||||
```js
|
||||
assert($('main').length === 1);
|
||||
@@ -35,7 +35,7 @@ Your `h1` element should be nested in your `main` element.
|
||||
assert($('h1')[0].parentElement.tagName === "MAIN");
|
||||
```
|
||||
|
||||
Your `h1` element should have the text `CAMPER CAFE`.
|
||||
Dein `h1`-Element sollte den Text `CAMPER CAFE` enthalten.
|
||||
|
||||
```js
|
||||
assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f344f9c805cd193c33d829c
|
||||
title: Step 11
|
||||
title: Schritt 11
|
||||
challengeType: 0
|
||||
dashedName: step-11
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f344fad8bf01691e71a30eb
|
||||
title: Step 10
|
||||
title: Schritt 10
|
||||
challengeType: 0
|
||||
dashedName: step-10
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f344fbc22624a2976425065
|
||||
title: Step 9
|
||||
title: Schritt 9
|
||||
challengeType: 0
|
||||
dashedName: step-9
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f344fc1520b6719f2e35605
|
||||
title: Step 8
|
||||
title: Schritt 8
|
||||
challengeType: 0
|
||||
dashedName: step-8
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3477ae34c1239cafe128be
|
||||
title: Step 13
|
||||
title: Schritt 13
|
||||
challengeType: 0
|
||||
dashedName: step-13
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3477ae8466a9a3d2cc953c
|
||||
title: Step 15
|
||||
title: Schritt 15
|
||||
challengeType: 0
|
||||
dashedName: step-15
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3477ae9675db8bb7655b30
|
||||
title: Step 12
|
||||
title: Schritt 12
|
||||
challengeType: 0
|
||||
dashedName: step-12
|
||||
---
|
||||
@@ -18,21 +18,21 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
|
||||
assert(hasH1);
|
||||
```
|
||||
|
||||
You should not add a new `style` tag. Add the new CSS rules to the existing `style` tag.
|
||||
Du solltest kein neues `style`-Tag hinzufügen. Add the new CSS rules to the existing `style` tag.
|
||||
|
||||
```js
|
||||
const hasManyStyleTags = document.querySelectorAll('style').length > 1;
|
||||
assert(!hasManyStyleTags);
|
||||
```
|
||||
|
||||
You should add a new `h2` selector.
|
||||
Du solltest einen neuen `h2`-Selektor hinzufügen.
|
||||
|
||||
```js
|
||||
const hasH2 = new __helpers.CSSHelp(document).getStyle('h2');
|
||||
assert(hasH2);
|
||||
```
|
||||
|
||||
You should add a new `p` selector.
|
||||
Du solltest einen neuen `p`-Selektor hinzufügen.
|
||||
|
||||
```js
|
||||
const hasP = new __helpers.CSSHelp(document).getStyle('p');
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3477aefa51bfc29327200b
|
||||
title: Step 14
|
||||
title: Schritt 14
|
||||
challengeType: 0
|
||||
dashedName: step-14
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3477cb2e27333b1ab2b955
|
||||
title: Step 16
|
||||
title: Schritt 16
|
||||
challengeType: 0
|
||||
dashedName: step-16
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3477cb303c5cb61b43aa9b
|
||||
title: Step 18
|
||||
title: Schritt 18
|
||||
challengeType: 0
|
||||
dashedName: step-18
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3477cbcb6ba47918c1da92
|
||||
title: Step 17
|
||||
title: Schritt 17
|
||||
challengeType: 0
|
||||
dashedName: step-17
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f34a1fd611d003edeafd681
|
||||
title: Step 19
|
||||
title: Schritt 19
|
||||
challengeType: 0
|
||||
dashedName: step-19
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f356ed60a5decd94ab66986
|
||||
title: Step 22
|
||||
title: Schritt 22
|
||||
challengeType: 0
|
||||
removeComments: false
|
||||
dashedName: step-22
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f356ed6199b0cdef1d2be8f
|
||||
title: Step 26
|
||||
title: Schritt 26
|
||||
challengeType: 0
|
||||
dashedName: step-26
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f356ed63c7807a4f1e6d054
|
||||
title: Step 21
|
||||
title: Schritt 21
|
||||
challengeType: 0
|
||||
dashedName: step-21
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f356ed63e0fa262326eef05
|
||||
title: Step 23
|
||||
title: Schritt 23
|
||||
challengeType: 0
|
||||
dashedName: step-23
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f356ed656a336993abd9f7c
|
||||
title: Step 25
|
||||
title: Schritt 25
|
||||
challengeType: 0
|
||||
dashedName: step-25
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f356ed69db0a491745e2bb6
|
||||
title: Step 27
|
||||
title: Schritt 27
|
||||
challengeType: 0
|
||||
dashedName: step-27
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f356ed6cf6eab5f15f5cfe6
|
||||
title: Step 20
|
||||
title: Schritt 20
|
||||
challengeType: 0
|
||||
dashedName: step-20
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f35e5c4321f818cdc4bed30
|
||||
title: Step 29
|
||||
title: Schritt 29
|
||||
challengeType: 0
|
||||
dashedName: step-29
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f35e5c44359872a137bd98f
|
||||
title: Step 28
|
||||
title: Schritt 28
|
||||
challengeType: 0
|
||||
dashedName: step-28
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3c866d0fc037f7311b4ac8
|
||||
title: Step 38
|
||||
title: Schritt 38
|
||||
challengeType: 0
|
||||
dashedName: step-38
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3c866d28d7ad0de6470505
|
||||
title: Step 32
|
||||
title: Schritt 32
|
||||
challengeType: 0
|
||||
dashedName: step-32
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3c866d5414453fc2d7b480
|
||||
title: Step 31
|
||||
title: Schritt 31
|
||||
challengeType: 0
|
||||
dashedName: step-31
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3c866daec9a49519871816
|
||||
title: Step 30
|
||||
title: Schritt 30
|
||||
challengeType: 0
|
||||
dashedName: step-30
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3c866dbf362f99b9a0c6d0
|
||||
title: Step 37
|
||||
title: Schritt 37
|
||||
challengeType: 0
|
||||
dashedName: step-37
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3c866dd0d0275f01d4d847
|
||||
title: Step 39
|
||||
title: Schritt 39
|
||||
challengeType: 0
|
||||
dashedName: step-39
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3c866de7a5b784048f94b1
|
||||
title: Step 36
|
||||
title: Schritt 36
|
||||
challengeType: 0
|
||||
dashedName: step-36
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3cade94c6576e7f7b7953f
|
||||
title: Step 41
|
||||
title: Schritt 41
|
||||
challengeType: 0
|
||||
dashedName: step-41
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3cade9993019e26313fa8e
|
||||
title: Step 42
|
||||
title: Schritt 42
|
||||
challengeType: 0
|
||||
dashedName: step-42
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3cade99dda4e6071a85dfd
|
||||
title: Step 46
|
||||
title: Schritt 46
|
||||
challengeType: 0
|
||||
dashedName: step-46
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3cade9fa77275d9f4efe62
|
||||
title: Step 40
|
||||
title: Schritt 40
|
||||
challengeType: 0
|
||||
dashedName: step-40
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e01f288a026d709587
|
||||
title: Step 66
|
||||
title: Schritt 66
|
||||
challengeType: 0
|
||||
dashedName: step-66
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e03d719d5ac4738993
|
||||
title: Step 56
|
||||
title: Schritt 56
|
||||
challengeType: 0
|
||||
dashedName: step-56
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e04559b939080db057
|
||||
title: Step 55
|
||||
title: Schritt 55
|
||||
challengeType: 0
|
||||
dashedName: step-55
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e050279c7a4a7101d3
|
||||
title: Step 54
|
||||
title: Schritt 54
|
||||
challengeType: 0
|
||||
dashedName: step-54
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e056bdde6ae6892ba2
|
||||
title: Step 58
|
||||
title: Schritt 58
|
||||
challengeType: 0
|
||||
dashedName: step-58
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e06d34faac0447fc44
|
||||
title: Step 60
|
||||
title: Schritt 60
|
||||
challengeType: 0
|
||||
dashedName: step-60
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e07276f782bb46b93d
|
||||
title: Step 63
|
||||
title: Schritt 63
|
||||
challengeType: 0
|
||||
dashedName: step-63
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e0819d4f23ca7285e6
|
||||
title: Step 48
|
||||
title: Schritt 48
|
||||
challengeType: 0
|
||||
dashedName: step-48
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e087d56ed3ffdc36be
|
||||
title: Step 61
|
||||
title: Schritt 61
|
||||
challengeType: 0
|
||||
dashedName: step-61
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e0e9629bad967cd71e
|
||||
title: Step 59
|
||||
title: Schritt 59
|
||||
challengeType: 0
|
||||
dashedName: step-59
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e0eaa7da26e3d34d78
|
||||
title: Step 53
|
||||
title: Schritt 53
|
||||
challengeType: 0
|
||||
dashedName: step-53
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3ef6e0f8c230bdd2349716
|
||||
title: Step 62
|
||||
title: Schritt 62
|
||||
challengeType: 0
|
||||
dashedName: step-62
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f3f26fa39591db45e5cd7a0
|
||||
title: Step 67
|
||||
title: Schritt 67
|
||||
challengeType: 0
|
||||
dashedName: step-67
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f459225127805351a6ad057
|
||||
title: Step 68
|
||||
title: Schritt 68
|
||||
challengeType: 0
|
||||
dashedName: step-68
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f459a7ceb8b5c446656d88b
|
||||
title: Step 69
|
||||
title: Schritt 69
|
||||
challengeType: 0
|
||||
dashedName: step-69
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f459cf202c2a3472fae6a9f
|
||||
title: Step 70
|
||||
title: Schritt 70
|
||||
challengeType: 0
|
||||
dashedName: step-70
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f459fd48bdc98491ca6d1a3
|
||||
title: Step 71
|
||||
title: Schritt 71
|
||||
challengeType: 0
|
||||
dashedName: step-71
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f45a05977e2fa49d9119437
|
||||
title: Step 72
|
||||
title: Schritt 72
|
||||
challengeType: 0
|
||||
dashedName: step-72
|
||||
---
|
||||
|
||||
@@ -1,13 +1,13 @@
|
||||
---
|
||||
id: 5f45a5a7c49a8251f0bdb527
|
||||
title: Step 74
|
||||
title: Schritt 74
|
||||
challengeType: 0
|
||||
dashedName: step-74
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
Verwende den gleichen Stil-Selektor wie im vorherigen Schritt, um die Schriftgröße der Artikel und Preise zu vergrößern, indem du einen Wert von `18px` verwendest.
|
||||
Using the same style selector in the previous step, make the font size of the items and prices larger by using a value of `18px`.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f45a66d4a2b0453301e5a26
|
||||
title: Step 78
|
||||
title: Schritt 78
|
||||
challengeType: 0
|
||||
dashedName: step-78
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 5f45b0731d39e15d54df4dfc
|
||||
title: Step 79
|
||||
title: Schritt 79
|
||||
challengeType: 0
|
||||
dashedName: step-79
|
||||
---
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user