题意: 就是有一副无限数字的牌,然后有4种类型,分别为S,H,C,D. 然后给你a<=b, 让你再S,H,C,D类型里面各抽一种,使得 牌面的数字(必须为合数,不包括0,1)加起来=n(a<=b 全部)方案数…然后增加了一点难度就是给C张牌,而且这些牌丢失了,
个人感想:裸的fft ,还是比较简单的… 最主要是感觉那个数据范围…
分析:FFt
代码:
/* Author:GavinjouElephant
* Title:
* Number:
* main meanning:
*
*
*
*/
#include <iostream>
using namespace std;
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <cctype>
#include <vector>
#include <set>
#include <cstdlib>
#include <map>
#include <queue>
//#include<initializer_list>
//#include <windows.h>
//#include <fstream>
//#include <conio.h>
#define MaxN 0x7fffffff
#define MinN -0x7fffffff
#define lson 2*k
#define rson 2*k+1
typedef long long ll;
const int INF=0x3f3f3f3f;
const int maxn=1e6+10;
int Scan()//读入整数外挂.
{
int res = 0, ch, flag = 0;
if((ch = getchar()) == '-') //判断正负
flag = 1;
else if(ch >= '0' && ch <= '9') //得到完整的数
res = ch - '0';
while((ch = getchar()) >= '0' && ch <= '9' )
res = res * 10 + ch - '0';
return flag ? -res : res;
}
void Out(int a) //输出外挂
{
if(a>9)
Out(a/10);
putchar(a%10+'0');
}
const long double PI = acos(-1.0);
//复数结构体
struct Complex
{
long double r,i;
Complex(long double _r = 0.0,long double _i = 0.0)
{
r = _r; i = _i;
}
Complex operator +(const Complex &b)
{
return Complex(r+b.r,i+b.i);
}
Complex operator -(const Complex &b)
{
return Complex(r-b.r,i-b.i);
}
Complex operator *(const Complex &b)
{
return Complex(r*b.r-i*b.i,r*b.i+i*b.r);
}
};
/*
* 进行fft和Ifft前的反转变换。
* 位置i和 (i二进制反转后位置)互换
* len必须去2的幂
*/
void change(Complex y[],int len)
{
int i,j,k;
for(i = 1, j = len/2;i < len-1; i++)
{
if(i < j)swap(y[i],y[j]);
//交换互为小标反转的元素,i<j保证交换一次
//i做正常的+1,j左反转类型的+1,始终保持i和j是反转的
k = len/2;
while( j >= k)
{
j -= k;
k /= 2;
}
if(j < k) j += k;
}
}
/*
* 做fft
* len必须为2^k形式,
* on==1时是DFT,on==-1时是IDFT
*/
void fft(Complex y[],int len,int on)
{
change(y,len);
for(int h = 2; h <= len; h <<= 1)
{
Complex wn(cos(-on*2*PI/h),sin(-on*2*PI/h));
for(int j = 0;j < len;j+=h)
{
Complex w(1,0);
for(int k = j;k < j+h/2;k++)
{
Complex u = y[k];
Complex t = w*y[k+h/2];
y[k] = u+t;
y[k+h/2] = u-t;
w = w*wn;
}
}
}
if(on == -1)
for(int i = 0;i < len;i++)
y[i].r /= len;
}
Complex S[maxn];
Complex H[maxn];
Complex C[maxn];
Complex D[maxn];
int a,b,c;
char str[10];
long long x[maxn];
int top;
bool isPrime[50010];
int pri[500010];
void init()
{
top=0;
memset(isPrime, false, sizeof(isPrime));
for(int i = 2; i <= 50010; i++)
{
if(!isPrime[i])
pri[top++]=i;
for(int j=0;j<top;j++)
{
if(i*pri[j]>50010)break;
isPrime[i*pri[j]]=true;
if(i%pri[j]==0)break;
}
}
return;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("coco.txt","r",stdin);
freopen("lala.txt","w",stdout);
#endif
init();
while(scanf("%d%d%d",&a,&b,&c),a+b+c)
{
int len = 1;
while(len <= b) len <<= 1;
len <<= 3;
for(int i = 0; i <= b; i++)
if(isPrime[i]) S[i] = H[i] = C[i] = D[i] = Complex(1, 0);
else S[i] = H[i] = C[i] = D[i] = Complex(0, 0);
for(int i = b + 1; i < len; i++) S[i] = H[i] = C[i] = D[i] = Complex(0, 0);
int num;
char type;
for(int i = 0; i < c; i++)
{
scanf("%d%c", &num, &type);
switch(type)
{
case 'S': S[num] = Complex(0, 0); break;
case 'H': H[num] = Complex(0, 0); break;
case 'C': C[num] = Complex(0, 0); break;
case 'D': D[num] = Complex(0, 0); break;
}
}
fft(S, len, 1);
fft(H, len, 1);
fft(C, len, 1);
fft(D, len, 1);
for(int i = 0; i < len; i++)
S[i] = S[i]*H[i]*C[i]*D[i];
fft(S, len, -1);
for(int i = a; i <= b; i++)
printf("%lld\n", (ll)(S[i].r + 0.5));
putchar('\n');
}
return 0;
}