"""simple docstring"""
import math_equivalence  # From: git+https://github.com/hendrycks/math.git

import datasets


lowercase__					       =	'\\n@article{hendrycksmath2021,\n  title={Measuring Mathematical Problem Solving With the MATH Dataset},\n  author={Dan Hendrycks\n    and Collin Burns\n    and Saurav Kadavath\n    and Akul Arora\n    and Steven Basart\n    and Eric Tang\n    and Dawn Song\n    and Jacob Steinhardt},\n  journal={arXiv preprint arXiv:2103.03874},\n  year={2021}\n}\n'


lowercase__					       =	'\\nThis metric is used to assess performance on the Mathematics Aptitude Test of Heuristics (MATH) dataset.\nIt first canonicalizes the inputs (e.g., converting "1/2" to "\\frac{1}{2}") and then computes accuracy.\n'


lowercase__					       =	r'\nCalculates accuracy after canonicalizing inputs.\n\nArgs:\n    predictions: list of predictions to score. Each prediction\n        is a string that contains natural language and LaTex.\n    references: list of reference for each prediction. Each\n        reference is a string that contains natural language\n        and LaTex.\nReturns:\n    accuracy: accuracy after canonicalizing inputs\n        (e.g., converting "1/2" to "\\frac{1}{2}")\n\nExamples:\n    >>> metric = datasets.load_metric("competition_math")\n    >>> results = metric.compute(references=["\\frac{1}{2}"], predictions=["1/2"])\n    >>> print(results)\n    {\'accuracy\': 1.0}\n'




@datasets.utils.file_utils.add_end_docstrings(_DESCRIPTION       ,      _KWARGS_DESCRIPTION				)
class    __snake_case       (     datasets.Metric				):



      def   lowerCamelCase_   (						self)	->			Optional[Any]:





        '''simple docstring'''





        return datasets.MetricInfo(
            description=_DESCRIPTION    ,			citation=_CITATION    ,			inputs_description=_KWARGS_DESCRIPTION    ,			features=datasets.Features(
                {
                    'predictions': datasets.Value('string'),
                    'references': datasets.Value('string'),
                })    ,			homepage='https://github.com/hendrycks/math'    ,			codebase_urls=['https://github.com/hendrycks/math']    ,			)



      def   lowerCamelCase_   (						self    ,			lowercase    ,			lowercase)	->			Optional[Any]:





        '''simple docstring'''





        a__:     Any										=	0.0
        for i, j in zip(lowercase    ,			lowercase):
          n_correct += 1.0 if math_equivalence.is_equiv(lowercase    ,			lowercase) else 0.0
        a__:     List[str]										=	n_correct / len(lowercase)
        return {
            "accuracy": accuracy,
        }



"""simple docstring"""
def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->int:
  while a != 0:
    a__							,    a__:     List[str]										=	b % a, a
  return b







def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->int:
  if gcd(_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   ) != 1:
    a__:     Dict										=	F'mod inverse of {a!r} and {m!r} does not exist'
    raise ValueError(_SCREAMING_SNAKE_CASE   )
  a__							,    a__							,    a__:     Union[str, Any]										=	1, 0, a
  a__							,    a__							,    a__:     Any										=	0, 1, m
  while va != 0:
    a__:     int										=	ua // va
    a__							,    a__							,    a__							,    a__							,    a__							,    a__:     Any										=	(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
  return ua % m


