Alle Herausforderungen
Mittel 1 gelöst 100.0% Erfolgsquote

Exact Fraction Arithmetic

Perform fraction operations and return a reduced fraction.

Das lernst du

  • Add, subtract, multiply and divide fractions
  • Reduce results with the GCD
  • Normalize signs and zero

Problem

Übersetzung anzeigen

Represent a fraction as [numerator, denominator]. Apply operation to first and second: add, subtract, multiply, or divide. For absolute, use only first. For power, raise first to the integer exponent and ignore second. Return lowest terms with a positive denominator. Normalize zero to [0, 1]. All divisions and negative powers in valid inputs are defined.

Implement rational_arithmetic(operation, first, second, exponent).

Input

operation: The operation name.

first: Two integers representing the first fraction.

second: Two integers representing the second fraction; use [0, 1] when unused.

exponent: The exponent for power; use 0 for other operations.

Output

Return [numerator, denominator] in reduced form with a positive denominator.

Einschränkungen

operation is add, subtract, multiply, divide, absolute, or power. Both fraction components have magnitude at most 100; denominators are nonzero. −6 ≤ exponent ≤ 6. For divide, second has nonzero numerator. For a negative power, first has nonzero numerator. The 0th power is [1, 1], including 0⁰ by this task’s convention. Values fit signed 64-bit.

Beispiele

Beispiel 1
Eingabe:
operation = "add"
first = [1, 6]
second = [1, 4]
exponent = 0

Erwartete Ausgabe:
expected = [5, 12]
Eingabe:
std::string operation = "add";
std::vector<long long> first = {1, 6};
std::vector<long long> second = {1, 4};
long long exponent = 0;

Erwartete Ausgabe:
std::vector<long long> expected = {5, 12};
Eingabe:
string operation = "add";
long[] first = new long[] {1, 6};
long[] second = new long[] {1, 4};
long exponent = 0;

Erwartete Ausgabe:
long[] expected = new long[] {5, 12};

Erläuterung

1/6 + 1/4 = 2/12 + 3/12 = 5/12, already reduced.

Beispiel 2
Eingabe:
operation = "power"
first = [2, 3]
second = [0, 1]
exponent = -2

Erwartete Ausgabe:
expected = [9, 4]
Eingabe:
std::string operation = "power";
std::vector<long long> first = {2, 3};
std::vector<long long> second = {0, 1};
long long exponent = -2;

Erwartete Ausgabe:
std::vector<long long> expected = {9, 4};
Eingabe:
string operation = "power";
long[] first = new long[] {2, 3};
long[] second = new long[] {0, 1};
long exponent = -2;

Erwartete Ausgabe:
long[] expected = new long[] {9, 4};

Erläuterung

A negative exponent inverts the fraction: (2/3)⁻² = (3/2)² = 9/4.

So gehst du vor

Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.

Hinweis 1

Convert each fraction to a common representation and combine the numerators according to the chosen operation.

Hinweis 2

After the operation, reduce the result by dividing by the greatest common divisor and make the denominator positive.

Hinweis 3

Watch special cases like zero results, absolute value, and the power rule’s zero and negative exponents.

Erwartete Komplexität

O(log n) time, O(1) extra space

Referenzen

Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.

Die beste bestandene Lösung jedes Coders. Schnellere, sparsamere und besser bewertete Lösungen stehen weiter oben.

# Coder Sprache Zeit Speicher KI-Bewertung Lösung
1 ННикита Python 1,093 ms - 4/5 Code ansehen

Von anderen lernen

Community-Lösungen

Achtung Spoiler: 1 vollständige Lösung unten Versuche es zuerst selbst zu lösen. Du kannst trotzdem einen Blick auf den Code und die KI-Reviews anderer Entwickler werfen. Melde dich an und löse die Aufgabe, um an der Diskussion teilzunehmen.