Super Poker II UVA - 12298 FFT_生成函数_调不出来

Code:

#include<bits/stdc++.h>     
#define maxn 4000000       
using namespace std; 

void setIO(string s)
{
    string in=s+".in", out=s+".out"; 
    freopen(in.c_str(),"r",stdin); 
    // froepen(out.c_str(),"w",stdout); 
}

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
{
    #define pi 3.1415926535898  
    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; 
                }
            }
        }
        if(flag==-1)  for(int i=0;i<n;++i) a[i].x/=(double)n; 
    }
    cpx A[maxn],B[maxn]; 
    void mult(int *a,int *b,int len)
    {
        int m = 1;
        while(m <= len) m <<= 1; 
        for(int i = 0;i < len; ++i) A[i].x = (double)a[i]; 
        for(int i = 0;i < len; ++i) B[i].x = (double)b[i]; 
        FFT(A,m,1),FFT(B,m,1); 
        for(int i = 0;i < m; ++i) A[i] = A[i] * B[i]; // , printf("%.2f\n",A[i].x); 
        FFT(A,m,-1);  
        for(int i = 0;i < len; ++i) a[i] = (int)(A[i].x + 0.5); 
    }
}; 

cpx arr[maxn], brr[maxn], crr[maxn], drr[maxn];
int vis[maxn],prime[maxn],non_prime[maxn],mark[4][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 
            mark[idx(str[i])][num]=cas; 
    } 
    printf("%d\n",num); 
}
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; 
        while(o--) update();        

        for(int i=1;i<=r;++i) arr[i].x=(vis[i] && mark[0][i]!=cas)?1.0:0.0, arr[i].y=0;  
        for(int i=1;i<=r;++i) brr[i].x=(vis[i] && mark[1][i]!=cas)?1.0:0.0, brr[i].y=0; 
        for(int i=1;i<=r;++i) crr[i].x=(vis[i] && mark[2][i]!=cas)?1.0:0.0, crr[i].y=0; 
        for(int i=1;i<=r;++i) drr[i].x=(vis[i] && mark[3][i]!=cas)?1.0:0.0, drr[i].y=0; 
        arr[0].x=brr[0].x=crr[0].x=drr[0].x=0.0;          
        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", (long long)(arr[i].x+0.5)); 
    }
    return 0; 
}