{"id":278,"date":"2010-06-09T17:04:00","date_gmt":"2010-06-09T09:04:00","guid":{"rendered":"http:\/\/localhost\/?p=278"},"modified":"2010-06-09T17:04:00","modified_gmt":"2010-06-09T09:04:00","slug":"balkan2007dream","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/wjmzbmr\/?p=278","title":{"rendered":"[Balkan2007]Dream"},"content":{"rendered":"\n<p>[Balkan2007]Dream<\/p>\n<p>Time Limit:10000MS  Memory Limit:165536K<br \/>Total Submit:3 Accepted:2 <br \/>Case Time Limit:1000MS<\/p>\n<p><strong>Description <\/strong><\/p>\n<p>\u7ed9\u51faN\u884cM\u5217\u7684\u6570\u5b57\u77e9\u9635. <br \/>\u4ece\u7b2c\u4e00\u884c\u7684\u6570\u5217\u4e2d\u9009\u4e00\u4e2a\u6570\u5b57,\u4ece\u6700\u540e\u4e00\u884c\u7684\u6570\u5217\u4e2d\u9009\u4e00\u4e2a\u6570\u5b57. <br \/>\u4ece\u5176\u5b83\u7684\u884c\u4e2d,\u6bcf\u884c\u53d6\u4e00\u5230\u4e24\u4e2a\u6570. <br \/>\u5c06\u53d6\u51fa\u6765\u7684\u6570\u5b57\u76f8\u4e58,\u5e0c\u671b\u5176\u53ef\u4ee5\u88abK\u6574\u9664. <br \/>\u4f60\u53ea\u9700\u8981\u8f93\u51fa\u7ed3\u679cMod L\u7684\u503c.<\/p>\n<p><strong>Input <\/strong><\/p>\n<p>\u7b2c\u4e00\u884c\u7ed9\u51faN,M <br \/>\u7b2c\u4e8c\u884c\u7ed9\u51faK,L <br \/>\u4e0b\u9762\u6709N\u884cM\u5217,\u7528\u4e8e\u63cf\u8ff0\u6570\u5b57\u77e9\u9635 <br \/>\u5176\u503c\u5728[1,1000000]\u5404\u4e0d\u76f8\u540c. <\/p>\n<p>N\u5728[3,200] <br \/>M\u5728[3,10000] <br \/>K\u5728[2,200000] <br \/>L\u5728[2,30000] <\/p>\n<p><strong>Output <\/strong><\/p>\n<p>\u53d6\u6cd5\u603b\u6570Mod L<\/p>\n<p><strong>Sample Input <\/strong><\/p>\n<\/p>\n<p><strong>Sample Output <\/strong><\/p>\n<\/p>\n<p><strong>Hint <\/strong><\/p>\n<p>\u4ee5\u4e0b\u4e3a\u6837\u4f8b\u768412\u79cd\u53d6\u6cd5. <br \/>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 1 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 2 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 3 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 4 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 5 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 6 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 7 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 8 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 9 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 10 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 11 <\/p>\n<p>5 2 1 <br \/>2 1 2 <br \/>3 7 4 <br \/>Pic. 12 <\/p>\n<p><strong>Source <br \/>\u597d\u5427\u8fd9\u9898\u4e0d\u7b97\u96be\u3002\u3002\u4f46\u662f\u633a\u6709\u610f\u601d\u7684\u3002\u3002\u4e00\u5f00\u59cb\u6211\u60f3\u7684\u662f\u8bb0\u5f55\u5bf9K\u7684\u6bcf\u79cd\u4f59\u6570\u6709\u591a\u5c11\u4e2a\uff0c\u4f46\u90a3\u6837\u663e\u7136\u592aSB\u4e86\u3002\u3002\u3002\u3002\u540e\u6765\u6211\u611f\u89c9\u8fd9\u6837\u5f88\u6d6a\u8d39\u554a\u3002\u3002\u5b9e\u9645\u4e0a\u5f53\u524d\u552f\u4e00\u6709\u7528\u7684\u4fe1\u606f\u662f\u4e0eK\u7684\u6700\u5927\u516c\u7ea6\u6570\uff01\uff01\u3002\u3002\u3002\u800cK\u7684\u7ea6\u6570\u4e0d\u4f1a\u8d85\u8fc7300\u4e2a\uff08\u8fd8\u8bb0\u5f97\u53cd\u7d20\u6570\u90a3\u4e2a\u9898\u76ee\u4e48\u3002\u3002\u7279\u610f\u7b97\u4e86\u4e0b\uff09\u3002\u3002\u6240\u4ee5\u6beb\u65e0\u538b\u529b\u7684\u5c31\u53ef\u4ee5A\u6389\u4e86\u3002\u3002\u3002\u9700\u8981\u4e0e\u5904\u7406\u4e00\u4e0b\u4e24\u4e2a\u7ea6\u6570\u76f8\u4e58\u4e4b\u540e\u4e0eK\u7684\u6700\u5927\u516c\u7ea6\u6570\u3002\u3002\u3002\u3002\u4ee5\u53ca\u6bcf\u4e2a\u6570\u4e0eK\u7684\u6700\u5927\u516c\u7ea6\u6570\uff08\u7c7b\u4f3c\u7b5b\u6cd5\u7684\u641e\uff09\u3002\u3002\u3002<br \/>\u53e6\u5916\u6700\u8fd1\u4e00\u76f4\u5728\u770bTopCoder SRM Level 3\u7684\u9898\u76ee\u3002\u3002\u6709\u4e86\u4e0d\u5c11\u611f\u89e6\u554a\u3002\u3002\u6709\u65f6\u95f4\u5199\u4e2a\u8868\u683c\u997f\u56e7\u3002\u3002<br \/>Code\uff1a<br \/><\/strong><\/p>\n<p>#include&lt;cstdio&gt;#include&lt;algorithm&gt;#include&lt;iostream&gt;#define rep(i,n) for(int i=0;i&lt;n;i++)using namespace std;const int maxn=200,maxm=10000,maxk=200000,maxw=1000000,maxs=300;typedef long long ll;int mod,k,n,m,Div[maxw+1],L[maxs],dn=0,Next[maxs][maxs];inline void Add(int&amp;x,int c){x+=c;x%=mod;}inline void Mult(int&amp;x,int c){x*=c;x%=mod;}int Dp[2][maxs],c1[maxs],c2[maxs];int main(){    \/\/freopen(&quot;in&quot;,&quot;r&quot;,stdin);    scanf(&quot;%d%d%d%d&quot;,&amp;n,&amp;m,&amp;k,&amp;mod);    for(int i=1;i&lt;=k;i++)if(k%i==0)L[dn++]=i;    rep(i,dn)rep(j,dn)        for(int k=dn-1;k&gt;=0;k&#8211;)if(ll(L[i])*L[j]%L[k]==0)        {            Next[i][j]=k;break;        }    rep(i,dn)    {        int x=L[i];        for(int j=x;j&lt;=maxw;j+=x)Div[j]=i;    }    int x,now=0,old=1;    rep(i,m)scanf(&quot;%d&quot;,&amp;x),Add(Dp[now][Div[x]],1);    rep(i,n-1)    {        swap(now,old);memset(Dp[now],0,sizeof Dp[now]);        memset(c1,0,sizeof c1);        memset(c2,0,sizeof c2);        rep(i,m)scanf(&quot;%d&quot;,&amp;x),Add(c1[Div[x]],1);        memcpy(c2,c1,sizeof c1);        if(i!=n-2)            rep(a,dn)rep(b,a+1)                if(a!=b)Add(c2[Next[a][b]],c1[a]*c1[b]*2);                else Add(c2[Next[a][b]],c1[a]*(c1[a]-1));        rep(a,dn)rep(b,dn)            Add(Dp[now][Next[a][b]],Dp[old][a]*c2[b]);    }    printf(&quot;%dn&quot;,Dp[now][dn-1]);}123 312 1005 2 12 1 23 7 4 <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[Balkan2007]Dream Time Limit:10000MS Memory Limit:165536KTotal Submit:3 Accepted:2 Case Time Limit:1000MS Description \u7ed9\u51faN\u884cM\u5217\u7684\u6570\u5b57\u77e9\u9635. \u4ece\u7b2c\u4e00\u884c\u7684\u6570\u5217\u4e2d\u9009\u4e00\u4e2a\u6570\u5b57,\u4ece\u6700\u540e\u4e00\u884c\u7684\u6570\u5217\u4e2d\u9009\u4e00\u4e2a\u6570\u5b57. \u4ece\u5176\u5b83\u7684\u884c\u4e2d,\u6bcf\u884c\u53d6\u4e00\u5230\u4e24\u4e2a\u6570. \u5c06\u53d6\u51fa\u6765\u7684\u6570\u5b57\u76f8\u4e58,\u5e0c\u671b\u5176\u53ef\u4ee5\u88abK\u6574\u9664. \u4f60\u53ea\u9700\u8981\u8f93\u51fa\u7ed3\u679cMod L\u7684\u503c. Input \u7b2c\u4e00\u884c\u7ed9\u51faN,M \u7b2c\u4e8c\u884c\u7ed9\u51faK,L \u4e0b\u9762\u6709N\u884cM\u5217,\u7528\u4e8e\u63cf\u8ff0\u6570\u5b57\u77e9\u9635 \u5176\u503c\u5728[1,1000000]\u5404\u4e0d\u76f8\u540c. N\u5728[3,200] M\u5728[3,10000] K\u5728[2,200000] L\u5728[2,30000] Output \u53d6\u6cd5\u603b\u6570Mod L Sample Input Sample Output Hint \u4ee5\u4e0b\u4e3a\u6837\u4f8b\u768412\u79cd\u53d6\u6cd5. 5 2 1 2 1 2 3 7 4 Pic. 1 5 2 1 2 1 2 3 7 4 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/278"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=278"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/278\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=278"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=278"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=278"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}