• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            coreBugZJ

            此 blog 已棄。

            Let it Bead,POJ 2409

            Let it Bead
            Time Limit: 1000MS
            Memory Limit: 65536K
            Total Submissions: 2318
            Accepted: 1448

            Description

            "Let it Bead" company is located upstairs at 700 Cannery Row in Monterey, CA. As you can deduce from the company name, their business is beads. Their PR department found out that customers are interested in buying colored bracelets. However, over 90 percent of the target audience insists that the bracelets be unique. (Just imagine what happened if two women showed up at the same party wearing identical bracelets!) It's a good thing that bracelets can have different lengths and need not be made of beads of one color. Help the boss estimating maximum profit by calculating how many different bracelets can be produced.

            A bracelet is a ring-like sequence of s beads each of which can have one of c distinct colors. The ring is closed, i.e. has no beginning or end, and has no direction. Assume an unlimited supply of beads of each color. For different values of s and c, calculate the number of different bracelets that can be made.

            Input

            Every line of the input file defines a test case and contains two integers: the number of available colors c followed by the length of the bracelets s. Input is terminated by c=s=0. Otherwise, both are positive, and, due to technical difficulties in the bracelet-fabrication-machine, cs<=32, i.e. their product does not exceed 32.

            Output

            For each test case output on a single line the number of unique bracelets. The figure below shows the 8 different bracelets that can be made with 2 colors and 5 beads.

            Sample Input

            1 1
            2 1
            2 2
            5 1
            2 5
            2 6
            6 2
            0 0

            Sample Output

            1
            2
            3
            5
            8
            13
            21

            Source

            Ulm Local 2000


            赤裸裸的 Polya,旋轉 i 的循環個數為 gcd( i, n )


             1 #include <iostream>
             2 
             3 using namespace std;
             4 
             5 typedef long long Lint;
             6 
             7 Lint gcd( Lint a, Lint b ) {
             8         return ( (b==0? a : gcd(b,a%b) );
             9 }
            10 
            11 Lint power( Lint a, Lint b ) {
            12         Lint ans = 1;
            13         while ( b-- > 0 ) {
            14                 ans *= a;
            15         }
            16         return ans;
            17 }
            18 
            19 Lint solve( Lint n, Lint m ) {
            20         Lint i, ans = 0;
            21         for ( i = 1; i <= n; ++i ) {
            22                 ans += power( m, gcd(n,i) );
            23         }
            24         if ( n & 1 ) {
            25                 ans += n * power( m, n/2+1 );
            26         }
            27         else {
            28                 ans += power( m, n/2 ) * n / 2 + power( m, n/2+1 ) * n / 2;
            29         }
            30         ans /= n + n;
            31         return ans;
            32 }
            33 
            34 int main() {
            35         Lint n, m;
            36         for ( ; ; ) {
            37                 cin >> m >> n;
            38                 if ( (m<1&& (n<1) ) {
            39                         break;
            40                 }
            41                 cout << solve( n, m ) << "\n";
            42         }
            43         return 0;
            44 }
            45 


            posted on 2011-04-17 22:11 coreBugZJ 閱讀(440) 評論(0)  編輯 收藏 引用 所屬分類: ACM

            久久精品aⅴ无码中文字字幕不卡| 久久久国产打桩机| 国产精品久久久久久久| 69久久夜色精品国产69| 国产精品美女久久久久AV福利| 久久久久国产视频电影| 久久久久亚洲精品日久生情| 国产精品18久久久久久vr | 久久精品国产亚洲AV高清热 | 九九久久精品国产| 国内精品久久久久影院老司| 99久久婷婷国产综合亚洲| 久久青青国产| 久久99国产精品久久久 | 狠狠狠色丁香婷婷综合久久五月| 久久乐国产精品亚洲综合| 久久发布国产伦子伦精品| 香蕉久久夜色精品国产尤物| 国产精品美女久久久久AV福利| 久久人人爽人人人人爽AV| 国产精品综合久久第一页| 亚洲精品乱码久久久久久中文字幕| 色综合久久88色综合天天| 午夜精品久久久久久久久| 四虎国产精品成人免费久久| 国产精品免费久久| 精品国产福利久久久| 久久久久久亚洲AV无码专区| 亚洲国产精品狼友中文久久久| av无码久久久久不卡免费网站| 欧美日韩精品久久久久| 无码8090精品久久一区| 久久国产成人午夜AV影院| 久久99精品久久久久久秒播| 免费国产99久久久香蕉| 国产精品VIDEOSSEX久久发布| 国产亚洲欧美成人久久片| 国产999精品久久久久久| 国产精品99久久久久久董美香| 青青草原综合久久| 国产一区二区三精品久久久无广告|