3 条题解

  • 0
    @ 2025-11-17 1:02:12
    n,k=map(int,input().split())
    print(n//k)
    
    • 0
      @ 2024-9-25 15:12:08
      #include <stdio.h>
      
      int main()
      {
          unsigned int n, k, count = 0;
          scanf("%u%u", &n, &k);
      
          for (int i = k; i <= n; i += k)
          {
              count++;
          }
          printf("%u", count);
      
          return 0;
      }
      
      • 0
        @ 2024-9-25 15:09:58
        #include <stdio.h>
        #define ll long long
        int main()
        {
            ll n=0;
            ll k=0;
            scanf("%lld %lld",&n,&k);
            int count=0;
        
            for (int i=1;i*k<=n;i++){
                    count++;
            }
            printf("%d",count);
        
            return 0;
        }
        
        • 1

        信息

        ID
        151
        时间
        1000ms
        内存
        64MiB
        难度
        10
        标签
        递交数
        8
        已通过
        4
        上传者