比赛 |
板子大赛 |
评测结果 |
AAAAAAAAAA |
题目名称 |
二项式展开 |
最终得分 |
100 |
用户昵称 |
喵喵喵 |
运行时间 |
0.029 s |
代码语言 |
C++ |
内存使用 |
3.33 MiB |
提交时间 |
2025-01-22 09:32:02 |
显示代码纯文本
#include <bits/stdc++.h>
using namespace std;
unsigned long long int a[65][65];
int n;
void print_num(int n,int x)
{
if(a[n][x] == 1) return;
else if(a[n][x] == 0) return;
else cout << a[n][x];
return;
}
void print_ab(int n,int x)
{
if(x < n)
{
cout << "a";
if(n - 1 - x + 1 == 1) cout << "";
else cout << "^" << n - 1 - x + 1;
}
if(x > 1)
{
cout << "b";
if(x - 1 == 1) cout << "";
else cout << "^" << x-1;
}
return;
}
int main()
{
freopen("binomial.in","r",stdin);
freopen("binomial.out","w",stdout);
memset(a,0,sizeof(a));
a[1][1] = 1;
for(int i = 2;i < 65;i++)
{
for(int j = 1;j < 65;j++)
{
a[i][j] = a[i-1][j] + a[i-1][j-1];
}
}
cin >> n;
if(n == 0)
{
cout << 1 << endl;
return 0;
}
n += 1;
for(int i = 1;i <= n;i++)
{
print_num(n,i);
print_ab(n,i);
if(i < n) cout << "+";
}
return 0;
}