├── .editorconfig ├── .gitignore ├── LICENSE ├── README.md ├── dynamic-programming └── dynamic-programming.ipynb ├── greedy └── greedy-algorithms.ipynb ├── priority-queue ├── README.md ├── question215.md ├── question215.py ├── question767.md ├── question767.py ├── question86.md └── question86.py ├── sweep-line-algorithm ├── README.md ├── geeks-for-geeks │ ├── README.md │ ├── input.txt │ └── maximum-intervals-overlap.cpp └── leetcode │ ├── README.md │ ├── rectangle-area.py │ └── rectangle-overlap.py └── topological_sort.ipynb /.editorconfig: -------------------------------------------------------------------------------- 1 | [*] 2 | charset = utf-8 3 | end_of_line = crlf 4 | indent_size = 4 5 | indent_style = space 6 | insert_final_newline = false 7 | max_line_length = 180 8 | tab_width = 4 9 | ij_continuation_indent_size = 8 10 | ij_formatter_off_tag = @formatter:off 11 | ij_formatter_on_tag = @formatter:on 12 | ij_formatter_tags_enabled = false 13 | ij_smart_tabs = false 14 | ij_wrap_on_typing = false 15 | 16 | [*.json] 17 | indent_size = 2 18 | ij_json_keep_blank_lines_in_code = 0 19 | ij_json_keep_indents_on_empty_lines = false 20 | ij_json_keep_line_breaks = true 21 | ij_json_space_after_colon = true 22 | ij_json_space_after_comma = true 23 | ij_json_space_before_colon = true 24 | ij_json_space_before_comma = false 25 | ij_json_spaces_within_braces = false 26 | ij_json_spaces_within_brackets = false 27 | ij_json_wrap_long_lines = false 28 | 29 | [.editorconfig] 30 | ij_editorconfig_align_group_field_declarations = false 31 | ij_editorconfig_space_after_colon = false 32 | ij_editorconfig_space_after_comma = true 33 | ij_editorconfig_space_before_colon = false 34 | ij_editorconfig_space_before_comma = false 35 | ij_editorconfig_spaces_around_assignment_operators = true 36 | 37 | [{*.cc,*.mm,*.tcc,*.hpp,*.cpp,*.ii,*.hxx,*.hp,*.hh,*.cxx,*.m,*.i,*.h,*.c,*.h++,*.ipp,*.icc,*.c++,*.pch,*.ino,*.inl,*.cp}] 38 | indent_size = 2 39 | tab_width = 2 40 | ij_continuation_indent_size = 4 41 | ij_c_add_brief_tag = true 42 | ij_c_add_getter_prefix = true 43 | ij_c_add_setter_prefix = true 44 | ij_c_align_dictionary_pair_values = false 45 | ij_c_align_group_field_declarations = false 46 | ij_c_align_init_list_in_columns = true 47 | ij_c_align_multiline_array_initializer_expression = true 48 | ij_c_align_multiline_assignment = true 49 | ij_c_align_multiline_binary_operation = true 50 | ij_c_align_multiline_chained_methods = false 51 | ij_c_align_multiline_for = false 52 | ij_c_align_multiline_ternary_operation = true 53 | ij_c_array_initializer_comma_on_next_line = false 54 | ij_c_array_initializer_new_line_after_left_brace = false 55 | ij_c_array_initializer_right_brace_on_new_line = false 56 | ij_c_array_initializer_wrap = off 57 | ij_c_assignment_wrap = off 58 | ij_c_binary_operation_sign_on_next_line = false 59 | ij_c_binary_operation_wrap = off 60 | ij_c_blank_lines_after_class_header = 0 61 | ij_c_blank_lines_after_imports = 1 62 | ij_c_blank_lines_around_class = 1 63 | ij_c_blank_lines_around_field = 0 64 | ij_c_blank_lines_around_field_in_interface = 0 65 | ij_c_blank_lines_around_method = 1 66 | ij_c_blank_lines_around_method_in_interface = 0 67 | ij_c_blank_lines_around_namespace = 0 68 | ij_c_blank_lines_around_properties_in_declaration = 0 69 | ij_c_blank_lines_around_properties_in_interface = 0 70 | ij_c_blank_lines_before_imports = 1 71 | ij_c_blank_lines_before_method_body = 0 72 | ij_c_block_brace_placement = next_line 73 | ij_c_block_brace_style = next_line 74 | ij_c_block_comment_at_first_column = true 75 | ij_c_catch_on_new_line = true 76 | ij_c_class_brace_style = next_line 77 | ij_c_class_constructor_init_list_align_multiline = true 78 | ij_c_class_constructor_init_list_comma_on_next_line = false 79 | ij_c_class_constructor_init_list_new_line_after_colon = never 80 | ij_c_class_constructor_init_list_new_line_before_colon = if_long 81 | ij_c_class_constructor_init_list_wrap = off 82 | ij_c_copy_is_deep = false 83 | ij_c_create_interface_for_categories = true 84 | ij_c_declare_generated_methods = true 85 | ij_c_description_include_member_names = true 86 | ij_c_discharged_short_ternary_operator = true 87 | ij_c_do_not_add_breaks = false 88 | ij_c_do_while_brace_force = always 89 | ij_c_else_on_new_line = true 90 | ij_c_enum_constants_comma_on_next_line = false 91 | ij_c_enum_constants_wrap = on_every_item 92 | ij_c_for_brace_force = always 93 | ij_c_for_statement_new_line_after_left_paren = false 94 | ij_c_for_statement_right_paren_on_new_line = false 95 | ij_c_for_statement_wrap = off 96 | ij_c_function_brace_placement = next_line 97 | ij_c_function_call_arguments_align_multiline = true 98 | ij_c_function_call_arguments_align_multiline_pars = false 99 | ij_c_function_call_arguments_comma_on_next_line = false 100 | ij_c_function_call_arguments_new_line_after_lpar = false 101 | ij_c_function_call_arguments_new_line_before_rpar = false 102 | ij_c_function_call_arguments_wrap = off 103 | ij_c_function_non_top_after_return_type_wrap = off 104 | ij_c_function_parameters_align_multiline = true 105 | ij_c_function_parameters_align_multiline_pars = false 106 | ij_c_function_parameters_comma_on_next_line = false 107 | ij_c_function_parameters_new_line_after_lpar = false 108 | ij_c_function_parameters_new_line_before_rpar = false 109 | ij_c_function_parameters_wrap = off 110 | ij_c_function_top_after_return_type_wrap = off 111 | ij_c_generate_additional_eq_operators = true 112 | ij_c_generate_additional_rel_operators = true 113 | ij_c_generate_class_constructor = true 114 | ij_c_generate_comparison_operators_use_std_tie = false 115 | ij_c_generate_instance_variables_for_properties = ask 116 | ij_c_generate_operators_as_members = true 117 | ij_c_header_guard_style_pattern = ${PROJECT_NAME}_${FILE_NAME}_${EXT} 118 | ij_c_if_brace_force = never 119 | ij_c_in_line_short_ternary_operator = true 120 | ij_c_indent_block_comment = true 121 | ij_c_indent_c_struct_members = 2 122 | ij_c_indent_case_from_switch = true 123 | ij_c_indent_class_members = 4 124 | ij_c_indent_directive_as_code = false 125 | ij_c_indent_implementation_members = 0 126 | ij_c_indent_inside_code_block = 2 127 | ij_c_indent_interface_members = 0 128 | ij_c_indent_interface_members_except_ivars_block = false 129 | ij_c_indent_namespace_members = 2 130 | ij_c_indent_preprocessor_directive = 0 131 | ij_c_indent_visibility_keywords = 2 132 | ij_c_insert_override = true 133 | ij_c_insert_virtual_with_override = false 134 | ij_c_introduce_auto_vars = false 135 | ij_c_introduce_const_params = false 136 | ij_c_introduce_const_vars = false 137 | ij_c_introduce_generate_property = false 138 | ij_c_introduce_generate_synthesize = true 139 | ij_c_introduce_globals_to_header = true 140 | ij_c_introduce_prop_to_private_category = false 141 | ij_c_introduce_static_consts = true 142 | ij_c_introduce_use_ns_types = false 143 | ij_c_ivars_prefix = _ 144 | ij_c_keep_blank_lines_before_end = 2 145 | ij_c_keep_blank_lines_before_right_brace = 1 146 | ij_c_keep_blank_lines_in_code = 1 147 | ij_c_keep_blank_lines_in_declarations = 1 148 | ij_c_keep_case_expressions_in_one_line = false 149 | ij_c_keep_control_statement_in_one_line = true 150 | ij_c_keep_directive_at_first_column = true 151 | ij_c_keep_first_column_comment = false 152 | ij_c_keep_indents_on_empty_lines = false 153 | ij_c_keep_line_breaks = false 154 | ij_c_keep_nested_namespaces_in_one_line = false 155 | ij_c_keep_simple_blocks_in_one_line = true 156 | ij_c_keep_simple_methods_in_one_line = true 157 | ij_c_keep_structures_in_one_line = false 158 | ij_c_lambda_capture_list_align_multiline = false 159 | ij_c_lambda_capture_list_align_multiline_bracket = false 160 | ij_c_lambda_capture_list_comma_on_next_line = false 161 | ij_c_lambda_capture_list_new_line_after_lbracket = false 162 | ij_c_lambda_capture_list_new_line_before_rbracket = false 163 | ij_c_lambda_capture_list_wrap = off 164 | ij_c_line_comment_add_space = false 165 | ij_c_line_comment_at_first_column = true 166 | ij_c_method_brace_placement = end_of_line 167 | ij_c_method_call_arguments_align_by_colons = true 168 | ij_c_method_call_arguments_align_multiline = false 169 | ij_c_method_call_arguments_special_dictionary_pairs_treatment = true 170 | ij_c_method_call_arguments_wrap = off 171 | ij_c_method_call_chain_wrap = off 172 | ij_c_method_parameters_align_by_colons = true 173 | ij_c_method_parameters_align_multiline = false 174 | ij_c_method_parameters_wrap = off 175 | ij_c_namespace_brace_placement = next_line 176 | ij_c_parentheses_expression_new_line_after_left_paren = false 177 | ij_c_parentheses_expression_right_paren_on_new_line = false 178 | ij_c_place_assignment_sign_on_next_line = false 179 | ij_c_property_nonatomic = true 180 | ij_c_put_ivars_to_implementation = true 181 | ij_c_refactor_compatibility_aliases_and_classes = true 182 | ij_c_refactor_properties_and_ivars = true 183 | ij_c_release_style = ivar 184 | ij_c_retain_object_parameters_in_constructor = true 185 | ij_c_semicolon_after_method_signature = false 186 | ij_c_shift_operation_align_multiline = true 187 | ij_c_shift_operation_wrap = off 188 | ij_c_show_non_virtual_functions = false 189 | ij_c_space_after_colon = true 190 | ij_c_space_after_colon_in_selector = false 191 | ij_c_space_after_comma = true 192 | ij_c_space_after_cup_in_blocks = false 193 | ij_c_space_after_dictionary_literal_colon = true 194 | ij_c_space_after_for_semicolon = true 195 | ij_c_space_after_init_list_colon = true 196 | ij_c_space_after_method_parameter_type_parentheses = false 197 | ij_c_space_after_method_return_type_parentheses = false 198 | ij_c_space_after_pointer_in_declaration = false 199 | ij_c_space_after_quest = true 200 | ij_c_space_after_reference_in_declaration = false 201 | ij_c_space_after_reference_in_rvalue = false 202 | ij_c_space_after_structures_rbrace = true 203 | ij_c_space_after_superclass_colon = true 204 | ij_c_space_after_type_cast = true 205 | ij_c_space_after_visibility_sign_in_method_declaration = true 206 | ij_c_space_before_autorelease_pool_lbrace = true 207 | ij_c_space_before_catch_keyword = true 208 | ij_c_space_before_catch_left_brace = true 209 | ij_c_space_before_catch_parentheses = true 210 | ij_c_space_before_category_parentheses = true 211 | ij_c_space_before_chained_send_message = true 212 | ij_c_space_before_class_left_brace = true 213 | ij_c_space_before_colon = true 214 | ij_c_space_before_comma = false 215 | ij_c_space_before_dictionary_literal_colon = false 216 | ij_c_space_before_do_left_brace = true 217 | ij_c_space_before_else_keyword = true 218 | ij_c_space_before_else_left_brace = true 219 | ij_c_space_before_for_left_brace = true 220 | ij_c_space_before_for_parentheses = true 221 | ij_c_space_before_for_semicolon = false 222 | ij_c_space_before_if_left_brace = true 223 | ij_c_space_before_if_parentheses = true 224 | ij_c_space_before_init_list = false 225 | ij_c_space_before_init_list_colon = true 226 | ij_c_space_before_method_call_parentheses = false 227 | ij_c_space_before_method_left_brace = true 228 | ij_c_space_before_method_parentheses = false 229 | ij_c_space_before_namespace_lbrace = true 230 | ij_c_space_before_pointer_in_declaration = true 231 | ij_c_space_before_property_attributes_parentheses = false 232 | ij_c_space_before_protocols_brackets = true 233 | ij_c_space_before_quest = true 234 | ij_c_space_before_reference_in_declaration = true 235 | ij_c_space_before_superclass_colon = true 236 | ij_c_space_before_switch_left_brace = true 237 | ij_c_space_before_switch_parentheses = true 238 | ij_c_space_before_template_call_lt = false 239 | ij_c_space_before_template_declaration_lt = false 240 | ij_c_space_before_try_left_brace = true 241 | ij_c_space_before_while_keyword = true 242 | ij_c_space_before_while_left_brace = true 243 | ij_c_space_before_while_parentheses = true 244 | ij_c_space_between_adjacent_brackets = false 245 | ij_c_space_between_operator_and_punctuator = false 246 | ij_c_space_within_empty_array_initializer_braces = false 247 | ij_c_spaces_around_additive_operators = true 248 | ij_c_spaces_around_assignment_operators = true 249 | ij_c_spaces_around_bitwise_operators = true 250 | ij_c_spaces_around_equality_operators = true 251 | ij_c_spaces_around_lambda_arrow = true 252 | ij_c_spaces_around_logical_operators = true 253 | ij_c_spaces_around_multiplicative_operators = true 254 | ij_c_spaces_around_pm_operators = false 255 | ij_c_spaces_around_relational_operators = true 256 | ij_c_spaces_around_shift_operators = true 257 | ij_c_spaces_around_unary_operator = false 258 | ij_c_spaces_within_array_initializer_braces = false 259 | ij_c_spaces_within_braces = true 260 | ij_c_spaces_within_brackets = false 261 | ij_c_spaces_within_cast_parentheses = false 262 | ij_c_spaces_within_catch_parentheses = false 263 | ij_c_spaces_within_category_parentheses = false 264 | ij_c_spaces_within_empty_braces = false 265 | ij_c_spaces_within_empty_function_call_parentheses = false 266 | ij_c_spaces_within_empty_function_declaration_parentheses = false 267 | ij_c_spaces_within_empty_lambda_capture_list_bracket = false 268 | ij_c_spaces_within_empty_template_call_ltgt = false 269 | ij_c_spaces_within_empty_template_declaration_ltgt = false 270 | ij_c_spaces_within_for_parentheses = false 271 | ij_c_spaces_within_function_call_parentheses = false 272 | ij_c_spaces_within_function_declaration_parentheses = false 273 | ij_c_spaces_within_if_parentheses = false 274 | ij_c_spaces_within_lambda_capture_list_bracket = false 275 | ij_c_spaces_within_method_parameter_type_parentheses = false 276 | ij_c_spaces_within_method_return_type_parentheses = false 277 | ij_c_spaces_within_parentheses = false 278 | ij_c_spaces_within_property_attributes_parentheses = false 279 | ij_c_spaces_within_protocols_brackets = false 280 | ij_c_spaces_within_send_message_brackets = false 281 | ij_c_spaces_within_switch_parentheses = false 282 | ij_c_spaces_within_template_call_ltgt = false 283 | ij_c_spaces_within_template_declaration_ltgt = false 284 | ij_c_spaces_within_template_double_gt = true 285 | ij_c_spaces_within_while_parentheses = false 286 | ij_c_special_else_if_treatment = true 287 | ij_c_superclass_list_after_colon = never 288 | ij_c_superclass_list_align_multiline = true 289 | ij_c_superclass_list_before_colon = if_long 290 | ij_c_superclass_list_comma_on_next_line = false 291 | ij_c_superclass_list_wrap = on_every_item 292 | ij_c_tag_prefix_of_block_comment = at 293 | ij_c_tag_prefix_of_line_comment = back_slash 294 | ij_c_template_call_arguments_align_multiline = false 295 | ij_c_template_call_arguments_align_multiline_pars = false 296 | ij_c_template_call_arguments_comma_on_next_line = false 297 | ij_c_template_call_arguments_new_line_after_lt = false 298 | ij_c_template_call_arguments_new_line_before_gt = false 299 | ij_c_template_call_arguments_wrap = off 300 | ij_c_template_declaration_function_body_indent = false 301 | ij_c_template_declaration_function_wrap = off 302 | ij_c_template_declaration_struct_body_indent = false 303 | ij_c_template_declaration_struct_wrap = off 304 | ij_c_template_parameters_align_multiline = false 305 | ij_c_template_parameters_align_multiline_pars = false 306 | ij_c_template_parameters_comma_on_next_line = false 307 | ij_c_template_parameters_new_line_after_lt = false 308 | ij_c_template_parameters_new_line_before_gt = false 309 | ij_c_template_parameters_wrap = off 310 | ij_c_ternary_operation_signs_on_next_line = true 311 | ij_c_ternary_operation_wrap = off 312 | ij_c_type_qualifiers_placement = before 313 | ij_c_use_modern_casts = true 314 | ij_c_use_setters_in_constructor = true 315 | ij_c_while_brace_force = always 316 | ij_c_while_on_new_line = true 317 | ij_c_wrap_property_declaration = off 318 | 319 | [{*.htm,*.sht,*.html,*.shtm,*.shtml}] 320 | ij_html_add_new_line_before_tags = body,div,p,form,h1,h2,h3 321 | ij_html_align_attributes = true 322 | ij_html_align_text = false 323 | ij_html_attribute_wrap = normal 324 | ij_html_block_comment_at_first_column = true 325 | ij_html_do_not_align_children_of_min_lines = 0 326 | ij_html_do_not_break_if_inline_tags = title,h1,h2,h3,h4,h5,h6,p 327 | ij_html_do_not_indent_children_of_tags = html,body,thead,tbody,tfoot 328 | ij_html_enforce_quotes = false 329 | ij_html_inline_tags = a,abbr,acronym,b,basefont,bdo,big,br,cite,cite,code,dfn,em,font,i,img,input,kbd,label,q,s,samp,select,small,span,strike,strong,sub,sup,textarea,tt,u,var 330 | ij_html_keep_blank_lines = 2 331 | ij_html_keep_indents_on_empty_lines = false 332 | ij_html_keep_line_breaks = true 333 | ij_html_keep_line_breaks_in_text = true 334 | ij_html_keep_whitespaces = false 335 | ij_html_keep_whitespaces_inside = span,pre,textarea 336 | ij_html_line_comment_at_first_column = true 337 | ij_html_new_line_after_last_attribute = never 338 | ij_html_new_line_before_first_attribute = never 339 | ij_html_quote_style = double 340 | ij_html_remove_new_line_before_tags = br 341 | ij_html_space_after_tag_name = false 342 | ij_html_space_around_equality_in_attribute = false 343 | ij_html_space_inside_empty_tag = false 344 | ij_html_text_wrap = normal 345 | 346 | [{*.jhm,*.xslt,*.xul,*.rng,*.xsl,*.xsd,*.ant,*.jrxml,*.qrc,*.xml,*.tld,*.fxml,*.wsdl,*.jnlp}] 347 | ij_xml_block_comment_at_first_column = true 348 | ij_xml_keep_indents_on_empty_lines = false 349 | ij_xml_line_comment_at_first_column = true 350 | 351 | [{*.pyw,*.py}] 352 | ij_python_align_collections_and_comprehensions = true 353 | ij_python_align_multiline_imports = true 354 | ij_python_align_multiline_parameters = true 355 | ij_python_align_multiline_parameters_in_calls = true 356 | ij_python_blank_line_at_file_end = true 357 | ij_python_blank_lines_after_imports = 1 358 | ij_python_blank_lines_after_local_imports = 0 359 | ij_python_blank_lines_around_class = 1 360 | ij_python_blank_lines_around_method = 1 361 | ij_python_blank_lines_around_top_level_classes_functions = 2 362 | ij_python_blank_lines_before_first_method = 0 363 | ij_python_dict_alignment = 0 364 | ij_python_dict_new_line_after_left_brace = false 365 | ij_python_dict_new_line_before_right_brace = false 366 | ij_python_dict_wrapping = 1 367 | ij_python_from_import_new_line_after_left_parenthesis = false 368 | ij_python_from_import_new_line_before_right_parenthesis = false 369 | ij_python_from_import_parentheses_force_if_multiline = false 370 | ij_python_from_import_trailing_comma_if_multiline = false 371 | ij_python_from_import_wrapping = 1 372 | ij_python_hang_closing_brackets = false 373 | ij_python_keep_blank_lines_in_code = 1 374 | ij_python_keep_blank_lines_in_declarations = 1 375 | ij_python_keep_indents_on_empty_lines = false 376 | ij_python_keep_line_breaks = true 377 | ij_python_new_line_after_colon = false 378 | ij_python_new_line_after_colon_multi_clause = true 379 | ij_python_optimize_imports_always_split_from_imports = false 380 | ij_python_optimize_imports_case_insensitive_order = false 381 | ij_python_optimize_imports_join_from_imports_with_same_source = false 382 | ij_python_optimize_imports_sort_by_type_first = true 383 | ij_python_optimize_imports_sort_imports = true 384 | ij_python_optimize_imports_sort_names_in_from_imports = false 385 | ij_python_space_after_comma = true 386 | ij_python_space_after_number_sign = true 387 | ij_python_space_after_py_colon = true 388 | ij_python_space_before_backslash = true 389 | ij_python_space_before_comma = false 390 | ij_python_space_before_for_semicolon = false 391 | ij_python_space_before_lbracket = false 392 | ij_python_space_before_method_call_parentheses = false 393 | ij_python_space_before_method_parentheses = false 394 | ij_python_space_before_number_sign = true 395 | ij_python_space_before_py_colon = false 396 | ij_python_space_within_empty_method_call_parentheses = false 397 | ij_python_space_within_empty_method_parentheses = false 398 | ij_python_spaces_around_additive_operators = true 399 | ij_python_spaces_around_assignment_operators = true 400 | ij_python_spaces_around_bitwise_operators = true 401 | ij_python_spaces_around_eq_in_keyword_argument = false 402 | ij_python_spaces_around_eq_in_named_parameter = false 403 | ij_python_spaces_around_equality_operators = true 404 | ij_python_spaces_around_multiplicative_operators = true 405 | ij_python_spaces_around_power_operator = true 406 | ij_python_spaces_around_relational_operators = true 407 | ij_python_spaces_around_shift_operators = true 408 | ij_python_spaces_within_braces = false 409 | ij_python_spaces_within_brackets = false 410 | ij_python_spaces_within_method_call_parentheses = false 411 | ij_python_spaces_within_method_parentheses = false 412 | ij_python_use_continuation_indent_for_arguments = false 413 | ij_python_use_continuation_indent_for_collection_and_comprehensions = false 414 | ij_python_wrap_long_lines = false 415 | 416 | [{*.zsh,*.bash,*.sh}] 417 | ij_shell_binary_ops_start_line = false 418 | ij_shell_keep_column_alignment_padding = false 419 | ij_shell_minify_program = false 420 | ij_shell_redirect_followed_by_space = false 421 | ij_shell_switch_cases_indented = false 422 | 423 | [{CMakeLists.txt,*.cmake}] 424 | indent_size = 2 425 | tab_width = 2 426 | ij_continuation_indent_size = 2 427 | ij_cmake_align_multiline_parameters_in_calls = false 428 | ij_cmake_force_commands_case = 2 429 | ij_cmake_keep_blank_lines_in_code = 1 430 | ij_cmake_keep_indents_on_empty_lines = false 431 | ij_cmake_space_before_for_parentheses = true 432 | ij_cmake_space_before_if_parentheses = true 433 | ij_cmake_space_before_method_call_parentheses = false 434 | ij_cmake_space_before_method_parentheses = false 435 | ij_cmake_space_before_while_parentheses = true 436 | ij_cmake_spaces_within_for_parentheses = false 437 | ij_cmake_spaces_within_if_parentheses = false 438 | ij_cmake_spaces_within_method_call_parentheses = false 439 | ij_cmake_spaces_within_method_parentheses = false 440 | ij_cmake_spaces_within_while_parentheses = false 441 | 442 | [{Clang Configuration,*.yml,*.yaml}] 443 | indent_size = 2 444 | ij_continuation_indent_size = 2 445 | ij_yaml_keep_indents_on_empty_lines = false 446 | ij_yaml_keep_line_breaks = true -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Created by https://www.gitignore.io/api/c,git,c++,cmake,linux,clion,macos,windows,eclipse,clion+all,clion+iml,qtcreator,executable,codeblocks,sublimetext,visualstudio,visualstudiocode 2 | # Edit at https://www.gitignore.io/?templates=c,git,c++,cmake,linux,clion,macos,windows,eclipse,clion+all,clion+iml,qtcreator,executable,codeblocks,sublimetext,visualstudio,visualstudiocode 3 | 4 | ### C ### 5 | # Prerequisites 6 | *.d 7 | 8 | # Object files 9 | *.o 10 | *.ko 11 | *.obj 12 | *.elf 13 | 14 | # Linker output 15 | *.ilk 16 | *.map 17 | *.exp 18 | 19 | # Precompiled Headers 20 | *.gch 21 | *.pch 22 | 23 | # Libraries 24 | *.lib 25 | *.a 26 | *.la 27 | *.lo 28 | 29 | # Shared objects (inc. Windows DLLs) 30 | *.dll 31 | *.so 32 | *.so.* 33 | *.dylib 34 | 35 | # Executables 36 | *.exe 37 | *.out 38 | *.app 39 | *.i*86 40 | *.x86_64 41 | *.hex 42 | 43 | # Debug files 44 | *.dSYM/ 45 | *.su 46 | *.idb 47 | *.pdb 48 | 49 | # Kernel Module Compile Results 50 | *.mod* 51 | *.cmd 52 | .tmp_versions/ 53 | modules.order 54 | Module.symvers 55 | Mkfile.old 56 | dkms.conf 57 | 58 | ### C++ ### 59 | # Prerequisites 60 | 61 | # Compiled Object files 62 | *.slo 63 | 64 | # Precompiled Headers 65 | 66 | # Compiled Dynamic libraries 67 | 68 | # Fortran module files 69 | *.mod 70 | *.smod 71 | 72 | # Compiled Static libraries 73 | *.lai 74 | 75 | # Executables 76 | 77 | ### CLion ### 78 | # Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio and WebStorm 79 | # Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 80 | 81 | # User-specific stuff 82 | .idea/**/workspace.xml 83 | .idea/**/tasks.xml 84 | .idea/**/usage.statistics.xml 85 | .idea/**/dictionaries 86 | .idea/**/shelf 87 | 88 | # Generated files 89 | .idea/**/contentModel.xml 90 | 91 | # Sensitive or high-churn files 92 | .idea/**/dataSources/ 93 | .idea/**/dataSources.ids 94 | .idea/**/dataSources.local.xml 95 | .idea/**/sqlDataSources.xml 96 | .idea/**/dynamic.xml 97 | .idea/**/uiDesigner.xml 98 | .idea/**/dbnavigator.xml 99 | 100 | # Gradle 101 | .idea/**/gradle.xml 102 | .idea/**/libraries 103 | 104 | # Gradle and Maven with auto-import 105 | # When using Gradle or Maven with auto-import, you should exclude module files, 106 | # since they will be recreated, and may cause churn. Uncomment if using 107 | # auto-import. 108 | # .idea/modules.xml 109 | # .idea/*.iml 110 | # .idea/modules 111 | # *.iml 112 | # *.ipr 113 | 114 | # CMake 115 | cmake-build-*/ 116 | 117 | # Mongo Explorer plugin 118 | .idea/**/mongoSettings.xml 119 | 120 | # File-based project format 121 | *.iws 122 | 123 | # IntelliJ 124 | out/ 125 | 126 | # mpeltonen/sbt-idea plugin 127 | .idea_modules/ 128 | 129 | # JIRA plugin 130 | atlassian-ide-plugin.xml 131 | 132 | # Cursive Clojure plugin 133 | .idea/replstate.xml 134 | 135 | # Crashlytics plugin (for Android Studio and IntelliJ) 136 | com_crashlytics_export_strings.xml 137 | crashlytics.properties 138 | crashlytics-build.properties 139 | fabric.properties 140 | 141 | # Editor-based Rest Client 142 | .idea/httpRequests 143 | 144 | # Android studio 3.1+ serialized cache file 145 | .idea/caches/build_file_checksums.ser 146 | 147 | ### CLion Patch ### 148 | # Comment Reason: https://github.com/joeblau/gitignore.io/issues/186#issuecomment-215987721 149 | 150 | # *.iml 151 | # modules.xml 152 | # .idea/misc.xml 153 | # *.ipr 154 | 155 | # Sonarlint plugin 156 | .idea/**/sonarlint/ 157 | 158 | # SonarQube Plugin 159 | .idea/**/sonarIssues.xml 160 | 161 | # Markdown Navigator plugin 162 | .idea/**/markdown-navigator.xml 163 | .idea/**/markdown-navigator/ 164 | 165 | ### CLion+all ### 166 | # Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio and WebStorm 167 | # Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 168 | 169 | # User-specific stuff 170 | 171 | # Generated files 172 | 173 | # Sensitive or high-churn files 174 | 175 | # Gradle 176 | 177 | # Gradle and Maven with auto-import 178 | # When using Gradle or Maven with auto-import, you should exclude module files, 179 | # since they will be recreated, and may cause churn. Uncomment if using 180 | # auto-import. 181 | # .idea/modules.xml 182 | # .idea/*.iml 183 | # .idea/modules 184 | # *.iml 185 | # *.ipr 186 | 187 | # CMake 188 | 189 | # Mongo Explorer plugin 190 | 191 | # File-based project format 192 | 193 | # IntelliJ 194 | 195 | # mpeltonen/sbt-idea plugin 196 | 197 | # JIRA plugin 198 | 199 | # Cursive Clojure plugin 200 | 201 | # Crashlytics plugin (for Android Studio and IntelliJ) 202 | 203 | # Editor-based Rest Client 204 | 205 | # Android studio 3.1+ serialized cache file 206 | 207 | ### CLion+all Patch ### 208 | # Ignores the whole .idea folder and all .iml files 209 | # See https://github.com/joeblau/gitignore.io/issues/186 and https://github.com/joeblau/gitignore.io/issues/360 210 | 211 | .idea/ 212 | 213 | # Reason: https://github.com/joeblau/gitignore.io/issues/186#issuecomment-249601023 214 | 215 | *.iml 216 | modules.xml 217 | .idea/misc.xml 218 | *.ipr 219 | 220 | # Sonarlint plugin 221 | .idea/sonarlint 222 | 223 | ### CLion+iml ### 224 | # Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio and WebStorm 225 | # Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 226 | 227 | # User-specific stuff 228 | 229 | # Generated files 230 | 231 | # Sensitive or high-churn files 232 | 233 | # Gradle 234 | 235 | # Gradle and Maven with auto-import 236 | # When using Gradle or Maven with auto-import, you should exclude module files, 237 | # since they will be recreated, and may cause churn. Uncomment if using 238 | # auto-import. 239 | # .idea/modules.xml 240 | # .idea/*.iml 241 | # .idea/modules 242 | # *.iml 243 | # *.ipr 244 | 245 | # CMake 246 | 247 | # Mongo Explorer plugin 248 | 249 | # File-based project format 250 | 251 | # IntelliJ 252 | 253 | # mpeltonen/sbt-idea plugin 254 | 255 | # JIRA plugin 256 | 257 | # Cursive Clojure plugin 258 | 259 | # Crashlytics plugin (for Android Studio and IntelliJ) 260 | 261 | # Editor-based Rest Client 262 | 263 | # Android studio 3.1+ serialized cache file 264 | 265 | ### CLion+iml Patch ### 266 | # Reason: https://github.com/joeblau/gitignore.io/issues/186#issuecomment-249601023 267 | 268 | 269 | ### CMake ### 270 | CMakeLists.txt.user 271 | CMakeCache.txt 272 | CMakeFiles 273 | CMakeScripts 274 | Testing 275 | Makefile 276 | cmake_install.cmake 277 | install_manifest.txt 278 | compile_commands.json 279 | CTestTestfile.cmake 280 | _deps 281 | 282 | ### CMake Patch ### 283 | # External projects 284 | *-prefix/ 285 | 286 | ### CodeBlocks ### 287 | # specific to CodeBlocks IDE 288 | *.layout 289 | *.depend 290 | # generated directories 291 | bin/ 292 | obj/ 293 | build/ 294 | 295 | ### Eclipse ### 296 | .metadata 297 | tmp/ 298 | *.tmp 299 | *.bak 300 | *.swp 301 | *~.nib 302 | local.properties 303 | .settings/ 304 | .loadpath 305 | .recommenders 306 | 307 | # External tool builders 308 | .externalToolBuilders/ 309 | 310 | # Locally stored "Eclipse launch configurations" 311 | *.launch 312 | 313 | # PyDev specific (Python IDE for Eclipse) 314 | *.pydevproject 315 | 316 | # CDT-specific (C/C++ Development Tooling) 317 | .cproject 318 | 319 | # CDT- autotools 320 | .autotools 321 | 322 | # Java annotation processor (APT) 323 | .factorypath 324 | 325 | # PDT-specific (PHP Development Tools) 326 | .buildpath 327 | 328 | # sbteclipse plugin 329 | .target 330 | 331 | # Tern plugin 332 | .tern-project 333 | 334 | # TeXlipse plugin 335 | .texlipse 336 | 337 | # STS (Spring Tool Suite) 338 | .springBeans 339 | 340 | # Code Recommenders 341 | .recommenders/ 342 | 343 | # Annotation Processing 344 | .apt_generated/ 345 | 346 | # Scala IDE specific (Scala & Java development for Eclipse) 347 | .cache-main 348 | .scala_dependencies 349 | .worksheet 350 | 351 | ### Eclipse Patch ### 352 | # Eclipse Core 353 | .project 354 | 355 | # JDT-specific (Eclipse Java Development Tools) 356 | .classpath 357 | 358 | # Annotation Processing 359 | .apt_generated 360 | 361 | .sts4-cache/ 362 | 363 | ### Executable ### 364 | *.bat 365 | *.cgi 366 | *.com 367 | *.gadget 368 | *.jar 369 | *.pif 370 | *.vb 371 | *.wsf 372 | 373 | ### Git ### 374 | # Created by git for backups. To disable backups in Git: 375 | # $ git config --global mergetool.keepBackup false 376 | *.orig 377 | 378 | # Created by git when using merge tools for conflicts 379 | *.BACKUP.* 380 | *.BASE.* 381 | *.LOCAL.* 382 | *.REMOTE.* 383 | *_BACKUP_*.txt 384 | *_BASE_*.txt 385 | *_LOCAL_*.txt 386 | *_REMOTE_*.txt 387 | 388 | ### Linux ### 389 | *~ 390 | 391 | # temporary files which can be created if a process still has a handle open of a deleted file 392 | .fuse_hidden* 393 | 394 | # KDE directory preferences 395 | .directory 396 | 397 | # Linux trash folder which might appear on any partition or disk 398 | .Trash-* 399 | 400 | # .nfs files are created when an open file is removed but is still being accessed 401 | .nfs* 402 | 403 | ### macOS ### 404 | # General 405 | .DS_Store 406 | .AppleDouble 407 | .LSOverride 408 | 409 | # Icon must end with two \r 410 | Icon 411 | 412 | # Thumbnails 413 | ._* 414 | 415 | # Files that might appear in the root of a volume 416 | .DocumentRevisions-V100 417 | .fseventsd 418 | .Spotlight-V100 419 | .TemporaryItems 420 | .Trashes 421 | .VolumeIcon.icns 422 | .com.apple.timemachine.donotpresent 423 | 424 | # Directories potentially created on remote AFP share 425 | .AppleDB 426 | .AppleDesktop 427 | Network Trash Folder 428 | Temporary Items 429 | .apdisk 430 | 431 | ### QtCreator ### 432 | # gitignore for Qt Creator like IDE for pure C/C++ project without Qt 433 | # 434 | # Reference: http://doc.qt.io/qtcreator/creator-project-generic.html 435 | 436 | 437 | 438 | # Qt Creator autogenerated files 439 | 440 | 441 | # A listing of all the files included in the project 442 | *.files 443 | 444 | # Include directories 445 | *.includes 446 | 447 | # Project configuration settings like predefined Macros 448 | *.config 449 | 450 | # Qt Creator settings 451 | *.creator 452 | 453 | # User project settings 454 | *.creator.user* 455 | 456 | # Qt Creator backups 457 | *.autosave 458 | 459 | ### SublimeText ### 460 | # Cache files for Sublime Text 461 | *.tmlanguage.cache 462 | *.tmPreferences.cache 463 | *.stTheme.cache 464 | 465 | # Workspace files are user-specific 466 | *.sublime-workspace 467 | 468 | # Project files should be checked into the repository, unless a significant 469 | # proportion of contributors will probably not be using Sublime Text 470 | # *.sublime-project 471 | 472 | # SFTP configuration file 473 | sftp-config.json 474 | 475 | # Package control specific files 476 | Package Control.last-run 477 | Package Control.ca-list 478 | Package Control.ca-bundle 479 | Package Control.system-ca-bundle 480 | Package Control.cache/ 481 | Package Control.ca-certs/ 482 | Package Control.merged-ca-bundle 483 | Package Control.user-ca-bundle 484 | oscrypto-ca-bundle.crt 485 | bh_unicode_properties.cache 486 | 487 | # Sublime-github package stores a github token in this file 488 | # https://packagecontrol.io/packages/sublime-github 489 | GitHub.sublime-settings 490 | 491 | ### VisualStudioCode ### 492 | .vscode/ 493 | .vscode/* 494 | !.vscode/settings.json 495 | !.vscode/tasks.json 496 | !.vscode/launch.json 497 | !.vscode/extensions.json 498 | 499 | ### VisualStudioCode Patch ### 500 | # Ignore all local history of files 501 | .history 502 | 503 | ### Windows ### 504 | # Windows thumbnail cache files 505 | Thumbs.db 506 | Thumbs.db:encryptable 507 | ehthumbs.db 508 | ehthumbs_vista.db 509 | 510 | # Dump file 511 | *.stackdump 512 | 513 | # Folder config file 514 | [Dd]esktop.ini 515 | 516 | # Recycle Bin used on file shares 517 | $RECYCLE.BIN/ 518 | 519 | # Windows Installer files 520 | *.cab 521 | *.msi 522 | *.msix 523 | *.msm 524 | *.msp 525 | 526 | # Windows shortcuts 527 | *.lnk 528 | 529 | ### VisualStudio ### 530 | ## Ignore Visual Studio temporary files, build results, and 531 | ## files generated by popular Visual Studio add-ons. 532 | ## 533 | ## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore 534 | 535 | # User-specific files 536 | *.rsuser 537 | *.suo 538 | *.user 539 | *.userosscache 540 | *.sln.docstates 541 | 542 | # User-specific files (MonoDevelop/Xamarin Studio) 543 | *.userprefs 544 | 545 | # Mono auto generated files 546 | mono_crash.* 547 | 548 | # Build results 549 | [Dd]ebug/ 550 | [Dd]ebugPublic/ 551 | [Rr]elease/ 552 | [Rr]eleases/ 553 | x64/ 554 | x86/ 555 | [Aa][Rr][Mm]/ 556 | [Aa][Rr][Mm]64/ 557 | bld/ 558 | [Bb]in/ 559 | [Oo]bj/ 560 | [Ll]og/ 561 | 562 | # Visual Studio 2015/2017 cache/options directory 563 | .vs/ 564 | # Uncomment if you have tasks that create the project's static files in wwwroot 565 | #wwwroot/ 566 | 567 | # Visual Studio 2017 auto generated files 568 | Generated\ Files/ 569 | 570 | # MSTest test Results 571 | [Tt]est[Rr]esult*/ 572 | [Bb]uild[Ll]og.* 573 | 574 | # NUnit 575 | *.VisualState.xml 576 | TestResult.xml 577 | nunit-*.xml 578 | 579 | # Build Results of an ATL Project 580 | [Dd]ebugPS/ 581 | [Rr]eleasePS/ 582 | dlldata.c 583 | 584 | # Benchmark Results 585 | BenchmarkDotNet.Artifacts/ 586 | 587 | # .NET Core 588 | project.lock.json 589 | project.fragment.lock.json 590 | artifacts/ 591 | 592 | # StyleCop 593 | StyleCopReport.xml 594 | 595 | # Files built by Visual Studio 596 | *_i.c 597 | *_p.c 598 | *_h.h 599 | *.meta 600 | *.iobj 601 | *.ipdb 602 | *.pgc 603 | *.pgd 604 | *.rsp 605 | *.sbr 606 | *.tlb 607 | *.tli 608 | *.tlh 609 | *.tmp_proj 610 | *_wpftmp.csproj 611 | *.log 612 | *.vspscc 613 | *.vssscc 614 | .builds 615 | *.pidb 616 | *.svclog 617 | *.scc 618 | 619 | # Chutzpah Test files 620 | _Chutzpah* 621 | 622 | # Visual C++ cache files 623 | ipch/ 624 | *.aps 625 | *.ncb 626 | *.opendb 627 | *.opensdf 628 | *.sdf 629 | *.cachefile 630 | *.VC.db 631 | *.VC.VC.opendb 632 | 633 | # Visual Studio profiler 634 | *.psess 635 | *.vsp 636 | *.vspx 637 | *.sap 638 | 639 | # Visual Studio Trace Files 640 | *.e2e 641 | 642 | # TFS 2012 Local Workspace 643 | $tf/ 644 | 645 | # Guidance Automation Toolkit 646 | *.gpState 647 | 648 | # ReSharper is a .NET coding add-in 649 | _ReSharper*/ 650 | *.[Rr]e[Ss]harper 651 | *.DotSettings.user 652 | 653 | # JustCode is a .NET coding add-in 654 | .JustCode 655 | 656 | # TeamCity is a build add-in 657 | _TeamCity* 658 | 659 | # DotCover is a Code Coverage Tool 660 | *.dotCover 661 | 662 | # AxoCover is a Code Coverage Tool 663 | .axoCover/* 664 | !.axoCover/settings.json 665 | 666 | # Visual Studio code coverage results 667 | *.coverage 668 | *.coveragexml 669 | 670 | # NCrunch 671 | _NCrunch_* 672 | .*crunch*.local.xml 673 | nCrunchTemp_* 674 | 675 | # MightyMoose 676 | *.mm.* 677 | AutoTest.Net/ 678 | 679 | # Web workbench (sass) 680 | .sass-cache/ 681 | 682 | # Installshield output folder 683 | [Ee]xpress/ 684 | 685 | # DocProject is a documentation generator add-in 686 | DocProject/buildhelp/ 687 | DocProject/Help/*.HxT 688 | DocProject/Help/*.HxC 689 | DocProject/Help/*.hhc 690 | DocProject/Help/*.hhk 691 | DocProject/Help/*.hhp 692 | DocProject/Help/Html2 693 | DocProject/Help/html 694 | 695 | # Click-Once directory 696 | publish/ 697 | 698 | # Publish Web Output 699 | *.[Pp]ublish.xml 700 | *.azurePubxml 701 | # Note: Comment the next line if you want to checkin your web deploy settings, 702 | # but database connection strings (with potential passwords) will be unencrypted 703 | *.pubxml 704 | *.publishproj 705 | 706 | # Microsoft Azure Web App publish settings. Comment the next line if you want to 707 | # checkin your Azure Web App publish settings, but sensitive information contained 708 | # in these scripts will be unencrypted 709 | PublishScripts/ 710 | 711 | # NuGet Packages 712 | *.nupkg 713 | # NuGet Symbol Packages 714 | *.snupkg 715 | # The packages folder can be ignored because of Package Restore 716 | **/[Pp]ackages/* 717 | # except build/, which is used as an MSBuild target. 718 | !**/[Pp]ackages/build/ 719 | # Uncomment if necessary however generally it will be regenerated when needed 720 | #!**/[Pp]ackages/repositories.config 721 | # NuGet v3's project.json files produces more ignorable files 722 | *.nuget.props 723 | *.nuget.targets 724 | 725 | # Microsoft Azure Build Output 726 | csx/ 727 | *.build.csdef 728 | 729 | # Microsoft Azure Emulator 730 | ecf/ 731 | rcf/ 732 | 733 | # Windows Store app package directories and files 734 | AppPackages/ 735 | BundleArtifacts/ 736 | Package.StoreAssociation.xml 737 | _pkginfo.txt 738 | *.appx 739 | *.appxbundle 740 | *.appxupload 741 | 742 | # Visual Studio cache files 743 | # files ending in .cache can be ignored 744 | *.[Cc]ache 745 | # but keep track of directories ending in .cache 746 | !?*.[Cc]ache/ 747 | 748 | # Others 749 | ClientBin/ 750 | ~$* 751 | *.dbmdl 752 | *.dbproj.schemaview 753 | *.jfm 754 | *.pfx 755 | *.publishsettings 756 | orleans.codegen.cs 757 | 758 | # Including strong name files can present a security risk 759 | # (https://github.com/github/gitignore/pull/2483#issue-259490424) 760 | #*.snk 761 | 762 | # Since there are multiple workflows, uncomment next line to ignore bower_components 763 | # (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) 764 | #bower_components/ 765 | 766 | # RIA/Silverlight projects 767 | Generated_Code/ 768 | 769 | # Backup & report files from converting an old project file 770 | # to a newer Visual Studio version. Backup files are not needed, 771 | # because we have git ;-) 772 | _UpgradeReport_Files/ 773 | Backup*/ 774 | UpgradeLog*.XML 775 | UpgradeLog*.htm 776 | ServiceFabricBackup/ 777 | *.rptproj.bak 778 | 779 | # SQL Server files 780 | *.mdf 781 | *.ldf 782 | *.ndf 783 | 784 | # Business Intelligence projects 785 | *.rdl.data 786 | *.bim.layout 787 | *.bim_*.settings 788 | *.rptproj.rsuser 789 | *- [Bb]ackup.rdl 790 | *- [Bb]ackup ([0-9]).rdl 791 | *- [Bb]ackup ([0-9][0-9]).rdl 792 | 793 | # Microsoft Fakes 794 | FakesAssemblies/ 795 | 796 | # GhostDoc plugin setting file 797 | *.GhostDoc.xml 798 | 799 | # Node.js Tools for Visual Studio 800 | .ntvs_analysis.dat 801 | node_modules/ 802 | 803 | # Visual Studio 6 build log 804 | *.plg 805 | 806 | # Visual Studio 6 workspace options file 807 | *.opt 808 | 809 | # Visual Studio 6 auto-generated workspace file (contains which files were open etc.) 810 | *.vbw 811 | 812 | # Visual Studio LightSwitch build output 813 | **/*.HTMLClient/GeneratedArtifacts 814 | **/*.DesktopClient/GeneratedArtifacts 815 | **/*.DesktopClient/ModelManifest.xml 816 | **/*.Server/GeneratedArtifacts 817 | **/*.Server/ModelManifest.xml 818 | _Pvt_Extensions 819 | 820 | # Paket dependency manager 821 | .paket/paket.exe 822 | paket-files/ 823 | 824 | # FAKE - F# Make 825 | .fake/ 826 | 827 | # CodeRush personal settings 828 | .cr/personal 829 | 830 | # Python Tools for Visual Studio (PTVS) 831 | __pycache__/ 832 | *.pyc 833 | 834 | # Cake - Uncomment if you are using it 835 | # tools/** 836 | # !tools/packages.config 837 | 838 | # Tabs Studio 839 | *.tss 840 | 841 | # Telerik's JustMock configuration file 842 | *.jmconfig 843 | 844 | # BizTalk build output 845 | *.btp.cs 846 | *.btm.cs 847 | *.odx.cs 848 | *.xsd.cs 849 | 850 | # OpenCover UI analysis results 851 | OpenCover/ 852 | 853 | # Azure Stream Analytics local run output 854 | ASALocalRun/ 855 | 856 | # MSBuild Binary and Structured Log 857 | *.binlog 858 | 859 | # NVidia Nsight GPU debugger configuration file 860 | *.nvuser 861 | 862 | # MFractors (Xamarin productivity tool) working folder 863 | .mfractor/ 864 | 865 | # Local History for Visual Studio 866 | .localhistory/ 867 | 868 | # BeatPulse healthcheck temp database 869 | healthchecksdb 870 | 871 | # Backup folder for Package Reference Convert tool in Visual Studio 2017 872 | MigrationBackup/ 873 | 874 | # End of https://www.gitignore.io/api/c,git,c++,cmake,linux,clion,macos,windows,eclipse,clion+all,clion+iml,qtcreator,executable,codeblocks,sublimetext,visualstudio,visualstudiocode -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # leetcode-hero 2 | Abstract data types and algorithmic techniques to solve programming interview problems 3 | 4 | ## Topics 5 | 6 | - [Manipulação de bits](https://dev.to/thiagocesarm/manipulacao-de-bits-para-resolucao-de-questoes-de-entrevistas-de-programacao-1kjp) 7 | - Algoritmos gulosos: [Medium](https://medium.com/@alvarofpp/algoritmos-gulosos-937390bb1137), [jupyter notebook](greedy/greedy-algorithms.ipynb). 8 | - [Segment Tree](https://dev.to/curingartur/segment-tree-3hpe) 9 | - [Ordenação topológica]: [Medium](https://medium.com/@mateussfcosta/ordena%C3%A7%C3%A3o-topol%C3%B3gica-para-resolu%C3%A7%C3%A3o-de-quest%C3%B5es-de-entrevistas-de-programa%C3%A7%C3%A3o-23563fbfc80b) - [Jupyter Notebok](topological_sort.ipynb) 10 | - [Fila de prioridade](priority-queue/README.md) 11 | - Programação dinâmica: [Medium](https://medium.com/@andersonsmed/programa%C3%A7%C3%A3o-din%C3%A2mica-c27598898165), [Notebook](dynamic-programming/dynamic-programming.ipynb) -------------------------------------------------------------------------------- /dynamic-programming/dynamic-programming.ipynb: -------------------------------------------------------------------------------- 1 | { 2 | "nbformat": 4, 3 | "nbformat_minor": 0, 4 | "metadata": { 5 | "colab": { 6 | "name": "ProgramaçãoDinâmica.ipynb", 7 | "provenance": [], 8 | "collapsed_sections": [], 9 | "include_colab_link": true 10 | }, 11 | "kernelspec": { 12 | "name": "python3", 13 | "display_name": "Python 3" 14 | } 15 | }, 16 | "cells": [ 17 | { 18 | "cell_type": "markdown", 19 | "metadata": { 20 | "id": "view-in-github", 21 | "colab_type": "text" 22 | }, 23 | "source": [ 24 | "\"Open" 25 | ] 26 | }, 27 | { 28 | "cell_type": "markdown", 29 | "metadata": { 30 | "id": "lKPOujAnk9js", 31 | "colab_type": "text" 32 | }, 33 | "source": [ 34 | "# Programação Dinâmica\n", 35 | "\n", 36 | "Programação dinâmica pode ser descrita como recursão com o apoio de uma tabela. Mais precisamente, ao invés de resolver os subproblemas recursivamente, esses subproblemas são resolvidos sequencialmente e as suas soluções são armazenadas em uma tabela.\n", 37 | "\n", 38 | "O truque para esse tipo de resolução é resolver os problemas na ordem certa, assim, sempre que você precisar de uma solução para um subproblema, ele já estará disponível na tabela.\n", 39 | "\n", 40 | "A utilidade da programação dinâmica é em problemas que a divisão e conquista produz um número exponencial de subproblemas e na verdade o que ocorre é a repetição de um pequeno número de subproblemas com frequência. Logo, nessas situações, calcula-se cada solução na primeira vez e as armazena em uma tabela para uso futuro, em vez sempre recalcular as soluções recursivamente quando for necessário.\n", 41 | "\n", 42 | "Enquanto a divisão e conquista é top-down, a programação dinâmica é bottom-up. Em resumo, com PD resolve-se os problemas de pequena\n", 43 | "dimensão e guarda-se as soluções. A solução de um problema é\n", 44 | "obtida combinando as de problemas de menor dimensão. " 45 | ] 46 | }, 47 | { 48 | "cell_type": "markdown", 49 | "metadata": { 50 | "id": "Mf6jUayY69KK", 51 | "colab_type": "text" 52 | }, 53 | "source": [ 54 | "-----------------------" 55 | ] 56 | }, 57 | { 58 | "cell_type": "markdown", 59 | "metadata": { 60 | "id": "13lYtLO9nnJx", 61 | "colab_type": "text" 62 | }, 63 | "source": [ 64 | "Para exemplificar, vamos a um exemplo básico:" 65 | ] 66 | }, 67 | { 68 | "cell_type": "code", 69 | "metadata": { 70 | "id": "gnit9uI_UPAT", 71 | "colab_type": "code", 72 | "colab": {} 73 | }, 74 | "source": [ 75 | "def fibonacci (numero):\n", 76 | " \n", 77 | " if numero <= 1:\n", 78 | " return numero\n", 79 | " else:\n", 80 | " return fibonacci(numero - 1) + fibonacci(numero - 2)" 81 | ], 82 | "execution_count": 0, 83 | "outputs": [] 84 | }, 85 | { 86 | "cell_type": "markdown", 87 | "metadata": { 88 | "id": "tazzPwzkohj0", 89 | "colab_type": "text" 90 | }, 91 | "source": [ 92 | "Acima nós temos uma implementação clássica do algoritmo de fibonacci, onde você calcula o fibonacci de um número através do fibonacci dos dois números anteriores a ele. Agora vamos a uma implementação com programação dinâmica." 93 | ] 94 | }, 95 | { 96 | "cell_type": "code", 97 | "metadata": { 98 | "id": "qjFFL2e1owQx", 99 | "colab_type": "code", 100 | "colab": {} 101 | }, 102 | "source": [ 103 | "def fibonacci_pd (numero):\n", 104 | "\n", 105 | " # Aqui nós definimos nossa estrutura, que trabalhará como uma \"memória\" com o fibonacci dos números já computados\n", 106 | " fib = [0, 1]\n", 107 | "\n", 108 | " for temp_num in range(2, numero + 1):\n", 109 | " \n", 110 | " fib.append(fib[temp_num - 1] + fib[temp_num - 2])\n", 111 | "\n", 112 | " return fib[numero]" 113 | ], 114 | "execution_count": 0, 115 | "outputs": [] 116 | }, 117 | { 118 | "cell_type": "markdown", 119 | "metadata": { 120 | "id": "rP9pazHOpZdN", 121 | "colab_type": "text" 122 | }, 123 | "source": [ 124 | "Agora vamos medir o tempo em que cada uma de nossas funções demora para calcular o fibonacci do número 40" 125 | ] 126 | }, 127 | { 128 | "cell_type": "code", 129 | "metadata": { 130 | "id": "ws97zybgpqC_", 131 | "colab_type": "code", 132 | "outputId": "47220d2c-aaba-4488-e192-13faa79867a1", 133 | "colab": { 134 | "base_uri": "https://localhost:8080/", 135 | "height": 34 136 | } 137 | }, 138 | "source": [ 139 | "import time\n", 140 | "\n", 141 | "start_time = time.clock()\n", 142 | "fibonacci(40)\n", 143 | "print(\"{} segundos\".format(time.clock() - start_time))" 144 | ], 145 | "execution_count": 0, 146 | "outputs": [ 147 | { 148 | "output_type": "stream", 149 | "text": [ 150 | "35.759142999999995 segundos\n" 151 | ], 152 | "name": "stdout" 153 | } 154 | ] 155 | }, 156 | { 157 | "cell_type": "code", 158 | "metadata": { 159 | "id": "-nhCIMm1t3aq", 160 | "colab_type": "code", 161 | "outputId": "4adbde32-485e-42d9-a8bb-5c1f3ba238d6", 162 | "colab": { 163 | "base_uri": "https://localhost:8080/", 164 | "height": 34 165 | } 166 | }, 167 | "source": [ 168 | "start_time = time.clock()\n", 169 | "fibonacci_pd(40)\n", 170 | "print(\"{} segundos\".format(time.clock() - start_time))" 171 | ], 172 | "execution_count": 0, 173 | "outputs": [ 174 | { 175 | "output_type": "stream", 176 | "text": [ 177 | "0.00013999999987390765 segundos\n" 178 | ], 179 | "name": "stdout" 180 | } 181 | ] 182 | }, 183 | { 184 | "cell_type": "markdown", 185 | "metadata": { 186 | "id": "94mAV71AvJZO", 187 | "colab_type": "text" 188 | }, 189 | "source": [ 190 | "![image.png](data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAA3QAAAJrCAIAAAAnBUYWAAAgAElEQVR4Aey9C3gcxZnvXS1Z8mXGNpZBI5PYwRoZQhIkkUB2NeLsCZtIyvfA5pMsOLmsLJGF8x1pvEC+RRLBm7MYNiS7lpyHbKJL9oEksr0fyWYtOc8CwdImkBx72BzYYIlsuM0Yjp3YIwHyrUfWxdJ8T3dJ7dJ0z0x3T/dMX/7ai0vVVW9V/d5m9E51/+vlJicnCX5AAARAAARAAARAAARAwAgCeUYYgQ0QAAEQAAEQAAEQAAEQEAgguMR9AAIgAAIgAAIgAAIgYBgBBJeGoYQhEAABEAABEAABEAABBJe4B0AABEAABEAABEAABAwjgODSMJQwBAIgAAIgAAIgAAIggOAS9wAIgAAIgAAIgAAIgIBhBFYYZgmGQAAEQAAEnE4gFAodO3bs+PHj0Wh0fHxcWq7f7/d6vdXV1VVVVSUlJVI9CiAAAi4kwOGcSxd6HUsGARAAAU0EotHovn37RkZG1PTy+XwtLS01NTVqGqMNCICA8wgguHSeT7EiEAABEDCMAM/z+/btGxoaSrAYj8cJIRzH0YJ0leM4Wvb5fMFgMBAISJdQAAEQcAkBBJcucTSWCQIgAAKaCYTD4fb29lgsRgiJx+M0cPT5fIFAwOfz+f1+ajEWi0XEn1AoxLYkhNTU1HR2dmoeGB1AAATsTADBpZ29h7mDAAiAgGkEhoeHu7q62GBxx44dgUCgrKwsxZhHjx7dv39/JBKR2vj9/u7ubq/XK9WgAAIg4GwCCC6d7V+sDgRAAAT0EBgcHOzr65Miy9ra2h07dqhX6hw+fHj//v2S4sfn8/X39yO+1OMJ9AEBGxJAcGlDp2HKIAACIGAmAWnPkg7S0dFRW1urdUCe59vb28PhMH2Yjv1LrQDRHgTsSwDnXNrXd5g5CIAACBhPIBwO9/b2Ursej6evr09HZEkI8Xq9/f39dXV1VPETiUQks8ZPGhZBAASsRADBpZW8gbmAAAiAQK4J7N69OxaL0YjwkUceSf2GZdrJdnR0VFZW0mYjIyPDw8Npu6ABCICA3QkguLS7BzF/EAABEDCMwODgIH1RkuO4tra2ioqKzE3v3r3b7/fTaLW3t5fn+cxtwgIIgICVCSC4tLJ3MDcQAAEQyB4BeqQlFfFUVFRs377dkLG9Xm9rayt98zIWix08eNAQszACAiBgWQIILi3rGkwMBEAABLJKYHh4mB5pyXHcjh07DBy7srJS2gSVn8du4EAwBQIgYAUCyC1uBS9gDiAAAiCQewL0hch4PM7GgsrTmh19rL79hTn2ov/+H/ffXsTWLCs3NTWNjo4SQmKxWCgUQuaeZXTwCwg4iwB2Lp3lT6wGBEAABHQR4HleOvlcnzw89bCVlZU+n4+2OXLkSOrGuAoCIGBrAti5tLX7MHkQAAEQMIYAm7mxurpanVF/2z/sDmygbQuLkm9b0hbV1dWDg4OEkLGxMXX20QoEQMCWBLBzaUu3YdIgAAIgYCyB06dPE0I4jvP7/R6PR53xgg2bS5Z+igrT9QkEAlQzLmXuSdcD10EABGxJAMGlLd2GSYMACICAsQToCUHxeFxLksbI/ocfevixxwePnphVNxuqGSeERKNRdT3QCgRAwH4EEFzaz2eYMQiAAAgYTuD48ePUZnl5uWrjcyfHXg698Ezf7rubul5Ke3ylJBgnhGDzUjVkNAQB+xFAcGk/n2HGIAACIJBjAoXX3//9/fuffLKve9fd4kuXZ4a7ngir3L7M8dwxPAiAgNkEIOgxmzDsgwAIgICdCNCjLtPNuNBbUuIlhGzZUnZ9SbTpvmfOnBkbmyRlJek64joIgIDzCWDn0vk+xgpBAARAIC2B0tJS2kY6kChtl6UGBWmlPLQlPeeSlqVjiZaM4F8QAAHnEEBw6RxfYiUgAAIgoJsA1fFwHKcq9zd/4rUTk7OzZJY/cfSJ7qEzhJAN5denOYuI53mqFieElJRgj1O3r9ARBKxOAI/Fre4hzA8EQAAEskBg06ZNNKt4JBIZHx9PvbN44ke77vvxODsrz6fub74+zQ7m2NgYVYsXFxezfVEGARBwGAHsXDrMoVgOCIAACOghQPMxchwXj8fZ59dKtvgzsxt8ngJ6ybO5/Lb7/+HAX1en2bck5OjRo7QLcj8qUUUdCDiHAHYuneNLrAQEQAAEdBPwer3l5eU0d87w8HDKDJDeiuB3DgS1DTU6OiodP3TjjTdq64zWIAACtiKAnUtbuQuTBQEQAAHTCEhZH0fFH2PH2b9/P33h0uPxYOfSWLawBgJWI4Dg0moewXxAAARAIDcEamtrr7zySvpkvKury8BJHD16VHrU3tDQYKBlmAIBELAgAQSXFnQKpgQCIAACOSAwNjZ24cIFmmE8Go3u27fPkEnEYrGurq54PE7D1uPHjyP3oyFgYQQELEuAm5yctOzkMDEQAAEQAIEsEIhGo93d3XRzkUaBdNCOjo6UL1+mn1osFnvggQcSzs70eDwtLS3YwkyPDy1AwJ4EEFza02+YNQiAAAgYRGBoaGhgYEBKzBOPxwsLC+fm5gghHo+no6NDehdT64B0z/LIkSP0BKJVq1ZNT09LRioqKtrb23HgpQQEBRBwDIH8Bx980DGLwUJAAARAAATUE4hGo7t373766adpKEkIKS4ufvTRRz/zmc8MDw8TQubm5l544QWv13v99derN0tbjo+PP/TQQ3Q3lOO48vLy7373uzMzM6+//rrUYHh4eG5urqKiQqtxtAcBELAyAexcWtk7mBsIgAAImEVg//79CW9VNjU1NTY20lQ9w8PDrKanoqKira3N7/ernM2+ffsGBwel3dDS0tK9e/dSy+FwuKur6/jx45Ipv9/f3t5eVlYm1aAAAiBgawIILm3tPkweBEAABDQTCIfD3d3d7HuQpaWlHR0dCeFdKBTas2dPLBaT3sKsra0NBAIpnpKPj4+Pjo7u27dPOtKSEFJVVdXZ2UkjS2muAwMDBw4ckH4lhDQ3Nzc0NCQ0YxugDAIgYBcCCC7t4inMEwRAAAQyJcDz/L59+4aGhlhDTU1NLS0tbI1UDofDDz/88MTEBM0MSV+d9Hg81dXVPp/P6/X6/X6e52mcGgqFIpEIPcyStiSE1NfX79y5UzLIFsLhcF9fHz22ndb7fL6Ojg48JWcpoQwCdiSA4NKOXsOcQQAEQEAzgdHR0a6uLnZPsby8vKOjI7Wkhuf5gwcPDg0NSc+4pYFpHEl/pccM0WOMaE15eXlzc3PaSHFwcHDfvn2s8YaGhubmZmxhSpxRAAHbEUBwaTuXYcIgAAIgoI2AfMPS4/E0Nzdv375dpSGe5wcGBkKhEN3FTN1LZVgpGYlGo11dXQlbmMFgEIl8JEQogIC9CCC4tJe/MFsQAAEQ0EZAenVS6lZVVRUMBlNvWEqNEwrhcPjo0aM0EIxGozTWLC0t9Xq9Pp+vsrIyEAjo23SUzzMQCHR0dOizljBt/AoCIJBNAggus0kbY4EACIBA9gjwPN/V1RUKhaQhPR5PZ2enZXcEeZ7fs2fPiy++yE54586dNTU1Ug0KIAAC1ieA4NL6PsIMQQAEQEAzgYSj0ZOptjXbNb9DKBTq6elhn7/juHXzqWMEEDCSAIJLI2nCFgiAAAjknACby5FOpri4uLOzM622JuczlyZAX/E8dOiQVIOMkRIKFEDA+gQQXFrfR5ghCIAACKglIN+wrK+vb2lpseObi6Ojo3v27EnYwmxtbU04j1MtGrQDARDIFgEEl9kijXFAAARAwEwCikejB4NBUzYsp494tn6ucIZdz8dir/1q1sfWGFNWPG59x44dxliHFRAAARMIILg0ASpMggAIgEB2CSjmckx2NLoBU8ticEkIUcwY2dbWZkrcbAAdmAABtxNAcOn2OwDrBwEQsDUB+dHoirkcDV7jYnD5sanDB+YWdytXLmwxYd+SmffAwEDCWe44bp3BgyIIWIgAgksLOQNTAQEQAAH1BDI/Gl39WIktF4PLm/i3h+fWJ14073fF49aRMdI84LAMAvoIILjUxw29QAAEQCCXBOQblmpyORo248XgcuV8dfV88ZZL21tnbrvWMOPpDMkzRtbU1ASDQTuKltKtFddBwJYEEFza0m2YNAiAgGsJKB6NHgwGa2trs8dE9s7lwhd/cr7n0/FszUDxuHUrnw+fLTAYBwQsQQDBpSXcgEmAAAiAgBoC8hyJVVVVnZ2dWd+0m+ZOTHDT09zEb1f071rz7AQhxTO/PDZ1wyo1qzCqjZxGIBBoa2vTl9nSqFnBDgiAAIJL3AMgAAIgYAMC8qPRrZLLcfqlNZV1KyfI/GPHzrdtyTJKnud7e3tHRkakcXHcuoQCBRDIFQEEl7kij3FBAARAQC0BSx+NPv3q6sr/uipHwSUlqHjcent7O7Yw1d5haAcChhJAcGkoThgDARAAAUMJyDcsLZHL8dyb+ePr57f4yMybBX9/j7f/t8Jj8cPHpm7O6mNxlrRixsjGxkYct85SQhkEskMAwWV2OGMUEAABENBMQPFo9MbGxqy/YZk487xHKtZ/+yRbu9Cw//yTt2VN0MMOzZYVj1tvb29HxkiWEsogYDYBBJdmE4Z9EAABENBMQDGXY0dHhzWCpHMrdt255v97Nf+8kP9xYVv1XOvfXPzyzTmPLCXKihkjGxoach6USzNEAQScTQDBpbP9i9WBAAjYjID8aHRCSFNTk4m5HG1GSNV0w+FwX1/f2NiY1Nrn8+G4dYkGCiBgKgEEl6bihXEQAAEQ0EAgx0eja5ipPZrKj1tHxkh7eA6ztDkBBJc2dyCmDwIg4AgC8g1Lj8fT3Ny8fft2R6wvZ4tQzBgZDAYDgUDO5oSBQcDpBBBcOt3DWB8IgIDlCcgPA6+qqgoGgzhJxyjXyQkHAoGOjg68hWkUYdgBAZYAgkuWBsogAAIgkFUCirkckcbQDB8oZozcuXNnTU2NGcPBJgi4mQCCSzd7H2sHARDIJQH50eg5yuWYSwhZHjsUCvX09ExMTEjjVlRU4Lh1iQYKIGAIAQSXhmCEERAAARDQQMCiR6NrWIGNmyoet97S0tLQ0GDjVWHqIGAlAggureQNzAUEQMAFBOQblvX19S0tLXj/L5vOV8wY2draao2TRLNJAmOBgPEEEFwazxQWQQAEQECRgOLR6MFgsKKiQrE9Ks0moHjcOjJGmo0d9h1PAMGl412MBYIACFiCgGIuRxyNnnPfKGaMbGtrQ8Sfc9dgAvYlgODSvr7DzEEABOxBQH40emlpqWVyOdqDodmzHBgYGBoaisVi0kA4bl1CgQIIaCWA4FIrMbQHARAAAbUEcDS6WlIWaKd43DoyRlrAM5iC/QgguLSfzzBjEAABWxCQb1iWl5d3dHTgaHQru0+eMbKmpiYYDEJuZWWvYW5WI4Dg0moewXxAAARsT0DxaPRgMFhbW2v7tblgAYrHreNkexd4Hks0jACCS8NQwhAIgAAIEELkmQZxNLodbwy5HwOBQFtbGzae7ehNzDnLBBBcZhk4hgMBEHAsAfnR6B6PBzte9vU3z/O9vb0jIyPSEjweD45bl2igAALJCCC4TEYG9SAAAiCggQCORtcAy1ZNFY9bR8ZIW/kQk802AQSX2SaO8UAABBxGQL5hWVxc3NnZiYMSHeNoxYyRjY2NOG7dMS7GQowlgODSWJ6wBgIg4C4CikejNzY2QlzsvPtA8bj19vZ2ZIx0nq+xogwJILjMECC6gwAIuJSAYi5HHI3u+LtBMWNkQ0MDvk443vVYoHoCCC7Vs0JLEAABEBAIyI9GJ4Q0NTUhl6NL7o9wONzX1zc2Niat1+fz4bh1iQYKIIDgEvcACIAACGgggKPRNcBydFP5cevIGOloh2NxGggguNQAC01BAATcTEC+YenxeJqbm7dv3+5mLG5eu2LGyGAwGAgE3IwFawcBBJe4B0AABEAgPQH5kdpVVVXBYBBHaqdn5/QW8nsjEAh0dHTgLUynex7rS0oAwWVSNLgAAiAAAvQNy66urlAoJNHA0egSChQoAcWMkTt37qypqQEiEHAhAQSXLnQ6lgwCIKCWgPxodORyVMvOfe1CoVBPT8/ExIS09IqKChy3LtFAwT0EEFy6x9dYKQiAgAYCOBpdAyw0XSKgeNw6MkYu4cG/biGA4NItnsY6QQAE1BOQb1jW19e3tLTgLTr1DN3cUjFjZGtrK45bd/Nd4aq1I7h0lbuxWBAAgTQEFI9GDwaDyOWYBhwuywgoHreOjJEyTqhwIAEElw50KpYEAiCgj4BiLkccja4PJnoRQhQzRra1teG7Cm4PZxNAcOls/2J1IAACqgjIj0YvLS1FLkdV7NAoHYGBgYGhoaFYLCY1xHHrEgoUHEkAwaUj3YpFgQAIqCWAo9HVkkK7DAgoHreOjJEZEEVXSxNAcGlp92ByIAACphKQb1iWl5d3dHTgaHRTsbvWuDxjZE1NTTAYhFDMtbeEUxeO4NKpnsW6QAAEUhHgeV5+NHowGKytrU3VDddAIDMCisetd3Z2ImNkZlzR21oEEFxayx+YDQiAQBYIyPP14Wj0LGDHEBIB+R0YCATa2tqwZS4hQsHWBBBc2tp9mDwIgIA2AvKj0ZHLURtBtDaIAM/zvb29IyMjkj2Px4Pj1iUaKNiaAIJLW7sPkwcBENBAAEeja4CFplkhoHjcOjJGZoU9BjGRAIJLE+HCNAiAgEUIyDcsi4uLOzs7cdygRRzk5mkoZoxsbGzEcetuvivsvnYEl3b3IOYPAiCQhoDi0eiNjY2Q6KYBh8tZJKB43Hp7ezsyRmbRCRjKMAIILg1DCUMgAAJWI6CYyxFHo1vNTZiPREAxY2RDQwO+CEmIULAFAQSXtnATJgkCIKCNgPxodEJIU1MTcjlq44jWWScQDof7+vrGxsakkX0+H45bl2igYAsCCC5t4SZMEgRAQAMBHI2uARaaWpKA/Lh1ZIy0pKMwKWUCCC6VuaAWBEDAjgTkG5Yej6e5uXn79u12XA7m7GYCihkjg8Egjlt3811hl7UjuLSLpzBPEACBNATkB1NXVVUFg0EcTJ0GHC5bmID8rg4EAh0dHXgL08JOw9QIgkvcBCAAArYnoJjLESn1bO9XLEAkoJgxcufOnTU1NSAEAtYkgODSmn7BrEAABNQSkB+NjlyOatmhnX0IhEKhnp6eiYkJacoVFRU4bl2igYKlCCC4tJQ7MBkQAAENBHA0ugZYaGp/AorHrSNjpP0d68AVILh0oFOxJBBwAwH5hmV9fX1LSwveRXOD9928RsWMka2trThu3c13hdXWjuDSah7BfEAABNIQUDwaPRgMIpdjGnC47CACisetI2Okgzxs76UguLS3/zB7EHAbAcVcjjga3W23AdZLCFHMGNnW1oZvWbg9ck4AwWXOXYAJgAAIqCIgPxq9tLQUuRxVsUMj5xIYGBgYGhqKxWLSEnHcuoQChVwRQHCZK/IYFwRAQC0BHI2ulhTauZKA4nHryBjpynvBKotGcGkVT2AeIAACigTkG5bl5eUdHR04Gl0RFypdS0CeMbKmpiYYDELi5tpbIocLR3CZQ/gYGgRAIBUBxaPRg8FgbW1tqm64BgJuJaB43DqyCbj1dsjluhFc5pI+xgYBEEhGQJ71DkejJ2OFehBgCcj/2wkEAm1tbdjsZymhbCoBBJem4oVxEAABzQTkR6N7PB7svmjmiA4uJsDzfG9v78jIiMTA4/HguHWJBgpmE0BwaTZh2AcBENBAAEeja4CFpiCQkoDicevIGJmSGS4aQwDBpTEcYQUEQCBDAvINy+Li4s7OThzalyFYdHczAcWMkY2NjThu3c13RRbWjuAyC5AxBAiAQBoCikejNzY2QuiaBhwug4AKAorHrbe3tyNjpAp4aKKHAIJLPdTQBwRAwCgCirkccTS6UXhhBwQkAooZIxsaGvAVTkKEglEEEFwaRRJ2QAAEtBGQH41OCGlqakIuR20c0RoEVBMIh8N9fX1jY2NSD5/Ph+PWJRooGEUAwaVRJGEHBEBAAwEcja4BFpqCgKEE5MetI2OkoYBhjCC4xE0AAiCQVQLyDUuPx9Pc3Lx9+/aszgODgYCLCShmjAwGg4FAwMVUsHTDCCC4NAwlDIEACKQlID/euaqqKhgM4njntOjQAAQMJyD/7zEQCHR0dOAtTMNRu80ggku3eRzrBYHcEFDM5Yij0XPjDIwKAksEFDNG7ty5s6amZqkJ/gUBzQQQXGpGhg4gAAJaCciPRkcuR60M0R4EzCMQCoV6enomJiakISoqKnDcukQDBa0EEFxqJYb2IAACGgjgaHQNsNAUBHJHQPG4dWSMzJ1D7D0ygkt7+w+zBwErE5BvWNbX17e0tOCNLit7DXNzMwHFjJGtra04bt3Nd4WOtSO41AENXUAABNIQUDwaPRgMIpdjGnC4DAIWIKB43DoyRlrAM7aZAoJL27gKEwUBuxBQzOWIo9Ht4j7MEwQIIYoZI9va2vD9ELeHGgIILtVQQhsQAAFVBORHo5eWliKXoyp2aAQC1iMwMDAwNDQUi8WkqeG4dQkFCikIILhMAQeXQAAE1BLA0ehqSaEdCNiKgOJx68gYaSsf5mCyCC5zAB1DgoDDCMg3LMvLyzs6OnA0usMcjeW4loA8Y2RNTU0wGIQ4z7W3ROqFI7hMzQdXQQAEUhFQPBo9GAzW1tam6oZrIAACdiOgeNw68iDYzY1Zmi+CyyyBxjAg4DwC8txxOBrdeV7GikCAJSD/rz4QCLS1teExBUsJZQSXuAdAAAQ0E5Afje7xeLCHoZkjOoCADQnwPN/b2zsyMiLN3ePx4Lh1iQYKhBAEl7gNQAAEtBHA0ejaeKE1CDiRgOJx68gY6URX61kTgks91NAHBNxJQL5hWVxc3NnZiaPv3Hk/YNUuJ6CYMbKxsRHHrbv8xsDOJW4AEAABtQQUj0ZvbGyEXFQtQbQDAScSUDxuvb29HRkjnehttWvCzqVaUmgHAq4loJjLEUeju/Z+wMJBQE5AMWNkQ0MDvnzKWbmhBsGlG7yMNYKATgLyo9EJIU1NTcjlqBMouoGAcwmEw+G+vr6xsTFpiT6fD8etSzRcVUBw6Sp3Y7EgoIEAjkbXAAtNQQAERALy49aRMdKFtwaCSxc6HUsGgTQE5BuWHo+nubl5+/btaXriMgiAgOsJKGaMDAaDgUDA9WzcAgDBpVs8jXU6jADP82NjY5FIhBASDodjsVhxcfGmTZsIIX6/X/2HeCwW83g8LBz5IclVVVXBYBCHJLOUUAYBEEhNQP5JEggEOjo62LcwL168uHr16tR2pKunZy+Fzk7z8wuEkFcuTAufdasL1q3IJ4QE1q/etqZAaolCzgkguMy5CzABENBAgOf5kZGRY8eOhUKhFN08Hk9FRcUtt9xSU1OTohkhpL29fceOHfQsIcVcjjgaPTVAXAUBEEhGQDFj5M6dO+nnUjweb2pquu+++/7oj/4omQVCyOnZS/8yfmH0wkz44lyKZiWF+RXelf/XVWsrvYUpmuFSdggguMwOZ4wCAgYQGBkZ6enpicViCbbi8Tit4Tgu4VLqF+qHh4e7uroIIU8//fSzzz47MDDAGkcuxwSY+BUEQEAHgVAo1NPTMzExIfWtqKhob29/4YUXnnzySZ/P19/fz25nSs34+YWDE/wPTp2TaggRPu048X9oJf30Yz/6qtev+sstGzYVrmB6oZhtAggus00c44GADgLhcHj37t3j4+O0r/R56vf7PR5PSUmJz+eLRCI8z4+LPwlDVFRU7N69O+Hjm+f5pqYmGk2uX7/+3LnLn+A4Gj0BIH4FARDIhID8uPU1a9ZMTU1Rm4oHUDz3/tR3T07y8/Sbc5yQvDgX5+JE+F2ILwnhCP1azXFx4RfCxeMLUpTZWOy9d/OGTOaMvpkQQHCZCT30BYFsEGBfXYrH4xzHVVRUVFVVVVdXK74HGQ6HR0dHh4aGpGCUEOLz+Xbv3s0ea9zT03Po0CFpAdQyIaS+vr6lpSUhEpWaoQACIAAC+gjIM0ZSOx6Pp7+/n/00+87JMwcnePGqEFbSDUtxv5LGkYnjC7WL/5cnhZiVa1d+3X+lNz8vsTV+N58AgkvzGWMEEMiAgPTkWgorm5qaKisr1Zg8fPjw/v37o9Eo/Tbv8XikFyjD4XBbWxtrJB6Pl5aW7ty5E7kcWSwogwAIGEtAfty6oMgJBB555BFCCD+/8M233z96TtDrCE/A6fYkFxcehaf/oaHnYjxKCClbXfDgNRuh9UlPzugWiOiNJgp7IGAcASmyFB4BcVxbW1t3d7fKyJIQUldXd+DAgbq6OvFjOh6Lxfbs2RMOhwkhu3fvTpgmx3GVlZWILBOw4FcQAAFjCTQ2NsoNhkKhgwcPEkK+c+IMjSzFzzzhuTfHvmIp77msRghA49I+J4mHL879/TvvU4H5sob4xWQC2Lk0GTDMg4BeAuzmosfj2b17t/qwMmHMgwcP9vf3073PVatWrVy5kn3Dkm38xBNPfOhDH2JrUAYBEAABAwl8/etf/+Uvfyk3GI/Hr733q7/74HXiJU5U7qjcsFQ0xgnfyMkCIVzl2pWPX1ssb4Qa8whg59I8trAMAvoJRKPR9vZ2uuNICNm7d6/uyJIQ0tjY2N7eTh+OT09Pnz17VnFmxcXFdPNA8SoqQQAEQCBDAhMTE2fOnFE0Ev/YJ5YiS0ETzql9FK5oTPy0E/Y9hSDn2IWZ75xQHlSxMyozJwCtfuYMYQEEjCewb9++WCxG9xo7Ojr8fn+GY9TV1Y2NjR0+fJgTfwghxcXFgUDglltuoeeuQ8GTIWF0BwEQSEuguLh47969tBnN/jA+Pv6LX/xibGxs6rbPiw+14+LLlYL6O6211A04uvspHNAWP/guf0fJWpxPlJqYgVfxWNxAmDAFAsYQiEajO3bsoLZqa2s7OjqMsUtIa2trOBzmOG7dunUDAwMIKI0CCzsgAAKZEFm0cYgAACAASURBVDj0h8nHozHxhcnFg4UysSb1jRPhwTr9ll5btGbX1o3SJRRMJYDH4qbihXEQ0ENg3759tJvH45GiTD2GZH1aW1vpw/Hz58/jCbgMDypAAARyQ+CJd+mZl0ZGluJRmML2J8cJoc7w5NRbU6ly/ORm5Q4dFcGlQx2LZdmWAE3wSKe/fft29uy3zNdE9eD0DPYXX3wxc4OwAAIgAAIZEjhyblo8LF08L30x3ViGJtnucUIW6Ifec+/RszPZqyibQgDvXJqCFUZBQDeBsbExqS89RUj6NXlh9rXev7hvaJz423/cX1eUvB0hpLa2dnR0lBASiUSi0aixwWvKkXERBEAABBQI/GpSSGlLQ0v6aEWhkVDFXVN23U+vSUgdPnfg31/v4lPEpJx4Xqbw5uXRcxfvJUjbk4SuodXYuTQUJ4yBQMYEjhw5Qm34/X6fz6fGHj/67YeHFjNDpm0fCAQkEXooFErbHg1AAARAwFQCY/yM+Ag7L52IJ07mFoSmws/C+Xnx37nY0ekUkaXYhiNC4khCorPzp2cviVX4f+YSQHBpLl9YBwGtBI4fP067qD3PfPL5roeH1R+z4fV6JcvHjh3TOj20BwEQAAEDCZyevRSdpXEiTRyeyvY7/+fNT/7bWMW/jd387+PvCA1nD7xyMpQuXBTzjgvHGxFCRi/MphoA1wwigODSIJAwAwIGEYhEInRnsby8XIXJ6NOPdYVixHfTZhWNF5tIlmMx4WkUfkAABEAgVwTGZxekoYVTg9T8FK77209sKs8nY6+9/e3z6bYtRYNiYCmUTs9A06MGcaZtEFxmShD9QcAkAirOCZo98aPd3x6bI5sb7q/2aJpGyhebNFlCYxAAARDInICqGFEcpuCOii2fLSB/iJ588PSM2n1IUTWe+SxhQSUBBJcqQaEZCGSDQDQapcOoCf5mX3ti15MRUvDh+79xj19LbFlSUkKfELHioWwsD2OAAAiAwHIC4SkhPowLj8RVxZeFG67uXC+ELh8o2fyzP/3oE2WetcsNKv8WF3KUE0LeEodTboNa4wgguDSOJSyBQMYENGi3+ZdEFc/m2x755u0lhQn6ydQT4fnF8ziKi5FvNzUqXAUBEDCXQMnKxVNrOHUpeWZj7/3P/zz5t2+c/sl7c4Tk33zN1r+/SkUks/TAHUl6zHXnknUcRbREAv+CgJUI0J3F5DOafe3bj4kqnpPP7Gp4RmoX6f58TTcp/8Yze29OEW7yPE93RjXEstIQKIAACICAcQS8+UJoqOZZzeKYs7HDp8WXxU+eGfujj/zt2rybNq0ufDeW9vk4zdPjXaEiEjVuda61hODSta7Hwi1KwOPxUJ1NJBKRZN3yuc4WFvl8Xql+lh8/I3zeejb4vEUll+ulBmxBylrOVqIMAiAAArklEE93FtHy6c2/N7NA1uatLOBWEpIuuFT1zH25ffymnwCCS/3s0BMEzCDg9/vHxsY4jqOy8SRDFFZ0fP8Ac41//t6Gb7xO/G396Q5RFw7jGB2l+wSlpaWMDRRBAARAINsEKr2LT1niwmPxdCFgXsENa+Jv8JdmCXf1xpLOK4VtyLffm7uQctZizCrkGCeE3Lhudcq2uGgMAewPG8MRVkDAKAJSwHf06FGjbLJ2xsfHI5EIfex+4403spdQBgEQAIHsE/CvLhAPUU8fW67duPnAH3/kpc+Uj37mhp/deNVWQsjF97/+h6WD1ZNMnRO0QsJhl4SQstXYU0uCydBqBJeG4oQxEMiYgJTyMRaLmRFfHj16lL57RAih2XoynjIMgAAIgIB+ArdcIe4mxhc4cXMxhaG1ebNjF+cXY8m56Zd+//umX//h5XSHqMeFXUth27LCu5K+4pliCFwyhABCeEMwwggIGEagrKyMvnYZj8eHhoaqq6vVmPbe+p2RW9M3jMVig4OD9Jl4VVVV+g5oAQIgAAImE7jlijUDp88TIbTkuJRPxk+N/37H+O81TUdMLE5Tl3P/ZcMaTX3RWDcB7FzqRoeOIGAWgYaGBmp6VPwxcJiDBw9KR2k2NjYaaBmmQAAEQEAfgW1rCiq8K8Un4wvikZf6zCTpRQ8h4jhPPvfZjQguk1AyuhrBpdFEYQ8EMibQ2Njo8Xg4jovH4319fUYlaRwfH5e2LcvLy1NI0TNeAQyAAAiAgAYCX/7AFWJrjpC8lHuXGmwublcKPYRn4ncUr8UzcW34MmiN4DIDeOgKAuYQ8Hq9wWCQnv0WDod7e3szHycWiz388MNSnNrc3Jy5TVgAARAAAUMIVHoLA+tXiaYW0jwaVz2eKBKPi5El5yvMv9OnKpWPavNomIoAgstUdHANBHJFoLa2try8nI5++PDhvr6+DGfS1dUlnW1UX1+PbcsMeaI7CICAsQR2bd3oyRc13fG4ikOJ0gy+GFkKloTn4g9tvRLblmmQGXoZwaWhOGEMBIwj8Mgjj5SWlnLiz+DgYFdXlz7bsVistbX1yJEj9PihqqqqnTt36jOFXiAAAiBgEgFvft7j1/qE+FJ8IyiT+HJpz3Ixo+RXr9konaZp0uRhNoEAgssEIPgVBKxCwOv1fuELX6Czicfjhw8fbm1tlXYfVc5ydHT0z//8zyORCA1SOY5DZKkSHZqBAAhkmcC2NQX3bi5azAZJ9y+FIyo1/tDT2Je61RatgY5HI0EDmnOTk5MGmIEJEAABowmEw+H29nae5xc/apfs19bWNjc3+3y+pQrlf0dHR/fv3z86OiqdakkLfr+/u7vb602TIlLZKGpBAARAwGQCz70/9Z2Tk7F5+rpkHiELRMyuQ2XfKQYX40nhOCNuQTzUiJDGq7z3btmQogsumUQAwaVJYGEWBDIiEI1GW1tbJf3NVVdd9e677wqix3icnlLp9/tra2v9fj89F5MONj4+Ho1GQ6HQ0aNHx8fH2fZXX331qVOnaDPElxn5Bp1BAARMJvDW1Fzwtyfn8oXMPaIiJ+/yEUWLcePiDBY3KIVK4cORLCx+QhJCvnrNRuxZmuyopOYRXCZFgwsgkCsCPM+3t7dLT8CbmppaWloGBgaGhoZouEnfnkzY0UyYrRSGFhcXt7S01NbW7tmzZ2RkhDarqanp7OxM6IJfQQAEQMAKBMLhcNtfPXDp9i/GP7GURUL4RCOE5MlPWRcT8NAYdHFzkzv+Rt6/PrWz/rbt27dbYTkunAOCSxc6HUu2NIGEyJKNAnme7+3tlQJEaRlSHCnV0ILH42loaGhsbKQPwXmef+CBB44fP06vspYTOuJXEAABEMghgfb29tHRUULIytLrrrn/r397UZbhUUznKCT0Wf7jK8z3/vynJ54ZJIR4PJ4DBw7gFaDlhLL0W/6DDz6YpaEwDAiAgAoCjz322NjYGG2YEP8VFhZWV1dv3759y5Yt8Xj8zJkzc3Nz8v3L4uLiQCDQ0tLS0dFRWVlZWFhIrRUWFt56660vvfTSmTNnCCHHjx+Px+OVlZUqJoUmIAACIJAlAsPDw4ODQnRICPl/vvDfHviTT9Zd6dm0smBmIT4+O784CU4QlS+WCfGvLvjTDWv+6kNF/+ODV3z0yg3PPPMMIWRubm5yclJlBl3JFAqGEMDOpSEYYQQEjCHAPrkuLS3du3dv6q/dPM9LT8/pDNIeYMnzfFNTk/Q2Z0dHR21trTGzhxUQAAEQyIwA+wFVWlr6ve99L8He6dlL47MLUqUnj9u2hr6aKdWRnp6eQ4cO0d+7u7vTfipe7omSQQQQXBoEEmZAIGMC7AeimshS94BUh474UjdAdAQBEDCJAPsxqDsuZCNUv9/f399v0mxhNhkBnHOZjAzqQSCrBIaHh6Wv2h6PJ+2eZSaTKysr6+7u9ng81Ehvb284HM7EIPqCAAiAQOYEwuGw9DFYU1Oje8dRyqBLCIlEItJD9sxnCAsqCSC4VAkKzUDARALDw8NSAh6Px5OFcyjLyspo+nJCSCwWa29vR3xpooNhGgRAQAUBaYvR4/FIH1Aq+ik0YTPo7tu3jx4YrNAOVeYQQHBpDldYBQHVBMLhcEJkWVZWpqL3dN4jFRuKipb/74dXvzqtoq/QpLa2tqOjgzam8SU+f1WiQzMQAAHDCQwPD1OFOCGkublZ+XXz6TcLHmla++FN4ufeNevu2FVwIuknXltbG51kLBbr7e01fMIwmIIAgssUcHAJBEwnQF9/lIYJBoPqIktCyCqyftVShrOVCytFG+uq57askqylLdTW1jY1NdFmiC/T4kIDEAABkwjQc9ao8dLS0iTnU07nP/o577efXTExI7Y8n/+Lfm/trvwk4WVZWVl9fT21OTIyIkWuJi0BZlkCCC5ZGiiDQFYJRKPR9vZ23cKaha/8+uzk5JnJyTO/fFAUT26e/knPpfXaltDS0lJTU0P7RCIRKeGkNitoDQIgAAIZEBgYGJA+CZM/EF81f3/P9F2PXfjlsbOnXjv/2E3Ct+uJwZXJH9e0tLRIL5f39fVlMEF01UYAwaU2XmgNAkYR4Hl+9+7d0udpU1OTziOBxp/x/NmjK2bIpb0/uXizhm1LaSGdnZ1sfInnRxIZFEAABLJAQIOOx/fpi99qu3TDlvgq3/yX7hcPvZzh6D6m0kSh7FGiko06BJfZoIwxQCCBgDwNT0tLS0Ibdb+eKNxxT+F5Mt/w3dgXr1XXRaFVMBgsLS2lF0ZGRvbs2aPQCFUgAAIgYAIBnTqe8ZfFU9RvmNuW6ks1lD0meCy9SQSX6RmhBQgYTqCrq0s6/DwhDY+2sY7sWvOy8LU9f+gv1199jfeRI5dzVmgx5PV69+7dy8aXAwMDWgygLQiAAAjoIaBKx6NgeDq//6l8QuJ/ev+cT+EyWwVlD0sjO2UEl9nhjFFA4DKBPXv2hEIh+ntpaWnyF4wud0la2tYa++53Y4/9zcyfFhNyvuDbd3qeOZe0ccoLNL6U3k86cODA8PBwyh64CAIgAAIZEVCn41Ea4s1+zw8nCNk2841PL+kalZqJdVD2JEVj2gUEl6ahhWEQUCLQ09MzMjJCrxiQhsd3y9yXvjTb9pWpf/ll7GOEkJkVT72qNKyqOq/Xyx6u3tXVhfhSFTg0AgEQ0EVAnY5HZnr6pdV3PppPyHzrExevTfVMXOoJZY+EIjsFBJfZ4YxRQEAgYGYanvULxcJxRNy5GX1PxqmHkLwHdyoIgEB2CGjQ8Syb0HjBPXeuOknITY/xf3PDsivJf4GyJzkbU64guDQFK4yCgJyA8Wl4pk/kvzouDjSd9/NH1/xCePly/tOb0z4kks+NrUHyHpYGyiAAAiYR0KXjObdi1+e8z54n2+668JO2BVW7lovTh7LHJD8qmkVwqYgFlSBgMAG9aXhSTYP7+c51//V6MVPF1evv7M8nhGy+a+rL+jXj0mBI3iOhQAEEQMAMArp0PNP5j//Z2v63CCEL0896t9L8ZJvW7VL7LhCUPWa4UtEmgktFLKgEASMJZJCGJ9U0uJktlzavW9ynXLdt7q6953/1La2HqCcbAMl7kpFBPQiAQIYE9Op4Tqz4wW/p0HknJ5be/5nhppOk6JHNEsoeGRKzKrjJyUmzbMMuCIAAIdFotLW1VTosvaOjQ+dh6bmAuWfPHkl+5Pf7u7u7lRP+5mJuGBMEQMCmBHp6eg4dOkQn393dXVFRkbWF8Dzf1NREP5D9fr/0aD5rE3DJQNi5dImjsczcEDAsDU9upk+QvCdH4DEsCDiWgF4djzFAoOwxhmM6Kwgu0xHCdRDQS8C4NDx6Z2BEPyTvMYIibIAACCwSkDYLPR5PRqf86iUKZY9echr6IbjUAAtNQUATAcPS8Gga1ejGSN5jNFHYAwH3EtCl4zEeF5Q9xjNdbhHB5XIe+A0EDCJgZBoeg6ak2wyS9+hGh44gAAISAb06HsmAYQUoewxDmcQQgsskYFANAhkQMDgNTwYzMaorkvcYRRJ2QMC1BHTm4zGHF3L2mMN10SqCS1PxwrgbCZiZhieXPJG8J5f0MTYI2JxAbnU8cnhQ9siZGFiD4NJAmDAFAkKCx66uLgrC4/E47OweJO/BLQ4CIKCPQM51PPJpQ9kjZ2JUDYJLo0jCDggQM9LwWA0rkvdYzSOYDwhYn4BFdDxyUFD2yJkYUoPg0hCMMAICQmTZ3t4ugQgGg2VlZdKvTiogeY+TvIm1gIDZBKyj45GvFMoeORNDahBcGoIRRtxOIBqNtre32zQNjw7ntbS01NTU0I6RSKS9vZ3neR120AUEQMDxBCyl45HThrJHziTzGgSXmTOEBbcTsHsaHn3+Q/IefdzQCwRcRcBqOh45fCh75Ewyr0FwmTlDWHA1AWek4dHnQiTv0ccNvUDAPQQsqOORw4eyR84kwxoElxkCRHe3E3BGGh59XkTyHn3c0AsEXELAsjoeOX8oe+RMMqlBcJkJPfR1OwEnpeHR50sk79HHDb1AwPEErKzjkcOHskfOJJMaBJeZ0ENfVxNwXhoefe5E8h593NALBJxNwOI6Hjl8KHvkTHTXILjUjQ4dXU3AqWl49DkVyXv0cUMvEHAqAevreOTkoeyRM9Fdg+BSNzp0dC8BZ6fh0edXJO/Rxw29QMCRBGyh45GTh7JHzkRfDYJLfdzQy70E3JCGR593kbxHHzf0AgGHEbCRjkdOHsoeORMdNQgudUBDF/cScE8aHn0+RvIefdzQCwQcQ8BeOh45dih75Ex01CC41AENXVxKwG1pePS5Gcl79HFDLxBwBgHb6Xjk2KHskTPRWoPgUisxtHcpAXem4dHnbCTv0ccNvUDA7gTsqOORM4eyR85Eaw2CS63E0N6NBNychkefv5G8Rx839AIBWxOwqY5HzhzKHjkTTTUILjXhQmOXEnBzGh59LkfyHn3c0AsE7EvA1joeOXYoe+RM1NcguFTPCi1dSgBpePQ5Hsl79HFDLxCwIwG763jkzKHskTNRX4PgUj0rtHQjAaThycTrSN6TCT30BQEbEXCAjkdOG8oeOROVNQguVYJCMzcSQBqezL2O5D2ZM4QFELA4AWfoeOSQoeyRM1FZg+BSJSg0cx0BpOExyuVI3mMUSdgBAWsScIyOR44Xyh45EzU1CC7VUEIb1xFAGh5jXY7kPcbyhDUQsA4Bh+l45GCh7JEzSVuD4DItIjRwHQGk4THD5UjeYwZV2ASB3BJwno5HzhPKHjmTtDUILtMiQgN3EUAaHvP8jeQ95rGFZRDICQFH6njkJKHskTNJXYPgMjUfXHUXAaThMdvfSN5jNmHYB4GsEXCqjkcOEMoeOZPUNQguU/PBVRcRQBqe7DgbyXuywxmjgIDZBBys45Gjg7JHziRFDYLLFHBwyV0EkIYnO/5G8p7scMYoIGAqAcfreOT0oOyRM0lWg+AyGRnUu4sA0vBk099I3pNN2hgLBAwn4AYdjxwalD1yJslqEFwmI4N6FxFAGp7sOxvJe7LPHCOCgFEEXKLjkeOCskfORLEGwaUiFlS6iADS8OTK2UjekyvyGBcEMiHgHh2PnBKUPXImijUILhWxoNItBJCGJ7eeRvKe3PLH6CCgg4CrdDxyPlD2yJnIaxBcypmgxi0EkIbHCp5G8h4reAFzAAGVBFyo45GTgbJHziShBsFlAhD86hYCSMNjHU8jeY91fIGZgEAKAu7U8ciBQNkjZ5JQg+AyAQh+dQUBpOGxmpuRvMdqHsF8QEBOwLU6HjkKKHvkTNgaBJcsDZRdQQBpeKzpZiTvsaZfMCsQoATcrOOR3wNQ9siZsDUILlkaKDufANLwWNnHSN5jZe9gbi4n4HIdj9z7UPbImUg1CC4lFCi4ggDS8FjZzUjeY2XvYG5uJgAdj6L3oexRxEIIQXCZjAzqHUgAaXis71Qk77G+jzBDtxGAjieZx6HsSUYGwWUyMqh3GgGk4bGLR5G8xy6ewjxdQgA6nhSOhrJHEQ6CS0UsqHQaAaThsZdHkbzHXv7CbB1MADqe1M6FskeRD4JLRSyodBQBpOGxozuRvMeOXsOcnUcAOp60PoWyR44IwaWcCWocRQBpeOzrTiTvsa/vMHNnEICOR6UfoexJAIXgMgEIfnUUAaThsbs7kbzH7h7E/O1LADoe9b6DsieBFYLLBCD41TkEkIbHGb5E8h5n+BGrsB0B6Hg0uQzKHhYXgkuWBsrOIYA0PM7xJSFI3uMkb2IttiAAHY9WN0HZwxJDcMnSQNkhBJCGxyGOZJaB5D0MDBRBwHQC0PHoQAxljwQNwaWEAgXnEEAaHuf4cmklSN6zRAL/goDpBKDj0Y0Yyh6KDsGl7lsIHS1KAGl4LOqYjKeF5D0ZI4QBEEhPADqe9IySt4Cyh7JBcJn8HsEVGxJAGh4bOk3DlJG8RwMsNAUBXQSg49GF7XInKHuQW/zy3YCSAwggDY8DnJh2CUjekxYRGoCAbgLQ8ehGJ3WEsgfBpXQzoGB7AkjDY3sXql4AkveoRoWGIKCNAHQ82nglaQ1lDx6LJ7k1UG0rAkjDYyt3GTBZJO8xACJMgMByAtDxLOeR0W8uV/YguMzo7kFnKxBAGh4reCH7c0Dynuwzx4gOJgAdj7HOdbmyB8GlsbcTrGWbANLwZJu4lcZD8h4reQNzsTcB6HgM95+blT0ILg2/nWAwewSQhid7rK06EpL3WNUzmJedCEDHY4a33KzsQXBpxh0Fm9kggDQ82aBshzGQvMcOXsIcLU0AOh6T3ONaZQ+CS5PuKJg1nQDS8JiO2CYDyJP39PT02GTumCYI5J4AdDym+sCdyh4El6beVDBuFgGk4TGLrD3tJiTvOXTo0PDwsD2XglmDQFYJQMdjNm53KnsQXJp9X8G+8QSQhsd4pva3iOQ99vchVpADAtDxZAG6C5U9CC6zcF9hCCMJIA2PkTSdZSsheU9XV1c4HHbWErEaEDCSAHQ8RtJMbsuFyh4El8lvB1yxHgGk4bGeT6w1IzZ5DyGkvb0d8aW1PITZWIkAdDxZ84bblD0ILrN2a2GgTAkgDU+mBN3RX568JxqNumPpWCUIaCAAHY8GWEY0dZWyB8GlEbcMbJhPAGl4zGfsnBESkvfs3r2b53nnLA8rAYGMCUDHkzFCzQZcpexBcKn5/kCH7BNAGp7sM7f7iEjeY3cPYv6mEoCOx1S8yYy7R9mD4DLZPYB6qxBAGh6reMJu80hI3tPV1WW3FWC+IGAKAeh4TMGqwqh7lD0ILlXcDmiSOwJIw5M79k4YmU3eEwqF9uzZ44RVYQ0gkBkB6Hgy45dRb5coexBcZnSXoLPZBJCGx2zCzraP5D3O9i9Wp4MAdDw6oBnbxQ3KHgSXxt4zsGYkAaThMZKmW20heY9bPY91KxCAjkcBStar3KDsQXCZ9dsKA6ojgDQ86jihVXoCSN6TnhFauIMAdDwW8bPjlT0ILi1yp2EaywggDc8yHPglYwJI3pMxQhiwPQHoeKzjQscrexBcWudmw0wWCSAND24FMwggeY8ZVGHT4gRGR0dPnTpFJwkdj6Wcpajs4Xn+Zz/7maXmqW8y+Q8++KC+nugFAmYQCIfDu3btopY9Hk93d3dZWZkZA8GmCwn4/f6SkpJQKEQImZube+GFFz71qU95vV4XosCSXULg8OHDjz76KM/zExMTP/3pT+mq77nnnoqKCpcQsPIy/X7/M888Qz+OJicnz58//5WvfCUWi9XV1Vl52mrmhp1LNZTQxkQCp06disfjdACk4TERNEyLBFIk77l06dLMzAw4gYDzCAwNDT3++ON0XaWlpdu3b3feGu24IknZE4/Hh4eHv/Wtb9lxFYpzRnCpiAWV2SPQ39//2GOPxeNxpOHJHnR3j6SYvGdmZqalpeVHP/qRu9lg9U4jEIlE2CXF4/HPf/7zbA3KuSVwxx135Ofnc+IPnUmCy3I7Pd2jr9DdEx1BwBACL774IiHk0qVLp06disVi1GZTU1Ntba0h9mEEBOQEOjs7CSEjIyOEkEgk8nd/93dvv/32xMTEiy++2NLSIm+PGhCwKQHpQ5XOn+O4b37zm6+//vrdd9+9cuVKmy7KGdOOx+PPPfecfLcywWU2XSx2Lm3qOIdMe3R0lK7k6NGjx48fp8/Ha2pq8AfeIQ628DLY5D2//vWvJyYmaKDJ87yFZ42pgYABBIaGhoaHhw0wBBMZEHjnnXe+973vZWDA0l2xc2lp99hxclK8SCfv9/tTCCaOHDkirZHjuHg8fuutt9JdJakeBRAwgwA9XP2+++47efIka39sbCwQCLA1bPn07KXxmXmpxpOft21NgfQrCiCQTQL8/EJ4ao4dsXJt4mbkO++8wzYghJSXl7e1tUEomYAl+79u3br1n/7pn9gTnaU5RKPRkpIS6VdCyImp0xcXpqWajYVXXFm4QfrVggUElxZ0iv2mFAqFjhw5MjY2Nj4+rjj7QCBwyy233HDDDQn/wbz66qtse47jnn/++bvuuuvqq69m61EGATMIjI2NJUSWhJAjR44kBJenZy+Fzk7/r7NTxy4oy33KVhdUrF352Y1eBJpmuAk2WQKnZy+N8bO/mowdPXc51GAblBTmV1+x+uPrVlevX8Xz/Pnz56WrHo+nubkZah4JSM4LHo+ns7Ozrq5uz5499OEJndLRo0cbGxtPTJ0ePf/ab8787uTF04pT3bx6U/WVH7/Ws3XLmk2KDXJYyU1OTuZweAxtdwJDQ0Nsyoe0y6mpqWlubqYhJs/zDQ0Nil0GBgYQXyqSQaVRBH72s5/J33YihKxbt+7gwYN0lGP87A9PnVWKKYU3ODiOS5hMSWH+lz9wRV3RmoR6/AoCmRM4PXvph384d3hySmZK+W705nNlkVf/s39RgPzRj370q1/9asLXe5kpVOSGAM/zTz311D//8z/T4T/wya2+L257f/ZswmziJM6RxI8dQsh1a7d+btOnr/NuTWifw19xzmUO4dt76FAo9NBDD73wwgtzc8ueyyiuir5MyXHc8ePHh4aGOI7z+/3/+I//GA6Hx9AfxgAAIABJREFUE9oXFxc3NDTcdNNNBQV42pjABr8aSaC4uHh2dvbkyZMJN/DMzMx11113xaar9/6fyZ7fn43OCg/B43HhMz1+OZwUtJ10NuKHvfBGB8dx/Hz8yNmLx/gZ/+rCjQX5Rk4XtlxMgJ9feGr8wtci70Uu0g9bMcbIk4IM2d0ohCBkNk6iVxQvfDzAnZ288QO+b33rWyneUHIxXUssvbCw8BOf+EReXt7vJt666s/9hdVFF+eFnWnxS+zlGSZGlvSDiXDvz54Nvf+bE1OnS72b1+SvvtwhdyXsXOaOvZ1H7u3tHRoaoiugf1Z9Pl9A/CkRf+glnufD4XAkEhkZGaHHK9DGhJDi4mL2KQAhpKampq6uDkf72vm+sOXch4eHDx8+PDY2Js0+f4s/b+euKeEPtBhWcnnihzwhcUKWf7oLJ7SKf+I5IkSXZIEsxZzkq9ds/OxGbGFKUFHQSeD07KX/GX4vLIWVZOluFO1x9KYUy3GxzAmRp7S/tXiDfm7Dyr8qLdY5A3TLFoHQ5G9+8NbBuLivInhO+FhZ+ogRHpVcnof49UIIPYVPJI6LL33yrM5f1bHtHis8JUdwedlbKKkhwPN8V1cXzXFC21dUVDQ1NVVWVqbuzvN8X18fK1Gk25l5eXl33HHHl770JXyrTg0QV00lEI1Ge3t7Q6FQ/Kb/Mn/758lqjxhL5hGyIMaPSx/xySchftCLfwEWFrc4G4u992629Ev3yVeDK5Yg8NbU3P/75jg/H1+6G2k4oeJuFKfPCd0WA83q9ase2rrRm48jYizhWfkk/jX6i5+e+rnwhVZ0GQ0fF7+8yluzNUJT8dHKkq//4prGQNHH2SbZLyO4zD5ze4/Y2toqHfHq8Xg6Ojqqq6vVLykajXZ3dx87dow+VYzH43fddVdTU5N6C2gJAuYR+NpPh4988PqlDUtOfCaV/g85Ox/aWnqYVVe05qGtG9kGKIOASgJsZBkXNyzJUvSg0sLSDSxsdhJCylYXPPGRZRpklXbQzGwCT518+ufvCkc+ix8gNGUds1GZbnhx01p4iCK+niO0znl8iS8x6ZyG6wyBPXv2SJGl3+/v7+/XFFkSQkpKSrq7u2niVPqI/LnnnsPJggxjFHNG4K2puWMf+ogYWYpPmsTHUqp2Dpgpi5/vhOMWQ9LDk1PPvS9XYDAdUAQBJQL8/ALds1x6MCq8pbH8pQylbsvrhOeq4qsd9JFq+OLcN99+f3kT/JZ7AqHJ39DIUpyKsDmt/WOHo/cG9Tgh5PvvHHyDfzuHa4OgJ4fwbTb04ODgj3/8Yzppv9/f3d1dVFSkbw3V1dU+n4/m5onFYi+//PLtt9+uzxR6gYAhBPj5hf/+WpSfj9PvPNq2K5fPYOnzffHNtyNnL1auW11SCH3Pckz4LTkBfn7hK29MiGIy4RWLjO5G8YuSuIUp7IRFLs55V+R/xFOYfHBcySqBE1OnHw8P0D1L+khcEgtqn4fwsIWIb91yHHnl7O8+tu7a9QVrtdsxoAd2Lg2A6AYT0Wi0r6+PPi70+Xzd3d0ZviJZV1dXW1tLX7uMRCIDA8J/XfgBgVwR+Obb79M32zL8W07nL+wiiC9B0Tv8795+j59fyNXSMK7tCPxk/IKo4InHSZ4QF2a6ADFDBVkQn42T7548c3r2UqYm0d8gAj3HD4iRpagfXHxaot803cAUEpKQ+MX56R//4Rn9tjLrieAyM36u6U0jS2GznuMeeeSRDCNLiq2jo6OsrIz+9R0aGsLDcdfcTZZb6DF+dulIakP+lgsLFJWe9IyYeHR2/ifjFyy3bEzIkgT4+YWDE/RuEd6VZDXCGcyXftuh6mPygz+cy8AUuhpGIDT5G+EwS/FNSUl6lbF14csIfUr+xoW3c/VwHMFlxn50gYHR0VEqD4/H4zt27PD7/UYturW1VfxOHY/FYtLJ1UYZhx0QUEngh6eEw4rF7zkL4kNIlf3SNFt6Pi581h+cuIDNyzS8cFkk8A8nzizJw6mwwxgu9G7khHO1yPDk1FvL80YaMwasaCEwNX/xqZOLO4vCWUKZ71AvjS4eLkDf3STff+dflqqz+i+Cy6zitulghw8fpjP3er3Gpg6rrKysra2lr5gcOCA8HcAPCGSZgKDjoXkdhVOp6f8aPoU4Px+HssdwrI40OLyYg8ewTXSJkijvWaAPi34yfjktpNQAhWwSOHbuNeGkdPreQ8avPrAzF+PUxVc33589m5PNS+QWZz2CsjIB6VTLurq6lA/EZ0888Rd3/zghvfiGhr4DwbKk7483NDRIh1+GQqGEtM7KE0ItCBhH4MhZQc0t6HgEmyk/4/NW1pWW/MWmtR9emUfI/NvvTX779ejz06m2l8SDBoXcPoQj/+vM1B3FXuMmDksOJHBkMWO4CsWw9rtR1HoIrzYREg+du+hAfLZa0n9M/qfwySNuKat7+aHok9f95YMfLHnztw88NJ7GfeKxFcIJRRzH/ebMf2Y/MyR2Lm11M+ZisqOjo7FYjI5cW1ubcgqFxFu4lLSxwENLnoqbS5JGlsLRa2VlPp+Pmn3llVdS2sdFEDCewNGzwsc0x+UthpdJR+CuKyvdc816MbIkhORvvfKqx2+++gYVH6L0vblRfgZPxpPSxQWRwK8mhQ/beFxU/KZiovduFKJW4f/4+TiejKcCbP61N2PvLA4inAeQ7qfwI1/+5Ncf/KCGY0qFpzBi0Hrs3GvprBt/XcXnovGDwqKdCBw7doxO1+fzpX3bcssXvv/siPDzTF/zZqGbr+GbHTen26yRDsukhxPZiQ7man8CNLGe8OmecteSkPgb75z8/u9Ptf37a7f84ndNb8RmCCErr7jTm6abePA1zbBCwheh0rX/HWPmCsZ44bYSY4LU95XOu1EMNoTztgghdM/ezNXAdlICb/Bv0+zhqd1M+19xxf/9zcBf3r527sx8UoPyC+KxREL1+7Nn35s9I29gag2CS1PxOsH4+LjwmDsej5eUqP7ONHm0q/3J1+fIh+//xj3Xp9q2pIACgQD9sKNjOYEa1mATAsf4WTpT8XW0dJOe5b/9+nshfu7CwqVXT7/7htCcW5nu/EpOPHeOvl3/yvk0D7PSzQDXHU5APNtSXGPazSxdd6O4b0kPMSD8JRyPlbPbaWp+WvzDKkwgnZRn9Qc2/fG1+e8fef3J54VOan+EryhLd5GgSc/uD965zC5vG44mBXzl5eXqph99+uHHXogR36fa/7p2S/rQUjRKd+/V2UcrEDCFgJothMsDF64RszpePBpb+vy+fE1eou9eyutRAwKKBNTcVExHbXfjYke6Z89YQTF7BE7E/kAHE8+3Tz3uxf9845utkal3Zzf++YdSt1S4atwJRwrGU1Rh5zIFHFy6TEB98Dc72tf7+hwhZPyF7h231T/wxCh/2YxySXrnkhASDoeVG6EWBEwgQF+CpBvnWsxzN2zZ8AFCZt579/nFrc80vel/QdgrSoPJ3ZelfXQBg4bvOtruRtGwBuvu9onZq48LDzbS/iycf1fXuffCAxNRqfj6+UjaQYxtgODSWJ6Otab+r2/h5u0d7e33t919200bCImN/fihx46mCS/Xrr2cn0oSDzkWJRZmJQLRmcWXIAVdpeqfwjVX/u0HCwiZ/qc3L6g6G33JNjKjqGbs9obqoz/Nd6O2yNXtjjB1/ep3bXROQ03kqtN0mm54LJ4GEC5rJlBUcWtdhdBre+31rZ/vjsyNDkdmqytSPB9ndyvTaoY0zwcdQCA5gbI1wo2pbS8nb839N27aSsgfTpzom1oKG5MPIVzhxMPsOLJNHC51W1x1LQFf4eXtHhVPS0VOOu5G6V0/14K2zMIlzY1JMxJf+BZsX7WqyKQhkpm9fCsna4F6EKAEpJcvVQPxFm0QjiOa42fTPjmUdkZTnqOpemQ0BAFNBNSdMieaXFH3sa1Nqwk5dyoYnk57Yy/OQghB1YWhmqaNxs4isKlwcbtHdTpxPXejdCN68tVvjzoLtAVW41mxJkuzEJ28sXBDloZbGgbB5RIJ/JuEANXxcBwXiah4aWM2+lp4UvyLOxt96Ym+l4WXLzff7Et9GFEkEjH96UCS1aHa5QQS9orS0ci76drSPcX5JPb+3a+8945qrS23JAfdtHLpHNh0I+G6mwmoyxOl824kcWEfnRDso+fyFtu8ZpMwPM2vQP1h9HToqz65+gKBx+JG+9Nx9jZtEv4biMfjkUhkfHycFd/I18q/1HXf7rFl9b7b7r99y7Ia2S+hUEjIj8JxVVVVsouoAAETCWwqXOErzB+fnRfPA5H2dBRH5K77kP/JLasIIe/lrev91MaVQquFt0+E/9ubqbYwBaNCcCl8yFesTfF6iOKgqHQXgcD6VaFzQkpAMalTirXrvxvpUZeEcNs84i2cYhBcMo3A5tXC0X70Y0H445dyoIJ1X/yHj/+X4qVTz6792N6DHyOxM0/e95v/SH3CUFwYgqzOW4kMPSkB42IuCNB8jBzHxePx0dHR1FPgZ0s+7FtMzUM8m8tvu/8f+r9SkXLfMhaLSWZvueWW1PZxFQQMJ1DhFf7ExslCuifXhYEPrqajX7m6YOnPct7GvHTPfwQ9qPC3w1eYLz33NHwVMOgMAh9fR+8x4Y5J+V1H590oCjwWN0Yrvfiqk7O7Zk3+6g+K8eXiNnKaiazwLEWWUkPPinSPQWhGW0Ku9W6VemWtgJ3LrKG260Ber7e8vHxsTNiPHB4eTp0BsuTWju/c2qFpqQcPHqTbloQQ1UdpahoBjUEgFYE/KfIMT06JOwdcShXFzA+Ojv0glSWFa8LOgfD3XPj3lvWLsalCO1SBgEig+opV3z0p3jQc4RbEfSdlMnruRvrmr3iXk8D6Vd78dN+LlIdGrTEEblx//e8vRsX3a+kOY1Kzc+f3N/98f9LLSheE4y2Fjx7B8ieKPqrUxNw63Fvm8nWG9bq6OrqQ0dHR4eFhAxcVi8UGBwfpM4Hy8nINSYAMnARMuZvALetXicoGGl4azEI0mkdjhM9emXIP3+CRYc6WBDYVrqBb6WIIaPC7eMJW6OLNSP5kg8eWgBw06eorPyE8Gedots+U+9T6Vi2+W7E6b2Xl+uv1GcikF4LLTOi5pW9tbW1xcTENAfft22fgUZQHDx7k+cVTMJubm90CFOu0GIF7N9NzOoRNBAM/4xdNxQXhT23Rmm1r0j3GshgWTCcnBL78gSvEcTlC8sQvJ8bMQrwbxbc/xDc0PrsxW2plY6bvQCtXFm6oKrqRShoEaY9xnz10IzQuvsn5meLAmvwcPDNBcOnAW9aMJbW0tFCz0Wi0t7fXkCGOHj26f/9+GrPW1NRUVIinYxpiGkZAQAuBz25c4yvMF/YXF+LikZRaOidpK/wtF/5P2JcghHz5A+uTNEQ1CCwjUOktDKwXdGNE/Fqy+BVlWRNdvwhfnfKocuShrVfqMoFOBhP44ubbVuetFGQ9cTFNo2Fb1fSjh2wsvKLGV23wpNWZQ3CpjpPrW9XW1kovRA4PDw8ODmaIJBKJdHV1USMejwfblhnyRPcMCdy7Rdi8FL/qCLuXBvxFj19+2tV4lRdSngwd5Kru927ZILyqIcoojfq2I37JETbRK7wrIeWxyO20Jn/1Z4oDwmQ4jsujmRozm1pcODNaFKEL32m/sPn2nGxbEkLyH3zwwcyWgt5uIVBdXf38889PTU0RQl5++WXhQ0rvXmMkEnnggQd4nqfbll/72teuvz4HL4W4xXNYpwoCW1atiBMyys8shpjigyV9DyWFwFToznGCAp2r8K582I+NIhU+QJMlAmvz8z60uvAXk1PiMR1CWCh8VVm6qu9fqlbzry7ouvaqQiOft+ubDnotEvjw2tJ3Z86Iyh4hKBQ+OVLqClOBEwNLbmnP8NNXVdUU52bbEsFlKjfhWgKBwsLCioqKF154YW5OOBp9dHR0fHy8srKysFDbeRbDw8O7du2anZ2lkWVbW1tqBXrCNPArCJhE4Ma1q07NXIpcFG5v8dhz6RgDDQPSyJJbiizxt1wDOzRlCGxZtcK7Iv9/n59eii/FsINpoKa4tAEvbIESjvPkc1/3X7VpJU6JUQMve20+vHbrq+ffvHCJl/y1eLi6likIj1s4wuUtvjZese7Dd2+9U4sBg9ti59JgoM42V1RUdNNNN0nxZSQSefrpp4uKilQmBB8dHe3u7qaP1GlkWV9fL73N6Wx0WJ0tCNy4btU7F+dOzlwS37IXNh+Fl6DoScfpFiA2FF6eEp5viVuX/tUFX71mI/6WpyOH68oEPuIpvHBp4bUp8Xu4mGZi6auLcvvEWiGeFO5GYQddjCwfv9YHVVkiJQv8XpBX8MmichpfCmeQ5okfORqdvfhyt5is4Vrv1tbSLxTk5VJByE1OTlqALaZgJwLhcLirq+v48ePSpH0+X3V1dW1trWKUOT4+Ts8wooelS9tBHR0d2LOUGKJgHQLfOXHm4LviIQbxuCDYpenyxKeSio8m6X6DuGOQR8RH4fTNtsfKrsRRgtZxq01n8tz7U3/3zvvi5On3l8svBKe4G4WvN8J7GYvJX/yrC75ediVe/LXyPTA1f/Gpk8+8OPnK0jdb4YNHOEtf8KSSq4WH4PRtCeGq2FgoVBXdePc1d+R8pQguc+4CW07gqaee+v73vy9NXbzJhf8AfD4fPauyvLx8XPzheT4SidAGS4IJIbfZdddd19PTI1lAAQQsReC596e+c3IyNi/GjeKnu5COjxH6SAlUxJhS3Nukm5ziMhqv8t67ZYOlVoTJ2JfAW1NzX4u8KyYpXYw1xMiRBheLYST9hkOEcETY/IrHF6SIJLB+1a6tG/E9xxY3wE9P/du/Rp9fmuric5PLf0DFpDvxxTxLgqvFRKHCn1Yipnn84pbbA0UfX+qey38RXOaSvk3H5nm+qakpFovF43Gv15vi2Eu6SSltVRJCCgsLZ2dn6cKxc2nTG8Al0+bnF34QOX3wgiCwXfwRokzxgbf4US5WivEms6+wbfbCo5+4FltES8jwr2EEvvfOuz86dSa+UjqzUHxuymxriZ+0i3EGHbXozMTf/PEN0IYb5oOsGHpv9sxPT/2cbmHSAenX28uaLkEomPjCTlXRjV/cfFuutOFyMHixV84ENWkI9Pb20oCS47ju7u7jx48fO3YsFArJo0z61Zn+//Lycvro/IEHHqCP1Ht7ewOBgNeLtCVpgONyTgh48/PyRg6t+NWRhUANKbt+oeSDlx9BXZ7Q4vuYK6cuzL42lvcfR/O5uU1V/ZevowQCBhHY+uYrK77bs/CJWxY+cmO89Dq6WcV8r7n88LRgfu7Ssf+d97tXFt55o+yPDxCiTXNp0HxhRieBKws33H3NHTXF1Uff/49j5157f/as6GXxey01KWxTLnr+g6tLrvNurfFVX1lorUcl2LnU6X7XdhsdHW1vb6fLr6+v37lzp4RidHT02LFjhBD6QNzj8dBXMDdt2sQGkSksSKZQAAErEKivr6dfmerr67f/9/8xemH29IygJT92QTixqGx1gXdF3toV+RXele8ee+nhhx+mc+7r6ysrK7PC/DEHJxFobW2NRCKEkPLy8kf2dB05O03vxremZmPzcV9hPpWO3bhudQk/uWPHDrp2PCCy+z1wYur0m/zbsUtTU/PTJy9GCSHXea8hhHhWrKm84nqrxZQSbexcSihQUEWgr6+PtvN4PAlC7wrxJ62VioqKmpqakZERQsihQ4fq6urwlzgtNDTIPoHh4WFpM76xsbGkcMWmjUk/MLcFAsXFxRMTE4SQwcHBzs7O7E8YIzqYQDgcppElIaSurs6bn5cqf6O3pLy8fGxsjN6N0E3a+sbYsmbTljWbbLeEpdM2bTdxTDgXBAYHB6UPuGAwqPuJdjAY9Hg8dAX9/XiGmAtfYsx0BIaHh2mT8vJyKlNL3UP6Ex4KhXheFJun7oCrIKCagJQUzePxSHdait51dXX0aiQSCYfDKVriEgiYQQDBpRlUnWmT5/l9+/bRtZWXl6v5gEsGwuv1Svke6SlFyVqiHgRyQiAajdKTs+hGkZo5SH/OY7FYKBRS0wVtQEANAZ7npTuqpqZGTZfa2lrpC7wUmKrpiDYgYAgBBJeGYHSFEUnHQwhpa2tTXvP0mwWPNK398KYNRUUbiq5Zd8eughPTii23b99eWlpKL/X29mKnR5ESKnNF4ODBg3RopY2iEwV/9UcbiorWDp5jp1dSUlJVVUVr8OecJYNyhgRYuWRjY+Nya8p3IyFECkOxlb6cmH1/S+prCy4JwaUFnWLFKY2OjtK3JAkh9fX1Sd6SnM5/9HPebz+7YkKQOxByPv8X/d7aXfnK4SUJBoN0qbFYbGBgwIrLxpzcSkC626W/0Iskxn+++k8qvT98SxHMZz/7WVqPZ5GKfFCpj4D0XSXxDY2Ud6MUhmIrXR92a/VK6WtrTVWcDYJLCzrFilNKoeNhprtq/v6e6bseu/DLY2dPvXb+sZuEc9gmBle+qhxdUmUP7X7o0CG8GMSQRDGXBBKkPNJUuCOPrK28c9VvVy6slOqWFQKirIdWSQHBshb4BQQ0EkiQ8ki9096NJSWCrIe2x90ocbNjIa2vLbgoBJcWdIrlpqRBx+P79MVvtV26YUt8lW/+S/fPC0uZ4eg+ptKyoOxRooK6HBNIIuU5l//UUytmNs/ufWJ2S9IZSu8i41lkUka4oIWAFBcuf0ND1d0ovQeMrXQtyK3WVpWvrTZpBJdW84jl5qNfxzP+snDUK7lhbtuqZKuCsicZGdTnikByKc/6S3t/ee61X8e+vI0o78ULU5b+nONZZK486KRxk0t5VN2NkPU44mZQ5WurrRTBpdU8Yrn5qNLxKMx6Or//qXxC4n96/5xP4bJUBWWPhAIFKxBIJeVZ5VvwJf2mRCcPWY8VnOiYOaSS8qi4GyHrccidoM7XllosgktLucNyk1Gn41Ga9pv9nh9OELJt5hufFt68TPkDZU9KPLiYVQJJpTyqZwFZj2pUaJiGgPRMPFHKk6bf5cuQ9VxmgVIWCSC4zCJsGw6lTscjW9j0S6vvfDSfkPnWJy5em2anhxACZY+MICpyQyCZlEfTbCDr0YQLjZMRSCblSdZesR6yHkUsqDSbAIJLswnb2L4GHc+yVY4X3HPnqpOE3PQY/zc3LLuS/Bcoe5KzwZXsEUgi5dE8Ach6NCNDBxkBadtyuZRH1i5dhfQeMGQ96VDhumEEEFwahtJhhvTqeM6t2PU577Pnyba7LvykbSH9ruUiNih7HHb/2HE5yaU8mlcj/TmHrEczO3QQCSSX8mgGBFmPZmTokDEBBJcZI3SoAV06nun8x/9sbb9wvvTC9LPerUVinp5N63a9qgYSlD1qKKGNeQRSSXnoqC/91bpNRRuK/ljYmCdkxT1bNxQVrf+zQfFUhGXzgqxnGQ78op1AKikPtab6boSsRzt+i/XQ4muLTB3BpUUcYa1p6NXxnFjxg9/SleSdnFj6izvDTSc/uGX5uqHsWc4Dv2WVgAopj8KhrXnnlG9vyHqy6jzHDSY9E08u5dFwN0LWY/MbRIOvLbLSFRaZB6ZhKQI6dTzk2pnRyeQnpqdfIlX20L/xhw4dqqurS5JnMr0ptAABTQRUSXlu7jk32aPSLJX1TExMEEIGBwc7OztVdkQzEFAl5dFyN1JZz9jYGL0bpXeCgdoeBLT42iIrws6lRRxhoWno1fEYswQoe4zhCCsaCRgl5WGHlf6EI1sPiwXltASkbcsMpTzsQNJ7wJD1sFhQNokAgkuTwNrVrF4dj2HrhbLHMJQwpJqAgVIedkzpzzlkPSwWlFMTMFDKww4EWQ9LA2WzCSC4NJuwzezr0vEYvEYoewwGCnPpCKSX8qSzoHgdsh5FLKhMTSC9lCd1/+RXa2pq6EVspSeHhCvGEEBwaQxHZ1jRq+MxfvVQ9hjPFBaTE1Ah5UneOeUVyHpS4sFFBQLSM/HkUh6FXmqqIOtRQwltDCGA4NIQjA4xolfHY/zykbPHeKawmISAKilPkr5pq5GtJy0iNGAJqJLysB20lJGtRwsttM2IAILLjPA5qXNudTxyklD2yJmgxgwCZkh52HlC1sPSQDk1AWnb0kApDzui9B4wZD0sFpQNJ4Dg0nCktjSYcx2PnBqUPXImqDGcgElSHnae0p9zyHpYLCjLCZgk5WEHgqyHpYGyeQQQXJrH1k6WraDjkfOCskfOBDXGEjBJysNOErIelgbKKQiYJ+VhB4Wsh6WBskkEEFyaBNZOZq2j45FTg7JHzgQ1BhIwT8rDThKyHpYGyskISM/EDZfysCNC1sPSQNkkAgguTQJrJ7PW0fHIqUHZI2eCGqMImCrlYScJWQ9LA2VFAqZKedgRIethaaBsEgEElyaBtY1Zq+l45OCg7JEzQY0hBMyW8rCThKyHpYGynIC0bWmSlIcdUXoPGLIeFgvKBhJAcGkgTPuZsqCORw4Ryh45E9RkTiALUh52ktKfc8h6WCwoUwJZkPKwqCHrYWmgbAYBBJdmULWNTWvqeOT4oOyRM0FNhgSyIOVhZwhZD0sD5QQC2ZHysINC1sPSQNlwAgguDUdqG4NW1vHIIULZI2eCmkwIZEfKw84Qsh6WBsosAemZuKlSHnZEyHpYGigbTgDBpeFIbWPQyjoeOUQoe+RMUKObQNakPOwMIethaaAsEcialEcakRACWQ9LA2XDCSC4NBypPQxaX8cj5whlj5wJavQRyKaUh50hZD0sDZQpAWnbMgtSHpa59B4wZD0sFpQNIYDg0hCMNjNiCx2PnCmUPXImqNFBIMtSHnaG0p9zyHpYLG4uZ1nKw6KGrIelgbKxBBBcGsvTHtbsouOR04SyR84ENVoJZFnKw04Psh6WBsqEkOxLeVjskPWwNFA2kACCSwNh2sOUvXQ8cqZQ9siZoEYTgexLedjpQdbD0kBZeiaeNSkPyxwQ2o65AAAgAElEQVSyHpYGygYSQHBpIEx7mLKXjkfOFMoeORPUqCeQEykPOz3IelgaLi/nRMrDMoesh6WBsoEEEFwaCNMGpuyo45FjhbJHzgQ1KgnkSsrDTg+yHpaGm8vStmWWpTwsc+k9YMh6WCwoZ0gAwWWGAO3U3aY6HjliKHvkTFCjhkAOpTzs9KQ/55D1sFjcVs6hlIdFDVkPSwNlowgguDSKpA3s2FfHI4cLZY+cCWrSEsihlIedG2Q9LA3XlnMr5WGxQ9bD0kDZEAIILg3BaAMjdtfxyBFD2SNngprUBHIr5WHnBlkPS8OdZemZeE6kPCxzyHpYGigbQgDBpSEYbWDE7joeOWIoe+RMUJOCQM6lPOzcIOthabiwnHMpD8scsh6WBsqGEEBwaQhGqxtxho5HThnKHjkT1CQjYAUpDzs3yHpYGm4rS9uWOZTysMyl94Ah62GxoKybAIJL3ehs09ExOh45cSh75ExQo0jAIlIedm7Sn3PIelgsbihbRMrDooash6WBcuYEEFxmztDqFpyk45GzhrJHzgQ1cgIWkfKwE4Osh6XhqrJ1pDwsdsh6WBooZ0gAwWWGAK3e3Xk6HjlxKHvkTFCTQMA6Uh52YpD1sDTcU5aeiedcysMyh6yHpYFyhgQQXGYI0OrdnafjkROHskfOBDUsAUtJediJQdbD0nBJ2VJSHpY5ZD0sDZQzJIDgMkOAlu7uVB2PHDqUPXImqJEIWE3KI02MEAJZD0vDDWVp29IiUh6WufQeMGQ9LBaUdRBAcKkDmj26OFjHI3cAlD1yJqihBCwo5WFdI/05h6yHxeLUsgWlPCxqyHpYGihnQgDBZSb0LN3X2ToeOXooe+RMUEMIsaCUh/ULZD0sDceXrSnlYbFD1sPSQFk3AQSXutFZuqMbdDxyB0DZI2eCGmtKeVi/QNbD0nB2WXombikpD8scsh6WBsq6CSC41I3O0h3doOOROwDKHjkTl9dYVsrD+gWyHpaGg8uWlfKwzCHrYWmgrJsAgkvd6Kzb0T06HrkPoOyRM3FzjZWlPKxfIOthaTi1LG1bWlDKwzKX3gOGrIfFgrImAgguNeGyQWNX6Xjk/oCyR87EtTUWl/KwfpH+nEPWw2JxUtniUh4WNWQ9LA2U9RFAcKmPm3V7uU3HI/cElD1yJu6ssbiUh3UKZD0sDUeWrS/lYbFD1sPSQFkHAQSXOqBZt4s7dTxyf0DZI2fiwhrrS3lYp0DWw9JwXll6Jm5ZKQ/LHLIelgbKOggguNQBzbpd3KnjkfsDyh45E7fV2ELKwzoFsh6WhsPKtpDysMwh62FpoKyDAIJLHdAs2sXNOh65S6DskTNxVY1dpDysUyDrYWk4qSxtW1pcysMyl94DhqyHxYKySgIILlWCsnozl+t45O6BskfOxD01NpLysE6R/pxD1sNisXvZRlIeFjVkPSwNlLUSQHCplZhF20PHI3cMlD1yJi6psZGUh/UIZD0sDceU7SXlYbFD1sPSQFkTAQSXmnBZtDF0PMkcA2VPMjLOrreXlIf1BWQ9LA1nlKVn4raQ8rDMIethaaCsiQCCS024LNoYOp5kjoGyJxkZB9fbTsrD+gKyHpaGA8q2k/KwzCHrYWmgrIkAgktNuKzYGDqe1F6Bsic1H+ddtaOUh/UCZD0sDbuXpW1LG0l5WObSe8CQ9bBYUE5LAMFlWkSWbgAdT1r3QNmTFpGTGthUysO6QPpzDlkPi8WOZZtKeVjUkPWwNFBWTwDBpXpWVmwJHY8ar0DZo4aSM9rYVMrDwoesh6Vh67J9pTwsdsh6WBooqySA4FIlKCs2g45HvVeg7FHPytYt7SvlYbFD1sPSsG9ZeiZuOykPyxyyHpYGyioJILhUCcqKzaDjUe8VKHvUs7JvS1tLeVjskPWwNGxatrWUh2UOWQ9LA2WVBBBcqgRluWbQ8Wh1CZQ9WonZrr3dpTwscMh6WBp2LEvbljaV8rDMpfeAIethsaCcggCCyxRwrHsJOh4dvoGyRwc0G3VxgJSHpS39OYesh8Vil7IDpDwsash6WBooqyGA4FINJcu1gY5Hn0ug7NHHzRa9HCDlYTlD1sPSsF3ZGVIeFjtkPSwNlNMSQHCZFpHlGkDHk4lLoOzJhJ6V+zpDysMShqyHpWGvsvRM3NZSHpY5ZD0sDZTTEkBwmRaR5RpAx5OJS6DsyYSeZfs6RsrDEoash6Vho7JjpDwsc8h6WBoopyWA4DItIms1gI4nc39A2ZM5Q6tZcJKUh2ULWQ9Lwy5ladvSAVIelrn0HjBkPSwWlBUJILhUxGLRSuh4DHEMlD2GYLSOEYdJeViw0p9zyHpYLFYuO0zKw6KGrIelgXJqAgguU/Ox1lXoeIzyB5Q9RpG0gh2HSXlYpJD1sDRsUXaelIfFDlkPSwPlFAQQXKaAY61L0PEY6w8oe4zlmUNrzpPysDAh62FpWL8sPRN3jJSHZQ5ZD0sD5RQEEFymgGOtS9DxGOsPKHuM5Zkra46U8rAwIethaVi87EgpD8scsh6WBsopCCC4TAHHQpeg4zHDGVD2mEE1yzadKuVhMULWw9KwclnatnSYlIdlLr0HDFkPiwXlBAIILhOAWPFX6HhM8gqUPSaBzZpZB0t5WIbSn3PIelgsVis7WMrDooash6WBcjICCC6TkbFQPXQ85jkDyh7z2GbBsoOlPCw9yHpYGpYtO1vKw2KHrIelgbIiAQSXilgsVAkdj9nOgLLHbMLm2Xe2lIflBlkPS8OaZemZuCOlPCxzyHpYGigrEkBwqYjFQpXQ8ZjtDCh7zCZskn3HS3lYbpD1sDQsWHa8lIdlDlkPSwNlRQIILhWxWKUSOp7seALKnuxwNnYUN0h5WGKQ9bA0rFaWti0dLOVhmUvvAUPWw2JBWSKA4FJCYbkCdDxZcwmUPVlDbdRALpHysLikP+eQ9bBYrFB2iZSHRQ1ZD0sDZTkBBJdyJlapgY4nm56AsiebtDMfyyVSHhYUZD0sDUuV3SPlYbFD1sPSQDmBAILLBCBW+RU6nux7Asqe7DPXPaJ7pDwsIsh6WBrWKUvPxB0v5WGZQ9bD0kA5gQCCywQgVvkVOp7sewLKnuwz1zeiq6Q8LCLIelgaFim7SsrDMoesh6WBcgIBBJcJQCzxK3Q8uXIDlD25Iq9pXLdJeVg4kPWwNKxQlrYtXSLlYZlL7wFD1sNiQZkQguDScrcBdDw5dAmUPTmEr3JoF0p5WDLSn3PIelgsuSq7UMrDooash6WBMksAwSVLwxJl6Hhy6wYoe3LLP+3oLpTysEwg62Fp5LzsTikPix2yHpYGyhIBBJcSCksUoOOxghug7LGCF5LNwZ1SHpYGZD0sjdyWpWfirpLysMwh62FpoCwRQHApobBEAToeK7gByh4reEFxDq6V8rA0IOthaeSw7FopD8scsh6WBsoSAQSXEorcF6Djyb0PlmYAZc8Sidz/e/HixVOnTsXjcUKIm6U8rCfksp7JycmJiQm2DcomERgdHb106RIhRNq2dKGUh2UrvQcsyXp4nj916hTbBmW3EUBwmWOPx2IxOgPoeHLsieXDJ1P2XLp0aW5ubnlb/GYuAe7/b+9coKMq8vxfNyGPTkIeHUg6DGFJguGhS8JDZyDs7CiQOR4foOgRz6COj/kvzrjz/zMSWPWcYZyz6jkC6x53fO2guyiOcFZgdGRco4zjkYTxASEOGgl5YOJAwqPzoNOdNAn3f6rq9u3Kox+30+m+j2/OjFTfW7du1edX3fd7f1W/Kkm655571q1bt3v37mPHjvGbqc+zib23XktXm+9yufbs2bNhw4Y77rijtbVVr/U1Vb02btx4/fXXv/rqq4cOHeINU+cdmqqdYTdGDOvZuXPnhg0bbrnlFnX6StjFIKOpCEBcxtmcq1evfv755wcHBxHHE2dLjLr9iMieixcv1tfXX3/99d98882ovDgwgQRSU1MJIWfPnn355ZclSZJlOS0tzeKPc4fDsWjRIkKIJEm7d+8+fvw4IYSDmkBLoGhGoLi4mBDy2muveTweQogsy6tXr7Y4mx/84Ad8bOEvf/kL740WB4LmQ1zGvw/s37//+uuvV8f7Vq9ePWvWrPhXCzUgRIzs+clPfrJx40ZCiOpsBqG4EJAkye12r1u37t133x0YGIhLHeJ408HBwfr6+g0bNhw5ciSO1bDyrTMyMsTmS5L04x//ePfu3U6nUzxuhbQsy01NTRs2bDhw4IAkSWKTCwoKxI9IW40AxKVeLM6/mWlpaffcc49e6mT5epSVlS1fvpy/kV+4cIHzUEdmLY8ndgC4r0i839mzZ1966aWGhgbxoBXSLpfr6aefHtM5VFJSYgUC+mzjyy+//Omnn+qzbhNXq6Ghoa1bt47ZG/Pz8yfuvihZ/wQgLuNpo6amphG3d7vdr776Kp8tPuIUPsaYgCzL9fX1Bw8eHPFGHuNq4HaEkBG+IkJIenr6tm3bysvLrcYnOzv7pZdeGq22x6RkNTixae+Y8KuqqtQlomJTDT3cZdKkSf/2b/9m8TkqejCEDusAcRlPo4w5wMpHycc8Fc+6Wu/ejz32GB8Ht17Tdddir9cr1ikvL2/btm2WnT2SkZGxffv2+fPni0yQjhmB5ORk8V78PUeN3xdPWSGdnp6+adOm0foSnksrWD9IGyEug8CJz6ni4uJnnnkmPT09PrfHXX0EfvnLXy5ZssT3yf/v3/72N/8HpGJCQBSXxcXFL730kmWVJefN9aX4RB+heGJiFovepL29XW15Wlratm3bysrK1CPWTGzatOnBBx8U2z56tEE8i7TpCUwyfQtj38Cmpqa//vWvNTU1hJCOjo7Ozk5CSElJSUZGRnp6+rJly5YsWcK/eJ999tmI6q1btw5zLkcwidfH1NTUX//61/X19U8//bS4guAXX3yhVulYT8PXvS3t/WcIIScu0oVgbImpM9LoTPbC1II5mcXlWXPVzEgEInDC1VrX9RXH2OY+4xnqJ4TMnlxECMlNyl6Yc6X6OM/Nzd2+fTueW5zkpk2bent7P/nkE0KI1+utOfFpe9q5IBhLM2amJdoCWQHHOYE295n63oavL7YQQs4PdF3wdtOvs60gbVJqblL2nMyS1tOneM7U1NSXXnrJ4XAAHSHk1ltvHRoa+s///E9O44+fvm//+/y67q9GY7QlpC7MubI8aw56o4l7jmTBALcJMqfL5dq/f/97773H1WTwu5SUlKxZs+a3v/1tV1cXz3nllVf+y7/8C36ngnOLy1mXy7Vz587f//736t1/9Zsn6iY1nnC1chmkHh+dsCWmzs4oWlt4w5TknNFnLX7kvLfr7dMH63oaQmIkhLi/7Oo91LHj8efxHRnRbW6/f23idzNtV+Yk2kI7C8qz5q7Mr5idQYU7/kQC7iHP26f/VNfzFVeT4qnR6f6W3p6PO/7Pirtvuumm0WetfOSffr7eOb0/bWFukp2uIBb8r9BWsDK/Yql9QfBsOGtEAhCX0bHa/v37d+7cqU6U5PHFfE0+8Qb8iBogoma77rrrHnnkETEn0noj8Ne//vXhhx9OzEnOWj4tY/FUtXqyLNMVOBIkQneQYX8SIZfpfjKqoQkhS+0Lbp62HBKTE3IPeXa3H6h11inE2GKBIzBSgOwbQo/7VjkBRpUYFdxDnoPnDh/49s+DCUP8uCwT2hGF3qhgZD89KsbZk4vu+M4N3MUuFmjNNMdY3VmjvuTIRJbYF1gFEgjjzQXLodRVSh+cq93b9t4liW5fRFcAHYWRHZVl8ZeReYXXFt4AjByaaf4LcTleU3Z0dPzqV79qbm4WC0pPTy8rKyspKUlPTy8pKenr6+MZamtrm5ubqRzxPSwJIVlZWW+++aZ4OdL6JPAf7//2aFoT9w8x8Ugk9gNKxQ+rMX0C+RLsIH1CEVl5ptsSU+8svGGpfaE+WxezWp1wtf6meRd/kMtUkksSYXs7CvSCYCSE3DdzDTC2uc9sPblD1UOsL3KMlCd9rCv6iPVB30+O+OOztvCGFVOXxszu+rxRm/vMcy27/N5K+pUOA6OvrxJCVkxdurbwBn22Lma1Ou/teq759XYPnSBEv80J9BtMQfJfv0C9UcC41L7gvpm3xazCuNFEE4C4HBfhpqamjRs3cocl/9UuKyu75ZZbKioqApXrcrlqampee+01cfS8pKRk27ZtmEkWCJoejv+h409vnT6o1oQ+vemvp/iaoJ5UEkyAcn+m/2Vi1bTlNzmuG5nVMp9rnUdfObVXaS7T5lQI+V2TY4BQUNPnkMTS9Lll8Sd6rfPoG+0HqLLkD3IuIIP3Rq43JZli9L3wWPyJXtfT8MqpNxWMioNcZTNGV1S8cfSFkY5LyJeV98byrLn3zVxj2RmE/vccRZbzURz/j95olP4vNd1zS3knL7QVVJXeb1mMoykZ+gjEZeTmq66u3rp1q/J+Rkh5efm6devCX3jvvffeEyVmfn7+tm3bMJ8scntM5JWvnHqTj+Ey3yR3R1KtE849fdrJ/9Cy7BPdj5GKG80YGW7mjmPcLYtRFei+JzQV6eH3Ri7p1fyWfaIPw8i2FSVB1fmoLzt7efT9CAAj58N+7sL9bWSXMIzM204D+JKzq0ofwPShUZ3NeAcSN2/ebLxa66DGTU1NTzzxxKVLl7jDcs2aNY899pgmaThr1qzKysrPP//c6XRKktTX1/fFF1/84Ac/wJIiOjDvsCq8dfqDg+cO00O+V2yJOizCUpZ8cJw/zmmaeTzaPR2yLM+ZTHcots5frfPo22f+xHw/FARXipowskmY/Fp6dbun4/xA14LsedZhSAgRJBF35VL/kFaMTIsqSqp30NVz6aLVMJ5wtT7X/Dp3DXBhQ7/U4X6neY9juZmql2S5d9DV4m6vyLXWpJc295mXWvcMyoP8PYepcw2/jYyjgpHCl2XP5YETF1uvsf99UkKSpb7X5mssxGUkNnW5XOvXr+/r6+PKsqqqau3atREUlJycfOONN3Z2djY1NUmS1NXV5XQ6gwypR3ALXDJOArXOo3u+/SMthE4gos9xrY8gXgH6+KeCij3IJKnRdWpKSk6hzSrb7/qf5QwlfwhFYBrl8S9LEluit93TYSmMwrOcqXRtnjY/79EYLfW20+Y+8+9N/00lERuJYN9KbbrS/6Xm74sM6AVvt6XedtxDnse//o1nqF/1oCv9yt/Rwkr5ZD2bq8FkugXfdsIiZahMEJeRmOvRRx/lC+9JklRVVTXOvRkqKipaWlp4gS0tLbIshz+2HkntcU3YBM57u37T/Dp7L+czzyMTlsr9lF9e+hSjya/pC/p8K0wwcg95njzxou9ZTp9EkT2EOEcq09mQOsdY191QnjUvK2ly2FY1akb3kGfryR29gy7FS6TZ0zas4QpG2f+2M3tysUWGI/+9aecFbzfriMqXcRgaLR+Yz5iV5HvbKUybVpDqX01CS2EGy/vvzTs7+s+ziedq1OJ4msC+1ey3wZpjO+Nhp8NrsUOPZqPUsz/uyapkf5qLGHXBxo0bS0pKeJDi/v37XS7XqCw4EAcCb50+6Hsv5zP4x1sHLqr4qkWeoX4xQmi8Rev4eo6RPcajhFFxAythvXv+dkDHrY9a1d7vrKFBzWzpK19AzrgKZ8KI+tM5x93tlsBY6zzKg5p58yPxWA6nzmW6rHRGsrv9neHnzfnphKuVbxvBY5rGj5FhYjM2WVTQB+cOu4c85mRnjVZBXGq2Mw/iIYQ4HI6qqirN1491QUZGxvr16/kqmH19fXv3+sJpx8qMY7EhcMLVepgtxBithxCvNi2NTzgk5LCz7rxXWUU/No2K/V3Oe7uUGavs+ROlh5Ay6ZWL9RMXW0+46PZIJv5zD3k+4BN/eahylJrKAEoSWzim3XOm1nk0SgXrtBj3kEd5o1PEYHT6I/uJYD5gWb7g7X7r9Ac6bX/0qvXKKbp8nkz/p8wtGH/ZXKbz2eyeof73O+kud/gzKAGIS22Gq66uVpcQuvvuu7VdHDR3eXl5RUUFHy+E8zIoqhidrO44xPzT9NeTrycUrRvLdPENxdHxRpvJ/Rz8WU6fQBRidJ7l3BD8wcZN8/YZ/ypR0TKTrsp5X13iezxTCsZqEoujUHq46V3ptRfquPeXTZ8eC0ekx9SgPUKI+hoQaWF6v67WeZSvDMpfTqJYXTblhb/OU4xwXkaRbYyLCr1dWIwrpPPbHTt2jNcwPz8/xFRLb9uHr768p/qz5q5LhKQXLq68//8+UOFIDtLA9evX19TUyLLc19dXW1sbovwgBeHUuAm4hzz1vV/TYpQfupCqyH7N7Ic2T3c0Hn/4kc4QozmsSL6xD1HuMu4K67aAYz0NbECcL5QeEiMhJFySfOolL/HExdbz3i4TTxkUdjMKvepQWva1/1Raec3krGRyqeti/f7GNw50B++T7K1WJhe83W3uMybeueco2+qarYPlGz4I8c0JtzcqxbDu6Bnqr+tpWJA1N0TZhj3d0Es3XmdriU1Eb1QmFXuG+o/1NGC7BIN2E3gutRmutraWXxBK+Xmbdmx8ck8tU5aEkL72z/f/6ufPN3iD3c7hcJSUlHDnpapig12AcxNG4ITrFC1bUYChJFHyvHuv+dfN0x3hV0cZSWIOozomv8K/1kA529xnlC1kfDPSQlReM0m/T7nRvCPj571dyhYy6l5GgTkmZd62fdHty6iyJIQk5UxefN+iR+/NDOZH8DkvKUwTY3QPeYTWhfpSE0I09kb+tsN7+te9w/ZsC2wuQ57hb4zhjERE1BvZyA4Dw1WsIRlZvtIQlxq6QH19vbp7eKgFg5Jnra2644YHn3zhtf0H9jz74By6ZlfXn99pDqouCVE1q6piNdQPWaNH4GjXl1Rbst0jgpeanb3qqaUP3Tj5UpeyvXPw7MpZ9hxSxiL5vcK6zGiZai4c8U0t8LmAAzchApIixiNOajJT/h3rpt5fPrWAv3wGbqb92jnX5RFCev7n4Q9/uuajZ96hLsvcG0vLsgNfw87wVe1JzQXTTrtUJBH72oWUlhH0Riq26CJZtGxVfoWgbsDTJ1yt/I0xjDedSHujshyEmTEa0PLaqgxxqYGX6k3Mz88vKSkJcaX96gf+361Xz3JkJNvnVq5lub3eENqSqMX29fV1dHSEuAVOTxgBZUZR6EmCtu8UfK808cKhr1/+sF9bbehziF2hOKW0XW2M3O0e2of9EUzBah0hSVUlOC/1BCveyOfODTgZRrr7ZYh2JBddSxdlcn/Y+PGpy4QMntzT3EgvyfrezGC+S1Yq64/K9tAhbmPI0+f6KUaZ7X4ZqgER9kbf3GI6wSDULYx6njtl2bbhod4YI++NfGF74hnqN33Io1H7Qah6h/y9CVWAJc9r2omHEnI2sJDgksWFweZcEkLKyspUop2dnZpvpF6MxPgIXFCDuNkiyYEL83x54qn1ze5z3twf/V3gXGOe8ZWsDByPmcccB6lqCaWKSIQk1V01TayKuEZnkzSUKcCB+kVScilbYvHC8f5Bnsd98auzpDSPOIqSyTHlWKCrTX7cPUTf/6i/jb6RqG8lY7Y6wt7I1+XhJZp7EvCY1EYcjLg3MtsoBrrg7TbxXOoRxMz0EZ5LDdbky0+GOXlMKNfbsK+6k5CkxWsr7MLhwEnttwhcFs5EREB1PLBdeYIWcbn3nDeSh7YyKE63MTwT9AYGPqlq9JDSkjYyMpKK/9fAlMKtOt1XLxTISZnptDhPt9olB3v76JFJUxOCuhKEgs3qK1I0urr5aHDuEfVGUbGqvyHB72O4s6pGD13ziHtj6KKRQ+8EIC41WKilhYbIEULmz58f/mXetn1bD3QRUnjrg1dnhHcZn1alrnkU3kXIZTQCFlBFwvNVfOwazVIWqK/YGQWrmbTlITW6SdsdlWb5NXpUigtcCH/9Vl9QA2fEGT0SgLjUYJXi4mKe+4svvgj3Mm/Djkdfbick/5ZH754RYkxcLZN7LvPz89UjSICAEQnkJqthJIJnzIgtMUqdFT+lLVt1U/q8R+cGVWfmGI0RZ3MKVhsjpxkOhbkMkRmaGv02FNqUZTFCf6Uj7Y1Kpdk7QG5yTvTbgBInngDEpQbGGRnU8xgqWlMs0PnhE4/s7yRkzoNPPjArXGmp7Rbi7ZCOGgH1+cq3aoxauUJBasnTfT/WwkmTJNUHwwT6LdXpBSZhFrgZNIYiBMhL3sZztADHgjRFXaalzaPB40OdjSGiCf0lm3WKm18VTZjnUtRb6m9IYIsa8kxaYiqPiwpZ+3H0Rlp2iPnFIW+PDHElAHEZCf7w4rhd9c9vfLK2jxTesO2pW8P0WtbX16sVgudSRRH7hKqKJvDWbFNnQkhaom0C76KHosNQRRFXUwkrJcTEGl1RRZIkh1RF3pPv0aD5pGWl19Hw8ElX3DGrlBDi7f649XJQxhbQ6H5VFEqjByUV7kmzavRw20+7XYS90QoaXQNGY2ZVx06MWf3Y1rq8vHzXrl2EkE72F1T8eZt2b9y4v50QkuOtfeSWA5doVZMKb3n2xZ8Gc2E2NytL76anpyNUPLbmHXY37nWgv3FyCFd1Uuadzy78h7xE5fLSq7bvvYr0db3886NHgi9GQgtnZZvVw0EIKbQ5Gl2trKWhd/KIjKTsC9DNTVKH4IeZ0gQfpqbQSEAq//zuxUDN6q1p/NMdV1+XN3n19n9c7cvUuqvxK7fvw5j/qnMuTazRp6aygEqJdUV1lYExcRASWW+k4j+BLo1g4i/1nMySP3R8yDpMyO4YYW9knZ3ewZaQAo0eoIfq/TA8lxosVFZWlp7OYjEJqampCXplx+fvKDKxq5Pu/8j+Ljm9vmSAi6urq/kZTTFDAQrD4cgJzM1U5teqD93AZU1K9ylLNU/6JLpqfvA/teSFOVcGz2ncs7xpEtPQ4qy+AC3STpKtKsNLnpsZaunZAHfV/+HSjCL2JkJfRkIuJXGp981Hjvz+k0IVavwAACAASURBVIt81c9LZ7s+/o9PnjkQXFqylaK479LEmxaWs/0Y+WCrb5HZIMbX3hvpq6gsX6YvU9xkQUo37qnZGUW2hBQ2Ms4W9g/aksh6ozr9w8QYg2Izw0l4LrVZcf78+YcPHyaEVFdX33rrrYEvnrF21/trA58e80xnZ2dzc7MsU1/ZsmXLxsyDg7Eh4HsO0buxmW4B39Ev9b5298HXtNeKuqF4obMzZmq/3BhX8OeQ5/IA9S+GcrxFQJJ+Vej6PBRkebZpt3KekVaQm5zNg7jVd5IgPaC7u/rpT5XX1CDZ1FPsN0dxiy7INu2rTlqibbrN8a2ngzqBaZcJ+KUmhETSG9k0QT7kbuI3Ri6d63u/pv0n9IAE0dob+XsUe2OUFtlN2xvVb59ZE/BcarMs13yyLDc3N4dyXmormRDy6quv+kZKydKlSzVfjwuiRyAt0VaWOcdfXnRnpCneJ+rhKMucY+45l+XZ89hjXKbzBaOLkZpHQTnd5jD38Bl/22GtDSaJ/D1WU8q3yH1ucvaMtAJNlxor87LcRUwRUYlOv35R/mMTQNhgrokdwIQQVfMxT3rUQVLpzx3MvNtH2UooLiYEIC61Ya6srMzLy+Oz8F544QVtFwfN3dnZWV1dzR+VK1eu5JHpQa/AyYklUOlQnMe+H7ro3U4pkaoE9S7RK11fJa2atpxVSGJunWjWjXqU+VeRkFXTVkSzaP2VtTK/wpaQwjtOdB/mzIWu7EXqM5b+2h+lGi3NXcAwcmkZTZDcL89LXJFnctfAUvvC3ORsJtC5CIySeZRilLkfS+wLzP3iHV1qeisN4lKzRe655x5+TUdHR7T0ZV9f35YtW7jbMj09/ac//anmauGCaBOYnVHkm/FDHW5hTBkMqwZ8uIc/3Moy58xm0+nCutKYmaYk5yyxL2B1p0/eaD3PFXMwV2hpRpG5HUWEkCnJOVyysBHd6HmAfV1bIjQGZal9oTF7Wbi1Tku08fcQHqcXrS81dcmz3wgeg7IyvyLcChk2H38PUV4Zo/atVgYiJCLZElLuLLzBsHhQcRrYhj9tBCorK9Vom3379qkhONpKGZ77+eefb2pq4sduueUWuC2H44nbp/tmrmH39s1zG/8zXSlBmX5454wb49a2GN541bTliteN3pQ/h8d3e7a2EVuWh3p/Te9v47B8zkv+KToY6VxYX+9eW2iJ3rgib6nidWNBPVHRRXTmYYIyifrOGTdawd+21L6Qv3tTWS2N/5eR9WrJNw+dkBV5S62AcXy/g7q+GuIyEvNUVVWlp6fzH+Xnn39+nJMvt27dqirU+fPnq57RSGqGa6JKYEpyjl9f0ogUaVyzBulrOX+WU0l038w15p4mqJpiSnKOT0azsJ5xrjLIMfqe5Tc5rjW995eTTEu0PTTrLpZW9OC4HG/MBarOPVxiX2B676/aIX9WvI6+7SiTV8cv06m25PJqiX2B6b2/Ksb7Zq4Z9tI4XoWpRP3xgCHTT3RRMZo1kbh582aztm3i2pWRkbF48eIDBw7QoMJLl/785z9nZGTMnas5WLWvr+/JJ5/88MMP+YB4cXHxU089lZwc/lY+E9dElKwQKLQVnBvoohGmhDonuJ8jgnlG7P2eSAnKvjxL7AtWFfDJiJZAXWgrkGW50XWKuiaUlcB9D3ctAJickqghWLzvEvuCO63hb+OQpiTnTEnJqetuoF4yHqjL3le0IFTy8vcc7kIvzSj655J1ERRi0EuykiZnJ09WMPIQ7+Ch44Ha6Xtd5Bin2xzri9cmJYRehixQecY6npZouyqz9KPznzKfLXW2MA6KZtfQFr5CCv1doH16us2x4YofWwejBlCGygpxGaG57Ha7w+Gora3l13/++ectLS1z584Nf0S7pqZmy5YtDQ0N6lTLxx9/HAunR2iPibxsYfa8b/pOdw6cp5ZiN6L/pb+j4f2Mch2kXEsvKcucs774zomssh7LnjO5mMt0PvalsAsfI20T1fZcoEtsSx5LPcu5Uf1vOyy6R+mDWjCyFyQlIJdjtOCzvNBWkJZoO957kjCnI/Ooq9/vsL4+rC+y3si+2rnJ2Y/NWW+1kdyspMm+tx1C19BLCLng2Ei2TJ8r5PlUy4dK7pqSgv3ER4Iy3GeIy8hNVlJSMmvWrM8+++zSpUuyLLe3t+/bt6+zs9PhcNjtbCuIAGXX1NQ8++yze/bscblcdJRUkoqLi7dv3z5jxowAV+BwnAl8117m81/ypzlfWjG0ulQclooOpYJqiX2BBZUlt9/C7HmK/5I+0WnP5943n2gPYGVlGUaal0lSFeNaqz3LVYw+YcRd6TyIPJQ2UjFSHxP9H3/P+edZ66yJsTi9kAujYS436j3z9cox+yNVQxS1lMBfNSnG6TaHBZUlx1NoKyhMm3a858QgGWKeS36YUgo+wsNlJV+nlnfH6TbHptk/KUidOiZ4HDQWAcnpdBqrxnqrbVNT05YtW86ePctCFXgMIsnPz6+oqEhPTy8rK+MVdrlczc3NLS0tx44d6+vrEzMvWbJk06ZN4bs89UbAOvWpdR595dTeEe1l8yh9zknfOTo3U+kLvkPs3/tmrrHOlKxhLRc+1DqPvtH2jufyADumPI98GIcppOEY/U+umxzXYkpWXU/DK63/MwZGtk+MqNfZTGGmy+niMX6My6cusdSkAqEP+pNt7jNbG3/LMbJOSE/5FKbwvabfZxq6QrUk/b8yMYO/Lt4/8zZ/iZZMtbnPPNeyi6/zz0e3g2NU99VVEZdlzrm/6DZrvueYsstAXEbBrC6Xa+/evW+++WZ/f79YHH/FFXdsUwMzebYpU6bce++9lZWV4lVI65lAm/vM7m8PNLpaeSXZzyh72rDnDXvg8CcPf/r4391LM4qsE8ET0oLnvV1vnT542Fnnw0hDpfyeDuEhrz7nec7SjKJV05ZbJIIHGEMSiEoG95DnrdMHD56jW68xSUTVI/1qqyMTXJD7FiRTD+cmZ68tvNE6gVDBabuHPO931nxwttb3wsNhjsLIIV9WhiEIWwNr1bTleOsOjtdwZyEuo2ayzZs3Hz16NMziuO7ctGkTlGWYxHSV7YSr9a3TB1WJGbxuZZlzKh3LoIdGUzrhaq3uOKTsIzf69PAj022OOwtvBMbhVOin896uN9reCR9jZX4FHuRjYnzr9MFj3V+J2mh0Nn4kNzkbemhMOPy9MXyMS+0LMAoxJkmjH4S4jI4FOzo67rqLrxJCbr755oSEhJaWlo6ODj5czu9RXFyckZFRUVHxwQcfnDx5khBSUlLy4osvRqcGKCXmBNxDnmM9DUecX3ouD7S7T6vPJFtCSmHatNzk7LmZxeVZczHQE9wyHGNDb8sFb7eIka9IYktIWWS/EhiDMySEuIc8J1ynjnZ9GQRjaUaRRVa/CokrSIa6noave5vbPR0XvF18nJdn5ss6LsyeV549FxiDAOSnTrhaj3Z9ORrjdJsjLdG2MHteaUaRufcaDYnI3BkgLqNj3507d+7atYuXtX///uATKKurq7du3cozv/DCC7NmzYpOJVAKCIAACIAACIAACMSbABZRj44F3n//fV5QONuCV1ZWpqen8/z79u2LTg1QCgiAAAiAAAiAAAjogADEZRSMUFtb29nZyQv64Q9/GE6JK1eu5Nlqa2tdLlc4lyAPCIAACIAACIAACOifAMRlFGz0v//7v7yUvLw8de2h4OWuWcM3rSZ9fX3qSuzBL8FZEAABEAABEAABENA/AYjL8dqoo6Pj8GFlDQtVMgqFtiX94rs5dvvkfT3CQeJwOObPn8+PYGRcJGPY9NiGNmxz4lhxkBwvfOnQC+nfn5Ntt+fYC7K+f3/KoWE/PuMt3VrXozeO197ojeMlaMzrIS7Ha7f33ntPLWLkukKdB23fL8/4bxoYPvpPHUBvbm5uamoanQFHDEMgqKEN0wo9VBQkx2+Fzx6dfPNjycfPsgVXBxKO70+7+fu2z4YtwTv+m1iiBPTG8ZsZvXH8DI1ZAsTleO0WKJRHOvT45PLbU4+nXE4Z+xYI6xmbi9GOhjS00RoUt/qCZDTQtyU//GIiIWTxE72nnV2tb/cXEkLaUx/7I1/mPxq3sEQZ6I3RMDN6YzQoGrMMiMtx2S1wKE9P4htvTBoo9G7f4Q28YTjCesZFXxcXh2VoXdRU75UAyWhYqPPzlOOEkMyBJ+4dSiUka1n/lgpa7ue/S8TYuAbA6I0aYAXMit4YEI35T0BcjsvGgUN5sga3f9TT8EnfvVeQwONR6hxNhPWMywzxvDgsQ8ezgoa5N0hGw1RnD7Hf9BmDM1J5cfJVy4do6mSisqBFNO5i/jLQG6NhY/TGaFA0aBkQl5EbLkQoT2r+5Xzl9z3QPRDWE4iMkY6HYWgjNSeOdQXJ8cPv4VMtsy5n+crKypNpciBxIPBrri8v/vUTQG/0s4g0hd4YKTkTXAdxGbkRg4XyhF0qwnrCRoWMIAACIAACIAACBiAAcRm5kQKF8mgqEWE9mnAhMwiAQDACip+yJ0GdYenzHg1lhRhICVYszoFABATQGyOAZpZLIC4jtGTgUB7NBSKsRzMyXAACIDAmgbxll+nxk0knlUFw6eRBGjyecsVQ3pgX4CAITBgB9MYJQ6v/giEuI7RR4FAezQUirEczMlwAAiAwJoH8ioHFdIZl8qMv0vDwnkOpv64hhMgVLHh8zEtwEAQmiAB64wSBNUKxEJeRWClEKA8v8rNfZBbYc+zfS22nnyc9UJRjt2fdtG/0anMI64nEBvq5JmxD66fKOq0JSEbBMPneJ9bT8PDjv84ssucU3ZxK93BY7HlyOQvricINrFIEemMULI3eGAWIBi0C4jISw4UXyjMgDYwsPKFn7IBNhPWMJGWkzxoMbaRmxaGuIBkN6Fc/efHtX3qv4qPgKUMVP+776O2B0miUbK0y0BujYW/0xmhQNGIZktPpNGK941vndevWdXbSVeNWrly5adOmqFRm9erVfX190S0zKhVDISAAAiAAAiAAAiAQPgF4LsNnpeSMYiiPeG+E9Yg0kAYBEAABEAABEDAoAYhLzYaLYiiPeG+E9Yg0kAYBEAABEAABEDAoAYhLbYYLK5RHW5FKboT1RIQNF4EACIAACIAACOiLAMSlNnuEF8qjrUw1N8J6VBRIgAAIgAAIgAAIGJQAxKU2w0VlV55At8RuPYHI4DgIgAAIgAAIgIBRCEBcarDUBIXyiDVAWI9IA2kQAAEQAAEQAAHDEYC41GCyCQrlEWuAsB6RBtIgAAIgAAIgAAKGIwBxGa7JJi6UR6wBwnpEGkiDAAiAAAiAAAgYjgDEZbgmm9BQHrESCOsRaSANAiAAAiAAAiBgLAIQl+Haa0JDecRKIKxHpIE0CIAACIAACICAsQhAXIZlrxiE8oj1QFiPSANpEAABEAABEAABAxGAuAzLWDEI5RHrgbAekQbSIAACIAACIAACBiIAcRnaWLEJ5RHrgbAekQbSIAACIAACIAACBiIAcRnaWDEL5RGrgrAekQbSIAACIAACIAACRiEAcRnaUjEL5RGrgrAekQbSIAACIAACIAACRiEAcRnCUjEO5RFrg7AekQbSIAACIAACIAAChiAAcRnCTDEO5RFrg7AekQbSIAACIAACIAAChiAAcRnMTLEP5RFrg7AekQbSIAACIAACIAAChiAAcRnMTHEJ5RErhLAekQbSIAACIAACIAAC+icAcRnMRnEJ5RErhLAekQbSIAACIAACIAAC+icAcRnQRnEM5RHrhLAekQbSIAACIAACIAACOicAcRnQQHEM5RHrhLAekQbSIAACIAACIAACOicAcTm2geIbyiPWCWE9Ig2kQQAEQAAEQAAEdE4A4nJsA8U9lEesFsJ6RBpIgwAIgAAIgAAI6JkAxOXY1ol7KI9YLYT1iDSQBgEQAAEQAAEQ0DMBiMsxrKOTUB6xZgjrEWkgDQIgAAIgAAIgoFsCEJdjmEYnoTxizRDWI9JAGgRAAARAAARAQLcEIC5HmkY/oTxizRDWI9JAGgRAAARAAARAQLcEIC5HmkZXoTxi5RDWI9JAGgRAAARAAARAQJ8EIC5H2kVXoTxi5RDWI9JAGgRAAARAAARAQJ8EIC6H2UWHoTxi/RDWI9JAGgRAAARAAARAQIcEIC6HGUWHoTxi/RDWI9JAGgRAAARAAARAQIcEIC79RtFnKI+/foQgrEekgTQIgAAIgAAIgIAOCUBc+o2i21AefxUJQViPSANpEAABEAABEAABvRGAuPRbRLehPP4qEoKwHpEG0iAAAiAAAiAAAnojAHGpWETnoTxiv0FYj0gDaRAAARAAARAAAV0RgLhUzKHzUB6x0yCsR6SBNAiAAAiAAAiAgK4IQFxSc+g/lEfsNAjrEWkgDQIgAAIgAAIgoCsCEJfUHIYI5RH7DcJ6RBpIgwAIgAAIgAAI6IcAxCW1hSFCecROg7AekQbSIAACIAACIAAC+iEAcUkMFMoj9huE9Yg0kAYBEAABEAABENAJAYhLYqBQHrHTIKxHpIE0CIAACIAACICATghYXVwaK5RH7DQI6xFpIA0CIAACIAACIKATAlYXl4YL5RH7DcJ6RBpIgwAIgAAIgAAI6IGA1cWl4UJ5xE6DsB6RBtIgAAIgAAIgAAJ6IGBpcWnQUB6x3yCsR6SBNAiAAAiAAAiAQNwJWFpcGjSUR+w0COsRaSANAiAAAiAAAiAQdwLWFZfGDeUROw3CekQaSIMACIAACIAACMSdgHXFpaFDecR+g7AekQbSIAACIAACIAAC8SVgXXFp6FAesdMgrEekgTQIgAAIgAAIgEB8CVhUXJoglEfsNwjrEWkgDQIgAAIgAAIgEEcCFhWXJgjlETsNwnpEGkiDAAiAAAiAAAjEkYAVxaU5QnnEToOwHpEG0iAAAiAAAiAAAnEkYEVxaZpQHrHfIKxHpIE0CIAACIAACIBAvAhYUVyaJpRH7DQI6xFpIA0CIAACIAACIBAvApYTlyYL5RH7DcJ6RBpIgwAIgAAIgAAIxIWA5cSlyUJ5xE6DsB6RBtIgAAIgAAIgAAJxIWAtcWm+UB6x0yCsR6SBNAiAAAiAAAiAQFwIWEtcmjKUR+w3COsRaSANAiAAAiAAAiAQewLWEpemDOUROw3CekQaSIMACIAACIAACMSegIXEpYlDecR+g7AekQbSIAACIAACIAACMSZgIXFp4lAesdMgrEekgTQIgAAIgAAIgECMCVhFXJo7lEfsNAjrEWkgDQIgAAIgAAIgEGMCVhGXpg/lEfsNwnpEGkiDAAiAAAiAAAjEkoBVxKXpQ3nEToOwHpEG0iAAAiAAAiAAArEkYAlxaZFQHrHfIKxHpIE0CIAACIAACIBAzAhYQlxaJJRH7DQI6xFpIA0CIAACIAACIBAzAuYXl9YJ5RE7DcJ6RBpIgwAIgAAIgAAIxIyA+cWlpUJ5xH6DsB6RBtIgAAIgAAIgAAKxIWB+cWmpUB6x0yCsR6SBNAiAAAiAAAiAQGwImFxcWjCUR+w3COsRaSANAiAAAiAAAiAQAwImF5cWDOUROw3CekQaSIMACIAACIAACMSAgJnFpTVDecROg7AekQbSIAACIAACIAACMSBgZnFp2VAesd8grEekgTQIgAAIgAAIgMBEEzCbuBwcHFSRWTaURyVACBkzrEdmf2I2pEEABEAABEAABEAgKgTMJi7ffffdH/3oR7W1tR9//HFnZydnpHrvooLMcIWIYT2dnZ3vvvtuZWVlX1+f4RqCCoMACIAACIAACOifgOR0OvVfy/BrWF9fv3HjRp5flmVJkvLy8l5//fXwSzBfzo6OjrvuuovTUFununXVI0iAAAiAAAiAAAiAwPgJmM1zKRKRJIkQ4na7a2trxeFyMY/p0y6Xq66ujhDCaZi+vWggCIAACIAACIBAfAlMiu/tY3B3l8u1ZcsWQsjvfve7qVOnxuCO+rlFdXX11q1bR9cnLy9v9EEcAQEQAAEQAAEQAIHxEzCb57KsrGxMKFVVVVZTljyaR51wKWJxOBziR6RBAARAAARAAARAIFoEzCYuR3NJT09/4YUXKisrR5+ywpFNmzY9+OCDI1o6NDQ04gg+ggAIgAAIgAAIgEBUCJhcXKanp2/btm3WrFlRgWXQQm699daqqiqDVh7VBgEQAAEQAAEQMBYBQ865POFqveDtvuDtIoT0XfKkJ9kIIYW2guk2x6BzQDVAbm7ujh07MjIy1COWTVRWVubn52/evJn7LE+fPk0ICYTRnpQ9I63AsqzQcBAAARAAARAAgfEQMNJSRLXOuqNdX55wtXqG+gO1OcU76dwn37qOnPee7nv99dfz8/MD5bTg8V27du3cuTN90ZTU4sm5V39nQPYGgpCbnL0ga96CnHmzM4oC5cFxEAABEAABEAABEBhNwBjistZZ99bpDy54u9UGyDJLSkSSeZKmJELXHuJ/tq7ELf+wYUpyju8A/iV1PQ3PHnklMTtZZRES4+zJRTcXLIfEVIkhAQIgAAIgAAIgEJyA3sVlm/vMf32zt91zhjaDrQNOl2xkbZKJ7EsSIhO6qKVEEzJPszwrpi5dW3hDcARWOHve2/Vf3+w9cbGVNtaPkQIcGyMh8mW6BD2Hs9S+YG3hDWmJdPoB/kAABEAABEAABEAgCAFdi8u6noZXTr0pDIIrsohqIr+P0t867s0khLowVYlZaCuoKr3fysKozX1m68kdHCNHp3h7/erRz5CKT/qJ/mcExp+V/Aie4GGk8AEEQAAEQAAEQGAUAf2Ky1rn0VdO7WUyh4ogrofEge9RbVEOyFRcMq+mJHGhlJuc/bPiddYMUlExcjocjt/jGwiijyUTmpQ+kSRbYmrVFQ9YE2MITjgNAiAAAiAAAiDgI6DTpYhUSUR9lXwglzorx3JX+lqi/suy0ZzyZXZMli94u7ee3OEe8qh5LJJgrl9FoLMZA9QZGbayVCcgKI5iz1D/1pM72txsioJFCKKZIAACIAACIAACGgnoUVy2uc/4fJZUCLEplGHJSrHtkrKZtkwSJCLLVBg1vmwpfckwvklFNhXoksyFpcgojDTFyGUpnctKMf7XN3sthTEMSMgCAiAAAiAAAiDgJ6A7cXne27X15A4miXxD4v7aRpCiypIKJFlu95zZ3X4ggiKMeIl7yPNcyy7PUD8dB6etpw7giP+4z5j+l2F8ruX1iIvChSAAAiAAAiAAAuYmoDtx+dbpgzz0RJJY8Ml4NJFiOhYQnUALqnXWnXCxiGlzW5WQ9ztr6MpNMpuuSoe1x8+ReTBZOScuttY6j5odIdoHAiAAAiAAAiAQCQF9ics295nDzjqlHdTjFrU/mf0RQt4+czBqheq1oPPerj90fEhrl8BCccKbqxqyNTIbH+ch+W+dNj/GkECQAQRAAARAAARAYDQBfYnLPX+jw9Z0ch/1uXEZM7rOmo/wKBaJOS+t4HXzKz860TJqfwpGZpwL3m44L6NGFgWBAAiAAAiAgIkI6Ehcnvd28VW+eVg4n+cXLdQ85JzL1SPOL6NVrD7L4d5f2tio6XOloWxoXEm/31mrz+ajViAAAiAAAiAAAnEkMCmO9x5x60ZxNiSdbzni/OiP9mtmP7R5uqPx+MOPdGpYZqi+9+vRZZnmSF1PA20Lm20ZkmFa9rX/VFp5zeSsZHKp62L9/sY3DnSHJKnI/nbPmfPeLiyrbpqeg4aAAAiAAAiAQFQI6MhzqToU6ah4yPmWyfPuveZfN093aKJA9SrbTltRYJouNkjmo13UL8vnRwavclLmbdsX3b6MKktCSFLO5MX3LXr03syQ7xt+d+iw94HgN8NZEAABEAABEAABaxDQkbjkDkW/cglsgOzsVU8tfejGyZe6hgJnGnWGb2bIy2/r+9uo8yY5QIPECZESJCnE6kP2a+dcl0cI6fmfhz/86ZqPnnmHuixzbywtyw5Kgi2ZqVipobclaF6cBAEQAAEQAAEQsBwBHYlLzp4NhgcfEbd9p+B7pYkXDn398of9Gg3mE1znmQLTeLExsiveRN8+jwErnVx07WRCiPvDxo9PXSZk8OSe5kaaOet7M0P5LlUHMBeyAW+BEyAAAiAAAiAAAtYjEEpHxIqIlk1fPF+eeGp9s/ucN/dHf6etfqpohSpKSi6dSuFdON4/yCG6L351lpTmEUdRMjmmHAuMl+57FPgszoAACIAACIAACFiVgF48l+2eDtUEqgRUj4xMXO495w0pf0ZepHxmCxIFOGf4wxo0+qTMdNpcT7cKcrC3jx6ZNDUhxCsHXeCIKct2D/YZN3yfQQNAAARAAARAILoE9CIuh7WKxdwMO4IP+iLgc1rCUvqyC2oDAiAAAiAAAvEnoBdxWWjzx31HdWueUYgv+4TRqDMmOJCWaAu3FYqf0patuil9vsxzg6ozc+zCqGuZuZcL06aNnQNHQQAEQAAEQAAErEpAL+JSgyoah6lUXZmbHDwkehz3MMill7yN52hVHQvSFHWZljaPBo8PdTZ6Q7VBloipNXqo9uM8CIAACIAACIBAQAJ6EZeEEFtCCq0mXaJbFYEB6x3xCb4h4hTzisvSjCIOJwRG78n3eujylstKr6Ph4ZOuuGNWKSHE2/1x6+UQdOkimmwhUtHfHOIanAYBEAABEAABELAGAXVMNP7NLc+ed9hZR2fxyVLwNdSTMu98duE/5CUqdS69avveq0hf18s/P3qErvEY4E9ZnIeN587JLAmQy/CHC22ORlerLFMVHTQ0qrem8U93XH1d3uTV2/9xta/Zrbsav3L7PgT6V/LpVhNjDNR2HAcBEAABEAABEAhOQEeey4U5V/K6BleWLM+kdJ+yVJuXPilJTY+ZkGSJuy1tCSmzfe69MXMa+iDHKDF9Tvc6Cvx3qffNR478/pOL1IFJyKWzXR//xyfPHAglLXmZXLbOzpgZuHicAQEQAAEQAAEQsCIBHXkuuVLxzbPhpAAAB6pJREFUOduCbS5+qfe1uw++ps1csiwrnjypPHuetmsNlXt2RpEtIcVzeYBuoRlMW9JWdXdXP/1ptdb2cduUZhTFZqas1uohPwiAAAiAAAiAQBwJ6MhzmZZoW2JfwPbFDqYsI4RFlaXEg5yXTVkUYSEGuWxF3lK2ibos8Z3Uo1dtOrXAN2dhZX5F9ApGSSAAAiAAAiAAAiYhoCNxSQhZNW25EtIT2ummwQCyorGoH680o8jEY+Icysr8CltCChXTdAKrBlAhsvJVLVmBpRlFC7LmhsiP0yAAAiAAAiAAAtYjoC9xOSU55ybHtczrxoNRoqGMZOZuoyXRIff7Zq4xvZXTEm2K81JxM0YDI5WpqtdSeQ0wPUk0EARAAARAAARAQCsBfYlLQsjK/IrpNodEBGej1jYNz08XzaHj4VRZ3uS4dkpyzvDz5vy0atoKBSNrXzTUJVt9iBW0xL7A9N5fc3YLtAoEQAAEQAAEJp6A7sRlWqLtvr+7jY7q0gmD7D8Rj+zKfEEehWJZ5pxV01ZMPFK93GFT6QNscFzBGDFFQilSvy9XqNNtjvtn3qaXRqIeIAACIAACIAACOiOgO3FJCJmRVvDQrLuonOH6kjodfdMmw8bHlsskEmufRAiVREXWkkRpibaq0p8oMp1NCojAf8m4U6cvj7HKTc7eVPpA2EZARhAAARAAARAAAcsR0KO4JITMzij6Wck6n/+Suc24wuFOtFBmYuulyxKNlqZZp9scm0ofsOC6OTPSChR9yfyOXKRrUep0+SYpQQmzn25zVFkSY6juhvMgAAIgAAIgAAJ+ApLT6fR/0lmqzX3muZZdF7x82x3qO2MreFOZKdEdaGhC/VMWDPft7qOuZrTEvsDiw7jnvV2/ad71raeDsVLAcC/maIy+paCU/X2YTKecyzLn3F90mwUFutrBkAABEAABEAABEAiHgK7FJSHEPeR5o/3AYWcdbwx1XFKHpCIrfbvFiCqTZWEZbAkpq6at4HHT4bAwcZ7RGOmEAd8w+RgYqahUONsSUlbkLbXUdFUT9wQ0DQRAAARAAAQmmoDexSVvf5v7zO5vDzS6WkUczAXn00c+uckzcD20Mr8CnjaR2Hlv1xtt79T3fi0eDIKRELJ86pJV05YDo0gMaRAAARAAARAAgSAEjCEueQPa3GcaXa2HLhzxjfCObJctIaU0o2iR/cryrLnQQyPp+D6f93Yd62442v3VCLHuO0//Lcucs8h+ZWlGkUVWbhLbjjQIgAAIgAAIgMB4CBhJXKrtdA952tkMwgvernP9zhnp30lLTOVhQGoeJEISAMaQiJABBEAABEAABEBAKwFDikutjUR+EAABEAABEAABEACB2BDQ6VJEsWk87gICIAACIAACIAACIBBdAhCX0eWJ0kAABEAABEAABEDA0gQMLS7bkn7x3Ry7ffK+HkvbcByNlw69kP79Odl2e469IOv796ccAslx0MSlIAACIAACIAAChEwyKoTOg7bbb089btTq66Lenz06+eYXE5WqDCQc35928+cJ733iuZpGR+EPBEAABEAABEAABCIgYEjPpXTo8cnlt6ceT7mcEkGTcQkn0Jb8MFOWi5/oPe3san27v5AQ0p762B/FJekBCwRAAARAAARAAAQ0ETCiuOxJfOONSQOF3u07vDM0NRaZBQKdn6dQv2/mwBP3DqUSkrWsf0sFPf357xIxNi5wQhIEQAAEQAAEQEATASOKy6zB7R/1NHzSd+8VpF9TY5FZIHD2ELP9jMEZyiC4fNXyIXr+ZGKnkA1JEAABEAABEAABENBCwJhzLlPzL2NaoBYzj5G35ywb/s66nOU7mZXHNtMcSBzoJwR8fVjwLwiAAAiAAAiAgBYCRvRcamkf8oIACIAACIAACIAACMSQAMRlDGHr6laKn7InQZ1h6fNlDmXBbakrU6EyIAACIAACIGAkAhCXRrJWNOuat+wyLe5k0kll4qp08iBdlijliqG8aN4HZYEACIAACIAACFiKAMSlpcwtNDa/YmAxIWQg+dEXaXh4z6HUX9cQQuQKFjwuZEQSBEAABEAABEAABMInIDmdzvBz6yXnZ7/IvPm/EweGVedyxY7eP9zKQlKGHceHgAQ+ezTzh+oi6jzXYvdfqgdKA16BEyAAAiAAAiAAAiAQnIBBPZcD0nBlSQhJ6MG6RMFtPers1U9efPuX3qv4KHjKUMWP+z56G8pyFCYcAAEQAAEQAAEQ0EDAmJ5LDQ1EVhAAARAAARAAARAAgdgRMKjnMnaAcCcQAAEQAAEQAAEQAIHwCUBchs8KOUEABEAABEAABEAABEIQgLgMAQinQQAEQAAEQAAEQAAEwicAcRk+K+QEARAAARAAARAAARAIQQDiMgQgnAYBEAABEAABEAABEAifAMRl+KyQEwRAAARAAARAAARAIAQBiMsQgHAaBEAABEAABEAABEAgfAIQl+GzQk4QAAEQAAEQAAEQAIEQBCAuQwDCaRAAARAAARAAARAAgfAJQFyGzwo5QQAEQAAEQAAEQAAEQhCAuAwBCKdBAARAAARAAARAAATCJwBxGT4r5AQBEAABEAABEAABEAhBAOIyBCCcBgEQAAEQAAEQAAEQCJ/A/wfqIzbaaS6fUQAAAABJRU5ErkJggg==)" 191 | ] 192 | }, 193 | { 194 | "cell_type": "markdown", 195 | "metadata": { 196 | "id": "7oNn_QGMvHnp", 197 | "colab_type": "text" 198 | }, 199 | "source": [ 200 | "Como podemos ver na imagem acima, o que acontece é que, no primeiro exemplo, vários números tem o seu fibonacci calculado repetidamente (veja o caso do número 2 e 3), e o que a programação dinâmica nos entrega é uma forma de armazenar esses dados, afim de melhorar a complexidade assintótica de nosso algoritmo." 201 | ] 202 | }, 203 | { 204 | "cell_type": "markdown", 205 | "metadata": { 206 | "id": "S4YkJspc7CVc", 207 | "colab_type": "text" 208 | }, 209 | "source": [ 210 | "--------------------" 211 | ] 212 | }, 213 | { 214 | "cell_type": "markdown", 215 | "metadata": { 216 | "id": "GcPNYtge2Xf_", 217 | "colab_type": "text" 218 | }, 219 | "source": [ 220 | "##Exemplos" 221 | ] 222 | }, 223 | { 224 | "cell_type": "markdown", 225 | "metadata": { 226 | "id": "vCMC8_ZW2cJB", 227 | "colab_type": "text" 228 | }, 229 | "source": [ 230 | "Agora vamos aos exemplos, começando pela questão 303 do LeetCode, que pode ser encontrada no link a seguir:\n", 231 | "- https://leetcode.com/problems/range-sum-query-immutable/" 232 | ] 233 | }, 234 | { 235 | "cell_type": "markdown", 236 | "metadata": { 237 | "id": "ksBVY02K2pvf", 238 | "colab_type": "text" 239 | }, 240 | "source": [ 241 | "303. Dado um array de números inteiros, encontre a soma dos elementos entre os índices i e j (i ≤ j), de forma inclusiva." 242 | ] 243 | }, 244 | { 245 | "cell_type": "code", 246 | "metadata": { 247 | "id": "fO-tQlHO279-", 248 | "colab_type": "code", 249 | "colab": {} 250 | }, 251 | "source": [ 252 | "class NumArray:\n", 253 | "\n", 254 | " _sum_list = None\n", 255 | " \n", 256 | " def __init__(self, nums: List[int]):\n", 257 | " \n", 258 | " self._sum_list = list()\n", 259 | " \n", 260 | " for index in range(len(nums) + 1):\n", 261 | " num = nums[index - 1] if index > 0 else 0\n", 262 | " \n", 263 | " if index >= 1:\n", 264 | " self._sum_list.append(self._sum_list[index - 1] + num)\n", 265 | " else:\n", 266 | " self._sum_list.append(num)\n", 267 | " \n", 268 | "\n", 269 | " def sumRange(self, i: int, j: int) -> int:\n", 270 | " \n", 271 | " return self._sum_list[j + 1] - self._sum_list[i]\n" 272 | ], 273 | "execution_count": 0, 274 | "outputs": [] 275 | }, 276 | { 277 | "cell_type": "markdown", 278 | "metadata": { 279 | "id": "uohLTTRm3APt", 280 | "colab_type": "text" 281 | }, 282 | "source": [ 283 | "O problema dessa questão está no fato que o método sumRange será chamado várias vezes, fazendo com que seja necessário recalcular a soma entre as posições várias vezes, de tal forma que a complexidade assintótica depende da quantidade de vezes que o método sumRange é chamado. Exemplificando:\n", 284 | "- Caso o método seja chamado n vezes, sendo n o tamanho do array de nums, a complexidade desse problema seria de O(n * n), no pior caso." 285 | ] 286 | }, 287 | { 288 | "cell_type": "markdown", 289 | "metadata": { 290 | "id": "pJ5xerjV38A1", 291 | "colab_type": "text" 292 | }, 293 | "source": [ 294 | "Para contornar esse problema, nós fazemos um processamento inicial, calculando a soma de todas as posições em relação aos seus anteriores, totalizando assim uma complexidade assintótica de O(n)." 295 | ] 296 | }, 297 | { 298 | "cell_type": "markdown", 299 | "metadata": { 300 | "id": "xphnVzdF43z5", 301 | "colab_type": "text" 302 | }, 303 | "source": [ 304 | "Esse procedimento é necessário para criar uma \"memória\" das somas, de tal forma que, quando seja necessário calcular a soma entre as posições i e j, esse cálculo seja realizado de forma constante, ou seja, em O(1)." 305 | ] 306 | }, 307 | { 308 | "cell_type": "markdown", 309 | "metadata": { 310 | "id": "gJjXfyqD4U2L", 311 | "colab_type": "text" 312 | }, 313 | "source": [ 314 | "------------" 315 | ] 316 | }, 317 | { 318 | "cell_type": "markdown", 319 | "metadata": { 320 | "id": "ivlMoYW95WlY", 321 | "colab_type": "text" 322 | }, 323 | "source": [ 324 | "Partindo agora para resolução de problemas mais complexos, vamos resolver a questão 62, que pode ser encontrada no link a seguir:\n", 325 | "- https://leetcode.com/problems/unique-paths/" 326 | ] 327 | }, 328 | { 329 | "cell_type": "markdown", 330 | "metadata": { 331 | "id": "YEbr0IAn55u3", 332 | "colab_type": "text" 333 | }, 334 | "source": [ 335 | "62. Um robô está localizado no canto superior esquerdo de uma matriz m x n. Ele só pode se mover ou para baixo ou para direita. O robô está tentando chegar ao canto inferiror direito da matriz. Nós devemos calcular a quantidade de caminhos únicos que o robô pode tomar.\n" 336 | ] 337 | }, 338 | { 339 | "cell_type": "code", 340 | "metadata": { 341 | "id": "eIpuxYgm6mRr", 342 | "colab_type": "code", 343 | "colab": {} 344 | }, 345 | "source": [ 346 | "class Solution:\n", 347 | "\n", 348 | " def uniquePaths(self, m: int, n: int) -> int:\n", 349 | " # Iniciamos os caminhos possíveis com 1, pois em uma matriz de 1 x 1, o robô só possui um caminho a tomar\n", 350 | " possible_paths = [[1 for col in range(m)] for row in range(n)]\n", 351 | " \n", 352 | " for a in range(1, n):\n", 353 | " for b in range(1, m):\n", 354 | " possible_paths[a][b] = possible_paths[a - 1][b] + possible_paths[a][b - 1]\n", 355 | " \n", 356 | " return possible_paths[n - 1][m - 1]" 357 | ], 358 | "execution_count": 0, 359 | "outputs": [] 360 | }, 361 | { 362 | "cell_type": "markdown", 363 | "metadata": { 364 | "id": "sCK_x0AX64IQ", 365 | "colab_type": "text" 366 | }, 367 | "source": [ 368 | "Esse problema pode ser considerado como um exemplo clássico do uso de programação dinâmica, uma vez que, pensando na forma recursiva, nós temos que a quantidade de caminhos que o robô pode tomar é igual a quantidade de caminhos tanto a esquerda quanto acima, uma vez que estamos falando de uma matriz em 2D. O que poderia nos levar a seguinte resolução:" 369 | ] 370 | }, 371 | { 372 | "cell_type": "code", 373 | "metadata": { 374 | "id": "T-kwDSDw8pnV", 375 | "colab_type": "code", 376 | "colab": {} 377 | }, 378 | "source": [ 379 | "def caminhosUnicos(m, n):\n", 380 | " if m == 1 and n == 1:\n", 381 | " return 1\n", 382 | " if m == 0 or n == 0:\n", 383 | " return 0\n", 384 | " return caminhosUnicos(m - 1, n) + caminhosUnicos(m, n - 1)" 385 | ], 386 | "execution_count": 0, 387 | "outputs": [] 388 | }, 389 | { 390 | "cell_type": "markdown", 391 | "metadata": { 392 | "id": "LJxfnZbw9UiG", 393 | "colab_type": "text" 394 | }, 395 | "source": [ 396 | "Porém, como nós já vimos, essa resolução nos leva ao problema do re-processamento desnecessário, de tal forma que certos elementos no espaço serão recalculados várias vezes, liderando a uma complexidade exponencial." 397 | ] 398 | }, 399 | { 400 | "cell_type": "markdown", 401 | "metadata": { 402 | "id": "9wcefjqd9keq", 403 | "colab_type": "text" 404 | }, 405 | "source": [ 406 | "Para tal, nós chegamos ao código mostrado na primeira célula, onde usamos uma matriz para armazenar os possíveis caminhos, seguindo de forma iterativa até termos preenchido toda a matriz com os possíveis caminhos, diminuindo a complexidade assintótica do problema de exponencial para O(n * m)." 407 | ] 408 | }, 409 | { 410 | "cell_type": "markdown", 411 | "metadata": { 412 | "id": "FOYi9gjI64MI", 413 | "colab_type": "text" 414 | }, 415 | "source": [ 416 | "--------------------" 417 | ] 418 | }, 419 | { 420 | "cell_type": "markdown", 421 | "metadata": { 422 | "id": "5we0q2v4VhNe", 423 | "colab_type": "text" 424 | }, 425 | "source": [ 426 | "Caso tenha interesse, a seguir nós listamos a resolução do problema 123, que é um problema do nível difícil e que usa programação dinâmica, seguem os links para o problema a para a resolução, respectivamente:\n", 427 | "- https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/\n", 428 | "- https://leetcode.com/playground/TVPEFDu8\n", 429 | "- OBS: A resolução foi implementada em C++, então se segure bem na cadeira antes de abrir esse link hahaha." 430 | ] 431 | }, 432 | { 433 | "cell_type": "markdown", 434 | "metadata": { 435 | "id": "DBF0WwMEWShr", 436 | "colab_type": "text" 437 | }, 438 | "source": [ 439 | "---------" 440 | ] 441 | }, 442 | { 443 | "cell_type": "markdown", 444 | "metadata": { 445 | "id": "kUUS8-g07IZC", 446 | "colab_type": "text" 447 | }, 448 | "source": [ 449 | "## Colaboradores" 450 | ] 451 | }, 452 | { 453 | "cell_type": "markdown", 454 | "metadata": { 455 | "id": "6SzJUVLQs61C", 456 | "colab_type": "text" 457 | }, 458 | "source": [ 459 | "* André Winston \n", 460 | "* Camila Duarte\n", 461 | "* Anderson Medeiros\n", 462 | "\n" 463 | ] 464 | } 465 | ] 466 | } -------------------------------------------------------------------------------- /greedy/greedy-algorithms.ipynb: -------------------------------------------------------------------------------- 1 | { 2 | "nbformat": 4, 3 | "nbformat_minor": 0, 4 | "metadata": { 5 | "colab": { 6 | "name": "Programação Gulosa.ipynb", 7 | "provenance": [], 8 | "collapsed_sections": [], 9 | "toc_visible": true 10 | }, 11 | "kernelspec": { 12 | "name": "python3", 13 | "display_name": "Python 3" 14 | } 15 | }, 16 | "cells": [ 17 | { 18 | "cell_type": "markdown", 19 | "metadata": { 20 | "id": "aof5Xlf20n1P", 21 | "colab_type": "text" 22 | }, 23 | "source": [ 24 | "# Algoritmos Gulosos\n", 25 | "Uma introdução à estratégia de programação 'gulosa'" 26 | ] 27 | }, 28 | { 29 | "cell_type": "markdown", 30 | "metadata": { 31 | "id": "kjFOBoPw05pQ", 32 | "colab_type": "text" 33 | }, 34 | "source": [ 35 | "![alt text](https://miro.medium.com/max/714/1*o0YLvMkmvhA-QG1YGsRhKg.jpeg)" 36 | ] 37 | }, 38 | { 39 | "cell_type": "markdown", 40 | "metadata": { 41 | "id": "6cV0V9GF0hUw", 42 | "colab_type": "text" 43 | }, 44 | "source": [ 45 | "De modo geral, algoritmos gulosos são aqueles que **sempre tomam a melhor decisão** que ele consegue encontrar, no conjunto de decisões possíveis a cada iteração, possuindo como objetivo 'coletar' um conjunto de melhores soluções com base em algum determinado critério, formando assim a solução do problema. Os critérios que definem o que seria a melhor decisão a tomar em certa iteração irão variar para cada problema. \n", 46 | "\n", 47 | "Tomem como exemplo, a situação em que você tem de sair da sua casa até um certo supermercado da sua cidade. Há várias ruas no caminho, todas com certo comprimento e você decide por utilizar uma abordagem gulosa para chegar até lá. A cada vez que você tem que escolher por qual rua seguir, você decide pela rua com menor comprimento, até chegar ao destino final, o supermercado. \n", 48 | "\n", 49 | "No exemplo, cada 'iteração' significa: **Escolha uma rua para seguir**. E a 'decisão gulosa' que foi escolhida foi: **Siga pela rua mais curta**. \n", 50 | "\n", 51 | "Vale reforçar que a tomada de decisão é com base nas informações disponíveis na iteração corrente, sem levar em consideração possíveis consequências futuras da escolha da decisão, ou seja, depois que uma decisão foi tomada, ela não pode ser desfeita.\n", 52 | "\n", 53 | "O algoritmo sempre tenta encontrar a melhor solução local, para no fim obter uma solução que resolva o problema, não necessariamente da melhor forma possível.\n", 54 | "\n" 55 | ] 56 | }, 57 | { 58 | "cell_type": "markdown", 59 | "metadata": { 60 | "id": "ReslvGAOHnRR", 61 | "colab_type": "text" 62 | }, 63 | "source": [ 64 | "O grafo a baixo ilustra a ideia dos algoritmos gulosos, a cada iteração, o critério utilizado para percorrer o gráfo é escolher o filho de maior peso.\n", 65 | "\n", 66 | "![alt text](https://d18l82el6cdm1i.cloudfront.net/uploads/EKKlGLuUQd-greedy-search-path.gif)" 67 | ] 68 | }, 69 | { 70 | "cell_type": "markdown", 71 | "metadata": { 72 | "id": "bSMxD8K4M6vo", 73 | "colab_type": "text" 74 | }, 75 | "source": [ 76 | "Mas a ideia do problema seria encontrar o caminhos de maior custos (custo é dado pela soma dos nos), nesse problema o algoritimo guloso, não consegue alcançar a melhor solução." 77 | ] 78 | }, 79 | { 80 | "cell_type": "markdown", 81 | "metadata": { 82 | "id": "Qo3jB9lc20x3", 83 | "colab_type": "text" 84 | }, 85 | "source": [ 86 | "\n", 87 | "# Características\n", 88 | "1. Jamais se arrepende de uma decisão, as escolhas realizadas são definitivas;\n", 89 | "2. Não leva em consideração as consequências de suas decisões;\n", 90 | "3. Podem fazer cálculos repetitivos;\n", 91 | "4. Nem sempre produz a melhor solução final (depende da quantidade de informação fornecida);\n", 92 | "5. Quanto mais informações, maior a chance de produzir uma solução melhor\n", 93 | "\n", 94 | "\n", 95 | "\n", 96 | "\n", 97 | "\n", 98 | "\n", 99 | "\n", 100 | "\n" 101 | ] 102 | }, 103 | { 104 | "cell_type": "markdown", 105 | "metadata": { 106 | "id": "Tvx-dqGn5_Ot", 107 | "colab_type": "text" 108 | }, 109 | "source": [ 110 | "\n", 111 | "# Vantagens\n", 112 | "\n", 113 | "1. Simples e fácil de implementação;\n", 114 | "2. Algoritmos de rápida execução;\n", 115 | "3. Podem fornecer a melhor solução (estado ideal).\n" 116 | ] 117 | }, 118 | { 119 | "cell_type": "markdown", 120 | "metadata": { 121 | "id": "DxzDyS8Q6vIG", 122 | "colab_type": "text" 123 | }, 124 | "source": [ 125 | "#Desvantagens\n", 126 | "1. Nem sempre conduz a soluções ótimas globais. Podem efetuar cálculos repetitivos.\n", 127 | "2. Escolhe o caminho que, à primeira vista, é mais econômico.\n", 128 | "3. Pode entrar em loop se não detectar a expansão de estados repetidos.\n", 129 | "4. Pode tentar desenvolver um caminho infinito." 130 | ] 131 | }, 132 | { 133 | "cell_type": "markdown", 134 | "metadata": { 135 | "id": "RvJEyY2LDxnS", 136 | "colab_type": "text" 137 | }, 138 | "source": [ 139 | "#Exemplos\n", 140 | "\n", 141 | "Os exemplos abaixo são questões provindas do site LeetCode, que possui questões de algoritmos dos mais diversos assuntos e que comumente aparecem em entrevistas de programação" 142 | ] 143 | }, 144 | { 145 | "cell_type": "markdown", 146 | "metadata": { 147 | "id": "9jnR3KL1D1Zw", 148 | "colab_type": "text" 149 | }, 150 | "source": [ 151 | "**EXEMPLO 1**\n", 152 | "[Questão 1221](https://leetcode.com/problems/split-a-string-in-balanced-strings/) do site leetcode\n", 153 | "\n", 154 | "**Separe uma string em strings balanceadas**\n", 155 | "\n", 156 | "String balanceadas são aquelas que possuem quantidades iguais de caracteres 'L' e 'R'.\n", 157 | "\n", 158 | "Dada uma string, divida-a na quantidade máxima de substrings balanceadas. Retorne a quantidade máxima de string balanceadas divididas." 159 | ] 160 | }, 161 | { 162 | "cell_type": "markdown", 163 | "metadata": { 164 | "id": "h_a_0fu2W9sX", 165 | "colab_type": "text" 166 | }, 167 | "source": [ 168 | "O problema pode ser compreendido da seguinte forma:\n", 169 | "\n", 170 | "Para separar a string de maneira correta, temos que iniciar dois contadores, um para \"L\" e um para \"R\".\n", 171 | "\n", 172 | "Depois de iniciar os contadores, vamos interar sobre a string adcionando aos contadores as ocorrencias de \"L\" e \"R\" e sempre que o valor dos contadores de \"R\" e \"L\" forem iguais e maiores que 0 é certo que ali está uma sub string balanceada.\n", 173 | "\n", 174 | "Nesse momento o algoritmo deve separar a string, fazendo uma ação definitiva, caracteristica de programação gulosa.\n", 175 | "\n", 176 | "No fim do laço basta retorna o numero de separações que a string teve ao longo da execução, que foi armazenado em \"output\".\n", 177 | "\n", 178 | "Segue abaixo o codigo da função:" 179 | ] 180 | }, 181 | { 182 | "cell_type": "code", 183 | "metadata": { 184 | "id": "ZQxQek8jCTgh", 185 | "colab_type": "code", 186 | "colab": {} 187 | }, 188 | "source": [ 189 | "def balanced_strings_split(s):\n", 190 | " count = {\n", 191 | " \"L\" : 0,\n", 192 | " \"R\" : 0,\n", 193 | " }\n", 194 | " output = 0\n", 195 | " for char in s:\n", 196 | " count[char] +=1\n", 197 | " if count[\"L\"] == count[\"R\"]:\n", 198 | " output += 1\n", 199 | " return output" 200 | ], 201 | "execution_count": 0, 202 | "outputs": [] 203 | }, 204 | { 205 | "cell_type": "markdown", 206 | "metadata": { 207 | "id": "N4Flpk4bXGzt", 208 | "colab_type": "text" 209 | }, 210 | "source": [ 211 | "Testando o codigo com uma entrada balanceada:" 212 | ] 213 | }, 214 | { 215 | "cell_type": "code", 216 | "metadata": { 217 | "id": "MyIKK0g8DGUy", 218 | "colab_type": "code", 219 | "colab": {} 220 | }, 221 | "source": [ 222 | "print(balanced_strings_split(\"LLLRRLRRLRRRLRLL\"))" 223 | ], 224 | "execution_count": 0, 225 | "outputs": [] 226 | }, 227 | { 228 | "cell_type": "markdown", 229 | "metadata": { 230 | "id": "cTU0JwDRDTfE", 231 | "colab_type": "text" 232 | }, 233 | "source": [ 234 | "**EXEMPLO 2**\n", 235 | "[Questão 55](https://leetcode.com/problems/jump-game/). Jump Game do site leetcode\n", 236 | "\n", 237 | "**Dada uma matriz de números inteiros não negativos, você está inicialmente posicionado no primeiro índice da matriz.**\n", 238 | "\n", 239 | "\n", 240 | "Cada elemento da matriz representa seu comprimento máximo de salto nessa posição.\n", 241 | "\n", 242 | "Determine se você consegue alcançar o último índice." 243 | ] 244 | }, 245 | { 246 | "cell_type": "markdown", 247 | "metadata": { 248 | "id": "cF_ZwDRCEIxB", 249 | "colab_type": "text" 250 | }, 251 | "source": [ 252 | "Solução:\n" 253 | ] 254 | }, 255 | { 256 | "cell_type": "code", 257 | "metadata": { 258 | "id": "bYUjUMSZGMgu", 259 | "colab_type": "code", 260 | "colab": {} 261 | }, 262 | "source": [ 263 | "def canJump(self, nums: List[int]) -> bool:\n", 264 | " r=0\n", 265 | " for l in range(len(nums)):\n", 266 | " if l>r:\n", 267 | " return False\n", 268 | " r=max(r,l+nums[l])\n", 269 | " if r>=len(nums)-1:\n", 270 | " return True" 271 | ], 272 | "execution_count": 0, 273 | "outputs": [] 274 | }, 275 | { 276 | "cell_type": "markdown", 277 | "metadata": { 278 | "id": "bU4EglKMVlMW", 279 | "colab_type": "text" 280 | }, 281 | "source": [ 282 | "**EXEMPLO 3**\n", 283 | "[763.](https://leetcode.com/problems/partition-labels/). Partition Labels\n", 284 | "\n", 285 | "Uma sequência S de letras minúsculas é fornecida. Queremos particionar essa string em tantas partes quanto possível, para que cada letra apareça em no máximo uma parte e retorne uma lista de números inteiros representando o tamanho dessas partes.\n", 286 | "\n", 287 | "Seja: \n", 288 | "\n", 289 | "Entrada: S = \"ababcbacadefegdehijhklij\"\n", 290 | "\n", 291 | "Saída: [9,7,8]\n", 292 | "\n", 293 | "Explicando a saída:\n", 294 | "\n", 295 | "As partições são \"ababcbaca\", \"defegde\", \"hijhklij\"." 296 | ] 297 | }, 298 | { 299 | "cell_type": "markdown", 300 | "metadata": { 301 | "id": "Im-wydjVjxat", 302 | "colab_type": "text" 303 | }, 304 | "source": [ 305 | "Para entendermos como resolver esse problema, podemos ver a ideia de algortimos gulosos, que sempre vão executar a melhor ação dada as condições atuais. E também não vai mudar seu comportamento perante isso.\n", 306 | "\n", 307 | "\n", 308 | "Temos que percorrer toda a string e verificar se o caractere atual, a sua ultima ocorrencia estoura o limite da partição definida pelo primeiro caractere, se estourar, dizemos que a ultima ocorrencia desse novo caractere é o limite da partição.\n", 309 | "\n", 310 | "Percorremos a string até encontrar o limite da partição com essa limitação sendo verdadeira, se isso ocorrer podemos iniciar uma segunda partição." 311 | ] 312 | }, 313 | { 314 | "cell_type": "markdown", 315 | "metadata": { 316 | "id": "5XD1_Rks1oAn", 317 | "colab_type": "text" 318 | }, 319 | "source": [ 320 | "Abaixo uma solução com as regras corrigidas e citadas." 321 | ] 322 | }, 323 | { 324 | "cell_type": "code", 325 | "metadata": { 326 | "id": "c7_NFhVv0gJ0", 327 | "colab_type": "code", 328 | "colab": {} 329 | }, 330 | "source": [ 331 | "def partition_labels(s):\n", 332 | " last = {c: i for i,c in enumerate(s)}\n", 333 | " j = anchor = 0\n", 334 | " ans = []\n", 335 | " for i,c in enumerate(s):\n", 336 | " j = max(j,last[c])\n", 337 | " if i == j:\n", 338 | " ans.append(i-anchor + 1)\n", 339 | " anchor = i + 1\n", 340 | " return ans" 341 | ], 342 | "execution_count": 0, 343 | "outputs": [] 344 | }, 345 | { 346 | "cell_type": "markdown", 347 | "metadata": { 348 | "id": "ZiwbAjYS2-2u", 349 | "colab_type": "text" 350 | }, 351 | "source": [ 352 | "Teste da solução" 353 | ] 354 | }, 355 | { 356 | "cell_type": "code", 357 | "metadata": { 358 | "id": "srsyesM01I4m", 359 | "colab_type": "code", 360 | "outputId": "4377cdcc-c1bc-4921-8787-5c6ad9682997", 361 | "colab": { 362 | "base_uri": "https://localhost:8080/", 363 | "height": 34 364 | } 365 | }, 366 | "source": [ 367 | "partition_labels(\"ababcbacadefegdehijhklij\")" 368 | ], 369 | "execution_count": 0, 370 | "outputs": [ 371 | { 372 | "output_type": "execute_result", 373 | "data": { 374 | "text/plain": [ 375 | "[9, 7, 8]" 376 | ] 377 | }, 378 | "metadata": { 379 | "tags": [] 380 | }, 381 | "execution_count": 70 382 | } 383 | ] 384 | } 385 | ] 386 | } -------------------------------------------------------------------------------- /priority-queue/README.md: -------------------------------------------------------------------------------- 1 | # Fila de prioridade 2 | 3 | Veja o no Medium uma explicação detalhada sobre filas de prioridade, e o que você deve ter em mente para quando tentar resolver essas questões, segue o link: 4 | https://medium.com/@wander.alves13/37e39985e302 5 | 6 | ## Questões do leet code resolvidadas 7 | 8 | 1. [Partition List](question86.md) 9 | 10 | + Dificuldade: Média 11 | 12 | 215. [Kth Largest Element in an Array](question215.md) 13 | 14 | + Dificuldade: Média 15 | 16 | 767. [Reorganize String](question767.md) 17 | 18 | + Dificuldade: Média 19 | 20 | ## Implementação: 21 | 22 | + Python 3 23 | 24 | Authors: 25 | 26 | + [Pablo Emanuell](https://github.com/pabloufrn) 27 | + [Graco Silva](https://github.com/gbvsilva) 28 | + [Wanderson Alves](https://github.com/wanderson130) 29 | 30 | <- [BACK TO HOME](../README.md) -------------------------------------------------------------------------------- /priority-queue/question215.md: -------------------------------------------------------------------------------- 1 | # 215. Kth Largest Element in an Array 2 | 3 | ## Solução 4 | 5 | > Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. 6 | > 7 | > **Example 1:** 8 | > 9 | > ``` 10 | > Input: [3,2,1,5,6,4] and k = 2 11 | > Output: 5 12 | > ``` 13 | > 14 | > **Example 2:** 15 | > 16 | > ```Input: [3,2,3,1,2,4,5,5,6] and k = 4 17 | > Output: 4 18 | > ``` 19 | > **Note:** 20 | > You may assume k is always valid, 1 ≤ k ≤ array's length. 21 | 22 | Para resolver essa questão, podemos ordenar a lista em ordem decrescente e retornar o k-ésimo termo, porém para economizar espaço podemos guardar apenas os cinco maiores elementos em uma fila e retornar o menor. 23 | 24 | ## Implementação 25 | 26 | Como sempre iniciamos declarando a lista, depois, para cada elemento na lista adicionamos ele na fila, e, como queremos guardar apenas os `k` maiores elementos, se o tamanho da fila é maior que `k`, removemos o menor. No final, apenas retornamos o menor elemento da fila. Veja o código: 27 | 28 | ```Python 3 29 | pqueue = [] 30 | for el in nums: 31 | heappush(pqueue, el) 32 | if(len(pqueue) > k): 33 | heappop(pqueue) 34 | return pqueue[0] 35 | ``` 36 | 37 | + [Código completo](./question215.py) 38 | + [Pratique no LeetCode](https://leetcode.com/problems/kth-largest-element-in-an-array/) 39 | 40 | Viu algum erro? mande um email para pabloemanuell2017@gmail.com 41 | 42 | [<- ANTERIOR](question86.md) | [PRÓXIMA ->](question767.md) 43 | 44 | [VOLTAR PARA O ÍNICIO](README.md) 45 | -------------------------------------------------------------------------------- /priority-queue/question215.py: -------------------------------------------------------------------------------- 1 | from heapq import * 2 | 3 | class Solution: 4 | def findKthLargest(self, nums: List[int], k: int) -> int: 5 | pqueue = [] 6 | for el in nums: 7 | heappush(pqueue, el) 8 | if(len(pqueue) > k): 9 | heappop(pqueue) 10 | return pqueue[0] 11 | 12 | -------------------------------------------------------------------------------- /priority-queue/question767.md: -------------------------------------------------------------------------------- 1 | # 767. Reorganize String 2 | 3 | ## Solução 4 | 5 | > Given a string `S`, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. 6 | > 7 | > If possible, output any possible result. If not possible, return the empty string. 8 | > 9 | > **Example 1:** 10 | >
11 | >  Input: S = "aab"
12 | >  Output: = "aba"
13 | > 
14 | > **Example 2:** 15 | >
16 | >  Input: S = "aaab"
17 | >  Output: = ""
18 | > 
19 | > **Note:** 20 | > - `S` will consist of lowercase letters and have length in range` [1, 500]`. 21 | 22 | Para resolver essa questão, é necessário seguir uma estrátegia para tentar reorganizar a string. Devemos perceber que as letras que mais ocorrem são as que causam mais problemas. Podemos alternar entre as duas letras com maior número de ocorrências na string das letras que ainda precisam ser organizadas. Como na questão [86](question86.md), precisamos de uma tupla, que nesse caso terá primeiro o número de ocorrências e depois o valor. 23 | 24 | Além disso temos um valor máximo do maior número de ocorrências, imagine que a letra que mais ocorre é um separador, se tivermos `k` separadores, precisamos de, no mínimo `k` letras restantes, se `k` for ímpar e `k-1` letras restantes se `k` for par. Em geral `k` pode ser no máximo `piso(n + 1 / 2)` . 25 | 26 | ## Implementação 27 | 28 | Para fazer a contagem, usamos um dicionário, primeiro precisamos colocar os elementos nele: 29 | 30 | ```Python 31 | C = {} 32 | max_count = (len(S) + 1) // 2 33 | for ch in S: 34 | count = C.get(ch, 0) + 1 35 | if(count > max_count): 36 | return "" 37 | C[ch] = count 38 | ``` 39 | 40 | Depois é só ordenar pelos critérios discutidos. Mas como temos uma min-heap, e queremos que os elementos com maior número de ocorrências venham primeiro, utilizamos o valor negativo para as ocorrências. 41 | 42 | ```Python 43 | pq = [] 44 | for key, value in C.items(): 45 | pq.append((-value, key)) 46 | heapify(pq) 47 | ``` 48 | 49 | Por fim organizamos a nova string, alternando entre os dois elementos com mais ocorrências (atualmente), sempre diminuindo o número de ocorrências em 1 (ou seja, somando 1 no número negativo de ocorrências), e retornamos o resultado. 50 | 51 | ```Python 3 52 | result = "" 53 | while(len(pq) > 1): 54 | p1, v1 = heappop(pq) 55 | p2, v2 = heappop(pq) 56 | result += v1 + v2 57 | if(p1 != -1): 58 | heappush(pq, (p1 + 1, v1)) 59 | if(p2 != -1): 60 | heappush(pq, (p2 + 1, v2)) 61 | if(len(pq) == 1): 62 | result += heappop(pq)[1] 63 | return result 64 | ``` 65 | 66 | Como pode ser observado, ao pegar os elementos dois a dois, pode ser que sobre um, se sobrar é só concatenar no resultado. 67 | 68 | - [Código completo](./question767.py) 69 | 70 | - [Pratique no LeetCode](https://leetcode.com/problems/reorganize-string/) 71 | 72 | Viu algum erro? mande um email para pabloemanuell2017@gmail.com 73 | 74 |  | [<- ANTERIOR](question215.md) 75 |  | [<- VOLTAR PARA O ÍNICIO](README.md) 76 | -------------------------------------------------------------------------------- /priority-queue/question767.py: -------------------------------------------------------------------------------- 1 | from heapq import * 2 | 3 | class Solution: 4 | def reorganizeString(self, S: str) -> str: 5 | C = {} 6 | max_count = (len(S) + 1) // 2 7 | for ch in S: 8 | count = C.get(ch, 0) + 1 9 | if(count > max_count): 10 | return "" 11 | C[ch] = count 12 | 13 | pq = [] 14 | for key, value in C.items(): 15 | pq.append((-value, key)) 16 | heapify(pq) 17 | 18 | result = "" 19 | while(len(pq) > 1): 20 | p1, v1 = heappop(pq) 21 | p2, v2 = heappop(pq) 22 | result += v1 + v2 23 | if(p1 != -1): 24 | heappush(pq, (p1 + 1, v1)) 25 | if(p2 != -1): 26 | heappush(pq, (p2 + 1, v2)) 27 | if(len(pq) == 1): 28 | result += heappop(pq)[1] 29 | return result -------------------------------------------------------------------------------- /priority-queue/question86.md: -------------------------------------------------------------------------------- 1 | # 86. Partition List 2 | 3 | ## Solução 4 | 5 | > Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. 6 | > You should preserve the original relative order of the nodes in each of the two partitions. 7 | > **Example:** 8 | > 9 | > ```None 10 | > Input: head = 1->4->3->2->5->2, x = 3 11 | > Output: 1->2->2->4->3->5 12 | > ``` 13 | > 14 | Para resolver a questão, temos que ordenar pelos seguintes críterios, em ordem de prioridade: 15 | 16 | 1. Valores menores que `x` primeiro. 17 | 2. Valores mais à esquerda na lista original primeiro. 18 | 19 | Isso é, precisamos fazer uma lista de prioridade com que armazene tuplas do tipo: 20 | t = (critério 1, critério 2, valor) 21 | Para o critério 1 podemos fazer dois grupos (0 e 1), um para valores menores que `x` e outro para o restante. 22 | Para o critério 2 podemos usar o índice dos elementos na lista original. 23 | Ao final da construção da fila, podemos fazer uma lista encadeada com o terceiro item de cada tupla. 24 | 25 | ## Implementação 26 | 27 | Primeiramente declaramos a fila de prioridade: 28 | 29 | ```Python 3 30 | pqueue = [] 31 | ``` 32 | 33 | Depois precisamos percorrer a lista de entrada e colocar os elementos na fila, conforme os critérios estabelecidos: 34 | 35 | ```Python 3 36 | current = head 37 | i = 0 38 | while(current != None): 39 | val = current.val 40 | heappush(pqueue, (0 if val < x else 1, i, val)) 41 | current = current.next 42 | i += 1 43 | ``` 44 | 45 | Agora construímos a nova lista de adjacência e retornamos: 46 | 47 | ```Python 3 48 | newhead = ListNode(heappop(pqueue)[2]) 49 | current = newhead 50 | while(len(pqueue) > 0): 51 | current.next = ListNode(heappop(pqueue)[2]) 52 | current = current.next 53 | return newhead 54 | ``` 55 | 56 | Tomando cuidado, no começo, com o caso da lista vazia: 57 | ```Python 3 58 | if(head == None): 59 | return head 60 | ``` 61 | 62 | + [Código completo](./question86.py) 63 | + [Pratique no LeetCode](https://leetcode.com/problems/partition-list/) 64 | 65 | Viu algum erro? mande um email para pabloemanuell2017@gmail.com 66 | 67 |  | [-> PRÓXIMA](question215.md) 68 | 69 |  | [<- VOLTAR PARA O ÍNICIO](README.md) 70 | -------------------------------------------------------------------------------- /priority-queue/question86.py: -------------------------------------------------------------------------------- 1 | from heapq import * 2 | 3 | class Solution: 4 | def partition(self, head: ListNode, x: int) -> ListNode: 5 | if(head == None): 6 | return head 7 | pqueue = [] 8 | current = head 9 | i = 0 10 | while(current != None): 11 | val = current.val 12 | heappush(pqueue, (0 if val < x else 1, i, val)) 13 | current = current.next 14 | i += 1 15 | newhead = ListNode(heappop(pqueue)[2]) 16 | current = newhead 17 | while(len(pqueue) > 0): 18 | current.next = ListNode(heappop(pqueue)[2]) 19 | current = current.next 20 | return newhead -------------------------------------------------------------------------------- /sweep-line-algorithm/README.md: -------------------------------------------------------------------------------- 1 | # Sweep Line Algorithm 2 | In computational geometry, a **sweep line algorithm** or **plane sweep algorithm** is an algorithmic paradigm that uses a conceptual sweep line or sweep surface to solve various problems in Euclidean space. It is one of the key techniques in computational geometry. 3 | 4 | The idea behind algorithms of this type is to imagine that a line (often a vertical line) is swept or moved across the plane, stopping at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects. 5 | 6 | In mathematics, a **[Voronoi diagram](https://en.wikipedia.org/wiki/Voronoi_diagram)** is a partition of a plane into regions close to each of a given set of objects. In the simplest case, these objects are just finitely many points in the plane (called seeds, sites, or generators). For each seed there is a corresponding region consisting of all points of the plane closer to that seed than to any other. These regions are called Voronoi cells. The Voronoi diagram of a set of points is dual to its Delaunay triangulation. 7 | 8 | ![Animation of Fortune's algorithm, a sweep line technique for constructing Voronoi diagrams.](https://upload.wikimedia.org/wikipedia/commons/2/25/Fortunes-algorithm.gif) 9 | ##### [From Wikipedia, the free encyclopedia](https://en.wikipedia.org/wiki/Sweep_line_algorithm) 10 | 11 | ## Problems 12 | 1. [Maximum Intervals Overlap](geeks-for-geeks/README.md) 13 | + Level: Medium 14 | 2. [Rectangle Area](leetcode/README.md) 15 | + Level: Medium 16 | 3. [Rectangle Overlap](leetcode/README.md) 17 | + Level: Easy 18 | 19 | ## Implementations: 20 | + C++ 21 | + Python 3 22 | 23 | ## Disclaimer 24 | > This material was used in the course SPECIAL TOPICS IN COMPUTER XIV - Programming Interviewing Practices of the Digital Metropolis Institute of the Federal University of Rio Grande do Norte. 25 | 26 | Authors: 27 | + [Giovanne Santos](https://github.com/gsdante) 28 | + [Marlus Marcos](https://github.com/marlusmarcos) 29 | + [Thiago Silva](https://github.com/silva-thiago) 30 | + [Yan Carlos](https://github.com/yandl5) 31 | 32 | <- [BACK TO HOME](../README.md) -------------------------------------------------------------------------------- /sweep-line-algorithm/geeks-for-geeks/README.md: -------------------------------------------------------------------------------- 1 | # Problem 1 2 | 3 | ## Maximum Intervals Overlap 4 | Consider a big party where a log register for guest’s entry and exit times is maintained. Find the time at which there are maximum guests in the party. Note that entries in register are not in any order. 5 | 6 | #### Input: 7 | The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n denoting the size of the entry and exit array. Then the next two line contains the entry and exit array respectively. 8 | 9 | #### Output: 10 | Print the maximum no of guests and the time at which there are maximum guests in the party. 11 | 12 | #### Constraints: 13 | 1 <= T <= 10^5 14 | 15 | 1 <= N <= 10^5 16 | 17 | 1 <= entry[i], exit[i] <= 10^5 18 | 19 | ### Example: 20 | #### Input: 21 | 2 22 | 23 | 5 24 | 25 | 1 2 10 5 5 26 | 27 | 4 5 12 9 12 28 | 29 | 7 30 | 31 | 13 28 29 14 40 17 3 32 | 33 | 107 95 111 105 70 127 74 34 | 35 | #### Output: 36 | 3 5 37 | 38 | 7 40 39 | 40 | ### Disclaimer 41 | > This material was used in the course SPECIAL TOPICS IN COMPUTER XIV - Programming Interviewing Practices of the Digital Metropolis Institute of the Federal University of Rio Grande do Norte. 42 | 43 | + [C++ problem solution](./maximum-intervals-overlap.cpp) 44 | 45 | + [Very cool technique used to solve problems with geometric solutions.](https://www.youtube.com/watch?v=3ph6V32oja0) 46 | 47 | + [Practice on Geeks for Geeks](https://practice.geeksforgeeks.org/problems/maximum-intervals-overlap/0) 48 | 49 | <- [BACK](../README.md) -------------------------------------------------------------------------------- /sweep-line-algorithm/geeks-for-geeks/input.txt: -------------------------------------------------------------------------------- 1 | 2 2 | 5 3 | 1 2 10 5 5 4 | 4 5 12 9 12 5 | 7 6 | 13 28 29 14 40 17 3 7 | 107 95 111 105 70 127 74 -------------------------------------------------------------------------------- /sweep-line-algorithm/geeks-for-geeks/maximum-intervals-overlap.cpp: -------------------------------------------------------------------------------- 1 | /// Source: https://practice.geeksforgeeks.org/problems/maximum-intervals-overlap/0#ExpectOP 2 | /// Problem: Maximum Intervals Overlap 3 | /// Data Structure: Sweep Line Algorithm 4 | /// Difficult: Medium 5 | /// Autores: Giovanne Santos, Marlus Marcos, Thiago Silva, Yan Carlos 6 | /// Created on 2019/09/26 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | #define ADD 0 /// Entrada na festa 14 | #define RMV 1 /// Saída da festa 15 | 16 | int main() 17 | { 18 | /** Ler arquivo com as informações de entrada */ 19 | std::ifstream ifs("input.txt"); 20 | 21 | if (not ifs) 22 | { 23 | /** Feedback em caso de problema para a leitura */ 24 | std::perror("input.txt"); 25 | } 26 | else 27 | { 28 | /** Ler o número de casos de teste */ 29 | int test_case; 30 | //std::cin >> test_case; 31 | ifs >> test_case; 32 | 33 | /** Resposta para todos os casos de teste */ 34 | while (test_case--) 35 | { 36 | /** 37 | * Lista de evento e o modo como o evento será modelado 38 | * 'int' é o tempo e o 'bool' é para desenpatar a ordenação (a entrada é preferêncial) 39 | */ 40 | std::vector> event; 41 | 42 | /** Ler a quantidade de convidados */ 43 | int guests; 44 | //std::cin >> guests; 45 | ifs >> guests; 46 | 47 | /** Registrar o tempo da chegada dos convidados */ 48 | for (int i = 0; i < guests; ++i) 49 | { 50 | int entry_time; 51 | //std::cin >> entry_time; 52 | ifs >> entry_time; 53 | 54 | /** 55 | * event: Registra o tempo que o evento acontece. 56 | * entry_time: Tempo em que o evento está acontecendo 57 | * ADD: Tipo do evento quando alguém entra 58 | */ 59 | event.emplace_back(entry_time, ADD); 60 | /** 61 | * note: candidate: 62 | * 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair; 63 | * _Alloc = std::allocator >; 64 | * std::vector<_Tp, _Alloc>::value_type = std::pair]' 65 | * push_back(const value_type& __x) 66 | */ 67 | } 68 | 69 | /** Registrar o tempo da saída dos convidados */ 70 | for (int i = 0; i < guests; ++i) 71 | { 72 | int departure_time; 73 | //std::cin >> departure_time; 74 | ifs >> departure_time; 75 | 76 | /** 77 | * event: Registra o tempo que o evento acontece 78 | * departure_time: Tempo em que o evento foi encerrado 79 | * ADD: Tipo do evento quando alguém entra 80 | */ 81 | event.emplace_back(departure_time, RMV); 82 | } 83 | 84 | /** Ordenar o vetor para realizar o Line Sweep. Como o vetor é de 'pair', ele já sabe como ordenar */ 85 | std::sort(event.begin(), event.end()); 86 | 87 | /** Quantidade de convidados na festa */ 88 | int guest = 0; 89 | /** Auge da festa, quantidade máxima de convidados */ 90 | int max_guests = -1; 91 | /** Tempo em que foi registrado o auge */ 92 | int time_max_guests = 0; 93 | 94 | /** Percorrer o vetor de eventos */ 95 | for (std::pair ev : event) 96 | { 97 | int event_time = ev.first; /// Tempo em que o evento ocorreu 98 | bool event_type = ev.second; /// Tipo de evento 99 | 100 | /** Se o tipo for de adição, um convidado será colocado na festa */ 101 | if (event_type == ADD) 102 | { 103 | guest++; /// Chegou um convidado 104 | } 105 | else 106 | { 107 | guest--; /// Saiu um convidado 108 | } 109 | 110 | /** Atualizar o número de convidados na festa, caso um novo convidado chegue à festa */ 111 | if (guest > max_guests) 112 | { 113 | max_guests = guest; 114 | time_max_guests = event_time; 115 | } 116 | } 117 | 118 | /** Imprimir a quantidade máxima de convidados e em que momento isso ocorreu */ 119 | std::cout << "The maximum no of guests: " << max_guests << "\nThe time at which there are maximum guests in the party: " << time_max_guests << std::endl; 120 | } 121 | } 122 | 123 | ifs.close(); 124 | } 125 | -------------------------------------------------------------------------------- /sweep-line-algorithm/leetcode/README.md: -------------------------------------------------------------------------------- 1 | # Problem 1 2 | 3 | ## 836. Rectangle Overlap 4 | A rectangle is represented as a list **[x1, y1, x2, y2]**, where **(x1, y1)** are the coordinates of its bottom-left corner, and **(x2, y2)** are the coordinates of its top-right corner. 5 | 6 | Two rectangles overlap if the area of their intersection is positive. To be clear, two rectangles that only touch at the corner or edges do not overlap. 7 | 8 | Given two (axis-aligned) rectangles, return whether they overlap. 9 | 10 | ### Example 1: 11 | #### Input: rec1 = [0,0,2,2], rec2 = [1,1,3,3] 12 | #### Output: true 13 | 14 | ### Example 2: 15 | #### Input: rec1 = [0,0,1,1], rec2 = [1,0,2,1] 16 | #### Output: false 17 | 18 | ### Notes: 19 | 1. Both rectangles rec1 and rec2 are lists of 4 integers. 20 | 2. All coordinates in rectangles will be between -10^9 and 10^9. 21 | 22 | [Python 3 Problem Solution](./rectangle-overlap.py) 23 | 24 | [Practice on Leetcode](https://leetcode.com/problems/rectangle-overlap/) 25 | 26 | # Problem 2 27 | 28 | ## 223. Rectangle Area 29 | Find the total area covered by two rectilinear rectangles in a 2D plane. 30 | 31 | Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. 32 | 33 | ![Rectangles in a 2D plane](https://assets.leetcode.com/uploads/2018/10/22/rectangle_area.png) 34 | 35 | ### Example: 36 | #### Input: A = -3, B = 0, C = 3, D = 4, E = 0, F = -1, G = 9, H = 2 37 | #### Output: 45 38 | 39 | ### Note: 40 | Assume that the total area is never beyond the maximum possible value of int. 41 | 42 | ## Disclaimer 43 | > This material was used in the course SPECIAL TOPICS IN COMPUTER XIV - Programming Interviewing Practices of the Digital Metropolis Institute of the Federal University of Rio Grande do Norte. 44 | 45 | + [Python 3 Problem Solution](./rectangle-area.py) 46 | 47 | + [Practice on Leetcode](https://leetcode.com/problems/rectangle-area/) 48 | 49 | <- [BACK](../README.md) -------------------------------------------------------------------------------- /sweep-line-algorithm/leetcode/rectangle-area.py: -------------------------------------------------------------------------------- 1 | # Source: https://leetcode.com/problems/rectangle-area/ 2 | # Problem: 223. Rectangle Area 3 | # Data Structure: Sweep Line Algorithm 4 | # Difficult: Medium 5 | # Autores: Giovanne Santos, Marlus Marcos, Thiago Silva, Yan Carlos 6 | # Created on 2019/09/26 7 | 8 | def isRectangleOverlap(rec1: List[int], rec2: List[int]) -> bool: 9 | horiz_overlap = max(rec1[0], rec2[0]) < min(rec1[2], rec2[2]) 10 | vert_overlap = max(rec1[1], rec2[1]) < min(rec1[3], rec2[3]) 11 | return horiz_overlap and vert_overlap 12 | 13 | def isRectangleContains(rec1: List[int], rec2: List[int]) -> bool: 14 | horiz_contains = rec1[0] == min(rec1[0], rec2[0]) and rec1[2] == max(rec1[2], rec2[2]) 15 | vert_contains = rec1[1] == min(rec1[1], rec2[1]) and rec1[3] == max(rec1[3], rec2[3]) 16 | return horiz_contains and vert_contains 17 | 18 | 19 | class Solution: 20 | def computeArea(self, A: int, B: int, C: int, D: int, E: int, F: int, G: int, H: int) -> int: 21 | rec1 = [A,B,C,D] 22 | rec2 = [E,F,G,H] 23 | rec1_area = (C - A) * (D - B) 24 | rec2_area = (G - E) * (H - F) 25 | overlap = isRectangleOverlap(rec1, rec2) 26 | if not overlap: 27 | return rec1_area + rec2_area 28 | else: 29 | if isRectangleContains(rec1, rec2): 30 | return rec1_area 31 | if isRectangleContains(rec2, rec1): 32 | return rec2_area 33 | 34 | return rec1_area + rec2_area - (min(C,G) - max(A,E)) * (min(D,H) - max(B,F)) 35 | total = (max(C,G) - min(A,E)) * (max(D,H) - min(B,F)) 36 | total -= (max(A,E) - min(A,E)) * (max(B,F) - min(B,F)) 37 | total -= (max(C,G) - min(C,G)) * (max(D,H) - min(D,H)) 38 | return total 39 | -------------------------------------------------------------------------------- /sweep-line-algorithm/leetcode/rectangle-overlap.py: -------------------------------------------------------------------------------- 1 | # Source: https://leetcode.com/problems/rectangle-overlap/ 2 | # Problem: 836. Rectangle Overlap 3 | # Data Structure: Sweep Line Algorithm 4 | # Difficult: Easy 5 | # Autores: Giovanne Santos, Marlus Marcos, Thiago Silva, Yan Carlos 6 | # Created on 2019/09/26 7 | 8 | class Solution: 9 | def isRectangleOverlap(self, rec1: List[int], rec2: List[int]) -> bool: 10 | horiz_overlap = max(rec1[0], rec2[0]) < min(rec1[2], rec2[2]) 11 | vert_overlap = max(rec1[1], rec2[1]) < min(rec1[3], rec2[3]) 12 | return horiz_overlap and vert_overlap 13 | -------------------------------------------------------------------------------- /topological_sort.ipynb: -------------------------------------------------------------------------------- 1 | {"nbformat":4,"nbformat_minor":0,"metadata":{"colab":{"name":"topological_sort.ipynb","provenance":[],"collapsed_sections":[],"toc_visible":true},"kernelspec":{"name":"python3","display_name":"Python 3"}},"cells":[{"cell_type":"markdown","metadata":{"id":"fTARpIj9a0nQ","colab_type":"text"},"source":["# **1. Ordenação Topológica**\n","\n","É comum no cotidiano de todos a realização de atividades que, de certo modo, possuem tarefas agregadas. Desta forma, podemos imaginar uma atividade como um conjunto de sub atividades, onde esta atividade será concluída se, e somente se, suas atividades agregadas e antecedentes forem também. Usando a teoria de grafos, podemos explicar este contexto através da ordenação topológica para o Grafo Direcionado Acíclico - **Directed Acyclic Graph (DAG)**. Essa é uma ordenação linear de vértices de tal modo que, para cada arco direcionado $(u, v)$, o vértice $u$ vem antes de $v$ na ordenação, logo essa abordagem não é possível se o gráfico não for um DAG.\n","\n","
\"creating\n","
Figura 1. Exemplo de um DAG.\n","
\n","\n","De maneira bem simples, podemos aplicar essa teoria com um exemplo que se aplica a esta ideia de atividades agregadas: fazer um bolo. Fazer o bolo seria a atividade principal, e desta forma, possui várias outras atividades agregadas. Para se concluir a atividade principal, seria preciso assar o bolo; mas antes, é necessário ter todos os ingredientes misturados. De modo geral, podemos imaginar que atividade de cozinhar um bolo (que iremos chamar de atividade A) possui duas sub atividades: assar o bolo (atividade B) e misturar os ingredientes (atividade C). Mas veja que antes de concluirmos a atividade B, devemos realizar a C. Desta forma, obtemos uma sequência de atividades que, ao serem realizadas na ordem correta, resultam num bolo.\n","\n","No âmbito computacional, podemos aplicar essa ideia em uma variedade de contextos de aplicações, incluindo sistemas operacionais, sistemas de informação e gerenciamento de redes."]},{"cell_type":"markdown","metadata":{"id":"hQwO72iqQFS5","colab_type":"text"},"source":["## **1.1 Aplicações e Casos de uso**\n"]},{"cell_type":"markdown","metadata":{"id":"VxqN9XrQannP","colab_type":"text"},"source":["### **1.1.1 Dependência entre tarefas**\n","Os **vértices** do digrafo podem representar tarefas a serem realizadas, e os **arestas** (arestas) restrições de dependência entre as tarefas.\n","\n","> *Uma ordenação topológica é uma sequência válida de tarefas.*"]},{"cell_type":"markdown","metadata":{"id":"o9XORck1ap6l","colab_type":"text"},"source":["### **1.1.2 Pré-requisitos de disciplinas**\n","Os **vértices** do digrafo podem representar disciplinas de um curso, e os **arcos** (arestas) pré-requisitos entre as disciplinas.\n","\n","> *Uma ordenação topológica é uma sequência válida para se cursar as disciplinas.*\n"]},{"cell_type":"markdown","metadata":{"id":"Y_dr_MUnapqS","colab_type":"text"},"source":["### **1.1.3 Como se vestir**\n","Os **vértices** do digrafo podem representar peças a serem vestidas, e os **arcos** (arestas) as dependência entre as peças.\n","\n","> *Uma ordenação topológica é uma sequência(ideial) de como se vestir*\n",">\n","> *PS: ignore se você for um Supemar da decada de 90*\n","\n","
\"creating\n","
Figura 2. Exemplo de DAG para o problema de como se vestir.\n","
\n"]},{"cell_type":"markdown","metadata":{"id":"MVRqu5twfd6C","colab_type":"text"},"source":["## **1.2 Algoritmos e complexidade**\n","\n","Dentre as diversas abordagens conhecidas, uma das mais utilizadas para solucionar o problema da ordenação topológica é utilizando o algoritmo Depth-first search (DFS). Dado um DAG $G = (V,E)$, o algoritmo DFS percorre todos os vértices de $G$ e, para cada um deles, executa os seguintes passos:\n","\n","1. marca o vértice atual como visitado\n","2. imprime o vértice atual\n","3. visita todos os vértices adjacentes que não foram visitados;\n","4. explora tanto quanto possível cada um dos seus ramos, antes de retroceder (backtracking).\n","\n","Vale ressaltar que uma DFS propriamente dita não é capaz de encontrar uma ordenação topológica de um grafo. Para isso, é necessário realizar alguns ajustes no algoritmo para que isso seja possível. Uma maneira é utilizar uma pilha e, depois de percorrer todos os sucessores de um vértice, então, ele é adicionado à pilha. Após percorrer todos os vértices do DAG, a ordenação topológica será o conteúdo da própria pilha.\n","\n","A maioria dos algoritmos, inclusive a abordagem com DFS, que trabalham para encontrar a ordenação topológica de um grafo $G=(V,E)$, tal que $G$ é dirigido e acíclico, conseguem realizar este processo com uma complexidade $O(|V|+|E|)$. Vale ressaltar que esta complexidade se dá para algoritmos que não trabalham de forma dinâmica, isto é, não apresentam a capacidade de atualizar a ordenação topológica ao adicionar ou remover uma aresta.\n","\n","Outra abordagem conhecida é o **Algoritmo de Kahn**. Este algoritmo trabalha escolhendo vértices na mesma ordem da eventual ordenação topológica. Primeiro, encontra uma lista de nós \"íniciais\", que não tem arestas de entrada e os insere em um conjunto S; pelo menos um nó devem existir se o grafo é acíclico. \n","\n","```\n","L ← Lista vazia que irá conter os elementos ordenados\n","S ← Conjunto de todos os nós sem arestas de entrada\n","enquanto S é não-vazio faça\n"," remova um nodo n de S\n"," insira n em L\n"," para cada nodo m com uma aresta e de n até m faça\n"," remova a aresta e do grafo\n"," se m não tem mais arestas de entrada então\n"," insira m em S\n","se o grafo tem arestas então\n"," escrever mensagem de erro (grafo tem pelo menos um ciclo)\n","senão\n"," escrever mensagem (ordenação topológica proposta: L)\n","```\n","\n","Se o grafo é um digrafo acíclico (DAG), a solução está contida na lista L (a solução não é única). Caso contrário, o grafo tem pelo menos um ciclo e, portanto, uma ordenação topológica é impossível."]},{"cell_type":"markdown","metadata":{"id":"BRtnIMDeUI7V","colab_type":"text"},"source":["# **2. Questões do Leet Code**\n","\n","Foram escolhidas duas questões do [LeetCode](https://www.leetcode.com) para serem resolvidas. Elas apresentam soluções bem semelhantes, alterando apenas a forma de retorno de cada função.\n","\n","A primeira questão é a de número 207: **Course Schedule**. Nesta questão, o principal objetivo é verificar se o grafo possui uma ordenação topológica. \n","A segunda questão, de número 210: **Course Schedule II**, diferentemente da primeira, tem como objetivo encontrar a ordenação topológica do grafo proprieamente dita. A descrição das duas questões, seguidas de possíveis soluções, são exibidas nas próximas subseções.\n","\n"]},{"cell_type":"markdown","metadata":{"id":"NSqmV-NqTwxK","colab_type":"text"},"source":["## **[2.1 Course Schedule](https://leetcode.com/problems/course-schedule/)**\n","\n","> *A descrição da questão foi retirada do próprio site do Leet Code e traduzida para o português.*\n","\n","Há um total de n cursos que você deve fazer, rotulados de 0 a n-1.\n","\n","Alguns cursos podem ter pré-requisitos, por exemplo, para o curso 0, você deve primeiro fazer o curso 1, que é expresso como um par: [0,1]\n","\n","Dado o número total de cursos e uma lista de pares de pré-requisitos, é possível concluir todos os cursos?\n","\n","**Exemplo 1:**\n","```\n","Entrada: 2, [[1,0]] \n","Saída: true\n","Explicação: Há um total de 2 cursos para fazer. \n"," Para fazer o curso 1, você deve ter concluído o curso 0. Portanto,\n"," é possível.\n","```\n","\n","**Example 2:**\n","```\n","Entrada: 2, [[1,0],[0,1]]\n","Saída: false\n","Explanation: Há um total de 2 cursos para fazer.\n"," Para fazer o curso 1, você deve ter concluído o curso 0 e, para\n"," fazer o curso 0, também deve ter concluído o curso 1. Portanto, é\n"," impossível.\n","```\n","**Nota:**\n","\n","1. Os pré-requisitos de entrada são um grafo representado por uma lista de arestas, não matrizes de adjacência. Leia mais sobre como um grafo é representado.\n","\n","2. Você pode assumir que não há arestas duplicadas nos pré-requisitos de entrada.\n","\n"]},{"cell_type":"markdown","metadata":{"id":"OGu5kkp7eetL","colab_type":"text"},"source":["### **2.1.1 Solução**\n"]},{"cell_type":"code","metadata":{"id":"LyQBHBpqJ3Ak","colab_type":"code","colab":{}},"source":["from collections import defaultdict\n","\n","class Solution:\n"," def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\n"," graph = defaultdict(list)\n"," canFinish = True\n"," \n"," for dest, src in prerequisites:\n"," graph[src].append(dest)\n"," \n"," visited = [0]*numCourses\n"," stack = []\n"," \n"," def topologicalSortUtil(v): \n"," nonlocal canFinish\n"," \n"," visited[v] = 2\n"," \n"," for i in graph[v]: \n"," if visited[i] == 0: \n"," topologicalSortUtil(i) \n"," elif visited[i] == 2:\n"," canFinish = False\n"," \n"," visited[v] = 1\n"," stack.insert(0,v)\n"," \n"," for i in range(numCourses): \n"," if visited[i] == 0: \n"," topologicalSortUtil(i)\n"," \n"," if not canFinish:\n"," break\n","\n"," return canFinish\n"],"execution_count":0,"outputs":[]},{"cell_type":"markdown","metadata":{"id":"O1Vt2LaISxn_","colab_type":"text"},"source":["#### **Estatísticas**\n","Esta solução é melhor que 60,09% das submissões para esta questão no LeetCode.\n"]},{"cell_type":"markdown","metadata":{"id":"y8yQXjrwT9Nt","colab_type":"text"},"source":["## **[2.2 Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)**\n","\n","> *A descrição da questão foi retirada do próprio site do Leet Code e traduzida para o português.*\n","\n","Há um total de n cursos que você deve fazer, rotulados de 0 a n-1.\n","\n","Alguns cursos podem ter pré-requisitos, por exemplo, para o curso 0, você deve primeiro fazer o curso 1, que é expresso como um par: [0,1]\n","\n","Dado o número total de cursos e uma lista de pares de pré-requisitos, retorne a ordem dos cursos que você deve fazer para concluir todos os cursos.\n","\n","Pode haver várias ordenações corretas, você só precisa retornar uma delas. Se for impossível concluir todos os cursos, retorne uma lista vazia.\n","\n","**Exemplo 1:**\n","```\n","Entrada: 2, [[1,0]] \n","Saída: [0,1]\n","Explicação: Há um total de 2 cursos para fazer.\n"," Para fazer o curso 1, você deve ter concluído o curso 0. Portanto, a ordem correta dos cursos é [0,1].\n","```\n","**Exemplo 2:**\n","```\n","Entrada: 4, [[1,0],[2,0],[3,1],[3,2]]\n","Saída: [0,1,2,3] ou [0,2,1,3]\n","Explicação: Há um total de 4 cursos a fazer. \n"," Para fazer o curso 3, você deve ter concluído os cursos 1 e 2.\n"," Os cursos 1 e 2 devem ser realizados após o término do curso 0.\n"," Portanto, uma ordem correta do curso é [0,1,2,3]. Outra ordenação\n"," correta é [0,2,1,3].\n","```\n","**Nota:**\n","\n","1. Os pré-requisitos de entrada são um grafo representado por uma lista de arestas, não matrizes de adjacência. Leia mais sobre como um grafo é representado.\n","\n","2. Você pode assumir que não há arestas duplicadas nos pré-requisitos de entrada.\n","\n"]},{"cell_type":"markdown","metadata":{"id":"hzybaHlHeYR7","colab_type":"text"},"source":["### **2.2.1 Solução**"]},{"cell_type":"code","metadata":{"id":"nUkhv_BYUCoQ","colab_type":"code","colab":{}},"source":["from collections import defaultdict\n","\n","class Solution:\n"," def findOrder(self, numCourses: int, prerequisites: List[List[int]]) -> List[int]:\n"," graph = defaultdict(list)\n"," canFinish = True\n"," \n"," for dest, src in prerequisites:\n"," graph[src].append(dest)\n"," \n"," visited = [0]*numCourses\n"," stack = []\n"," \n"," def topologicalSortUtil(v): \n"," nonlocal canFinish\n"," \n"," visited[v] = 2\n"," \n"," for i in graph[v]: \n"," if visited[i] == 0: \n"," topologicalSortUtil(i) \n"," elif visited[i] == 2:\n"," canFinish = False\n"," \n"," visited[v] = 1\n"," stack.insert(0,v)\n"," \n"," for i in range(numCourses): \n"," if visited[i] == 0: \n"," topologicalSortUtil(i)\n"," \n"," if not canFinish:\n"," break\n","\n"," return stack if canFinish else []"],"execution_count":0,"outputs":[]},{"cell_type":"markdown","metadata":{"id":"Y1TFt5gkS_bz","colab_type":"text"},"source":["##### **Estatísticas**\n","\n","Esta solução é melhor que 73,02% das submissões para esta questão no LeetCode."]},{"cell_type":"markdown","metadata":{"id":"kU_CRs0uOTB1","colab_type":"text"},"source":["# **Referências**\n","\n","http://wiki.icmc.usp.br/images/9/93/Alg2_05.Grafos_ordenacaotopologica.pdf\n","\n","http://www.codcad.com/lesson/50\n","\n","http://edirlei.3dgb.com.br/aulas/paa/PAA_Aula_07_Ordenacao_Topologica.pdf\n","\n","https://pt.wikipedia.org/wiki/Ordena%C3%A7%C3%A3o_topol%C3%B3gica\n","\n","http://www.ic.unicamp.br/~meidanis/courses/mo417/2003s1/aulas/2003-05-14.html\n","\n","##Colaboradores\n","\n","#####Douglas Alexandre dos Santos <>\n","#####Franklin Matheus da Costa Lima <>\n","#####Mateus Santiago Ferreira Costa <>\n"]}]} --------------------------------------------------------------------------------