Hexo

D.ZookeeperandTheInfiniteZoo（CodeforcesGlobalRound13）题解xiaodangao

题目链接[D.ZookeeperandTheInfiniteZoo](http//codeforces.com/problemset/problem/1491/D)

D.3ColoringCodeforcesRound#712(Div.2)（题解）xiaodangao

题目链接[D.3Coloring](http//codeforces.com/contest/1503/problem/B)

C.KbeautifulStringsCodeforcesRound#705(Div.2)题解xiaodangao

题目链接[C.KbeautifulStrings](http//codeforces.com/contest/1493/problem/C)

POJ.3585AccumulationDegree(树型DP)xiaodangao

题目链接[AccumulationDegree](http//poj.org/problem?id=3585)

Acwing.10有依赖的背包问题(树型DP,分组背包)xiaodangao

题目链接[Acwing.10有依赖的背包问题(树型DP,分组背包)](https//www.acwing.com/problem/content/description/10/)

Acwing.284金字塔(区间DP)题解xiaodangao

KPhDmath(数学)题解xiaodangao

K.PhDmath

timelimitpertest

memorylimitpertest

1024megabytesinputstandardinputoutputstandardoutput

Johnnyisabrilliantmathematicsstudent.Helovesmathematicssincehewasachild,nowheisworkingonhisPhDthesis.Hefacesasmallmathematicalproblem,hehasandigitintegernumber(letuscallits),hewantstofindhowmanysubstringofsaredivisiblebyaprimenumberp.

Hissupervisorprofessorisonvacationnow,socanyouplayhisroleandhelphimwiththat?

ThefirstlinecontainsthenumberoftestcasesT.EachofthenextTlinesrepresentsatestcase.Foreachtestcaseyouwillbegiven4numbers1 ≤ a, b ≤ 1018,1 ≤ n ≤ 106,2 ≤ p < 200.Wherea < b.sisnotdirectlygivenintheinput,youhavetocalculateitfromaandbasfollowssisthefirstndigitsfromthedecimalrepresentationofa / b(treata / bdecimalrepresentationasithasaninfinitedigitsandjusttakethefirstndigitsfromtheleft)

Foreachtestcaseyoushouldprintonelinecontainingthenumberofsubstringsofsthatcanbedividedbypwithoutremainder.

ExamplesInputCopy3243524252415OutputCopy631Note

Forthefirsttestcaseinthesample,a=2,b=4,n=3andp=5.Sos=500andthereare6substringsthataredividedbypwhichare5,0,0,50,00,500.

poj.1179Polygon(区间DP)题解xiaodangao

题目链接[http//poj.org/problem?id=1179](poj)

Acwing199.余数之和（数学+思维）xiaodangao

AcWing198.反素数（数学+DFS）xiaodangao

1…4 567 8