Super Poker II UVA - 12298 FFT_生成函数-CSDN博客

本文链接：https://blog.csdn.net/liyong1009s/article/details/91862881

Super Poker II UVA - 12298 FFT_生成函数

Code:

#include<bits/stdc++.h>     
#define maxn 1000000    
#define ll long long 
#define double long double    
#define setIO(s) freopen(s".in","r",stdin), freopen(s".out","w",stdout) 
using namespace std; 
 
struct cpx
{
    double x,y; 
    cpx(double a=0,double b=0){x=a,y=b;} 
}; 
cpx operator+(cpx a,cpx b) { return cpx(a.x+b.x,a.y+b.y); }
cpx operator-(cpx a,cpx b) { return cpx(a.x-b.x,a.y-b.y); } 
cpx operator*(cpx a,cpx b) { return cpx(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x); } 
 
namespace FFT
{
    const double pi=acos(-1);  
    void FFT(cpx *a,int n,int flag)
    {
        for(int i = 0,k = 0;i < n; ++i)
        {
            if(i > k) swap(a[i],a[k]);
            for(int j = n >> 1;(k^=j)<j;j>>=1);
        }
        for(int mid=1;mid<n;mid<<=1)
        {
            cpx wn(cos(pi/mid),flag*sin(pi/mid)),x,y; 
            for(int j=0;j<n;j+=(mid<<1)) 
            {
                cpx w(1,0); 
                for(int k=0;k<mid;++k) 
                {
                    x = a[j+k],y=w*a[j+mid+k]; 
                    a[j+k]=x+y; 
                    a[j+mid+k]=x-y; 
                    w=w*wn; 
                }
            }
        } 
    }      
}; 
 
cpx arr[maxn], brr[maxn], crr[maxn], drr[maxn];
int vis[maxn],prime[maxn],non_prime[maxn]; 
int tot,cas; 
char str[100]; 
int idx(char c)
{
    if(c=='S') return 0;
    if(c=='H') return 1; 
    if(c=='C') return 2;
    if(c=='D') return 3;  
}
void update()
{
    scanf("%s",str+1); 
    int len=strlen(str+1); 
    int num=0; 
    for(int i=1;i<=len;++i) 
    {
        if(str[i]>='0' && str[i]<='9') 
            num=num*10+str[i]-'0'; 
        else
        {
            int cur=idx(str[i]); 
            switch(cur)
            {
                case 0 : { arr[num].x=0;  break;}
                case 1 : { brr[num].x=0;  break;}
                case 2 : { crr[num].x=0;  break;}
                case 3 : { drr[num].x=0;  break;}
            }
        }
    }     
}
void get_number()
{  
    for(int i=2;i<=100000;++i) 
    {
        if(!vis[i]) prime[++tot]=i;  
        for(int j=1;j<=tot&&prime[j]*i*1ll<=1ll*100000;++j) 
        {
            vis[prime[j]*i]=1; 
            if(i%prime[j]==0) break; 
        } 
    }
    tot=0; 
    for(int i=2;i<=100000;++i) if(vis[i]) non_prime[++tot]=i; 
}  
int main()
{
    // setIO("input");  
    get_number(); 
    for(cas=1; ;++cas)
    {
        int l,r,o,len=1;  
        scanf("%d%d%d",&l,&r,&o);  
 
        if(l==0&&r==0&&o==0) break; 
 
        while(len<=r) len<<=1; 
        
        len<<=2;    
        for(int i=1;i<=r;++i) arr[i]=cpx(vis[i],0); 
        for(int i=1;i<=r;++i) brr[i]=cpx(vis[i],0); 
        for(int i=1;i<=r;++i) crr[i]=cpx(vis[i],0);  
        for(int i=1;i<=r;++i) drr[i]=cpx(vis[i],0); 
        while(o--)  update();       
        // for(int i=0;i<len;++i) printf("%d %d\n",(int)arr[i].x,(int)arr[i].y);         
        FFT::FFT(arr,len, 1), FFT::FFT(brr,len, 1), FFT::FFT(crr,len, 1), FFT::FFT(drr,len, 1); 
        for(int i=0;i<len;++i) 
        { 
            arr[i]=arr[i]*brr[i]*crr[i]*drr[i];      
        }
        FFT::FFT(arr,len,-1);              
        for(int i=l;i<=r;++i) printf("%lld\n", (ll)(arr[i].x/len+0.1)%1000000); 
        printf("\n"); 
        for(int i=0;i<=len+233;++i) arr[i]=brr[i]=crr[i]=drr[i]=cpx(0,0); 
    }
    return 0; 
}