4 条题解

  • 0
    @ 2025-3-31 8:25:23

    import java.util.Scanner;

    import static java.lang.Math.pow;

    public class Main { public static void main(String[] args) { //输入k Scanner sc = new Scanner(System.in); int k = sc.nextInt();

        //定义Sn
        double Sn = 0;
        int i = 1, count = 0;
        while (Sn <= k) {
            Sn = Sn + pow(i, -1 );
            i++;
            count++;
        }
    
        System.out.println(count);
    }
    

    }

    • 0
      @ 2024-11-4 17:56:10
      #include<bits/stdc++.h>
      using namespace std;
      int main(){
          int k,n=0;
          cin>>k;
          for(double Sn=0;Sn<=k;n++,Sn+=1.0/n);
          cout<<n;
          return 0;
      }
      
      • 0
        @ 2024-10-29 12:16:30
        #include<bits/stdc++.h>
        using namespace std;
        
        int main() {
            int k; double sn = 0;
            cin >> k;
            for (int n = 1;; n++) {
                sn += 1.0 / n;
                if (sn > k) {
                    cout << n;
                    break;
                }
            }
            return 0;
        }
        
        • -2
          #include <stdio.h>
          int main()
          {
              int k;
              scanf("%d",&k);
              double sum=0;
              int count=0;
              for(int i=1;sum<=k;i++){
                  sum+=1.0/i;
                  count++;
              }
              printf("%d",count);
              return 0;
          }
          
          
          • 1

          信息

          ID
          5093
          时间
          1000ms
          内存
          512MiB
          难度
          1
          标签
          递交数
          690
          已通过
          320
          上传者