{"id":18,"date":"2022-06-04T10:52:00","date_gmt":"2022-06-04T02:52:00","guid":{"rendered":"http:\/\/ubuntu.tim-wcx.ltd\/wordpress\/index.php\/2022\/06\/04\/%e6%b1%82%e7%bb%84%e5%90%88%e6%95%b0%e7%9a%84%e6%96%b9%e6%b3%95\/"},"modified":"2022-06-04T10:52:00","modified_gmt":"2022-06-04T02:52:00","slug":"%e6%b1%82%e7%bb%84%e5%90%88%e6%95%b0%e7%9a%84%e6%96%b9%e6%b3%95","status":"publish","type":"post","link":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/2022\/06\/04\/%e6%b1%82%e7%bb%84%e5%90%88%e6%95%b0%e7%9a%84%e6%96%b9%e6%b3%95\/","title":{"rendered":"\u6c42\u7ec4\u5408\u6570\u7684\u65b9\u6cd5"},"content":{"rendered":"

\n <\/path>\n <\/svg><\/p>\n

<\/a>1.\u66b4\u529b<\/h3>\n

\u6839\u636e\u9636\u4e58\u516c\u5f0f\u5c55\u5f00\uff0c\u65f6\u95f4\u590d\u6742\u5ea6\u8f83\u9ad8\uff0c\u4e14\u5bb9\u6613\u70b8\u6389long long<\/p>\n

<\/a>2.\u501f\u7528double\u66b4\u529b\u6765\u6c42<\/h3>\n

http:\/\/icpc.upc.edu.cn\/problem.php?cid=1438&pid=9<\/a><\/p>\n

<\/a>\u9898\u76ee\u63cf\u8ff0<\/h6>\n

Imagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he\u2019s explaining that (a+b)2=a2+2ab+b2). So you decide to waste your time with drawing modern art instead.<\/p>\n

Fortunately you have a piece of squared paper and you choose a rectangle of size n*m on the paper. Let\u2019s call this rectangle together with the lines it contains a grid. Starting at the lower left corner of the grid, you move your pencil to the upper right corner, taking care that it stays on the lines and moves only to the right or up. The result is shown on the left:
\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"<\/p>\n

Really a masterpiece, isn\u2019t it? Repeating the procedure one more time, you arrive with the picture shown on the right. Now you wonder: how many different works of art can you produce?<\/p>\n

<\/a>\u8f93\u5165<\/h6>\n

The input contains several testcases. Each is specified by two unsigned 32-bit integers n and m, denoting the size of the rectangle. As you can observe, the number of lines of the corresponding grid is one more in each dimension. Input is terminated by n=m=0.<\/p>\n

<\/a>\u8f93\u51fa<\/h6>\n

For each test case output on a line the number of different art works that can be generated using the procedure described above. That is, how many paths are there on a grid where each step of the path consists of moving one unit to the right or one unit up? You may safely assume that this number fits into a 32-bit unsigned integer.<\/p>\n

