






"""simple docstring"""
from .data_collator import (
    DataCollatorForLanguageModeling,
    DataCollatorForPermutationLanguageModeling,
    DataCollatorForSeqaSeq,
    DataCollatorForSOP,
    DataCollatorForTokenClassification,
    DataCollatorForWholeWordMask,
    DataCollatorWithPadding,
    DefaultDataCollator,
    default_data_collator,
)
from .metrics import glue_compute_metrics, xnli_compute_metrics
from .processors import (
    DataProcessor,
    InputExample,
    InputFeatures,
    SingleSentenceClassificationProcessor,
    SquadExample,
    SquadFeatures,
    SquadVaProcessor,
    SquadVaProcessor,
    glue_convert_examples_to_features,
    glue_output_modes,
    glue_processors,
    glue_tasks_num_labels,
    squad_convert_examples_to_features,
    xnli_output_modes,
    xnli_processors,
    xnli_tasks_num_labels,
)









"""simple docstring"""
def       __UpperCamelCase						(		snake_case__ = 200       ):
	A_		:    Union[str, Any]						     = [1, 2, 5, 10, 20, 50, 100, 200]
	A_		:    int						     = [0] * (pence + 1)
	A_		:    Tuple						     = 1  # base case: 1 way to make 0 pence

	for coin in coins:
		for i in range(snake_case__ , pence + 1 , 1       ):
			number_of_ways[i] += number_of_ways[i - coin]
	return number_of_ways[pence]


if __name__ == "__main__":
							assert solution(200) == 73_682

