fft实现大整数相乘,由于使用浮点运算,真实速度不怎么快

#include<iostream>
#include<unordered_map>
#include<complex>
#define _USE_MATH_DEFINES
#include<math.h>
#include<algorithm>
using namespace std;
using cp = complex<double>;
vector<complex<double>> w(int n) {
	vector<complex<double>> ans;
	const double angle = M_PI /(double) n;
	double start = 0.0;
	for (int i = 0; i < n * 2; i++) {
		ans.emplace_back(complex<double>(cos(start), sin(start)));
		start += angle;
	}
	return ans;
}

complex<double> calcitem(vector<complex<double>>& seq, vector<complex<double>>& w, int idx,int cy) {
	int len = seq.size();
	if (len == 1)return seq[0];
	else {
		remove_reference<decltype(seq)>::type even;
		decltype(even) odd;
		int i = 0;
		while (i < len) {
			even.push_back(seq[i]); i++;
			if (i < len) {
				odd.push_back(seq[i]); i++;
			}
		}
		return calcitem(even, w, (idx << 1) % cy, cy) + w[idx] * calcitem(odd, w, (idx << 1) % cy, cy);
	}
}
vector<complex<double>> calc(vector<complex<double>>& seq, vector<complex<double>>& w) {
	vector<complex<double>> ans;
	int len = w.size();
	for (int i = 0; i < len;i++) {
		ans.push_back(calcitem(seq, w, i, len));
	}
	return ans;
}
template<typename T>
void print(vector<T> &t) {
	for (auto i : t) {
		cout << i << ' ';
	}cout << endl;
};

void deal(vector<complex<double>> A, vector<complex<double>> B) {
	int len = A.size();
	auto W = w(len);
	auto Ax = calc(A, W);
	auto Bx = calc(B, W);
	len = Ax.size();
	decltype(Ax)  C;
	for (int i = 0; i < len; i++) {
		C.push_back(Ax[i] * Bx[i]);
	}
	auto Dx = calc(C, W);
	vector<long long> ans;
	ans.emplace_back(lround((Dx[0] / (double)len).real()));
	for (int i = Dx.size() - 1; i > 0; i--) {
		ans.emplace_back(lround((Dx[i] / (double)len).real()));
	}
	int n = ans.size();
	int carry = 0;
	for (int i = 0; i < n; i++) {
		ans[i] += carry;
		carry = ans[i] / 10;
		ans[i] = ans[i] % 10;
	}
	for (int i = n-1; i >= 0; i--) {
		cout << ans[i];
	}cout << endl;

}

void sdeal(vector<int> a, vector<int> b) {
	vector<complex<double>> aa, bb;
	for (auto i : a)aa.push_back(cp(i, 0));
	for (auto i : b)bb.push_back(cp(i, 0));
	deal(aa, bb);
}

int main() {

	sdeal({ 1, 2, 3, 4 }, { 1, 2, 3, 4 });
	
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值