zoukankan      html  css  js  c++  java
  • 组合数学之Polya计数 TOJ1116 Let it Bead

    1116: Let it Bead 分享至QQ空间

    Time Limit(Common/Java):1000MS/10000MS     Memory Limit:65536KByte
    Total Submit: 7            Accepted:4

    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

    经典题目

    #include<stdio.h>
    #include<string.h>
    int eular(int n)
    {
        int ret=1,i;
        for(i=2; i*i<=n; i++)
        {
            if(n%i==0)
            {
                ret*=i-1;
                n/=i;
                while(n%i==0)
                {
                    n=n/i;
                    ret*=i;
                }
            }
            if(n==1)
                break;
        }
        if(n>1)
            ret*=n-1;
        return ret;
    }
    int po(int a,int b)
    {
        int ret=1,i;
        for(i=1; i<=b; i++)
            ret*=a;
        return ret;
    }
    int main()
    {
        int n,ans,i,m;
        while(~scanf("%d%d",&m,&n))
        {
            if(!n&&!m)break;
            ans=0;
            for(i=1; i*i<n; i++)
            {
                if(n%i==0)
                {
                    ans+=eular(n/i)*po(m,i);
                    ans+=eular(i)*po(m,n/i);
                }
            }
            if(i*i==n)
                ans+=eular(n/i)*po(m,i);
            if(n&1)
                ans+=po(m,n/2+1)*n;
            else
                ans+=po(m,n/2)*n/2+po(m,n/2+1)*n/2;
            printf("%d
    ",ans/n/2);
        }
        return 0;
    }

     也是很优秀的写法

    #include<bits/stdc++.h>
    using namespace std;
    int c,n,ans;
    int po(int p,int n)
    {
        int ans=1;
        while(n)
        {
            if(n&1)ans*=p;
            p*=p,n>>=1;
        }
        return ans;
    }
    
    int main()
    {
        while(cin>>c>>n&&(c||n))
        {
            ans=0;
            for(int i=1; i<=n; i++)
                ans+=po(c,__gcd(n,i));
            if(n&1)
                ans+=n*po(c,n/2+1);
            else
                ans+=(po(c,n/2+1)+po(c,n/2))*(n/2);
            cout<<ans/2/n<<endl;
        }
        return 0;
    }
  • 相关阅读:
    MySQL中去重字段完全相同的数据
    SVN自动更新-win平台
    EF出错:Unable to convert MySQL date/time value to System.DateTime
    微信不支持Object.assign
    记录一下dotnetcore.1.0.0-VS2015Tools.preview2安装不上的问题
    Ajax表单异步上传(包括文件域)
    .NET web开发之WebApi初试水
    遍历数组一次求得数组的平均数、标准差、方差
    记STM32F030多通道ADC DMA读取乱序问题
    RT-Thread入门和模拟器的配置生成
  • 原文地址:https://www.cnblogs.com/BobHuang/p/8794897.html
Copyright © 2011-2022 走看看