4 条题解

  • 2
    @ 2025-4-8 15:19:18

    火影手游回调秽土鼬

    def updic(val,dic): if val in dic: dic[val] += 1 else: dic[val]=1 N,C = map(int,input().split()) x = input() a = []; j = 0; dic = {} for i in range(len(x)): if x[i] == " ": a.append(int(x[i-j:i])) updic(a[-1],dic) j=0 else: j += 1 a.append(int(x[i-j+1:i+1]))
    updic(a[-1], dic)

    ans = 0 for k in dic: t = k-C if t in dic: ans += dic[t]*dic[k] print(ans)

    • -2
      @ 2025-3-5 12:53:47

      陈旭洋爱玩galgame

      #include<bits/stdc++.h>
      using namespace std;
      int n,c,ans,a[100005];
      int main(){
          cin>>n>>c;
          for(int i=1;i<=n;i++){
              cin>>a[i];
          }
          for(int i=1;i<=n;i++){
              for(int j=1;j<=n;j++){
                  if(a[i]+c==a[j]){
                      ans++;
                  }
              }
          }
          cout<<ans;
          return 0;
      }
      
      • -3
        @ 2025-4-2 12:11:40
        def updic(val,dic):
            if val in dic:
                dic[val] += 1
            else:
                dic[val]=1
        N,C = map(int,input().split())
        x = input()
        a = []; j = 0; dic = {}
        for i in range(len(x)):
            if x[i] == " ":
                a.append(int(x[i-j:i]))
                updic(a[-1],dic)
                j=0
            else:
                j += 1
        a.append(int(x[i-j+1:i+1]))  #思考:这行代码的功能是什么?
        updic(a[-1], dic)
        
        ans = 0
        for k in dic:
            t = k-C
            if t in dic:
                ans += dic[t]*dic[k]
        print(ans)
        
        
        • -3
          @ 2025-4-2 12:11:23

          `def updic(val,dic): if val in dic: dic[val] += 1 else: dic[val]=1

          N,C = map(int,input().split()) x = input() a = []; j = 0; dic = {} for i in range(len(x)): if x[i] == " ": a.append(int(x[i-j:i])) updic(a[-1],dic) j=0 else: j += 1 a.append(int(x[i-j+1:i+1])) #思考:这行代码的功能是什么? updic(a[-1], dic)#将最后一个数放入 ans = 0 for k in dic: t = k-C if t in dic: ans += dic[t]*dic[k] print(ans) `

          • 1

          信息

          ID
          923
          时间
          1000ms
          内存
          256MiB
          难度
          4
          标签
          递交数
          108
          已通过
          46
          上传者