2179: FFT快速傅立叶
Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 3709 Solved: 1970
[ Submit][ Status][ Discuss]
Description
给出两个n位10进制整数x和y,你需要计算x*y。
Input
第一行一个正整数n。 第二行描述一个位数为n的正整数x。 第三行描述一个位数为n的正整数y。
Output
输出一行,即x*y的结果。
Sample Input
1
3
4
3
4
Sample Output
12
数据范围:
n<=60000
数据范围:
n<=60000
HINT
Source
就是FFT的模板题, 还是很好写的.
#include<bits/stdc++.h>
#define pi acos(-1)
using namespace std;
typedef complex<double> C;
const int maxn = 1e5 + 4e4;
int n, m, l, r[maxn], c[maxn];
char s[maxn], t[maxn];
C a[maxn], b[maxn];
inline void FFT(C *a, int f)
{
for (int i = 0; i < n; ++ i)
if (r[i] > i) swap(a[i], a[r[i]]);
for (int i = 1; i < n; i <<= 1)
{
C wn(cos(pi / i), f * sin(pi / i));
for (int j = 0; j < n; j += i << 1)
{
C w = 1;
for (int k = 0; k < i; ++ k, w *= wn)
{
C x = a[j + k], y = w * a[j + k + i];
a[j + k] = x + y, a[j + k + i] = x - y;
}
}
}
}
int main()
{
scanf("%d%s%s", &m, s, t);
for (int i = 0; i < m; ++ i)
a[i] = s[m - i - 1] - '0', b[i] = t[m - i - 1] - '0';
for (n = 1, m <<= 1; n < m; n <<= 1) ++ l;
for (int i = 0; i < n; ++ i) r[i] = (r[i >> 1] >> 1) | ((i & 1) << (l - 1));
FFT(a, 1), FFT(b, 1);
for (int i = 0; i < n; ++ i) a[i] *= b[i];
FFT(a, -1);
for (int i = 0; i < n; ++ i) a[i] /= n;
for (int i = 0; i < m; ++ i) c[i] = (int) (a[i].real() + 0.5);
for (int i = 0; i < m; ++ i)
if (c[i] >= 10)
c[i + 1] += c[i] / 10, c[i] %= 10;
else if (!c[i] && i == m - 1) -- m;
for (int i = m - 1; ~i; -- i) printf("%d", c[i]);
return 0;
}