4 solutions

  • 1
    @ 2024-7-9 9:49:57
    #include<bits/stdc++.h>
    using namespace std;
    const int N=1010,mod=1e9+7;
    int n;
    int f[N];
    int main()
    {
        cin>>n;
        f[0]=1; //初始化 
        for(int i=1;i<=n;i++) //枚举当前选择 
        {
            for(int j=i;j<=n;j++) //体积从小到大 
            {
                f[j]=(f[j]+f[j-i])%mod;
            }
        }
        cout<<f[n]<<endl;
        return 0;
    }
    
    • 0
      @ 2024-8-1 9:23:35
      #include<bits/stdc++.h>
      using namespace std;
      const int N=1010,mod=1e9+7;
      int n;
      int f[N];
      int main()
      {
          cin>>n;
          f[0]=1;
          for(int i=1;i<=n;i++)
          {
              for(int j=i;j<=n;j++)
              {
                  f[j]=(f[j]+f[j-i])%mod;
              }
          }
          cout<<f[n]<<endl;
          return 0;
      }
      
      • -1
        @ 2024-7-9 10:09:58

        好吧,现在知道了=)

        • -1
          @ 2024-7-9 9:40:37

          我不知道,我什么都不知道=(

          • 1

          Information

          ID
          209
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          5
          Tags
          # Submissions
          29
          Accepted
          14
          Uploaded By