寒假集训_专题四题解_J - Sum (HDU - 4704 )

m0_46185124

于 2020-01-25 20:20:25 发布

阅读量155

点赞数

分类专栏：专题训练

本文链接：https://blog.csdn.net/m0_46185124/article/details/104084587

版权

专题训练专栏收录该内容

32 篇文章 1 订阅

订阅专栏

题目

在这里插入图片描述
Input
2
Output
2

Hint

For N = 2, S(1) = S(2) = 1.
The input file consists of multiple test cases.

Sample Input
2

题目大意

定义S(k)为将N分成k份的和的方案数(有顺序，k份中不含0),求(S(1)+S(2)+…+S(N))mod10⁹+7

题解

通过隔板法可求出S(k)=C(N-1,K-1),所以答案为C(N-1,0)+C(N-1,1)+…+C(N-1,N-1) = 2^N-1,但如果直接用快速幂求的话会TLE，这时可以用费马小定理(a^p-1同余1，(a,p)=1)来优化,注意本题有组输入(在Hint中)。

代码

#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int mod = 1e9 + 7;
int len;
char number[100010];
int qmi(int a,int b,int p)
{
	int res = 1%p,t = a%p;
	while(b)
	{
		if(b&1)res = (LL)res*t%p;
		b >>= 1;
		t = (LL)t*t%p;
	}
	return res;
}
vector<int> div(vector<int> &A, int b, LL &r)
{
	vector<int> B;
	r = 0;
	for(int i = A.size()-1; i >= 0; i --)
	{
		r = r*10 + A[i];
		B.push_back(r/b);
		r = r%b;
	}
	reverse(B.begin(),B.end());
	while(B.size()&&B.back() == 0)B.pop_back(); 
	return B;
}
int main()
{
	while(scanf("%s",number)!=EOF)
	{	
		vector<int> A;
		len = strlen(number);
		if(len==1&&number[0] == 1)
		{
			printf("1\n");
			continue;
		}
		LL t = -1;
		for(int i = len-1;i>=0;i--)
		if(t == 0)A.push_back(number[i]-'0');
		else if(number[i]-'0' > 0)
		{
			A.push_back(number[i]-'0'-1);
			t = 0;
		}
		else A.push_back(9);
		while(A.size()>1&&A.back() == 0)A.pop_back(); 
		div(A,mod-1,t);
		cout << qmi(2,t,mod)<<endl;
	}
	return 0;
}