提交记录 501 - Judge Duck Online

用户	题目	状态	得分	用时	内存	语言	代码长度
dDuck	1002. 测测你的多项式乘法	Compile Error	0	0 ns	0 KB	C	1.41 KB

提交时间	评测时间
2018-06-20 14:18:42	2020-07-31 20:39:35

代码

#include<math.h>
#define MAXN 2400005 
#define tpi acos(-1.0)
struct Complex
{
    double x;
    double y;
    Complex(double tX=0,double tY=0){x=tX,y=tY;}
}A[MAXN],B[MAXN];
int Rev[MAXN]={};
Complex operator + (Complex&a,Complex&b) {return Complex(a.x+b.x,a.y+b.y);}
Complex operator - (Complex&a,Complex&b) {return Complex(a.x-b.x,a.y-b.y);}
Complex operator * (Complex&a,Complex&b) {return Complex(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
int N,M;
int Limit=1,Siz=0;
void DFT(Complex*List,int Mode)
{
    for(int i=0;i<Limit;++i) if(i<Rev[i])
	{
		Complex t;
		t=List[Rev[i]];
		List[Rev[i]]=List[i];
		List[i]=t;
	}
    for(int Mid=1;Mid<Limit;Mid<<=1)
    {
        Complex Wn(cos(tpi/Mid),Mode*sin(tpi/Mid));
        for(int Len=Mid<<1,Pos=0;Pos<Limit;Pos+=Len)
        {
            Complex Base(1,0);
            for(int Sub=0;Sub<Mid;++Sub,Base=Base*Wn)
            {
                Complex X=List[Pos+Sub],Y=Base*List[Pos+Mid+Sub];
                List[Pos+Sub]=X+Y;
                List[Pos+Mid+Sub]=X-Y;
            }
        }
    }
}
void poly_multiply(unsigned *a, int n, unsigned *b, int m, unsigned *c)
{
    for(int i=0;i<=N;++i)A[i].x=a[i];
    for(int i=0;i<=M;++i)B[i].x=b[i];
    while(Limit<=N+M) Limit<<=1,++Siz;
    for(int i=0;i<Limit;++i) Rev[i]=(Rev[i>>1]>>1)|((i&1)<<(Siz-1));
    DFT(A,1);
    DFT(B,1);
    for(int i=0;i<=Limit;++i)A[i]=A[i]*B[i];
    DFT(A,-1);
    for(int i=0;i<=N+M;++i)c[i]=(int)(A[i].x/Limit+0.5);
}

评测结果

Compilation

N/A

Compile Error

Score: N/A

显示更多

jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:8:5: error: expected specifier-qualifier-list before ‘Complex’
    8 |     Complex(double tX=0,double tY=0){x=tX,y=tY;}
      |     ^~~~~~~
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:11:1: error: unknown type name ‘Complex’; use ‘struct’ keyword to refer to the type
   11 | Complex operator + (Complex&a,Complex&b) {return Complex(a.x+b.x,a.y+b.y);}
      | ^~~~~~~
      | struct 
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:11:18: error: expected ‘=’, ‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before ‘+’ token
   11 | Complex operator + (Complex&a,Complex&b) {return Complex(a.x+b.x,a.y+b.y);}
      |                  ^
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:12:1: error: unknown type name ‘Complex’; use ‘struct’ keyword to refer to the type
   12 | Complex operator - (Complex&a,Complex&b) {return Complex(a.x-b.x,a.y-b.y);}
      | ^~~~~~~
      | struct 
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:12:18: error: expected ‘=’, ‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before ‘-’ token
   12 | Complex operator - (Complex&a,Complex&b) {return Complex(a.x-b.x,a.y-b.y);}
      |                  ^
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:13:1: error: unknown type name ‘Complex’; use ‘struct’ keyword to refer to the type
   13 | Complex operator * (Complex&a,Complex&b) {return Complex(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
      | ^~~~~~~
      | struct 
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:13:18: error: expected ‘=’, ‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before ‘*’ token
   13 | Complex operator * (Complex&a,Complex&b) {return Complex(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
      |                  ^
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c:16:10: error: unknown type name ‘Complex’
   16 | void DFT(Complex*List,int Mode)
      |          ^~~~~~~
jp_data/tasks/e262cf43d32a11ea899e00163e04388b/contestant.c: In function ‘poly_multiply’:
jp_data/tasks/e262cf43d32a