> /PZ 1 >>
endobj
11 0 obj
<> stream
xZߏ6~_1/Kkɒm&"= ͵.-mf)R!!s@Jz7|3|VG-;|6_W.~^
|]Y1_/0~c>~=+o;uȊ+v1#}"-YUu l1[*M=ktE+kxcފz[[F^gS >?z-t
/G/g`WlVz"p<t@h%j.l{/bQ>sJ0ptV:_6K[A\@%eQ)zFP ?$!N3$i;C`vf7#| v/NYi;ג-t|DaM9aF6ʂ1$ -ZXֳ N^cq@x~J &r]H@և!-_~Pw3 8^5=F&}'1ؗ).-bKa`g,3]Z9<13;iA4z;#WÆ-8ZXܟL7^K (?~BLE6R2m!XAHBQU`!M>G@ۓSSg:(dQ yDiOFc@3Ex '5r)D7ӏDRVQ@(dk4Ở-ߦa?.'Z:2jDn_AJtCL&2-(GRHR̵aJ)$hԽx
?LE,B4gUj=I<%{
[E݁AN\ F5׳b۩L8o8Hpc='?o]˸5La7#RbYY"V#buUo@覵ǖI6rQA]$?}q[EȐbj"ϓ$vlAYV<AF#s)}4Z#CΣ4p%c:0dو@|4
v@*U|P.m3uT[%0g
p&'FV%eH[G>C@Σ&j8$Cewgp˛*1KNIyBCc>ln*~~> /PZ 1 >>
endobj
13 0 obj
<> stream
xZ]}ϯoQF#'
1!jq19#璜f6<]{׳?t1}O?㿒oWeywvCbᏤ?t#\jokm
oY&&g`n<2=5f8HL^K5]kY̔ҚcZ6NHT]8M#WdQVZ?A[6ן|÷Ԇ```B]d`.t0 LLB8x8C dO!.)ǉSxpɑfUBoCf^{l$gL;"ʳ&B<@O1$QVY#KY'.V>FH#HAUUJ}Dj1g(䫾&KcftUQt9pѣg" ¤K+~iM( Ghw=l1m+CJ^PFϚܝLп,D(TA"}(<>K
*釗oc2a
H63zQ3ݏ#:N!CV}Ȏ,j}Hav!bi(4erv$ 4Bwp}I9PrAy1kBQ%w8Hn$$`}zk[k;|9W(DwJ>1Gȅq4OV2td8Gp'kH1J8+/D6\x
yR<".닐*=5i[OjxC$\ijVq:bΉSe
NVcz8PLABՍ/de^^FG/@R?p4K0(y`ˮ#6{VPU.G*DY^N1Y%YuCd . Kzm-|`DoUᬷfD)bUq+T*s5P?sYsWrcz@8[Q?p剜c8(̓4̓K=TdIQ^YҪrE;@I
Y7>ʧIta5K*CPTjyO߾;tO*dcLkDG&')U0Luጻq{N#) J"zMB/l&ͬSӞci5Cx0(di
x1";q15Oql:{8Kh
ER(N7g;CNsEƍB!Ll#l[7Ur$"
<@
b΄o@h͈ g=6?=rzU9&A}B8x?I2캒uNMsl~"dٱ]hxSHqo),@ Z9uOW| `_z$黿iT`i7 Uc*㜟Ї,y1vU^tػ 2pwpMCħݎZúv50= [Tp
/2M10t >ȖQ^(EqAdl42Kl2g)f[I/ig]Z-
endstream
endobj
14 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 15 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
15 0 obj
<> stream
x[]s6}&S[%oIiD^I)@_48;cgS{=?G]~j<ǟG;_Qɼ=QjTNz/C~qf&GV#1#>ΧlrXej5Vr9U7ū<'[Gޜ*7vv~o-K{*Ol__@<蟝?_j%Wr0ioJOfٜ_.'lW>v*:=-2REN* !+Nה/Ժ J&ÐuC.$PǆX|hO>pYw2Z`N 1[1S6HQᐴ8K|St];{gҭr8PLRP;
ږ)dߵ5VKR{FES1BBiҭ|:sw>?%X
t?.z*["b5?.ΪP)ӇHh#(Fmd}ǍM&: Z*m*VAeh'CiE6f\;rx]N!/X^pe85網ǒm
j)C"Yyȩo0~Hd"/-؟x惛hUΓ;[@[u˲zS;\bΌOeƥk}gܾ@3GSqm 2!4iY3(\aGZ
SXݗcG$a8Ztv%"/Weڤ9`.TlӸwodk(h@ Gn,QUPnJ"Eږ5AM6ҩW͞M%!Eڕ$)sgb8E3xYnsk123&J,.).jk*BݚB
'vt]J#LU^VB8^f#ݍK&8&JTlivֺxiak^F
^hɦ`DQ8zDw9WPnQ2#TÁE\AY$B$q;seCm 0xiaJ0DkCcचZl7Yc&Q
TMxI[z3GDlօ~qG82
mWq{ti\J}WFuo(bX̸]yWF$ bQ09'[x&5Ҁllp@u!MPG<MW|o(O`]]¼Iwui]Ǚq瀡2n
|.v
͚M4Z9Lՠ?aZ&Ws&&'V]@ `MH|- 'Yv5-W0p`5k(R@~vX{#6e0
zfmZ
x+j@qj@^:c`i7Ć>{gʆͩIRjzħ=Fh:?Vȉ-[&='
z 77fn@p.래d-;dFAE*d]M
&wsd3ѲkltGdSВj=!9bf>D
̥v%JXlLN/EVAI&gcٸm <[-7P̈(_5 P1W]f
~Gr#}94]GOMQ6[r
LfK{0pV
endstream
endobj
16 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 17 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
17 0 obj
<> stream
x[]6}vҵ%*$5^ʖ=3AZ@s=L|5= ~bM#o_77ً[7_)>ǧ.31]\~gO?Ϭtȁ~%~==oYO\l=[V3q[_~]xaC#kU7TVֵj*:hnJ+Ӹ*nwK~gsC@_W3<_<[,2wƚ xkʮ p7bcNtpB"PhJjJ)7ip`rPu%V"do
Z5]:a´^Rhd)=z$jYTB#$
>?zU:d.F h*h
yGmĦި&MEq#RW*0FS.Bn-q I֭HOO^i-6 $^t@r0th[}f߄4BdO$;")'YY"] zF?zc3d0Y^qL|QK9`R$j4 :e6PW5Ai+`8DL؋Aƻ쬤?s>-!0Fps{PCoqR^So2\aU9=rHGoLWzX%Ȝ墷qV7hnZoҽhsQ Bp(AHQJkG-X)IAJks\)l{f_I@^bqol?.S`S%R*obd$eXC;}rdaQY\JӚ$j(OۻX1ЧyrjSӌ
endstream
endobj
18 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 19 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
19 0 obj
<> stream
x[]sF|ϯGPߔSugU!X-b!L|JKHXFoOO|]ڪs~_
u>>_'^G|[DMRpJ_z_?r>Oď tu>g2Sl./.PsӶ]0F]]\_]ʙUWM>xEhċgS@_.ťL/_?ϲ9q1"_UC.Vi`]働k@sM֩nZnwZӨ6g+ӕQjkVO7ILd n
Pl5M8MGjEZu0JO V ]w*
&(߭1e.D'P~lT[۱~6k6]dʔɣp0
Qf ,'B~(d~~*
g難ؑr(CߵQ;hPctOxu]F,rk_\i,2!ras|w=XU6_Cz
e
692hs`=k,b)2[
(A@l
mG1ZYϚD>H.`p
U.6.Ń|+6klE[ZUHӱ94c!81Á\"I"lJ[N0
Cԁ8*(,=HuMRIv)zlفxl1<vhn
nQ%?!x+?6L.&bK`:p2@.̣&d+ipw!sG8psdadXJc=73V-K
vS0C6{pL~6Odj+/Ih&7Ш~"\7:;*?̈́*^ga:fדe|Qo֗:Y-vߨr:TIv4q\P0I#l
'jź[Zmr;)ݫ뛻<9$%}`/G=ZG=Vwa}sRQ%ּ~:fУ[M;n8HԺӾz6 0;QYL(}rqcC]o'elU
XbMۢZA;3}:ssF
FOaNms WbxS}-յ
]tPH?fRfxc Sow
sAhCYfh0L%_',Ԥ8X_:s2>𠇪HM./2
ÁDLӅx/>_S^͡&MuF!qj$fܽR,|W8@iNg8H\~~[LA6
<`
yrlrj˒Xui;2h5/KeZ[y~ڭOh3T}x'CptAL!X
;O%מAh[hڸl77#"o5!!l6,"GqJ})mZ[#zcL _3"
l
-^´.R "{1ǳG8>*
z4#i][4|brQctd T]B6ޱwz
qt4]*Ηl>_kԜ*G"Ln۴OTYNn1*S!!\,uU}ȩŚz6!inG&E7$ug%fơ WCш >U{J߽V(qKAE뛷4J~_Ѩ?v)yeؓY(/J:?igft?NƠǪǱbD$zv'lщ=D2c~P]$g-Ymy+gd˒g;A"S.d,{nt5y*258TtT%}0H:xAnxcXdRq/S7x#;I2Ľ/@_ћW|9A.cz4t:#:Rx3kg/_+
endstream
endobj
20 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 21 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
21 0 obj
<> stream
x[]s8|_1/T\Q{r۔ws{9۩<"!1Ip Њ_+˛2]BRR@Q264_3~e4̋wxb[QwvEa폤Gn#'_ȿoĕ|2'g^4kWk6F:EIh>f#i*)JC(KU*]VʼnSGxy5]q¿$'6Gi g+ Z.Q]"R%WVB!Fa)unWmᲝPrYftz-q-,-ĖGnd>9愤\<}}RA(XM#>~ʍgGgԋC.Vl|V3,O !|3 wM^-o@d>prBncByd(LHK^l+
PFyOl{70A]\^r7ouIwLeQcA,_ɪ
PEF^<]eV`M%DFI|āHdc^wz3jP>o]kXA6`1qvWWhBr+Ӽ҅^okvө_`OqЃ[chBNe#`ՕJٙ7zDXjPpB5J$!~=^cOPwv3vӠ
`Ob~sG
nQ4~Lb)bOT~GD;TwlEu_d榩8vThGi8>]z'%7]0+D75r?D
1[po*Q
$t@WV`Y[g8k
Y+މYjf0`dlUV6Hu]l#{=rgҝarcz0$#6D҆w_v~rgɛUe;nv'rz$Aؠǌ%zY~qKSk*DnZcm}~O;`L'B$(h0iS***> /PZ 1 >>
endobj
23 0 obj
<> stream
xZ]oF}ﯸ `+"Ec4E&z0"G<3=AI#[@R|Ϝ{wf:S@S~Ǐ=wkzSBI__o_4|0>r~,,ɞy+Wk]I˜lLEJ~{uSIsN[*Vʽ45t#K
%iVuJ|e5_7IUxsdg"|\J5oP_=NcaĞN~KnX,ǿ{ި]˥%X8˂k*5L5ռXQ+v%BIsW"KuhxYɠ
ȢD5jp$a*2: MC-v$$?gg`wnEgMq#- d9W7@߽^Ajk,mYg2fڪkgxB7Jݓ
$2}5"$jpjWF{
C-&^3m U3!{>2}ᝌMLF_йJy d9"gـO|p)mo`7B2Țگ+\3*
hiU`0wRlnM7AėVaC ϖDtj9smp8F]P7^qNυED>_jU;U2à9/:
ޔ1XY!0Ğ7q"z_b;ZuU?qӰ$ˣ6ab*^^UĈ5x4gQҁQۢ_y3v'fR{> Q\M~_XCf
ַӮ20{}s ~P[(8(y***xChƐGe1AȢhօud0!]_Q
+`E!B`ͣΚ{gxhZ
(Wד $g@3}̚FE5YR?YohϬfðuRE)$ak
Z
+`P+"%YXzW&+ʇAy5
endstream
endobj
24 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 25 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
25 0 obj
<> stream
xZ]o8}_q߶o?36 ͠L恖hTIʮCsI*R'`*@YsϹRt>iH7*h83;|Q6i߬wç$uouo=>}ӟq69s`7}{|"l9[Lib>MAx9zkZT*kk6VT>^rJWF{Z[*le<{`<0y6
VN~K$c&uHlK@2,|{=8aONkP)7;iFh~\at` ZY$
+lrQIIry lά:ǵXPfI*XysCp.Ɩ_rBY<7i$
/5~p(+RG2S{YqaiR #T/5~'R;S+ApY0rr=rL1wb7t͊aTUm,sQ7JcjNX\{teBioMP<VDZlQ08A3_X5tr>&G+v߱~fUXAEP6LgQYjm
צ;jߐ=NZSѵBk$Iդt^6wE?[4}Ѣ br$X~촶2uq> kvPHHjE$)ګ
9oUL;B";%BEw'UpV!t]7p&*}\cJEum(١8ӬЋ=34#a"J+/ ~vC(n}o(D/'+a!f,a`ǙA/~}bh8}lvNZx١ߋܬQJWp}ISoVXft'ʦG0J0N)LEx&M(4 N1[0CBbT;mBPLt){M,rh&~0)x/K05ptvQRE;! ݾpH?@q&rd@(}g.:lx/BbYl7dTJh/ķ}-/{"IBr>Bgfm_zAzŠ9?c-kWC:];5=">י+];Y:)Vhyd6<2Q
W |ψ8A_cZ|59Mh1h:Fiɾٸyz-m
endstream
endobj
26 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 27 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
27 0 obj
<> stream
x[r7|W1HoCRO[l'kE8H8K"ngUqLCӧOi_b#g$~ǯG\+p#=qBoS/ħ|O/3ƣn)Hώlp6eb6ft:7x}A@d\(y -NZ "z\m$JfdhaA-]+V}l,yVNF{$*BZ;k*eXXGi'Jkֲ8ΕQz?Zˀɒ%X|Ѣ)q+E)tjJaqx$ "؞'dG.3cr4'<O륕)UA?䇥)ChByT!WA*;̘!teidY*0Iv5jMU9"|eFJ+U.(C!L&dC
Z'%)%-\.\AnH?"xJZV3Ϙ!5hK6S_s CY'l521p&*DքzT(EF*CÉdXn6lި+1@0q8J%
бIgi'*~~%oHWugrqJ [BFH7~~*AIс,8{Mi,υckm18qؿC~z\ޥrU֫Bn*C:u1}(tHr}ե*5cLi翬94'͙CiwR"JhQҢa I?{㵾
~PiK&Z6|ՒZbRW5: :U żrZh,'$Ht|>v~5
8_(+Wf_-VĭK#L飀^]먣>VdlpDK_RAy-Zgl
0+CS2VvĉMcjGz)YRv
PádwtS{6Bơ8I$eH8Tkfchk\-]H2|Pyx1I^H̞sGg8l)tl7çFKO%v]
endstream
endobj
28 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 29 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
29 0 obj
<> stream
x[rF}WcRh7QÖ,^g%[+*$[5DDq?#?g]T*p grp<C[w3h<g.nWuBɤO%}JfA
?7#Fi2{儏Ǹs[|"&yrXiLGxBi궥Nk:ժ2)];;UUz]ꪥ:-;ol~~ߊ죿wM/28$^}h:1lrNUR.=n;3:cTPۭXFSgO|јG4*Ӷr:M`卾.̰yMuWqGm=4Y5) Nh,"rigl{~ǯФUcT(4{6W^z8HL73borsҙAi]A5|c?ʕq6Ru?3,/O"lzΫtPTҽokFFkW5]tii_4Ro[g|Q1=$rAl QYS.c
aD8?wO_\%087OL8st;p5r*
˯\XO_kgpD|DsnUZ1yTwy! PGRa0T1Wȩe7^>?^[2Ns!oD9E˛)Sw('CZ:NofՀZB\C۰ Ǡێْٵ}4gǁӂCJ|&3q Rw-sJR%Xw[=/ m]">AJզX&S!7L*k_ϬC$GO_3:њb?+f K)ihk݀"'/|;[ƿTW~*ia$BNnnֿ(,^i_loCckĄu聵
Jč^5455l}c}=bX nkj.SfDq/y<|ֻHUCmMˑ )#|WYDÅʃt*^6 t!u8iSZzJBʼJBo_MBT&%s 8y1u
>ީJb=)myh64D:]YUFY3嘍r'9%660-HN,mk}8<UC֬
}M
ie
f.[F5eZP`^;[jr1A #iU#VourN@wg-*BP>Uq
leOC?8.n*JB:xVo͈;%pӭJ#(9YLFt[ |3;ӹJw}b&{9".eiX9Q`bӢw
pTNq+
Kɶk77Vpt!-o!iv*p u&0
g9Qh)d>V>s^VAoK-Lt8EQ dH'
tjp0u+bi#8(؈{X
qx<30*NAmZRr8sR(OЪ8-erzg(t&Υ Hlr2"t"Biog +C-PuL{4<%!^qEefB|BH$"Υ]k?UTi &*c!Zq4b3hʌv8X@:尰Mj4l4+6{GOp v) Rԙ6;&f[^+N'΅P[+(SॶJxnmPa ^Ǿoc$sͷE҇E~uj$@rzÖ*KۿxD?pp0$"΅qvyj];+;DIH5~$q3?`QR}G/X8Cv'DBrT^DӃnk7I~"R5`ZԞ}ĸm-PpoRHAJݜ/U6(Rڸm`CgCZj\Zpt&^vyzHk/mK>NֶZsvp&/ԭ$΄ `wF')vmU{"jGeAj_Vc{lT[^lRme0X:نF1uaͽ>|nqRj*=%g#A_*L
"4"`ҩZ B2ǹeB΅pG=
xϬA@ZkGg1gu/ #.PPf04xir Ux LS-;Ρ"4í/Fh[S6RU)-3؇yb6|4LfvZLQwԓY
endstream
endobj
30 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 31 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /PZ 1 >>
endobj
31 0 obj
<> stream
xZ]o6}ﯸ>4,-4NSms-R{.IV .m L{xn?⇶ԥdtω_b77uDQ\߿7t䃟S<'/?;QҋfNJ|9<7$`ԧQpMF]t+Js#V+Uz˕"ΫR¾n>g\_Ng>pՃbN0ah_{pKiYϟ^QVJMV
.H
XidUxpߞױ;
?P=ǜ[KBb,J%rȬJ%_*Jw^A4rp=$%E*;t+iDYպ$] fGؑ*0eei+V")=~x{KzLuЧʐMq./tG(F]~DH[vj̆I5s%P?_P|@ Ǡ
]Tu<1)
q}ԙ)8#:E!X̠"ZsjYN{bt\<[& $C18}뭯LQM!PU$ߝNW^tB}qh[=IEKT`s2[W%Fɭ-_j&Laue]%~]s}Xz$ÑE/H
9U.8V]ჟ~MRKKg,Le(:n;cXrإ9%Y8a;;TѲU 6b>/._=[/-a{~+2(zsM
0H:U2G=
.`m-H/TW;r$"jT"lTݔuh$`Mg6|5S8R*rv֭ۅkjbFoiyAp@s»mC&CNQ/jD7٤h4D^$prN*q/
ȱp 0s՜v}-RW
nN]!@2Z&F拲MU2J* vϹQN>:LR|=xP\w^{qhQ8J
* =%
:rԏ&
LVq d^S뽍8qa .tL.qƟˤUFrVyi>l
5
́xsD 6o(p߹3UL?I3kJxa m0:)~oI>\K拜nmIPF=yǥnN?>7^=h4
endstream
endobj
32 0 obj
<< /Type /Page /Parent 1 0 R /LastModified (D:20211128231611+00'00') /Resources 2 0 R /MediaBox [0.000000 0.000000 595.276000 841.890000] /CropBox [0.000000 0.000000 595.276000 841.890000] /BleedBox [0.000000 0.000000 595.276000 841.890000] /TrimBox [0.000000 0.000000 595.276000 841.890000] /ArtBox [0.000000 0.000000 595.276000 841.890000] /Contents 33 0 R /Rotate 0 /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Annots [ 6 0 R 7 0 R ] /PZ 1 >>
endobj
33 0 obj
<> stream
xZr۶}Wlߒ.#D%&Mn;;n6M "QR(qܹwx#Z$ٳgEr?ßCh~\
(!N7w?o3_tx{|fI%Wvl:x3$r9|tɹ0^j!žepUYȶu-moT[Z/>9wk唸y^ZE<ܼ7wEIeel/='
JZ`+40hf55c-܊6Z5 'uBVmb[A8bd˕f#-)
1d%eCPV ,F|0o-4 *f<Z(]VQ\hG;-6%|ī/@iiapq
Z$ժcFյ!8=3,ʱd:=\
.VN++BAmJ#P\ ax)ǚ
1 yPZ4pVQ$X 8ge:($A
%`↛B(
nq%D}y~X92\sJ;Êl$IDh(" ~$!}mǪ2]Ь%MefF4º2
9{j6U+IIj'VB~dOa qby4T
y$fO#(~ՌNF)`A"|PT!hE\VJHAQFX95e{24ʪn.)ßS:Du:̂23~ )a]QM_{
\!ʐnqO; EiTZ7Vq@=Wtw?E'}{ӗΣ'#J?G sS`'Z:ŋL&ώ~aIKfha-$`s{?pUH1{/|q2%gGyzx
ZN袍{<`O Ro%k=oYi+ɓ8'h
n
endstream
endobj
1 0 obj
<< /Type /Pages /Kids [ 8 0 R 10 0 R 12 0 R 14 0 R 16 0 R 18 0 R 20 0 R 22 0 R 24 0 R 26 0 R 28 0 R 30 0 R 32 0 R ] /Count 13 >>
endobj
3 0 obj
<>
endobj
4 0 obj
<>
endobj
5 0 obj
<>
endobj
2 0 obj
<< /ProcSet [/PDF /Text /ImageB /ImageC /ImageI] /Font << /F1 3 0 R /F2 4 0 R /F3 5 0 R >> /XObject << >> >>
endobj
6 0 obj
<> /H /I>>
endobj
7 0 obj
<> /H /I>>
endobj
34 0 obj
<< /Title (Dynamic Programming Problems And Solutions Doc File) /Author (Academic Press,Princeton University Press,Notion Press,S. Chand Publishing,CreateSpace Independent Publishing Platform,Courier Corporation,Springer,<title--->Programming Interview Problems</title---><title--->Dynamic Programming \(with Solutions in Python\)</title---><desc--->Are you preparing for a programming interview? Would you like to work at one of the Internet giants, such as Google, Facebook, Amazon, Apple, Microsoft or Netflix? Are you looking for a software engineer position? Are you studying computer science or programming? Would you like to improve your programming skills? If the answer to any of these questions is yes, this book is for you! The book contains very detailed answers and explanations for the most common dynamic programming problems asked in programming interviews. The solutions consist of cleanly written code, with plenty of comments, accompanied by verbal explanations, hundreds of drawings, diagrams and detailed examples, to help you get a good understanding of even the toughest problems. The goal is for you to learn the patterns and principles needed to solve even dynamic programming problems that you have never seen before. Here is what you will get: A 180-page book presenting dynamic programming problems that are often asked in interviews. Multiple solutions for each problem, starting from simple but naive answers that are gradually improved until reaching the optimal solution. Plenty of detailed examples and walkthroughs, so that you can see right away how the solution works. 350+ drawings and diagrams which cater towards visual learners. Clear and detailed verbal explanations of how to approach the problems and how the code works. Analysis of time and space complexity. Discussion of other variants of the same problem, with solutions. Unit tests, including the reasoning behind choosing each one \(edge case identification, performance evaluation etc.\). Suggestions regarding what clarification questions you should ask, for each problem. Multiple solutions to the problems, where appropriate. General Python implementation tips. Wishing you the best of luck with your interviews!</desc---><title--->Dynamic Programming for the Day Before Your Coding Interview</title---><desc--->Dynamic Programming is a fundamental algorithmic technique which is behind solving some of the toughest computing problems.In this book, we have covered some Dynamic Programming problems which will give you the general idea of formulating a Dynamic Programming solution and some practice on applying it on a variety of problems.Some of the problems we have covered are: * Permutation coefficientThis is a basic problem but is significant in understanding the idea behind Dynamic Programming. We have used this problem to: * Present the two core ideas of Dynamic Programming to make the idea clear and help you understand what Dynamic Programming mean. * Show another approach which can same performance \(in terms of time complexity\) and understand how it is different from our Dynamic Programming approach* Longest Common SubstringThis is an important problem as we see how we can apply Dynamic Programming in string problems. In the process, we have demonstrated the core ideas of handling string data which helps in identifying the cases when Dynamic Programming is the most efficient approach.* XOR valueThis is another significant problem as we are applying Dynamic Programming on a Number Theory problem more specifically problem involving subset generation. The search space is exponential in size but with our efficient approach, we can search the entire data in polynomial time which is a significant improvement.This brings up a fundamental power of Dynamic Programming: Search exponential search space in polynomial time* K edgesIn line with our previous problems, in this problem, we have applied Dynamic Programming in a graph-based problem. This is a core problem as in this we learn that: * Dynamic Programming makes the solution super-efficient * Extending the Dynamic Programming solution using Divide and Conquer enables us to solve it more efficientlyThis problem shows a problem where Dynamic Programming is not the most efficient solution but is in the right path.We have covered other relevant solutions and ideas as well so that you have the complete idea of the problems and understand deeply the significance of Dynamic Programming in respect to the problems.This book has been carefully prepared and reviewed by Top programmers and Algorithmic researchers and members of OpenGenus. We would like to thank Aditya Chatterjee and Ue Kiao for their expertise in this domain and reviews from professors at The University of Tokyo and Tokyo Institute of Technology.Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.</desc---><title--->Dynamic Programming for Coding Interviews</title---><title--->A Bottom-Up approach to problem solving</title--->,Springer Science & Business Media,OpenGenus,Walter de Gruyter GmbH & Co KG,MIT Press,Athena Scientific,John Wiley & Sons,CRC Press,Elsevier,SIAM,World Scientific,Packt Publishing Ltd) /Subject (Dynamic Programming Problems And Solutions published by : Academic Press Princeton University Press Notion Press S. Chand Publishing CreateSpace Independent Publishing Platform Courier Corporation Springer <title--->Programming Interview Problems</title---><title--->Dynamic Programming \(with Solutions in Python\)</title---><desc--->Are you preparing for a programming interview? Would you like to work at one of the Internet giants, such as Google, Facebook, Amazon, Apple, Microsoft or Netflix? Are you looking for a software engineer position? Are you studying computer science or programming? Would you like to improve your programming skills? If the answer to any of these questions is yes, this book is for you! The book contains very detailed answers and explanations for the most common dynamic programming problems asked in programming interviews. The solutions consist of cleanly written code, with plenty of comments, accompanied by verbal explanations, hundreds of drawings, diagrams and detailed examples, to help you get a good understanding of even the toughest problems. The goal is for you to learn the patterns and principles needed to solve even dynamic programming problems that you have never seen before. Here is what you will get: A 180-page book presenting dynamic programming problems that are often asked in interviews. Multiple solutions for each problem, starting from simple but naive answers that are gradually improved until reaching the optimal solution. Plenty of detailed examples and walkthroughs, so that you can see right away how the solution works. 350+ drawings and diagrams which cater towards visual learners. Clear and detailed verbal explanations of how to approach the problems and how the code works. Analysis of time and space complexity. Discussion of other variants of the same problem, with solutions. Unit tests, including the reasoning behind choosing each one \(edge case identification, performance evaluation etc.\). Suggestions regarding what clarification questions you should ask, for each problem. Multiple solutions to the problems, where appropriate. General Python implementation tips. Wishing you the best of luck with your interviews!</desc---><title--->Dynamic Programming for the Day Before Your Coding Interview</title---><desc--->Dynamic Programming is a fundamental algorithmic technique which is behind solving some of the toughest computing problems.In this book, we have covered some Dynamic Programming problems which will give you the general idea of formulating a Dynamic Programming solution and some practice on applying it on a variety of problems.Some of the problems we have covered are: * Permutation coefficientThis is a basic problem but is significant in understanding the idea behind Dynamic Programming. We have used this problem to: * Present the two core ideas of Dynamic Programming to make the idea clear and help you understand what Dynamic Programming mean. * Show another approach which can same performance \(in terms of time complexity\) and understand how it is different from our Dynamic Programming approach* Longest Common SubstringThis is an important problem as we see how we can apply Dynamic Programming in string problems. In the process, we have demonstrated the core ideas of handling string data which helps in identifying the cases when Dynamic Programming is the most efficient approach.* XOR valueThis is another significant problem as we are applying Dynamic Programming on a Number Theory problem more specifically problem involving subset generation. The search space is exponential in size but with our efficient approach, we can search the entire data in polynomial time which is a significant improvement.This brings up a fundamental power of Dynamic Programming: Search exponential search space in polynomial time* K edgesIn line with our previous problems, in this problem, we have applied Dynamic Programming in a graph-based problem. This is a core problem as in this we learn that: * Dynamic Programming makes the solution super-efficient * Extending the Dynamic Programming solution using Divide and Conquer enables us to solve it more efficientlyThis problem shows a problem where Dynamic Programming is not the most efficient solution but is in the right path.We have covered other relevant solutions and ideas as well so that you have the complete idea of the problems and understand deeply the significance of Dynamic Programming in respect to the problems.This book has been carefully prepared and reviewed by Top programmers and Algorithmic researchers and members of OpenGenus. We would like to thank Aditya Chatterjee and Ue Kiao for their expertise in this domain and reviews from professors at The University of Tokyo and Tokyo Institute of Technology.Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.</desc---><title--->Dynamic Programming for Coding Interviews</title---><title--->A Bottom-Up approach to problem solving</title---> Springer Science & Business Media OpenGenus Walter de Gruyter GmbH & Co KG MIT Press Athena Scientific John Wiley & Sons CRC Press Elsevier SIAM World Scientific Packt Publishing Ltd) /Keywords (,Programming Interview Problems,Dynamic Programming \(with Solutions in Python\),Dynamic Programming for the Day Before Your Coding Interview,Dynamic Programming for Coding Interviews,A Bottom-Up approach to problem solving,Dynamic Programming,A Computational Tool,Cracking Programming Interviews,500 Questions with Solutions,Models and Applications,Approximate Dynamic Programming,Solving the Curses of Dimensionality,PHP 7 Data Structures and Algorithms,Stochastic Control Theory,Dynamic Programming Principle,Abstract Dynamic Programming,Statistics for Machine Learning,Learning JavaScript Data Structures and Algorithms,Foundations and Principles, Second Edition,Solving Problems Using Dynamic Programming: A Hacker's Perspective,A New Class of Solutions to Dynamic Programming Problems Problems Arising in Growth Theory and Applications to Dynamic Games,Solving Optimization Problems with MATLAB,Reinforcement Learning and Dynamic Programming Using Function Approximators,Dynamic Programming and Optimal Control,7 days with Dynamic Programming,Dynamic Programming and Stochastic Control,Computerized Closed Form Solutions to Nonserial Dynamic Programming Problems,String Algorithms for the Day Before Your Coding Interview,Programming Challenges,The Programming Contest Training Manual,Applied Dynamic Programming,Dynamic Programming and Stationary Analyses of Inventory Problems,Applications to Agriculture and Natural Resources,Iterative Dynamic Programming,Reinforcement Learning and Optimal Control,Volume I,Dynamic Programming in Chemical Engineering and Process Control by Sanford M Roberts,Modeling and Simulation of Logistics Flows 1,Theory and Fundamentals,Applied Dynamic Programming for Optimization of Dynamical Systems,A New Class of Solutions to Dynamic Programming Problems Arising in Growth Theory and Applications to Dynamic Games,Problems in Operation Research \(Principles & Solution\),Principles and Solutions,Logic Programming and Nonmonotonic Reasoning,8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings,The Art and Theory of Dynamic Programming,Nonlinear and Dynamic Programming,An Introduction,Eye of the Hurricane,Introduction To Algorithms) /Creator (Acrobat Distiller 9.0.0 \(Macintosh\)) /Producer (Acrobat PDFMaker 18 for Word|x|Bureau of Labor Statistics) /CreationDate (D:20211128231611+00'00') /ModDate (D:20211128231611+00'00') /Trapped /False >>
endobj
35 0 obj
<< /Type /Metadata /Subtype /XML /Length 19379 >> stream
application/pdf
Dynamic Programming Problems And Solutions Doc File
Academic Press,Princeton University Press,Notion Press,S. Chand Publishing,CreateSpace Independent Publishing Platform,Courier Corporation,Springer,<title--->Programming Interview Problems</title---><title--->Dynamic Programming (with Solutions in Python)</title---><desc--->Are you preparing for a programming interview? Would you like to work at one of the Internet giants, such as Google, Facebook, Amazon, Apple, Microsoft or Netflix? Are you looking for a software engineer position? Are you studying computer science or programming? Would you like to improve your programming skills? If the answer to any of these questions is yes, this book is for you! The book contains very detailed answers and explanations for the most common dynamic programming problems asked in programming interviews. The solutions consist of cleanly written code, with plenty of comments, accompanied by verbal explanations, hundreds of drawings, diagrams and detailed examples, to help you get a good understanding of even the toughest problems. The goal is for you to learn the patterns and principles needed to solve even dynamic programming problems that you have never seen before. Here is what you will get: A 180-page book presenting dynamic programming problems that are often asked in interviews. Multiple solutions for each problem, starting from simple but naive answers that are gradually improved until reaching the optimal solution. Plenty of detailed examples and walkthroughs, so that you can see right away how the solution works. 350+ drawings and diagrams which cater towards visual learners. Clear and detailed verbal explanations of how to approach the problems and how the code works. Analysis of time and space complexity. Discussion of other variants of the same problem, with solutions. Unit tests, including the reasoning behind choosing each one (edge case identification, performance evaluation etc.). Suggestions regarding what clarification questions you should ask, for each problem. Multiple solutions to the problems, where appropriate. General Python implementation tips. Wishing you the best of luck with your interviews!</desc---><title--->Dynamic Programming for the Day Before Your Coding Interview</title---><desc--->Dynamic Programming is a fundamental algorithmic technique which is behind solving some of the toughest computing problems.In this book, we have covered some Dynamic Programming problems which will give you the general idea of formulating a Dynamic Programming solution and some practice on applying it on a variety of problems.Some of the problems we have covered are: * Permutation coefficientThis is a basic problem but is significant in understanding the idea behind Dynamic Programming. We have used this problem to: * Present the two core ideas of Dynamic Programming to make the idea clear and help you understand what Dynamic Programming mean. * Show another approach which can same performance (in terms of time complexity) and understand how it is different from our Dynamic Programming approach* Longest Common SubstringThis is an important problem as we see how we can apply Dynamic Programming in string problems. In the process, we have demonstrated the core ideas of handling string data which helps in identifying the cases when Dynamic Programming is the most efficient approach.* XOR valueThis is another significant problem as we are applying Dynamic Programming on a Number Theory problem more specifically problem involving subset generation. The search space is exponential in size but with our efficient approach, we can search the entire data in polynomial time which is a significant improvement.This brings up a fundamental power of Dynamic Programming: Search exponential search space in polynomial time* K edgesIn line with our previous problems, in this problem, we have applied Dynamic Programming in a graph-based problem. This is a core problem as in this we learn that: * Dynamic Programming makes the solution super-efficient * Extending the Dynamic Programming solution using Divide and Conquer enables us to solve it more efficientlyThis problem shows a problem where Dynamic Programming is not the most efficient solution but is in the right path.We have covered other relevant solutions and ideas as well so that you have the complete idea of the problems and understand deeply the significance of Dynamic Programming in respect to the problems.This book has been carefully prepared and reviewed by Top programmers and Algorithmic researchers and members of OpenGenus. We would like to thank Aditya Chatterjee and Ue Kiao for their expertise in this domain and reviews from professors at The University of Tokyo and Tokyo Institute of Technology.Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.</desc---><title--->Dynamic Programming for Coding Interviews</title---><title--->A Bottom-Up approach to problem solving</title--->,Springer Science & Business Media,OpenGenus,Walter de Gruyter GmbH & Co KG,MIT Press,Athena Scientific,John Wiley & Sons,CRC Press,Elsevier,SIAM,World Scientific,Packt Publishing Ltd
Dynamic Programming Problems And Solutions published by : Academic Press Princeton University Press Notion Press S. Chand Publishing CreateSpace Independent Publishing Platform Courier Corporation Springer <title--->Programming Interview Problems</title---><title--->Dynamic Programming (with Solutions in Python)</title---><desc--->Are you preparing for a programming interview? Would you like to work at one of the Internet giants, such as Google, Facebook, Amazon, Apple, Microsoft or Netflix? Are you looking for a software engineer position? Are you studying computer science or programming? Would you like to improve your programming skills? If the answer to any of these questions is yes, this book is for you! The book contains very detailed answers and explanations for the most common dynamic programming problems asked in programming interviews. The solutions consist of cleanly written code, with plenty of comments, accompanied by verbal explanations, hundreds of drawings, diagrams and detailed examples, to help you get a good understanding of even the toughest problems. The goal is for you to learn the patterns and principles needed to solve even dynamic programming problems that you have never seen before. Here is what you will get: A 180-page book presenting dynamic programming problems that are often asked in interviews. Multiple solutions for each problem, starting from simple but naive answers that are gradually improved until reaching the optimal solution. Plenty of detailed examples and walkthroughs, so that you can see right away how the solution works. 350+ drawings and diagrams which cater towards visual learners. Clear and detailed verbal explanations of how to approach the problems and how the code works. Analysis of time and space complexity. Discussion of other variants of the same problem, with solutions. Unit tests, including the reasoning behind choosing each one (edge case identification, performance evaluation etc.). Suggestions regarding what clarification questions you should ask, for each problem. Multiple solutions to the problems, where appropriate. General Python implementation tips. Wishing you the best of luck with your interviews!</desc---><title--->Dynamic Programming for the Day Before Your Coding Interview</title---><desc--->Dynamic Programming is a fundamental algorithmic technique which is behind solving some of the toughest computing problems.In this book, we have covered some Dynamic Programming problems which will give you the general idea of formulating a Dynamic Programming solution and some practice on applying it on a variety of problems.Some of the problems we have covered are: * Permutation coefficientThis is a basic problem but is significant in understanding the idea behind Dynamic Programming. We have used this problem to: * Present the two core ideas of Dynamic Programming to make the idea clear and help you understand what Dynamic Programming mean. * Show another approach which can same performance (in terms of time complexity) and understand how it is different from our Dynamic Programming approach* Longest Common SubstringThis is an important problem as we see how we can apply Dynamic Programming in string problems. In the process, we have demonstrated the core ideas of handling string data which helps in identifying the cases when Dynamic Programming is the most efficient approach.* XOR valueThis is another significant problem as we are applying Dynamic Programming on a Number Theory problem more specifically problem involving subset generation. The search space is exponential in size but with our efficient approach, we can search the entire data in polynomial time which is a significant improvement.This brings up a fundamental power of Dynamic Programming: Search exponential search space in polynomial time* K edgesIn line with our previous problems, in this problem, we have applied Dynamic Programming in a graph-based problem. This is a core problem as in this we learn that: * Dynamic Programming makes the solution super-efficient * Extending the Dynamic Programming solution using Divide and Conquer enables us to solve it more efficientlyThis problem shows a problem where Dynamic Programming is not the most efficient solution but is in the right path.We have covered other relevant solutions and ideas as well so that you have the complete idea of the problems and understand deeply the significance of Dynamic Programming in respect to the problems.This book has been carefully prepared and reviewed by Top programmers and Algorithmic researchers and members of OpenGenus. We would like to thank Aditya Chatterjee and Ue Kiao for their expertise in this domain and reviews from professors at The University of Tokyo and Tokyo Institute of Technology.Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.</desc---><title--->Dynamic Programming for Coding Interviews</title---><title--->A Bottom-Up approach to problem solving</title---> Springer Science & Business Media OpenGenus Walter de Gruyter GmbH & Co KG MIT Press Athena Scientific John Wiley & Sons CRC Press Elsevier SIAM World Scientific Packt Publishing Ltd
,Programming Interview Problems,Dynamic Programming (with Solutions in Python),Dynamic Programming for the Day Before Your Coding Interview,Dynamic Programming for Coding Interviews,A Bottom-Up approach to problem solving,Dynamic Programming,A Computational Tool,Cracking Programming Interviews,500 Questions with Solutions,Models and Applications,Approximate Dynamic Programming,Solving the Curses of Dimensionality,PHP 7 Data Structures and Algorithms,Stochastic Control Theory,Dynamic Programming Principle,Abstract Dynamic Programming,Statistics for Machine Learning,Learning JavaScript Data Structures and Algorithms,Foundations and Principles, Second Edition,Solving Problems Using Dynamic Programming: A Hacker's Perspective,A New Class of Solutions to Dynamic Programming Problems Problems Arising in Growth Theory and Applications to Dynamic Games,Solving Optimization Problems with MATLAB®,Reinforcement Learning and Dynamic Programming Using Function Approximators,Dynamic Programming and Optimal Control,7 days with Dynamic Programming,Dynamic Programming and Stochastic Control,Computerized Closed Form Solutions to Nonserial Dynamic Programming Problems,String Algorithms for the Day Before Your Coding Interview,Programming Challenges,The Programming Contest Training Manual,Applied Dynamic Programming,Dynamic Programming and Stationary Analyses of Inventory Problems,Applications to Agriculture and Natural Resources,Iterative Dynamic Programming,Reinforcement Learning and Optimal Control,Volume I,Dynamic Programming in Chemical Engineering and Process Control by Sanford M Roberts,Modeling and Simulation of Logistics Flows 1,Theory and Fundamentals,Applied Dynamic Programming for Optimization of Dynamical Systems,A New Class of Solutions to Dynamic Programming Problems Arising in Growth Theory and Applications to Dynamic Games,Problems in Operation Research (Principles & Solution),Principles and Solutions,Logic Programming and Nonmonotonic Reasoning,8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings,The Art and Theory of Dynamic Programming,Nonlinear and Dynamic Programming,An Introduction,Eye of the Hurricane,Introduction To Algorithms
2021-11-28T23:16:11+00:00
Acrobat Distiller 9.0.0 (Macintosh)
2021-11-28T23:16:11+00:00
2021-11-28T23:16:11+00:00
,Programming Interview Problems,Dynamic Programming (with Solutions in Python),Dynamic Programming for the Day Before Your Coding Interview,Dynamic Programming for Coding Interviews,A Bottom-Up approach to problem solving,Dynamic Programming,A Computational Tool,Cracking Programming Interviews,500 Questions with Solutions,Models and Applications,Approximate Dynamic Programming,Solving the Curses of Dimensionality,PHP 7 Data Structures and Algorithms,Stochastic Control Theory,Dynamic Programming Principle,Abstract Dynamic Programming,Statistics for Machine Learning,Learning JavaScript Data Structures and Algorithms,Foundations and Principles, Second Edition,Solving Problems Using Dynamic Programming: A Hacker's Perspective,A New Class of Solutions to Dynamic Programming Problems Problems Arising in Growth Theory and Applications to Dynamic Games,Solving Optimization Problems with MATLAB®,Reinforcement Learning and Dynamic Programming Using Function Approximators,Dynamic Programming and Optimal Control,7 days with Dynamic Programming,Dynamic Programming and Stochastic Control,Computerized Closed Form Solutions to Nonserial Dynamic Programming Problems,String Algorithms for the Day Before Your Coding Interview,Programming Challenges,The Programming Contest Training Manual,Applied Dynamic Programming,Dynamic Programming and Stationary Analyses of Inventory Problems,Applications to Agriculture and Natural Resources,Iterative Dynamic Programming,Reinforcement Learning and Optimal Control,Volume I,Dynamic Programming in Chemical Engineering and Process Control by Sanford M Roberts,Modeling and Simulation of Logistics Flows 1,Theory and Fundamentals,Applied Dynamic Programming for Optimization of Dynamical Systems,A New Class of Solutions to Dynamic Programming Problems Arising in Growth Theory and Applications to Dynamic Games,Problems in Operation Research (Principles & Solution),Principles and Solutions,Logic Programming and Nonmonotonic Reasoning,8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings,The Art and Theory of Dynamic Programming,Nonlinear and Dynamic Programming,An Introduction,Eye of the Hurricane,Introduction To Algorithms
KONICA MINOLTA bizhub PRO 950|x|Adobe Acrobat 9.45 Paper Capture Plug-in
uuid:4f515141-1653-ee37-b16d-068542015759
uuid:4f515141-1653-ee37-b16d-068542015759
http://ns.adobe.com/pdf/1.3/
pdf
Adobe PDF Schema
http://ns.adobe.com/xap/1.0/mm/
xmpMM
XMP Media Management Schema
internal
UUID based identifier for specific incarnation of a document
InstanceID
URI
http://www.aiim.org/pdfa/ns/id/
pdfaid
PDF/A ID Schema
internal
Part of PDF/A standard
part
Integer
internal
Amendment of PDF/A standard
amd
Text
internal
Conformance level of PDF/A standard
conformance
Text
endstream
endobj
36 0 obj
<< /Type /Catalog /Version /1.7 /Pages 1 0 R /Names << >> /ViewerPreferences << /Direction /L2R >> /PageLayout /SinglePage /PageMode /UseNone /OpenAction [8 0 R /FitH null] /Metadata 35 0 R >>
endobj
xref
0 37
0000000000 65535 f
0000038236 00000 n
0000038711 00000 n
0000038380 00000 n
0000038486 00000 n
0000038597 00000 n
0000038835 00000 n
0000039057 00000 n
0000000015 00000 n
0000000465 00000 n
0000002516 00000 n
0000002968 00000 n
0000005191 00000 n
0000005643 00000 n
0000007962 00000 n
0000008414 00000 n
0000011226 00000 n
0000011678 00000 n
0000014338 00000 n
0000014790 00000 n
0000017667 00000 n
0000018119 00000 n
0000020499 00000 n
0000020951 00000 n
0000023132 00000 n
0000023584 00000 n
0000025855 00000 n
0000026307 00000 n
0000029199 00000 n
0000029651 00000 n
0000032595 00000 n
0000033047 00000 n
0000035433 00000 n
0000035909 00000 n
0000039274 00000 n
0000065018 00000 n
0000084481 00000 n
trailer
<< /Size 37 /Root 36 0 R /Info 34 0 R /ID [ <4f5151411653ee37b16d068542015759> <4f5151411653ee37b16d068542015759> ] >>
startxref
84690
%%EOF
*