mirror of
https://github.com/open-thought/reasoning-gym.git
synced 2026-04-19 12:58:07 +00:00
formatting
This commit is contained in:
parent
98988c8481
commit
20069b2a7d
37 changed files with 504 additions and 666 deletions
|
|
@ -1,21 +1,24 @@
|
|||
"""Least Common Multiple (LCM) task generator"""
|
||||
|
||||
from dataclasses import dataclass
|
||||
from functools import reduce
|
||||
from math import lcm
|
||||
from random import Random
|
||||
from typing import List, Optional, Tuple
|
||||
|
||||
from ..dataset import ProceduralDataset
|
||||
from math import lcm
|
||||
from functools import reduce
|
||||
|
||||
|
||||
@dataclass
|
||||
class LCMConfig:
|
||||
"""Configuration for LCM task generation"""
|
||||
min_numbers: int = 2 # Minimum numbers to find LCM of
|
||||
max_numbers: int = 2 # Maximum numbers to find LCM of
|
||||
min_value: int = 1 # Minimum value for each number
|
||||
max_value: int = 100 # Maximum value for each number (kept smaller than GCD default since LCM grows fast)
|
||||
|
||||
min_numbers: int = 2 # Minimum numbers to find LCM of
|
||||
max_numbers: int = 2 # Maximum numbers to find LCM of
|
||||
min_value: int = 1 # Minimum value for each number
|
||||
max_value: int = 100 # Maximum value for each number (kept smaller than GCD default since LCM grows fast)
|
||||
seed: Optional[int] = None
|
||||
size: int = 500 # Virtual dataset size
|
||||
size: int = 500 # Virtual dataset size
|
||||
|
||||
def validate(self):
|
||||
"""Validate configuration parameters"""
|
||||
|
|
@ -36,38 +39,34 @@ class LCMDataset(ProceduralDataset):
|
|||
def _generate_numbers(self, rng: Random) -> Tuple[List[int], int]:
|
||||
"""Generate a list of random positive integers and their LCM.
|
||||
Will try up to 3 times to find numbers with LCM < product."""
|
||||
|
||||
def calculate_product(nums: List[int]) -> int:
|
||||
return reduce(lambda x, y: x * y, nums)
|
||||
|
||||
|
||||
for _ in range(3): # Try up to 3 times to get LCM < product
|
||||
num_count = rng.randint(self.config.min_numbers, self.config.max_numbers)
|
||||
numbers = [rng.randint(self.config.min_value, self.config.max_value)
|
||||
for _ in range(num_count)]
|
||||
numbers = [rng.randint(self.config.min_value, self.config.max_value) for _ in range(num_count)]
|
||||
result = reduce(lcm, numbers)
|
||||
if result < calculate_product(numbers):
|
||||
return numbers, result
|
||||
|
||||
|
||||
# If we failed to find LCM < product after 3 tries, generate one final set
|
||||
num_count = rng.randint(self.config.min_numbers, self.config.max_numbers)
|
||||
numbers = [rng.randint(self.config.min_value, self.config.max_value)
|
||||
for _ in range(num_count)]
|
||||
numbers = [rng.randint(self.config.min_value, self.config.max_value) for _ in range(num_count)]
|
||||
result = reduce(lcm, numbers)
|
||||
return numbers, result
|
||||
|
||||
def __getitem__(self, idx: int) -> dict:
|
||||
"""Generate a single LCM task"""
|
||||
rng = Random(self.seed + idx)
|
||||
|
||||
|
||||
numbers, result = self._generate_numbers(rng)
|
||||
numbers_str = ", ".join(str(n) for n in numbers)
|
||||
|
||||
|
||||
return {
|
||||
"question": f"Find the Least Common Multiple (LCM) of these numbers: {numbers_str}",
|
||||
"answer": str(result),
|
||||
"metadata": {
|
||||
"numbers": numbers,
|
||||
"result": result
|
||||
}
|
||||
"metadata": {"numbers": numbers, "result": result},
|
||||
}
|
||||
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue