前几天做的比赛,做得乱七八糟的,现在补一补。
1003-hannnnah_j’s Biological Test
题意:一个大小为 n 的环,选 m 个位置涂黑,要求相邻两个黑点之间至少间隔 k 个白点,问方案数。
分析:这道题比赛的时候没有想,因为别人在我看题之前就A了。赛后,将5-2-1的情况想了一下,感觉是很快就想出来枚举的思路。对于n的环,我先标个序号1~n,然后就是枚举第一个黑点的编号。当编号
≤ k
时,我们发现去掉这个黑点和前面K个白点与后面k个白点的,剩下的点就是一条
n − 2 k − 1
的链,涂黑m-1个白点,而且每两个黑点之间必须至少有k个白点。按照组合数学就是
C ( m − 1 n − 2 k − 1 − ( m − 2 ) ∗ k )
。当编号
> k
的时候,就是在上面
n − 2 k − 1
的链基础上(然后每次少1),继续涂黑m-1个黑点。公式是
C ( m − 1 n − 2 k − 1 − ( m − 2 ) ∗ k ) + C ( m − 1 n − 2 k − 1 − ( m − 2 ) ∗ k − 1 ) + C ( m − 1 n − 2 k − 1 − ( m − 2 ) ∗ k − 2 ) + . . . . . . + C ( m − 1 m ) + C ( m − 1 m − 1 ) = C ( m n − 2 k − 1 − ( m − 2 ) ∗ k + 1 )
这样两个组合数相加即可。还有几个注意点,一是前面的数如果不满足组合数定义的话,直接输出0;二是如果m是1的话,那么不需要这么考虑,直接将n输出就行了。还有这道题是环是编号的,所以不需要(能)用波利亚定理。
#include <map>
#include <set>
#include <ctime>
#include <stack>
#include <cmath>
#include <queue>
#include <bitset>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <fstream>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std ;
#define maxn 1000000+10
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define clr(x,y) memset(x,y,sizeof(x))
#define rep(i,n) for(int i=0;i<(n);i++)
#define repf(i,a,b) for(int i=(a);i<=(b);i++)
#define pii pair<int,int>
#define mp make_pair
#define FI first
#define SE second
#define IT iterator
#define PB push_back
#define Times 10
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const double eps = 1e-10 ;
const double pi = acos (-1.0 );
const ll mod = 1e9 +7 ;
const int inf = 0x3f3f3f3f ;
const ll INF = (ll)1e18 +300 ;
const double delta = 0.98 ;
inline void RI(int & x)
{
x=0 ;
char c=getchar();
while (!((c>='0' &&c<='9' )||c=='-' ))c=getchar();
bool flag=1 ;
if (c=='-' )
{
flag=0 ;
}
while (c<='9' &&c>='0' )
{
x=x*10 +c-'0' ;
c=getchar();
}
if (!flag)x=-x;
}
ll fac[maxn];
ll inv[maxn];
ll qlow(ll a,ll n){
ll ans=1 ;
while (n){
if (n&1 )ans=ans*a%mod;
a=a*a%mod;
n>>=1 ;
}
return ans;
}
void init(){
fac[0 ]=inv[0 ]=1 ;
for (int i=1 ;i<=1000000 ;i++){
fac[i]=fac[i-1 ]*i%mod;
inv[i]=qlow(fac[i],mod-2 );
}
}
ll C(int n,int m){
return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main(){
int T;
init();
scanf ("%d" ,&T);
while (T--){
int n,m,k;
scanf ("%d %d %d" ,&n,&m,&k);
if (m==1 ){
printf ("%d\n" ,n);
continue ;
}
int a=n-1 -2 *k;
int b=m-1 ;
if (a<0 ||a-(b-1 )*k<b){
puts ("0" );
continue ;
}
a-=(b-1 )*k;
ll ans=(C(a,b)*k%mod+C(a+1 ,b+1 ))%mod;
printf ("%lld\n" ,ans);
}
return 0 ;
}
1004 Mathematician QSC
题意:
f ( 0 ) = 0 , f ( 1 ) = 1 , f ( n ) = 2 ∗ f ( n − 1 ) + f ( n − 2 ) , g ( n ) = ∑ n i = 0 f ( i ) 2
,求
x g ( n ∗ y ) m o d ( s + 1 )
分析:这道题目一看就是矩阵快速幂,但是有几点需要搞清楚。首先一个就是
g ( n )
的取模应该取什么,根据一个公式(
x y m o d z = x y m o d φ ( z ) + φ ( z ) m o d z
),那么就是应该取
φ ( s + 1 )
模,但是有个条件g(n)必须大于
φ ( s + 1 )
,如果小于的话只能直接求解,也就是说当n*y小于等于10的时候,暴力求解;当大于的时候,用矩阵快速幂取模
φ ( s + 1 )
。这矩阵的写法可以参考我矩阵专题的博客,这里就把公式写一下。
g ( n ) = ∑ n i = 0 f ( i ) 2 = g ( n − 1 ) + f ( n ) 2
f ( n ) 2 = ( 2 ∗ f ( n − 1 ) + f ( n − 2 ) ) 2 = 4 ∗ f ( n − 1 ) 2 + 4 ∗ f ( n − 1 ) ∗ f ( n − 2 ) + f ( n − 2 ) 2
f ( n ) ∗ f ( n − 1 ) = ( 2 ∗ f ( n − 1 ) + f ( n − 2 ) ) ∗ f ( n − 1 ) = 2 ∗ f ( n − 1 ) 2 + f ( n − 1 ) ∗ f ( n − 2 )
那么矩阵构造是:
[ g ( n − 1 ) f ( n − 1 ) 2 f ( n − 2 ) 2 f ( n − 1 ) f ( n − 2 ) ] ∗ ⎡ ⎣ ⎢ ⎢ ⎢ 1 4 1 4 0 4 1 4 0 1 0 0 0 2 0 1 ⎤ ⎦ ⎥ ⎥ ⎥ = [ g ( n ) f ( n ) 2 f ( n − 1 ) 2 f ( n ) f ( n − 1 ) ]
#include <map>
#include <set>
#include <ctime>
#include <stack>
#include <cmath>
#include <queue>
#include <bitset>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <fstream>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std ;
#define maxn 10000+10
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define clr(x,y) memset(x,y,sizeof(x))
#define rep(i,n) for(int i=0;i<(n);i++)
#define repf(i,a,b) for(int i=(a);i<=(b);i++)
#define pii pair<int,int>
#define mp make_pair
#define FI first
#define SE second
#define IT iterator
#define PB push_back
#define Times 10
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const double eps = 1e-10 ;
const double pi = acos (-1.0 );
const ll mod = 1e9 +7 ;
const int inf = 0x3f3f3f3f ;
const ll INF = (ll)1e18 +300 ;
const double delta = 0.98 ;
inline void RI(int & x)
{
x=0 ;
char c=getchar();
while (!((c>='0' &&c<='9' )||c=='-' ))c=getchar();
bool flag=1 ;
if (c=='-' )
{
flag=0 ;
}
while (c<='9' &&c>='0' )
{
x=x*10 +c-'0' ;
c=getchar();
}
if (!flag)x=-x;
}
ll m;
ll g[maxn];
ll f[maxn];
int tot;
bool isprime[maxn];
int prime[maxn];
void init(){
for (int i=2 ;i<=10000 ;i++){
if (!isprime[i])
prime[tot++]=i;
for (int j=0 ;1l l*prime[j]*i<=10000 ;j++){
isprime[prime[j]*i]=true ;
if (i%prime[j]==0 )break ;
}
}
f[0 ]=0 ;f[1 ]=1 ;
g[0 ]=0 ;g[1 ]=1 ;
for (int i=2 ;i<=10 ;i++){
f[i]=2 *f[i-1 ]+f[i-2 ];
g[i]=g[i-1 ]+f[i]*f[i];
}
}
int phi(int n)
{
int ans=n;
for (int i=0 ;i<tot&&prime[i]<=n;i++)
if (n%prime[i]==0 )
{
ans=ans-ans/prime[i];
while (n%prime[i]==0 )
n/=prime[i];
}
if (n>1 )ans=ans-ans/n;
return ans;
}
struct matrix{
int n;
ll maze[5 ][5 ];
void init(int n){
this ->n=n;
clr(maze,0 );
}
matrix operator * (const matrix& rhs){
matrix ans;
ans.init(n);
for (int i=0 ;i<n;i++)
for (int j=0 ;j<n;j++)
for (int k=0 ;k<n;k++)
ans.maze[i][j]=(ans.maze[i][j]+maze[i][k]*rhs.maze[k][j])%m;
return ans;
}
};
ll qlow(matrix a,ll n){
matrix ans;
ans.init(a.n);
for (int i=0 ;i<a.n;i++)ans.maze[i][i]=1 ;
while (n){
if (n&1 )ans=ans*a;
a=a*a;
n>>=1 ;
}
return (ans.maze[0 ][0 ]+ans.maze[1 ][0 ])%m;
}
ll cal(ll a,ll n,ll m){
ll ans=1 ;
while (n){
if (n&1 )ans=(ans*a)%m;
a=(a*a)%m;
n>>=1 ;
}
return ans;
}
int main(){
int T;
ll n,y,x,s;
scanf ("%d" ,&T);
init();
while (T--){
scanf ("%lld %lld %lld %lld" ,&n,&y,&x,&s);
n*=y;
if (n==0 ){
printf ("%lld\n" ,1l l%(s+1 ));
continue ;
}
else if (n<=10 ){
cout <<cal(x,g[n],s+1 )<<endl;
}
else {
m=phi(s+1 );
matrix ans;
ans.init(4 );
ans.maze[0 ][0 ]=1 ;ans.maze[0 ][1 ]=0 ;ans.maze[0 ][2 ]=0 ;ans.maze[0 ][3 ]=0 ;
ans.maze[1 ][0 ]=4 ;ans.maze[1 ][1 ]=4 ;ans.maze[1 ][2 ]=1 ;ans.maze[1 ][3 ]=2 ;
ans.maze[2 ][0 ]=1 ;ans.maze[2 ][1 ]=1 ;ans.maze[2 ][2 ]=0 ;ans.maze[2 ][3 ]=0 ;
ans.maze[3 ][0 ]=4 ;ans.maze[3 ][1 ]=4 ;ans.maze[3 ][2 ]=0 ;ans.maze[3 ][3 ]=1 ;
ll ant=cal(x,qlow(ans,n-1 )+m,s+1 );
cout <<ant<<endl;
}
}
return 0 ;
}
1007 odd-even number
分析:暂时不太会把,等以后再刷一下数位DP之后,再次尝试这道题。
1010-Count primes
分析:cf上的一道原题。用的是什么什么公式,但是看不懂,直接作为模版收集。
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std ;
#define MAX 100005
#define MAXN 1000005
#define maxnode 15
#define sigma_size 30
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define LL long long
#define ull unsigned long long
#define mem(x,v) memset(x,v,sizeof(x))
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define bits(a) __builtin_popcount(a)
#define mk make_pair
#define limit 10000
const int INF = 0x3f3f3f3f ;
const LL INFF = 0x3f3f ;
const double inf = 1e18 ;
const double eps = 1e-4 ;
const LL mod = 1e9 +7 ;
const ull mx = 133333331 ;
inline void RI(int &x) {
char c;
while ((c=getchar())<'0' || c>'9' );
x=c-'0' ;
while ((c=getchar())>='0' && c<='9' ) x=(x<<3 )+(x<<1 )+c-'0' ;
}
const int N = 5e6 + 2 ;
bool np[N];
int prime[N], pi[N];
int getprime() {
int cnt = 0 ;
np[0 ] = np[1 ] = true ;
pi[0 ] = pi[1 ] = 0 ;
for (int i = 2 ; i < N; ++i) {
if (!np[i]) prime[++cnt] = i;
pi[i] = cnt;
for (int j = 1 ; j <= cnt && i * prime[j] < N; ++j) {
np[i * prime[j]] = true ;
if (i % prime[j] == 0 ) break ;
}
}
return cnt;
}
const int M = 7 ;
const int PM = 2 * 3 * 5 * 7 * 11 * 13 * 17 ;
int phi[PM + 1 ][M + 1 ], sz[M + 1 ];
void init() {
getprime();
sz[0 ] = 1 ;
for (int i = 0 ; i <= PM; ++i) phi[i][0 ] = i;
for (int i = 1 ; i <= M; ++i) {
sz[i] = prime[i] * sz[i - 1 ];
for (int j = 1 ; j <= PM; ++j) {
phi[j][i] = phi[j][i - 1 ] - phi[j / prime[i]][i - 1 ];
}
}
}
int sqrt2(LL x) {
LL r = (LL)sqrt (x - 0.1 );
while (r * r <= x) ++r;
return int (r - 1 );
}
int sqrt3(LL x) {
LL r = (LL)cbrt(x - 0.1 );
while (r * r * r <= x) ++r;
return int (r - 1 );
}
LL getphi(LL x, int s) {
if (s == 0 ) return x;
if (s <= M) return phi[x % sz[s]][s] + (x / sz[s]) * phi[sz[s]][s];
if (x <= prime[s]*prime[s]) return pi[x] - s + 1 ;
if (x <= prime[s]*prime[s]*prime[s] && x < N) {
int s2x = pi[sqrt2(x)];
LL ans = pi[x] - (s2x + s - 2 ) * (s2x - s + 1 ) / 2 ;
for (int i = s + 1 ; i <= s2x; ++i) {
ans += pi[x / prime[i]];
}
return ans;
}
return getphi(x, s - 1 ) - getphi(x / prime[s], s - 1 );
}
LL getpi(LL x) {
if (x < N) return pi[x];
LL ans = getphi(x, pi[sqrt3(x)]) + pi[sqrt3(x)] - 1 ;
for (int i = pi[sqrt3(x)] + 1 , ed = pi[sqrt2(x)]; i <= ed; ++i) {
ans -= getpi(x / prime[i]) - i + 1 ;
}
return ans;
}
LL lehmer_pi(LL x) {
if (x < N) return pi[x];
int a = (int )lehmer_pi(sqrt2(sqrt2(x)));
int b = (int )lehmer_pi(sqrt2(x));
int c = (int )lehmer_pi(sqrt3(x));
LL sum = getphi(x, a) + (LL)(b + a - 2 ) * (b - a + 1 ) / 2 ;
for (int i = a + 1 ; i <= b; i++) {
LL w = x / prime[i];
sum -= lehmer_pi(w);
if (i > c) continue ;
LL lim = lehmer_pi(sqrt2(w));
for (int j = i; j <= lim; j++) {
sum -= lehmer_pi(w / prime[j]) - (j - 1 );
}
}
return sum;
}
int main() {
init();
LL n;
while (cin >> n) {
cout << lehmer_pi(n) << endl;
}
return 0 ;
}