# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087832 | MahmytM | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
vector<int> find_subset(int l, int u, vector<int> w){
int sum=0;
vector<int> ans;
for(int i=0;i<w.size();i++){
if(sum+w[i]<=u){
sum+=w[i];
ans.pb(i);
}
}
if(l<=sum and sum<=u){
return ans;
}else{
return 0;
}
}