建议BDFS或OIwikiFS
by wzq100205 @ 2024-04-26 20:18:32
搜不到再来
by wzq100205 @ 2024-04-26 20:18:53
@[hy_xiaoshangxian](/user/1290525) 你的意思是写一个能生成杨辉三角的代码？
by wzq100205 @ 2024-04-26 20:19:53
暴力应该可以
by lzh009 @ 2024-04-26 20:20:19
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,c[25][25];
int main(){
cin>>n;
n--;
for(int i=0;i<=n;i++){
c[i][0]=1;
for(int j=1;j<=i;j++) c[i][j]=c[i-1][j-1]+c[i-1][j];
}
for(int i=0;i<=n;i++)
for(int j=0;j<=i;j++)
if(j==i) cout<<c[i][j]<<endl;else cout<<c[i][j]<<" ";
return 0;
}
```
应该可以
by starwind24 @ 2024-04-26 20:25:51
@[starwind24](/user/1279373)
确实可以
by hy_xiaoshangxian @ 2024-04-26 20:30:45
```
#include <bits/stdc++.h>
using namespace std;
const int max_n = 30;
int n, ans[max_n][max_n];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
ans[i][1] = 1;
ans[i][i] = 1;
}
for (int i = 3; i <= n; ++i)
for (int j = 2; j < n; ++j)
ans[i][j] = ans[i - 1][j - 1] + ans[i - 1][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i; ++j) printf("%d ", ans[i][j]);
printf("\n");
}
return 0;
}
by zong15632539rongjuan @ 2024-04-27 20:10:07