Teams（uva11609+组合）

I - Teams

Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld
& %llu

Submit 

cid=77956#status//I/0" style="padding-bottom:0px; line-height:normal; margin:0px; padding-left:0px; padding-right:0px; font-family:Arial,Helvetica,sans-serif; color:rgb(73,73,73); font-size:14px; font-weight:normal; text-decoration:underline; padding-top:0px">Status 

id=33600" target="_blank" style="padding-bottom:0px; line-height:normal; margin:0px; padding-left:0px; padding-right:0px; font-family:Arial,Helvetica,sans-serif; color:rgb(73,73,73); font-size:14px; font-weight:normal; text-decoration:underline; padding-top:0px">Practice 

id=33600" target="_blank" style="padding-bottom:0px; line-height:normal; margin:0px; padding-left:0px; padding-right:0px; font-family:Arial,Helvetica,sans-serif; color:rgb(73,73,73); font-size:14px; font-weight:normal; text-decoration:underline; padding-top:0px">UVA
11609

题意：有n个人。选多个人參加比赛，当中一个是队长。队长不同其它选手同样也算作不同的方案。。问你一共同拥有多少种方案。

思路：自己才纸上略微推理一下，n*2^n-1%mod；

转载请注明出处：寻找&星空の孩子

题目链接：

id=33600" target="_blank" style="padding-bottom:0px; line-height:normal; margin:0px; padding-left:0px; padding-right:0px; font-family:Arial,Helvetica,sans-serif; color:rgb(73,73,73); font-size:14px; font-weight:normal; text-decoration:underline; padding-top:0px">UVA
11609

也欢迎来我开的专题刷题。哈哈

cid=77956#overview" target="_blank" style="padding-bottom:0px; line-height:normal; margin:0px; padding-left:0px; padding-right:0px; font-family:Arial,Helvetica,sans-serif; color:rgb(73,73,73); font-size:14px; font-weight:normal; text-decoration:underline; padding-top:0px">http://acm.hust.edu.cn/vjudge/contest/view.action?

cid=77956#overview

#include<stdio.h>
#define mod 1000000007
#define LL long long
LL ppow(LL x,LL n)
{
    LL tp=1;
    while(n)
    {
        if(n&1) tp=tp*x%mod;
        n>>=1;
        x=x*x%mod;
    }
    return tp;
}
int main()
{
    int ca=1,T;
    scanf("%d",&T);
    LL n;
    while(ca<=T)
    {
        scanf("%lld",&n);
        printf("Case #%d: %lld\n",ca++,(n*ppow(2,n-1))%mod);
    }
    return 0;
}

版权声明：本文博主原创文章，博客，未经同意不得转载。