1 条题解

  • 0
    @ 2025-1-21 13:56:08
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<algorithm>
    #include<queue>
    #include<cmath>
    using namespace std;
    int dp[1010][1010];
    void init()
    {
        for (int i = 1; i <= 1000; i++)
            dp[i][1] = dp[i][i] = 1;
        for (int i = 2; i <= 1000; i++)
            for (int j = 2; j < i; j++)
                dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
    }
    void out(int n)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= i; j++)
                cout << dp[i][j] << ' ';
            cout << endl;
        }
    }
    int main()
    {
        init();
        int n;
        cin >> n;
        out(n);
        return 0;
    }
    
    • @ 2025-1-21 13:56:24
      #include<iostream>
      #include<cstring>
      #include<cstdio>
      #include<algorithm>
      #include<queue>
      #include<cmath>
      using namespace std;
      int dp[1010][1010];
      void init()
      {
          for (int i = 1; i <= 1000; i++)
              dp[i][1] = dp[i][i] = 1;
          for (int i = 2; i <= 1000; i++)
              for (int j = 2; j < i; j++)
                  dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
      }
      void out(int n)
      {
          for (int i = 1; i <= n; i++)
          {
              for (int j = 1; j <= i; j++)
                  cout << dp[i][j] << ' ';
              cout << endl;
          }
      }
      int main()
      {
          init();
          int n;
          cin >> n;
          out(n);
          return 0;
      }
      
  • 1

信息

ID
575
时间
1000ms
内存
256MiB
难度
9
标签
(无)
递交数
8
已通过
7
上传者