<\/a>\u6837\u4f8b\u8f93\u5165<\/h6>\n
5 4\n1 1\n0 0\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h6>\n
126\n2\n<\/code><\/pre>\n
\u8f93\u5165a\u548cb\uff0c\u6c42C(b,a+b)<\/p>\n
#pragma<\/span> GCC optimize(1)<\/span>\n#pragma<\/span> GCC optimize(2)<\/span>\n#pragma<\/span> GCC optimize(3,\"Ofast\",\"inline\")<\/span>\n#include<\/span> <\/span><\/span>\n#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    register<\/span> ll n,<\/span>k,<\/span>a,<\/span>b;<\/span>\n    register<\/span> ll sum,<\/span>p;<\/span>\n    register<\/span> long<\/span> double<\/span> sum1=<\/span>1.0<\/span>;<\/span>\n    while<\/span>(<\/span>scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>n,<\/span>&<\/span>k)<\/span>&&<\/span>(<\/span>n!=<\/span>0<\/span>||<\/span>k!=<\/span>0<\/span>)<\/span>)<\/span>\n    {<\/span>\n        sum1=<\/span>1.0<\/span>;<\/span>\n        a=<\/span>n+<\/span>k;<\/span>\n        b=<\/span>n<<\/span>k?<\/span>n:<\/span>k;<\/span>\n        for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>b;<\/span>i++<\/span>)<\/span>\n        {<\/span>\n            sum1=<\/span>sum1*<\/span>a*<\/span>1.0<\/span>\/<\/span>i;<\/span>\n            a--<\/span>;<\/span>\n        }<\/span>\n        sum1+<\/span>=<\/span>0.5<\/span>;<\/span>\n        sum=<\/span>sum1;<\/span>\n        printf<\/span>(<\/span>\"%lldn\"<\/span>,<\/span>sum)<\/span>;<\/span>\n    }<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n<\/code><\/pre>\n
<\/a>3.\u9006\u5143\u6c42\u7ec4\u5408\u6570<\/h4>\n
http:\/\/icpc.upc.edu.cn\/problem.php?id=12104<\/a><\/p>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h6>\n
You are given positive integers N and M.
 How many sequences a of length N consisting of positive integers satisfy a1\u00d7a2\u00d7\u2026\u00d7aN=M? Find the count modulo 109+7.
 Here, two sequences a\u2019 and a” are considered different when there exists some i such that a\u2019i\u2260a”i.<\/p>\n
Constraints
 \u00b7All values in input are integers.
 \u00b71\u2264N\u2264105
 \u00b71\u2264M\u2264109<\/p>\n
<\/a>\u8f93\u5165<\/h6>\n
Input is given from Standard Input in the following format:
 N M<\/p>\n
<\/a>\u8f93\u51fa<\/h6>\n
Print the number of the sequences consisting of positive integers that satisfy the condition, modulo 109+7.<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h6>\n
2 6<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h6>\n
4<\/p>\n
<\/a>\u63d0\u793a<\/h6>\n
Four sequences satisfy the condition: {a1,a2}={1,6},{2,3},{3,2} and {6,1}.<\/p>\n
<\/a>\u601d\u8def<\/h6>\n
\u8d28\u56e0\u6570\u5206\u89e3\uff0c\u7136\u540e\u6bcf\u4e2a\u7d20\u6570\u56e0\u5b50\u4e2a\u6570\uff0c\u8bbe\u4e3ax\uff0c\u8f6c\u5316\u4e3a\u628ax\u4e2a\u76f8\u540c\u7684\u653e\u8fdbn\u4e2a\u4f4d\u7f6e\uff0c\u5f00\u59cb\u5199\u7684n^x,\u4f46\u662fwa,\u540e\u6765\u5199\u7684\u9694\u677f\u6cd5\u3002
 C(n+x-1,n-1)\u3002
 \u4e3a\u5565\u4e0d\u662fn^x\uff0c\u56e0\u4e3a\u5143\u7d20\u76f8\u540c\uff0c\u4e0d\u540c\u65b9\u6848\u53d6\u51b3\u4e8e\u6bcf\u4e2a\u76d2\u5b50\u591a\u5c11\u4e2a\u7403\u3002\u53c8\u9694\u677f\u6cd5\u4e0d\u80fd\u6709\u7a7a\u5143\u7d20\uff0c\u4f46\u9898\u76ee\u53ef\u4ee5\u3002\u6240\u4ee5\u6211\u4eec\u6dfb\u52a0\u4e09\u5757\u9694\u677f\uff0c\u7b54\u6848\u4e3a\u4e0a\u3002<\/p>\n
