lanqiao 1457 杨辉三角形(优化解法)

2025-04-07 15:39:05 +08:00
parent 224120a35e
commit 3eb32c17a5
1 changed files with 2 additions and 1 deletions
--- a/12lanqiao/test8-2.cpp
+++ b/12lanqiao/test8-2.cpp
@@ -1,9 +1,10 @@
 // lanqiao 1457 杨辉三角形(优化解法)
 #include <bits/stdc++.h>
 using namespace std;
+#define int long long
 const int N = 1e5 + 10;
 int a[N], b[N];
-int main(){
+signed main(){
    int n; cin >> n;
    a[0] = b[0] = 1;
    if (n == 1){