感慨大自然的神奇~
参考了这篇题解. 杨辉三角形.
附ac代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1025][1025];
int main(int argc, char const *argv[])
{
a[1][1]=1;
a[2][1]=1;
a[2][2]=1;
for (int i = 3; i <= 1024; ++i)
{
for (int j = 1; j <= 1024; ++j)
{
a[i][j] = (a[i-1][j]+a[i-1][j-1])%2;
}
}
ll n;
cin >> n;
for (int i = 1; i <= pow(2,n); ++i)
{
//输出空格
for (int k = 0; k < pow(2,n)-i; ++k)
{
cout<<" ";
}
if (i%2)
{
for (int j = 1; j <= i; ++j)
{
if (a[i][j])
{
cout << "/\\";
}
else
cout<<" ";
}
printf("\n");
}
else
{
for (int j = 1; j <= i; ++j)
{
if (a[i][j]==0)
{
cout<<" ";
}
else if (a[i][j] && a[i][j+1])
{
cout<<"/__\\";
j++;
}
}
printf("\n");
}
}
return 0;
}