本文共 1293 字,大约阅读时间需要 4 分钟。
# include # include # include # include # include # include # include # include # include # include # include # include using namespace std;# define lowbit(x) ((x)&(-x))const double pi=acos(-1.0);# define eps 1e-8# define MOD 1000000007# define INF 1000000000# define mem(a,b) memset(a,b,sizeof(a))# define FOR(i,a,n) for(int i=a; i<=n; ++i)# define FDR(i,a,n) for(int i=a; i>=n; --i)# define bug puts("H");# define lch p<<1,l,mid# define rch p<<1|1,mid+1,r# define mp make_pair# define pb push_backtypedef pair PII;typedef vector VI;# pragma comment(linker, "/STACK:1024000000,1024000000")typedef long long LL;inline int Scan() { int x=0,f=1; char ch=getchar(); while(ch<'0'||ch>'9'){ if(ch=='-') f=-1; ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();} return x*f;}inline void Out(int a) { if(a<0) {putchar('-'); a=-a;} if(a>=10) Out(a/10); putchar(a%10+'0');}const int N=80005;//Code begin....typedef complex cmx;int c[N<<2], val[N<<2], a[N<<2], b[N<<2];cmx x[N<<2], y[N<<2];void change(cmx x[], int len) { int i, j, k; for(i=1, j=len>>1; i >1; while(j>=k) j-=k, k>>=1; if(j
转载于:https://www.cnblogs.com/lishiyao/p/7368411.html