#include<\/span> <\/span><\/span>\n#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> unsigned<\/span> long<\/span> long<\/span> ll;<\/span>\nconst<\/span> ll N=<\/span>1e9<\/span>+<\/span>7<\/span>;<\/span>\nll w[<\/span>505500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll p<\/span>(<\/span>ll x,<\/span>ll y)<\/span>\n{<\/span>\n    ll sum1=<\/span>1<\/span>;<\/span>\n    while<\/span>(<\/span>y)<\/span>\n    {<\/span>\n        if<\/span> (<\/span>y&<\/span>1<\/span>)<\/span>\n            sum1=<\/span>(<\/span>sum1%<\/span>N*<\/span>x%<\/span>N)<\/span>%<\/span>N;<\/span>\n        y>>=<\/span>1<\/span>;<\/span>\n        x=<\/span>(<\/span>x%<\/span>N*<\/span>x%<\/span>N)<\/span>%<\/span>N;<\/span>\n    }<\/span>\n    return<\/span> sum1%<\/span>N;<\/span>\n}<\/span>\nll c1<\/span>(<\/span>ll x,<\/span>ll y)<\/span>\n{<\/span>\n    if<\/span>(<\/span>x<<\/span>y)<\/span>\n        swap<\/span>(<\/span>x,<\/span>y)<\/span>;<\/span>\n    return<\/span> (<\/span>w[<\/span>x]<\/span>%<\/span>N*<\/span>p<\/span>(<\/span>(<\/span>w[<\/span>x-<\/span>y]<\/span>%<\/span>N*<\/span>w[<\/span>y]<\/span>%<\/span>N)<\/span>%<\/span>N,<\/span>N-<\/span>2<\/span>)<\/span>%<\/span>N)<\/span>%<\/span>N;<\/span>\n}<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    ll n,<\/span>m;<\/span>\n    w[<\/span>1<\/span>]<\/span>=<\/span>1<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>2<\/span>;<\/span>i<=<\/span>500500<\/span>;<\/span>i++<\/span>)<\/span>\n        w[<\/span>i]<\/span>=<\/span>(<\/span>w[<\/span>i-<\/span>1<\/span>]<\/span>*<\/span>i)<\/span>%<\/span>N;<\/span>\n    cin>><\/span>n>><\/span>m;<\/span>\n    if<\/span>(<\/span>n==<\/span>1<\/span>)<\/span>\n    {<\/span>\n        cout<<<\/span>1<\/span><<<\/span>endl;<\/span>\n        return<\/span> 0<\/span>;<\/span>\n    }<\/span>\n    ll sum=<\/span>1<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>2<\/span>;<\/span>i*<\/span>i<=<\/span>m+<\/span>100<\/span>;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        if<\/span>(<\/span>m%<\/span>i!=<\/span>0<\/span>)<\/span>\n            continue<\/span>;<\/span>\n        ll js=<\/span>0<\/span>;<\/span>\n        while<\/span>(<\/span>m%<\/span>i==<\/span>0<\/span>)<\/span>\n        {<\/span>\n            m=<\/span>m\/<\/span>i;<\/span>\n            js++<\/span>;<\/span>\n        }<\/span>\n        sum=<\/span>(<\/span>sum%<\/span>N*<\/span>c1<\/span>(<\/span>n-<\/span>1<\/span>,<\/span>n+<\/span>js-<\/span>1<\/span>)<\/span>%<\/span>N)<\/span>%<\/span>N;<\/span>\n    }<\/span>\n    if<\/span>(<\/span>m!=<\/span>1<\/span>)<\/span>\n        sum=<\/span>(<\/span>sum%<\/span>N*<\/span>n%<\/span>N)<\/span>%<\/span>N;<\/span>\n    cout<<<\/span>sum%<\/span>N<<<\/span>endl;<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
1.\u66b4\u529b \u6839\u636e\u9636\u4e58\u516c\u5f0f\u5c55\u5f00\uff0c\u65f6\u95f4\u590d\u6742\u5ea6\u8f83\u9ad8\uff0c\u4e14\u5bb9\u6613…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-18","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/18","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/comments?post=18"}],"version-history":[{"count":0,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/18\/revisions"}],"wp:attachment":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/media?parent=18"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/categories?post=18"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/tags?post=18"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}